Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0302052 · Physical Review Letters

Optimal Multiqubit Operations for Josephson Charge Qubits

A. O. Niskanen, Juha J. Vartiainen, Martti M. Salomaa

Published May 13, 2003• 43 citations
arXivHTMLPDF

Abstract

We introduce a method for finding the required control parameters for a quantum computer that yields the desired quantum algorithm without invoking elementary gates. We concentrate on the Josephson charge-qubit model, but the scenario is readily extended to other physical realizations. Our strategy is to numerically find any desired double- or triple-qubit gate. The motivation is the need to significantly accelerate quantum algorithms in order to fight decoherence.

DOI
10.1103/physrevlett.90.197901

Related papers

ACCELERATION OF QUANTUM ALGORITHMS USING THREE-QUBIT GATES

Juha J. Vartiainen, A. O. Niskanen, Mikio Nakahara +1 more

Quantum-circuit optimization is essential for any practical realization of quantum computation, in order to beat decoherence. We present a scheme for implementing the final stage in the compilation of quantum circuits, i.e. for finding the actual physical realizations of the individual modules in the quantum-gate library. We find that numerical optimization can be efficiently utilized in order to generate the appropriate control-parameter sequences which produce the desired three-qubit modules within the Josephson charge-qubit model. Our work suggests ways in which one can in fact considerably reduce the number of gates required to implement a given quantum circuit, hence diminishing idle time and significantly accelerating the execution of quantum algorithms.

arXiv:quant-ph/0310165•International Journal of Quantum Information•Mar 1, 2004•11 citations

Optimization Algorithms for Josephson Qubits

Robert Roloff, Markus Wenin, W. Pötz

Superconducting nanoelectrical circuits are promising candidates for the physical implementation of the basic building block of a quantum computer, the qubit. We investigate how optimal control theory can be applied to optimize the dynamics of Josephson qubits. For the example of the charge qubit, several numerical methods are employed to search for external control fields which, by current technology, are realistic and induce the desired unitary time evolution within the system (i.e. the desired gate operation) as faithfully as possible in presence of dissipation, decoherence and leakage. Associated calculations which model the environment microscopically are time-intensive so that parallel computing methods are beneficial in the sampling over control fields. In particular, we discuss the performance of differential-evolution-algorithm based optimizations on a cluster. Using a simpler Lindblad model for environmental effects, we compare the performance of a conjugate-gradient approach to that of a genetic algorithm.

International Workshop on Computational Electronics•May 1, 2009•0 citations

Method to Factorize Fifteen with Josephson Charge Qubits

Juha J. Vartiainen, A. O. Niskanen, Mikio Nakahara +1 more

We investigate both the physical and algorithmic requirements for an implementation of Shor's factorization algorithm on a hypothetical Josephson charge qubit register. We represent an implementation which is optimal for small number of available qubits, but still provides a general method to factorize integer without a prior knowledge of the number to be factorized. Furthermore, our strategy is easily generalized to other realizations and parameter values. In order to meet the stringent requirements set by short decoherence time, we accelerate the algorithm by decomposing it into tailored two- and three-qubit gates and find their physical realizations through the numerical optimization.

•Aug 29, 2003•0 citations

Scalable Quantum Computing with Josephson Charge Qubits

J. Q. You, Jaw-Shen Tsai, Franco Nori

A goal of quantum information technology is to control the quantum state of a system, including its preparation, manipulation, and measurement. However, scalability to many qubits and controlled con-nectivity between any selected qubits are two of the major stumbling blocks to achieve quantum com-puting (QC). Here we propose an experimental method, using Josephson charge qubits, to efficiently solve these two central problems. The proposed QC architecture is scalable since any two charge qubits can be effectively coupled by an experimentally accessible inductance. More importantly, we formulate an efficient and realizable QC scheme that requires only one (instead of two or more) two-bit operation to implement conditional gates.

arXiv:cond-mat/0306209•Physical Review Letters•Oct 21, 2002•204 citations

Optimal control of coupled Josephson qubits

Andreas K. Spörl, Thomas Schulte‐Herbrüggen, Steffen J. Glaser +4 more

In two and three coupled Josephson charge qubits, we exemplify how to take pulses for realizing quantum gates from fidelity-limited pioneering stages to the decoherence limit of near time optimal high-fidelity controls. Thus, a CNOT gate can be obtained with a fidelity $>1$--${10}^{\ensuremath{-}9}$ for the two qubits. Even when including higher charge states, the leakage is below $1%$, although the pulses are nonadiabatic. The controls are five times faster than the pioneering experiment [Nature (London) 425, 941 (2003)] for otherwise identical parameters---i.e., a progress towards the error-correction threshold by a factor of 100. We outline schemes to generate these shaped pulses by Cauer synthesis, or more generally by few LCR circuits. The approach generalizes to larger systems: e.g., directly realizing a TOFFOLI gate in three linearly coupled charge qubits is shown to be 13 times faster than decomposing it into a circuit of nine CNOT gates of the above experimental work. In view of the next generation of fast pulse shapers, the combination of methods is designed to find wide application in quantum control of pseudospin and macroscopic quantum systems.

arXiv:quant-ph/0504202•Physical Review A•Jan 2, 2007•120 citations

From the control of quantum systems to multiqubit logic

Ville Bergholm

Quantum computing and quantum information science are two recently discovered and rapidly growing fields of physics that show substantial promise in providing new and valuable technologies in the foreseeable future. Large-scale quantum computers, if ever realized experimentally, are likely to outperform their classical counterparts in a number of important computational tasks, the most important of which may be the accurate simulation of many-body quantum systems such as the ones encountered in physics, chemistry and life sciences. This thesis investigates the problem of controlling quantum systems for the purpose of performing quantum information processing tasks. The problem is approached from a theoretical and simulational viewpoint. The work contained here encompasses a range of levels of abstraction. Firstly, we discuss the decomposition of abstract multiqubit logic gates into sequences of simple elementary gates. Secondly, we study the local commutational properties of two-qubit gates using local gate invariants. Thirdly, we develop methods for the physical implementation of the elementary gates through the control of specific quantum systems, possibly in the presence of noise and decoherence. We present a new, almost optimal n-qubit gate decomposition based on the cosine-sine decomposition, which utilizes a likewise new intermediate quantum circuit structure we call a uniformly controlled gate. We then show how they can be used in constructing a general state transformation circuit. Both of the resulting circuits can be efficiently implemented using nearest-neighbor gates which makes their physical realization simpler. A local gate invariant is introduced which can be used to assess the suitability of two-qubit gates for serving as the entangling gate in elementary gate libraries. Finally, we develop numerical optimization methods for finding near-optimal control sequences for generating oneand two-qubit gates, both in closed quantum systems and in the presence of Markovian noise.

•Dec 4, 2007•0 citations
We introduce a method for finding the required control parameters for a quantum computer that yields the desired quantum algorithm without invoking elementary gates. We concentrate on the Josephson charge-qubit model, but the scenario is readily extended to other physical realizations. Our strategy is to numerically find any desired double- or triple-qubit gate. The motivation is the need to significantly accelerate quantum algorithms in order to fight decoherence.
Quantum-circuit optimization is essential for any practical realization of quantum computation, in order to beat decoherence. We present a scheme for implementing the final stage in the compilation of quantum circuits, i.e. for finding the actual physical realizations of the individual modules in the quantum-gate library. We find that numerical optimization can be efficiently utilized in order to generate the appropriate control-parameter sequences which produce the desired three-qubit modules within the Josephson charge-qubit model. Our work suggests ways in which one can in fact considerably reduce the number of gates required to implement a given quantum circuit, hence diminishing idle time and significantly accelerating the execution of quantum algorithms.
Superconducting nanoelectrical circuits are promising candidates for the physical implementation of the basic building block of a quantum computer, the qubit. We investigate how optimal control theory can be applied to optimize the dynamics of Josephson qubits. For the example of the charge qubit, several numerical methods are employed to search for external control fields which, by current technology, are realistic and induce the desired unitary time evolution within the system (i.e. the desired gate operation) as faithfully as possible in presence of dissipation, decoherence and leakage. Associated calculations which model the environment microscopically are time-intensive so that parallel computing methods are beneficial in the sampling over control fields. In particular, we discuss the performance of differential-evolution-algorithm based optimizations on a cluster. Using a simpler Lindblad model for environmental effects, we compare the performance of a conjugate-gradient approach to that of a genetic algorithm.
We investigate both the physical and algorithmic requirements for an implementation of Shor's factorization algorithm on a hypothetical Josephson charge qubit register. We represent an implementation which is optimal for small number of available qubits, but still provides a general method to factorize integer without a prior knowledge of the number to be factorized. Furthermore, our strategy is easily generalized to other realizations and parameter values. In order to meet the stringent requirements set by short decoherence time, we accelerate the algorithm by decomposing it into tailored two- and three-qubit gates and find their physical realizations through the numerical optimization.
A goal of quantum information technology is to control the quantum state of a system, including its preparation, manipulation, and measurement. However, scalability to many qubits and controlled con-nectivity between any selected qubits are two of the major stumbling blocks to achieve quantum com-puting (QC). Here we propose an experimental method, using Josephson charge qubits, to efficiently solve these two central problems. The proposed QC architecture is scalable since any two charge qubits can be effectively coupled by an experimentally accessible inductance. More importantly, we formulate an efficient and realizable QC scheme that requires only one (instead of two or more) two-bit operation to implement conditional gates.
In two and three coupled Josephson charge qubits, we exemplify how to take pulses for realizing quantum gates from fidelity-limited pioneering stages to the decoherence limit of near time optimal high-fidelity controls. Thus, a CNOT gate can be obtained with a fidelity >1>1>1--${10}^{\ensuremath{-}9}$ for the two qubits. Even when including higher charge states, the leakage is below 11%1, although the pulses are nonadiabatic. The controls are five times faster than the pioneering experiment [Nature (London) 425, 941 (2003)] for otherwise identical parameters---i.e., a progress towards the error-correction threshold by a factor of 100. We outline schemes to generate these shaped pulses by Cauer synthesis, or more generally by few LCR circuits. The approach generalizes to larger systems: e.g., directly realizing a TOFFOLI gate in three linearly coupled charge qubits is shown to be 13 times faster than decomposing it into a circuit of nine CNOT gates of the above experimental work. In view of the next generation of fast pulse shapers, the combination of methods is designed to find wide application in quantum control of pseudospin and macroscopic quantum systems.
Quantum computing and quantum information science are two recently discovered and rapidly growing fields of physics that show substantial promise in providing new and valuable technologies in the foreseeable future. Large-scale quantum computers, if ever realized experimentally, are likely to outperform their classical counterparts in a number of important computational tasks, the most important of which may be the accurate simulation of many-body quantum systems such as the ones encountered in physics, chemistry and life sciences. This thesis investigates the problem of controlling quantum systems for the purpose of performing quantum information processing tasks. The problem is approached from a theoretical and simulational viewpoint. The work contained here encompasses a range of levels of abstraction. Firstly, we discuss the decomposition of abstract multiqubit logic gates into sequences of simple elementary gates. Secondly, we study the local commutational properties of two-qubit gates using local gate invariants. Thirdly, we develop methods for the physical implementation of the elementary gates through the control of specific quantum systems, possibly in the presence of noise and decoherence. We present a new, almost optimal n-qubit gate decomposition based on the cosine-sine decomposition, which utilizes a likewise new intermediate quantum circuit structure we call a uniformly controlled gate. We then show how they can be used in constructing a general state transformation circuit. Both of the resulting circuits can be efficiently implemented using nearest-neighbor gates which makes their physical realization simpler. A local gate invariant is introduced which can be used to assess the suitability of two-qubit gates for serving as the entangling gate in elementary gate libraries. Finally, we develop numerical optimization methods for finding near-optimal control sequences for generating oneand two-qubit gates, both in closed quantum systems and in the presence of Markovian noise.