Quantum Information Processing in Cavity-QED

We give a brief overview of cavity-QED and its roles in quantum information science. In particular, we discuss setups in optical cavity-QED, where either atoms serve as stationary qubits, or photons serve as flying qubits. PACS: 42.50.Pq, 03.67.Lx, 03.67.Hk, 32.80.Pj     

Ion Trap Quantum Computing with Ca+ Ions

The scheme of an ion trap quantum computer is described and the implementation of quantum gate operations with trapped Ca⁺ ions is discussed. Quantum information processing with Ca⁺ ions is exemplified with several recent experiments investigating entanglement of ions. PACS: 03.67.Lx, 03.67.Mn, 32.80.Pj     

Quantum Information Processing with Trapped Neutral Atoms

Quantum information can be processed using large ensembles of ultracold and trapped neutral atoms, building naturally on the techniques developed for high-precision spectroscopy and metrology. This article reviews some of the most important protocols for universal quantum logic with trapped neutrals, as well as the history and state-of-the-art of experimental work to implement these in the laboratory. Some general observations are made concerning the different strategies for qubit encoding, transport and interaction, including trade-offs between decoherence rates and the likelihood of two-qubit gate errors. These trade-offs must be addressed through further refinements of logic protocols and trapping technologies before one can undertake the design of a general-purpose neutral-atom quantum processor. PACS: 03.67.Lx, 32.80.Pj, 34.50.-s     

Qubit Geometry and Conformal Mapping

Identifying the Bloch sphere with the Riemann sphere (the extended complex plane), we obtain relations between single qubit unitary operations and Möbius transformations on the extended complex plane. PACS: 03.67.-a, 03.67.Lx, 03.67.Hk     

A Characterization of Global Entanglement

We define a set of 2 ⁿ⁻¹−1 entanglement monotones for n qubits and give a single measure of entanglement in terms of these. This measure is zero except on globally entangled (fully inseparable) states. This measure is compared to the Meyer–Wallach measure for two, three, and four qubits. We determine the four-qubit state, symmetric under exchange of qubit labels, which maximizes this measure. It is also shown how the elementary monotones may be computed as a function of observable quantities. We compute the magnitude of our measure for the ground state of the four-qubit superconducting experimental system investigated in [M. Grajcar et al., Phys. Rev. Lett. 96, 047006 (2006)], and thus confirm the presence of global entanglement in the ground state.      

石墨烯量子点和量子比特

本文主要回顾了石墨烯量子点的制备以及基于石墨烯量子点自旋和电荷量子比特操作的研究进展,由于石墨烯材料相对较轻的原子重量使其具有较小的自旋轨道相互作用,另外含有核自旋的碳同位素13C在自然界中的含量大约只占1%,这使得超精细相互作用(即核自旋和电子自旋相互作用)较弱,所以石墨烯比其他材料具有较长的自旋退相干时间,在量子计算和量子信息中有非常好的应用前景.本文计算了5种静电约束制备的石墨烯量子点:1)扶手型单层石墨烯纳米条带,2)单层石墨烯圆盘,3)双层石墨烯圆盘,4)ABC堆积型三层石墨烯圆盘,5)ABA堆积型三层石墨烯圆盘.石墨烯量子点中自旋比特应用的关键是破坏谷简并,在1)中,主要是利用边界条件破坏谷简并,而2)–5)中是利用外磁场破坏谷简并.文章进一步介绍了自旋轨道相互作用和超精细相互作用对石墨烯量子点中自旋操作的影响.     

Further results on sampled-data design for robust control of a single qubit

This paper presents further results on the robust control method for qubit systems in Dong et al. (2013) Dong, D., Petersen, I.R., &; Rabitz, H. (2013). Sampled-data design for robust control of a single qubit. IEEE Transactions on Automatic Control, 58, 2654–2659.[Crossref], [Web of Science ®] , [Google Scholar]. Based on the properties of an antisymmetric system, an alternative method is presented to analyse and exclude singularity intervals in the proof of partial original results. For the case of amplitude damping decoherence, a larger sampling period is presented when the upper bound of the probability of failure is small enough. For the case of phase damping decoherence, a larger sampling period is given when the lower bound of the target coherence is large enough. Furthermore, we provide improved sampling periods for amplitude damping decoherence and phase damping decoherence without the above prior constraints.     

A Nuclear Spin Valve: Towards the Read-out of Single Nuclear Spin Qubits

We propose a scheme to read out qubits defined in single nuclear spins—addressing one of the main obstacles on the way to a solid state NMR quantum computer. It is based on a “spin valve” between bulk nuclear spin systems that is highly sensitive to the state of the qubit spin. We suggest a concrete realization of that detector in a Si lattice and show that it can be operated over a broad range of experimental parameters. Transport of spin through the proposed spin valve is analogous to that of charge through an electronic nanostructure, but exhibits distinctive new features.      

Dephasing of Quantum Bits by a Quasi-Static Mesoscopic Environment

We examine coherent processes in a two-state quantum system that is strongly coupled to a mesoscopic spin bath and weakly coupled to other environmental degrees of freedom. Our analysis is specifically aimed at understanding the quantum dynamics of solid-state quantum bits such as electron spins in semiconductor structures and superconducting islands. The role of mesoscopic degrees of freedom with long correlation times (local degrees of freedom such as nuclear spins and charge traps) in qubit-related dephasing is discussed in terms of a quasi-static bath. A mathematical framework simultaneously describing coupling to the slow mesoscopic bath and a Markovian environment is developed and the dephasing and decoherence properties of the total system are investigated. The model is applied to several specific examples with direct relevance to current experiments. Comparisons to experiments suggests that such quasi-static degrees of freedom play an important role in current qubit implementations. Several methods of mitigating the bath-induced error are considered.Dedicated to Anton Zeilinger, whose work has inspired exploration of quantum phenomenon in many avenues of physics and beyond.     

Extending the cooper minimal pair theorem

In the study of cappable and noncappable properties of the recursively enumerable(r.e.)degrees.Lempp suggested a conjecture which asserts that for all r.e.degrees and b,if a ≮b then there exists an r.e.degree c such that c≤a and c≮b and c is cappable.We shall prove in this paper that this conjecture holds under the condition that a is high.Working below a high r.e.degree h,we show that for any r.e.degree b with h≮b,there exist r.e.degrees a0 and a1 and such that a0,a1≮b,a0,a1≤h,and a0 and a1 from a minimal pair.     

Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition

Abstract. Using the notion of modular decomposition we extend the class of graphs on which both the treewidth and the minimum fill-in can be solved in polynomial time. We show that if C is a class of graphs that are modularly decomposable into graphs that have a polynomial number of minimal separators, or graphs formed by adding a matching between two cliques, then both the treewidth and the minimum fill-in on C can be solved in polynomial time. For the graphs that are modular decomposable into cycles we give algorithms that use respectively O(n) and O(n ³ ) time for treewidth and minimum fill-in.     

Local noncuppability in R/M

Given any [c],[a],[d]∈R/M such that [d]≤[a]≤[c], [a] is locally noncuppable between [c] and [d] if [d]<[a]≤[c]and [a] ∨ [b] < [c] for any [b]∈R/M such that [d]≤ [ b ] < [ c ]. It will be shown that given any nonzero [ c ] ∈ R/M, there are [ a ], [ d ] ∈R/M such that [d]<[a]≤[c] and[a] is locally noncuppable between [c] and[d].     

Feature space versus empirical kernel map and row kernel space in SVMs

In machine-learning technologies, the support vector machine (SV machine, SVM) is a brilliant invention with many merits, such as freedom from local minima, the widest possible margins separating different clusters, and a solid theoretical foundation. In this paper, we first explore the linear separability relationships between the high-dimensional feature space H and the empirical kernel map U as well as between H and the space of kernel outputs K. Second, we investigate the relations of the distances between separating hyperplanes and SVs in H and U, and derive an upper bound for the margin width in K. Third, as an application, we show experimentally that the separating hyperplane in H can be slightly adjusted through U. The experiments reveal that existing SVM training can linearly separate the data in H with considerable success. The results in this paper allow us to visualize the geometry of H by studying U and K.     

Generation of robust root loci for linear systems with parametric uncertainties in an ellipsoid

Given a parametric polynomial family p(s; Q) := {ⁿ _k=0 a_k (q)s^k : q ] Q}, Q R ^m , the robust root locus of p(s; Q) is defined as the two-dimensional zero set _p,Q := {s ] C:p(s; q) = 0 for some q ] Q}. In this paper we are concerned with the problem of generating robust root loci for the parametric polynomial family p(s; E) whose polynomial coefficients depend polynomially on elements of the parameter vector q ] E which lies in an m-dimensional ellipsoid E. More precisely, we present a computational technique for testing the zero inclusion/exclusion of the value set p(z; E) for a fixed point z in C, and then apply an integer-labelled pivoting procedure to generate the boundary of each subregion of the robust root locus _p,E . The proposed zero inclusion/exclusion test algorithm is based on using some simple sufficient conditions for the zero inclusion and exclusion of the value set p(z,E) and subdividing the domain E iteratively. Furthermore, an interval method is incorporated in the algorithm to speed up the process of zero inclusion/exclusion test by reducing the number of zero inclusion test operations. To illustrate the effectiveness of the proposed algorithm for the generation of robust root locus, an example is provided.     

PP-Lowness and a Simple Definition of AWPP

Abstract. We show that the counting classes AWPP and APP [FFKL], [L] are more robust than previously thought. Our results identify a sufficient condition for a language to be low for PP, and we show that this condition is at least as weak as other previously studied criteria. We extend a result of K?bler et al. by proving that all sparse co-C ₌ P languages are in APP, and are thus PP-low. Our results also imply that AWPP ⊂eq APP, and thus APP contains many other established subclasses of PP-low, thereby reducing several different lowness results to membership in APP. We also show that AWPP and APP are Σ ⁰ ₂ -definable classes. Some of our results are reminiscent of amplifying certainty in probabilistic computation.     

Lie group continual meta learning algorithm

Humans can use acquired experience to learn new skills quickly and without forgetting the knowledge they already have. However, the neural network cannot do continual learning like humans, because it is easy to fall into the stability-plasticity dilemma and lead to catastrophic forgetting. Since meta-learning with the already acquired knowledge as a priori can directly optimize the final goal, this paper proposes LGCMLA (Lie Group Continual Meta Learning Algorithm) based on meta-learning, this algorithm is an improvement of CMLA (Continual Meta Learning Algorithm) proposed by Jiang et al. On the one hand, LGCMLA enhances the continuity between tasks by changing the inner-loop update rule (from using random initialization parameters for each task to using the updated parameters of the previous task for the subsequent task). On the other hand, it uses orthogonal groups to limit the parameter space and adopts the natural Riemannian gradient descent to accelerate the convergence speed. It not only corrects the shortcomings of poor convergence and stability of CMLA, but also further improves the generalization performance of the model and solves the stability-plasticity dilemma more effectively. Experiments on miniImageNet, tieredImageNet and Fewshot-CIFAR100 (Canadian Institute For Advanced Research) datasets prove the effectiveness of LGCMLA. Especially compared to MAML (Model-Agnostic Meta-Learning) with standard four-layer convolution, the accuracy of 1 shot and 5 shot is improved by 16.4% and 17.99% respectively under the setting of 5-way on miniImageNet.

     

Local Approximability of Max-Min and Min-Max Linear Programs

In a max-min LP, the objective is to maximise ω subject to A x≤1, C x≥ω 1, and x≥0. In a min-max LP, the objective is to minimise ρ subject to A x≤ρ 1, C x≥1, and x≥0. The matrices A and C are nonnegative and sparse: each row a _i of A has at most Δ _I positive elements, and each row c _k of C has at most Δ _K positive elements.     

Detection of Redundant Code Using R 2 D 2

We present the R ² D ² redundancy detector. R ² D ² identifies redundant code fragments in large software systems written in Lisp. For each pair of code fragments, R ² D ² uses a combination of techniques ranging from syntax-based analysis to semantics-based analysis, that detects positive and negative evidences regarding the redundancy of the analyzed code fragments. These evidences are combined according to a well-defined model and sufficiently redundant fragments are reported to the user. R ² D ² explores several techniques and heuristics to operate within reasonable time and space bounds and is designed to be extensible.