arXiv subjects

Yasushi Kondo

Publications and source records attributed to Yasushi Kondo.

35 records · Page 2Linked to original sources

arXiv2014

Two-Qubit Gate Operation on Selected Nearest-Neighbor Neutral Atom Qubits

We have previously discussed the design of a neutral atom quantum computer with an on-demand interaction [E. Hosseini Lapasar, et al., J. Phys. Soc. Jpn. 80, 114003 (2011)]. In this contribution, we propose an experimental method to demonstrate a selective two-qubit gate operation that is less demanding than our original proposal, although the gate operation is limited to act between two neighboring atoms. We evaluate numerically the process of a two-qubit gate operation that is applied to a selected pair of nearest-neighbor, trapped atoms and we estimate the upper bound of the gate operation time and corresponding gate fidelity. The proposed scheme is scalable and, though challenging, is feasible with current experimental capabilities.

quant-ph↗

arXiv2013

Efficient entanglement operator for a multi-qubit system

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.

quant-ph↗

arXiv2013

Minimal and Robust Composite Two-Qubit Gates with Ising-Type Interaction

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.

quant-ph↗

arXiv2012

Concatenated composite pulses compensating simultaneous systematic errors

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.

quant-ph↗

arXiv2012

Quantum Error Correction with Uniformly Mixed State Ancillae

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.

quant-ph↗

arXiv2012

Geometric Aspects of Composite Pulses

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.

quant-ph↗

arXiv2011

Designing Robust Unitary Gates: Application to Concatenated Composite Pulse

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.

quant-ph↗

arXiv2011

Estimation of Coupling Constants of a Three-Spin Chain: Case Study of Hamiltonian Tomography with NMR

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.

quant-ph↗

arXiv2011

Scalable Neutral Atom Quantum Computer with Interaction on Demand: Proposal for Selective Application of Two-Qubit Gate

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.

quant-ph↗

arXiv2010

Hamiltonian Determination with Restricted Access in Transverse Field Ising Chain

We propose a method to evaluate parameters in the Hamiltonian of the Ising chain under site-dependent transverse fields, with a proviso that we can control and measure one of the edge spins only. We evaluate the eigenvalues of the Hamiltonian and the time-evoultion operator exactly for a 3-spin chain, from which we obtain the expectation values of $σ_x$ of the first spin. The parameters are found from the peak positions of the Fourier transform of the expectation value. There are four assumptions in our method, which are mild enough to be satisfied in many physical systems.

quant-ph↗

arXiv2010

Scalable Neutral Atom Quantum Computer with Interaction on Demand

We propose a scalable neutral atom quantum computer with an on-demand interaction. Artificial lattice of near field optical traps is employed to trap atom qubits. Interactions between atoms can be turned off if the atoms are separated by a high enough potential barrier so that the size of the atomic wave function is much less than the interatomic distance. One-qubit gate operation is implemented by a gate control laser beam which is attached to an individual atom. Two-qubit gate operation between a particular pair of atoms is introduced by leaving these atoms in an optical lattice and making them collide so that a particular two-qubit state acquires a dynamical phase. Our proposal is feasible within existing technology developed in cold atom gas, MEMS, nanolithography, and various areas in optics.

quant-ph↗

arXiv2010

Geometric Quantum Gates, Composite Pulses, and Trotter-Suzuki Formulas

We show that all geometric quantum gates (GQG's in short), which are quantum gates only with geometric phases, are robust against control field strength errors. As examples of this observation, we show (1) how robust composite rf-pulses in NMR are geometrically constructed and (2) a composite rf-pulse based on Trotter-Suzuki Formulas is a GQG.

quant-ph↗

arXiv2007

Generation and Suppression of Decoherence in Artificial Environment for Qubit System

It is known that a quantum system with finite degrees of freedom can simulate a composite of a system and an environment if the state of the hypothetical environment is randomized by external manipulation. We show theoretically that any phase decoherence phenomena of a single qubit can be simulated with a two-qubit system and demonstrate experimentally two examples: one is phase decoherence of a single qubit in a transmission line, and the other is that in a quantum memory. We perform NMR experiments employing a two-spin molecule and clearly measure decoherence for both cases. We also prove experimentally that the bang-bang control efficiently suppresses decoherence.

quant-ph↗

arXiv2006

Artificial Decoherence and its Suppression in NMR Quantum Computer

Liquid-state NMR quantum computer has demonstrated the possibility of quantum computation and supported its development. Using NMR quantum computer techniques, we observed phase decoherence under two kinds of artificial noise fields; one a noise with a long period, and the other with shorter random period. The first one models decoherence in a quantum channel while the second one models transverse relaxation. We demonstrated that the bang-bang control suppresses decoherence in both cases.

quant-ph↗

arXiv2005

Hamiltonian of Homonucleus Molecules for NMR Quantum Computing

We derive the Hamiltonian in the rotating frame for NMR quantum computing with homonucleus molecules as its computational resource. The Hamiltonian thus obtained is different from conventional Hamiltonians that appear in literature. It is shown that control pulses designed for heteronucleus spins can be translated to pulses for homonucleus spins by simply replacing hard pulses by soft pulses with properly chosen pulse width. To demonstrate the validity of our Hamiltonian, we conducted several experiments employing cytosine as a homonucleus molecule. All the experimental results demonstrate that our Hamiltonian accurately describes the dynamics of the spins, while the conventional Hamiltonian fails. Finally we use our Hamiltonian for precise control of field inhomogeneity compensation with a pair of $π$-pulses.

quant-ph↗

arXiv2004

Warp-Drive Quantum Computation

Recently it has been shown that time-optimal quantum computation is attained by using the Cartan decomposition of a unitary matrix. We extend this approach by noting that the unitary group is compact. This allows us to reduce the execution time of a quantum algorithm $U_{\rm alg}$ further by adding an extra gate $W$ to it. This gate $W$ sends $U_{\rm alg}$ to another algorithm $WU_{\rm alg}$ which is executable in a shorter time than $U_{\rm alg}$. We call this technique warp-drive. Here we show both theoretically and experimentally that the execution time of Grover's algorithm is reduced in two-qubit NMR quantum computer. Warp-drive is potentially a powerful tool in accelerating algorithms and reducing the errors in any realization. of a quantum computer

quant-ph↗

arXiv2004

Demonstrating quantum algorithm acceleration with NMR quantum computer

In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger modules, such that the desired unitary matrix expressing the algorithm is directly implemented. We demonstrate this by taking the two-qubit Grover's algorithm implemented in NMR quantum computation, whose pseudopure state is generated by cyclic permutations of the state populations. This is the first exact time-optimal solution, to our knowledge, obtained for a self-contained quantum algorithm.

quant-ph↗