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:0906.5209 · Physical Review A

Quantum logic with weakly coupled qubits

Michael R. Geller, Emily Pritchett, Andrei Galiautdinov, John M. Martinis

Published Jan 22, 2010• 23 citations
arXivHTMLPDF

Abstract

There are well-known protocols for performing controlled NOT (CNOT) quantum logic with qubits coupled by particular high-symmetry (Ising or Heisenberg) interactions. However, many architectures being considered for quantum computation involve qubits or qubits and resonators coupled by more complicated and less symmetric interactions. Here we consider a widely applicable model of weakly but otherwise arbitrarily coupled two-level systems, and use quantum gate design techniques to derive a simple and intuitive CNOT construction. Useful variations and extensions of the solution are given for common special cases.

DOI
10.1103/physreva.81.012320

Related papers

Controlled-not gate with weakly coupled qubits: Dependence of fidelity on the form of interaction

Joydip Ghosh, Michael R. Geller

An approach to the construction of the controlled-not quantum logic gate for a four-dimensional coupled-qubit model with weak but otherwise arbitrary coupling has been given recently [M. R. Geller et al., Phys. Rev. A 81, 012320 (2010)]. How does the resulting fidelity depend on the form of qubit-qubit coupling? In this paper we calculate intrinsic fidelity curves (fidelity in the absence of decoherence versus total gate time) for a variety of qubit-qubit interactions, including the commonly occurring isotropic Heisenberg and $\mathit{XY}$ models, as well as randomly generated ones. For interactions not too close to that of the Ising model, we find that the fidelity curves do not significantly depend on the form of the interaction, and we calculate the resulting interaction-averaged fidelity curve for the non-Ising-like cases and a criterion for determining its applicability.

arXiv:1003.2718•Physical Review A•May 28, 2010•20 citations

Single-step controlled- NOT logic from any exchange interaction

Andrei Galiautdinov

A self-contained approach to studying the unitary evolution of coupled qubits is introduced, capable of addressing a variety of physical systems described by exchange Hamiltonians containing Rabi terms. The method automatically determines both the Weyl chamber steering trajectory and the accompanying local rotations. Particular attention is paid to the case of anisotropic exchange with tracking controls, which is solved analytically. It is shown that, if computational subspace is well isolated, any exchange interaction can always generate high fidelity, single-step controlled-NOT (CNOT) logic, provided that both qubits can be individually manipulated. The results are then applied to superconducting qubit architectures, for which several CNOT gate implementations are identified. The paper concludes with consideration of two CNOT gate designs having high efficiency and operating with no significant leakage to higher-lying noncomputational states.

arXiv:0705.1784•Journal of Mathematical Physics•Nov 1, 2007•7 citations

Demonstration of an all-optical quantum controlled-NOT gate

Jeremy L. O’Brien, Geoff J. Pryde, Andrew G. White +2 more

The promise of tremendous computational power, coupled with the development of robust error-correcting schemes, has fuelled extensive efforts to build a quantum computer. The requirements for realizing such a device are confounding: scalable quantum bits (two-level quantum systems, or qubits) that can be well isolated from the environment, but also initialized, measured and made to undergo controllable interactions to implement a universal set of quantum logic gates. The usual set consists of single qubit rotations and a controlled-NOT (CNOT) gate, which flips the state of a target qubit conditional on the control qubit being in the state 1. Here we report an unambiguous experimental demonstration and comprehensive characterization of quantum CNOT operation in an optical system. We produce all four entangled Bell states as a function of only the input qubits' logical values, for a single operating condition of the gate. The gate is probabilistic (the qubits are destroyed upon failure), but with the addition of linear optical quantum non-demolition measurements, it is equivalent to the CNOT gate required for scalable all-optical quantum computation.

arXiv:quant-ph/0403062•APS•Mar 8, 2004•61 citations

An arbitrary two-qubit computation in 23 elementary gates or less

Stephen S. Bullock, Igor L. Markov

Quantum circuits currently constitute a dominant model for quantum computation according to M. Nielsen and I. Chuang (2000). Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We pursue circuits without ancilla qubits and a small number of elementary quantum gates by A. Barenco et al. (1995) and G. Song and A. Klappenecker (2003) as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least 17 gates: 15 one-qubit rotations and 2 CNOTs. To this end, we constructively prove a worst-case upper bound to 23 elementary gates, of which at most 4 (CNOTs) entail multi-qubit interactions. Our analysis shows that previous known synthesis algorithms, although more general, entail much larger quantum circuits than ours in the special case of two qubits. One such algorithm according to G. Cybenko (2001) has a worst case of 61 gates of which 18 may be CNOTs. Our technique rely on the KAK decomposition from Lie theory as well as the polar and spectral (symmetric Shur) matrix decompositions from numerical analysis. They are related to the canonical decomposition of two-qubit gate with respect to the "magic basis" of phase-shifted Bell states by N. Khaneja et al. (2001) and M. Lewenstein et al. (2001). We extend this decomposition in terms of elementary gates for quantum computation.

ACM/IEEE Design Automation Conference (DAC)•Mar 1, 2004•5 citations

Controlled-NOT logic with nonresonant Josephson phase qubits

Andrei Galiautdinov

We establish theoretical bounds on qubit detuning for some of the previously proposed controlled-NOT (CNOT) logic gate implementations with weakly coupled Josephson phase qubits. It is found that in the two-step, $\sqrt{i\text{SWAP}}$-based case the value of the detuning during the entangling operations must not exceed $2g$, where $g$ is the characteristic coupling constant. In the single-step case we consider two practical, physically distinct implementations, in which one of the qubits is driven by a concurrent rf pulse of fixed frequency. We find that when the local drive is applied to the ``reference'' qubit (with which it is in resonance), the detuning should not exceed $g$. If the drive is applied to the ``detuned'' qubit, generation of the perfect CNOT gate is possible at any value of detuning provided that the amplitude of the pulse can be made arbitrarily large.

arXiv:0901.0001•Physical Review A•Apr 13, 2009•8 citations

Design of Gates for Quantum Computation: The NOT Gate

Dima Mozyrsky, Vladimir Privman, Steven P. Hotaling

We offer an alternative to the conventional network formulation of quantum computing. We advance the analog approach to quantum logic gate/circuit construction. As an illustration, we consider the spatially extended NOT gate as the first step in the development of this approach. We derive an explicit form of the interaction Hamiltonian corresponding to this gate and analyze its properties. We also discuss general extensions to the case of certain time-dependent interactions which may be useful for practical realization of quantum logic gates.

arXiv:quant-ph/9608029•International Journal of Modern Physics B•Jul 20, 1997•1 citation
There are well-known protocols for performing controlled NOT (CNOT) quantum logic with qubits coupled by particular high-symmetry (Ising or Heisenberg) interactions. However, many architectures being considered for quantum computation involve qubits or qubits and resonators coupled by more complicated and less symmetric interactions. Here we consider a widely applicable model of weakly but otherwise arbitrarily coupled two-level systems, and use quantum gate design techniques to derive a simple and intuitive CNOT construction. Useful variations and extensions of the solution are given for common special cases.
An approach to the construction of the controlled-not quantum logic gate for a four-dimensional coupled-qubit model with weak but otherwise arbitrary coupling has been given recently [M. R. Geller et al., Phys. Rev. A 81, 012320 (2010)]. How does the resulting fidelity depend on the form of qubit-qubit coupling? In this paper we calculate intrinsic fidelity curves (fidelity in the absence of decoherence versus total gate time) for a variety of qubit-qubit interactions, including the commonly occurring isotropic Heisenberg and XY\mathit{XY}XY models, as well as randomly generated ones. For interactions not too close to that of the Ising model, we find that the fidelity curves do not significantly depend on the form of the interaction, and we calculate the resulting interaction-averaged fidelity curve for the non-Ising-like cases and a criterion for determining its applicability.
A self-contained approach to studying the unitary evolution of coupled qubits is introduced, capable of addressing a variety of physical systems described by exchange Hamiltonians containing Rabi terms. The method automatically determines both the Weyl chamber steering trajectory and the accompanying local rotations. Particular attention is paid to the case of anisotropic exchange with tracking controls, which is solved analytically. It is shown that, if computational subspace is well isolated, any exchange interaction can always generate high fidelity, single-step controlled-NOT (CNOT) logic, provided that both qubits can be individually manipulated. The results are then applied to superconducting qubit architectures, for which several CNOT gate implementations are identified. The paper concludes with consideration of two CNOT gate designs having high efficiency and operating with no significant leakage to higher-lying noncomputational states.
The promise of tremendous computational power, coupled with the development of robust error-correcting schemes, has fuelled extensive efforts to build a quantum computer. The requirements for realizing such a device are confounding: scalable quantum bits (two-level quantum systems, or qubits) that can be well isolated from the environment, but also initialized, measured and made to undergo controllable interactions to implement a universal set of quantum logic gates. The usual set consists of single qubit rotations and a controlled-NOT (CNOT) gate, which flips the state of a target qubit conditional on the control qubit being in the state 1. Here we report an unambiguous experimental demonstration and comprehensive characterization of quantum CNOT operation in an optical system. We produce all four entangled Bell states as a function of only the input qubits' logical values, for a single operating condition of the gate. The gate is probabilistic (the qubits are destroyed upon failure), but with the addition of linear optical quantum non-demolition measurements, it is equivalent to the CNOT gate required for scalable all-optical quantum computation.
Quantum circuits currently constitute a dominant model for quantum computation according to M. Nielsen and I. Chuang (2000). Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We pursue circuits without ancilla qubits and a small number of elementary quantum gates by A. Barenco et al. (1995) and G. Song and A. Klappenecker (2003) as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least 17 gates: 15 one-qubit rotations and 2 CNOTs. To this end, we constructively prove a worst-case upper bound to 23 elementary gates, of which at most 4 (CNOTs) entail multi-qubit interactions. Our analysis shows that previous known synthesis algorithms, although more general, entail much larger quantum circuits than ours in the special case of two qubits. One such algorithm according to G. Cybenko (2001) has a worst case of 61 gates of which 18 may be CNOTs. Our technique rely on the KAK decomposition from Lie theory as well as the polar and spectral (symmetric Shur) matrix decompositions from numerical analysis. They are related to the canonical decomposition of two-qubit gate with respect to the "magic basis" of phase-shifted Bell states by N. Khaneja et al. (2001) and M. Lewenstein et al. (2001). We extend this decomposition in terms of elementary gates for quantum computation.
We establish theoretical bounds on qubit detuning for some of the previously proposed controlled-NOT (CNOT) logic gate implementations with weakly coupled Josephson phase qubits. It is found that in the two-step, iSWAP\sqrt{i\text{SWAP}}iSWAP​-based case the value of the detuning during the entangling operations must not exceed 2g2g2g, where ggg is the characteristic coupling constant. In the single-step case we consider two practical, physically distinct implementations, in which one of the qubits is driven by a concurrent rf pulse of fixed frequency. We find that when the local drive is applied to the ``reference'' qubit (with which it is in resonance), the detuning should not exceed ggg. If the drive is applied to the ``detuned'' qubit, generation of the perfect CNOT gate is possible at any value of detuning provided that the amplitude of the pulse can be made arbitrarily large.
We offer an alternative to the conventional network formulation of quantum computing. We advance the analog approach to quantum logic gate/circuit construction. As an illustration, we consider the spatially extended NOT gate as the first step in the development of this approach. We derive an explicit form of the interaction Hamiltonian corresponding to this gate and analyze its properties. We also discuss general extensions to the case of certain time-dependent interactions which may be useful for practical realization of quantum logic gates.