arXiv subjects
Publications and source records attributed to Mikio Nakahara.
We implement a non-adiabatic universal set of holonomic quantum gates based on abelian holonomies using dynamical invariants, by Lie-algebraic methods. Unlike previous implementations, presented scheme does not rely on secondary methods such as double-loop or spin-echo and avoids associated experimental difficulties. It turns out that such gates exist purely in the non-adiabatic regime for these systems.
In the context of evolutionary quantum computing in the literal meaning, a quantum crossover operation has not been introduced so far. Here, we introduce a novel quantum genetic algorithm which has a quantum crossover procedure performing crossovers among all chromosomes in parallel for each generation. A complexity analysis shows that a quadratic speedup is achieved over its classical counterpart in the dominant factor of the run time to handle each generation.
In liquid-state NMR quantum computation, a selective entanglement operator between qubits 2 and 3 of a three-qubit molecule is conventionally realized by applying a pair of short $π$-pulses to qubit 1. This method, called refocusing, is well suited for heteronuclear molecules. When the molecule is homonuclear, however, the $π$-pulses applied to qubit 1 often induce unwanted $z$-rotations on qubits 2 and 3, even if the $z$-components of qubits 2 and 3 are left unchanged. This phenomenon is known as the transient Bloch-Siegert effect, and compensation thereof is required for precise gate operation. We propose an alternative refocusing method, in which a weak square pulse is applied to qubit 1. This technique has the advantage of curbing the Bloch-Siegert effect, making it suitable for both hetero- and homonuclear molecules.
Half-quantum votices and ordinary vortices in a rotating thin film superfluid $^3$He under a strong magnetic field are considered. It is shown that $2n+1$ half-quantum vortices interpolates between $n$ singular vortices and $n+1$ singular vortices as the angular velocity is changed. The phase diagram of the vortex configurations in the angular velocity-magnetic field space is obtained for a paramagnon parameter $δ=0.05$.
We construct a minimal robust controlled-NOT gate with an Ising-type interaction by which elementary two-qubit gates are implemented. It is robust against inaccuracy of the coupling strength and the obtained quantum circuits are constructed with the minimal number (N=3) of elementary two-qubit gates and several one-qubit gates. It is noteworthy that all the robust circuits can be mapped to one-qubit circuits robust against a pulse length error. We also prove that a minimal robust SWAP gate cannot be constructed with N=3, but requires N=6 elementary two-qubit gates.
We present a Lie-algebraic classification and detailed construction of the dynamical invariants, also known as Lewis-Riesenfeld invariants, of the four-level systems including two-qubit systems which are most relevant and sufficiently general for quantum control and computation. These invariants not only solve the time-dependent Schrödinger equation of four-level systems exactly but also enable the control, and hence quantum computation based on which, of four-level systems fast and beyond adiabatic regimes.
In NMR experiments and quantum computation, many pulse (quantum gate) sequences called the composite pulses, were developed to suppress one of two dominant errors; a pulse length error and an off-resonance error. We describe, in this paper, a general prescription to design a single-qubit concatenated composite pulse (CCCP) that is robust against two types of errors simultaneously. To this end, we introduce a new property, which is satisfied by some composite pulses and is sufficient to obtain a CCCP. Then we introduce a general method to design CCCPs with shorter execution time and less number of pulses.
It is often assumed that the ancilla qubits required for encoding a qubit in quantum error correction (QEC) have to be in pure states, $|00...0>$ for example. In this letter, we seek an encoding scheme, in which the ancillae may be in a uniformly mixed state. We demonstrate our scheme experimentally by making use of a three-qubit NMR quantum computer. Moreover, the encoded state has an interesting nature in terms of Quantum Discord, or purely quantum correlations between the data-qubit and ancillae.
Eigenvalue-preserving-but-not-completely-eigenvalue-preserving (EnCE) maps were previously introduced for the purpose of detection and quantification of nonclassical correlation, employing the paradigm where nonvanishing quantum discord implies the existence of nonclassical correlation. It is known that only the matrix transposition is nontrivial among Hermiticity-preserving (HP) linear EnCE maps when we use the changes in the eigenvalues of a density matrix due to a partial map for the purpose. In this paper, we prove that this is true even among not-necessarily HP (nnHP) linear EnCE maps. The proof utilizes a conventional theorem on linear preservers. This result imposes a strong limitation on the linear maps and promotes the importance of nonlinear maps.
Stability of a half-quantum vortex (HQV) in superfluid $^3$He has been discussed recently by Kawakami, Tsutsumi and Machida in Phys. Rev. B {\bf 79}, 092506 (2009). We further extend this work here and consider the A$_2$ phase of superfluid $^3$He confined in thin slab geometry and analyze the HQV realized in this setting. Solutions of HQV and singly quantized singular vortex are evaluated numerically by solving the Ginzburg-Landau (GL) equation and respective first critical angular velocities are obtained by employing these solutions. We show that the HQV in the A$_2$ phase is stable near the boundary between the A$_2$ and A$_1$ phases. It is found that temperature and magnetic field must be fixed first in the stable region and subsequently the angular velocity of the system should be increased from zero to a sufficiently large value to create a HQV with sufficiently large probability. A HQV does not form if the system starts with a fixed angular velocity and subsequently the temperature is lowered down to the A$_2$ phase. It is estimated that the external magnetic field with strength on the order of 1 T is required to have a sufficiently large domain in the temperature-magnetic field phase diagram to have a stable HQV.
Unitary operations acting on a quantum system must be robust against systematic errors in control parameters for reliable quantum computing. Composite pulse technique in nuclear magnetic resonance (NMR) realises such a robust operation by employing a sequence of possibly poor quality pulses. In this article, we demonstrate that two kinds of composite pulses, one compensates for a pulse length error in a one-qubit system and the other compensates for a J-coupling error in a twoqubit system, have vanishing dynamical phase and thereby can be seen as geometric quantum gates, which implement unitary gates by the holonomy associated with dynamics of cyclic vectors defined in the text.
We apply the inversely-engineered control method based on Lewis-Riesenfeld invariants to control mixed states of a two-level quantum system. We show that the inversely-engineered control passages of mixed states - and pure states as special cases - can be made significantly faster than the conventional adiabatic control passages, which renders the method applicable to quantum computation. We devise a new type of inversely-engineered control passages, to be coined the antedated control passages, which further speed up the control significantly. We also demonstrate that by carefully tuning the control parameters, the inversely-engineered control passages can be optimized in terms of speed and energy cost.
It is known that one can do quantum error correction without syndrome measurement, which is often done in operator quantum error correction (OQEC). However, the physical realization could be challenging, especially when the recovery process involves high-rank projection operators and a superoperator. We use operator theory to improve OQEC so that the implementation can always be done by unitary gates followed by a partial trace operation. Examples are given to show that our error correction scheme outperforms the existing ones in various scenarios.
We propose a simple formalism to design unitary gates robust against given systematic errors. This formalism generalizes our previous observation [Y. Kondo and M. Bando, J. Phys. Soc. Jpn. 80, 054002 (2011)] that vanishing dynamical phase in some composite gates is essential to suppress amplitude errors. By employing our formalism, we naturally derive a new composite unitary gate which can be seen as a concatenation of two known composite unitary operations. The obtained unitary gate has high fidelity over a wider range of the error strengths compared to existing composite gates.
It has been shown that inter-spin interaction strengths in a spins-1/2 chain can be evaluated by accessing one of the edge spins only. We demonstrate this experimentally for the simplest case, a three-spin chain, with nuclear magnetic resonance (NMR) technique. The three spins in the chain interact through nearest-neighbor Ising interactions under site-dependent transverse fields. The employed molecule is an alanine containing three $^{13}$C nuclei, each of which has spin-1/2.
We propose a scalable neutral atom quantum computer with an on-demand interaction through a selective two-qubit gate operation. Atoms are trapped by a lattice of near field Fresnel diffraction lights so that each trap captures a single atom. One-qubit gate operation is implemented by a gate control laser beam which is applied to an individual atom. Two-qubit gate operation between an arbitrary pair of atoms is implemented by sending these atoms to a state-dependent optical lattice and making them collide so that a particular two-qubit state acquires a dynamical phase. We give numerical evaluations corresponding to these processes, from which we estimate the upper bound of a two-qubit gate operation time and corresponding gate fidelity. Our proposal is feasible within currently available technology developed in cold atom gas, MEMS, nanolithography, and various areas in optics.
We investigate an efficient quantum error correction of a fully correlated noise. Suppose the noise is characterized by a quantum channel whose error operators take fully correlated forms given by $σ_x^{\otimes n}$, $σ_y^{\otimes n}$ and $σ_z^{\otimes n}$, where $n>2$ is the number of qubits encoding the codeword. It is proved that (i) $n$ qubits codeword encodes $(n-1)$ data qubits when $n$ is odd and (ii) $n$ qubits codeword implements a noiseless subsystem encoding $(n-2)$ data qubits when $n$ is even. Quantum circuits implementing these schemes are constructed.
We present a systematic construction of quantum circuits implementing Grover's database search algorithm for arbitrary number of targets. We introduce a new operator which flips the sign of the targets and evaluate its circuit complexity. We find the condition under which the circuit complexity of the database search algorithm based on this operator is less than that of the conventional one.