Speed limits of two-qubit gates with qudits
- URL: http://arxiv.org/abs/2312.09218v1
- Date: Thu, 14 Dec 2023 18:49:11 GMT
- Title: Speed limits of two-qubit gates with qudits
- Authors: Bora Basyildiz, Casey Jameson, and Zhexuan Gong
- Abstract summary: We find an optimal theoretical bound for the speed limit of a two-qubit gate achieved using two qudits with a bounded interaction strength and arbitrarily fast single-qudit gates.
We develop an open-source, machine learning assisted, quantum optimal control algorithm that can achieve a speedup close to the theoretical limit with near-perfect gate fidelity.
- Score: 0.5852077003870417
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The speed of elementary quantum gates ultimately sets the limit on the speed
at which quantum circuits can operate. For a fixed physical interaction
strength between two qubits, the speed of any two-qubit gate is limited even
with arbitrarily fast single-qubit gates. In this work, we explore the
possibilities of speeding up two-qubit gates beyond such a limit by expanding
our computational space outside the qubit subspace, which is experimentally
relevant for qubits encoded in multi-level atoms or anharmonic oscillators. We
identify an optimal theoretical bound for the speed limit of a two-qubit gate
achieved using two qudits with a bounded interaction strength and arbitrarily
fast single-qudit gates. In addition, we find an experimentally feasible
protocol using two parametrically coupled superconducting transmons that
achieves this theoretical speed limit in a non-trivial way. We also consider
practical scenarios with limited single-qudit drive strengths and off-resonant
transitions. For such scenarios, we develop an open-source, machine learning
assisted, quantum optimal control algorithm that can achieve a speedup close to
the theoretical limit with near-perfect gate fidelity. This work opens up a new
avenue to speed up two-qubit gates when the physical interaction strength
between qubits cannot be easily increased while extra states outside the qubit
subspace can be well controlled.
Related papers
- Designing Fast Quantum Gates with Tunable Couplers: A Reinforcement
Learning Approach [0.0]
We propose and illustrate the usefulness of reinforcement learning to generate fast two-qubit gates in superconducting qubits.
We show that the RL controller offers great effectiveness in finding piecewise constant gate pulse sequences autonomously.
Such gate pulse sequences exploit the leakage space judiciously by controlling the leakage dynamics into and out of the computational subspace.
arXiv Detail & Related papers (2023-12-26T23:52:57Z) - Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling
Limit [55.05109484230879]
We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system.
We generate optimal pulse sequences that implement a CNOT gate with high fidelity.
We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
arXiv Detail & Related papers (2023-06-14T18:24:51Z) - Pulse-controlled qubit in semiconductor double quantum dots [57.916342809977785]
We present a numerically-optimized multipulse framework for the quantum control of a single-electron charge qubit.
A novel control scheme manipulates the qubit adiabatically, while also retaining high speed and ability to perform a general single-qubit rotation.
arXiv Detail & Related papers (2023-03-08T19:00:02Z) - Two qubits in one transmon -- QEC without ancilla hardware [68.8204255655161]
We show that it is theoretically possible to use higher energy levels for storing and controlling two qubits within a superconducting transmon.
The additional qubits could be used in algorithms which need many short-living qubits in error correction or by embedding effecitve higher connectivity in qubit networks.
arXiv Detail & Related papers (2023-02-28T16:18:00Z) - Quantum Speed Limit for Change of Basis [55.500409696028626]
We extend the notion of quantum speed limits to collections of quantum states.
For two-qubit systems, we show that the fastest transformation implements two Hadamards and a swap of the qubits simultaneously.
For qutrit systems the evolution time depends on the particular type of the unbiased basis.
arXiv Detail & Related papers (2022-12-23T14:10:13Z) - Extensive characterization of a family of efficient three-qubit gates at
the coherence limit [0.4471952592011114]
We implement a three-qubit gate by simultaneously applying two-qubit operations.
We generate two classes of entangled states, the GHZ and W states, by applying the new gate only once.
We analyze the experimental and statistical errors on the fidelity of the gates and of the target states.
arXiv Detail & Related papers (2022-07-06T19:42:29Z) - Implementing two-qubit gates at the quantum speed limit [33.51056531486263]
We experimentally demonstrate commonly used two-qubit gates at nearly the fastest possible speed.
We achieve this quantum speed limit by implementing experimental gates designed using a machine learning inspired optimal control method.
We expect our method to offer significant speedups for non-native two-qubit gates.
arXiv Detail & Related papers (2022-06-15T18:00:00Z) - Speed limits for two-qubit gates with weakly anharmonic qubits [0.6738135972929344]
We use optimal control theory to determine the maximum achievable gate speed for two-qubit gates.
We analyze the effect of the additional quantum states on the gate speed.
arXiv Detail & Related papers (2021-09-03T12:07:59Z) - Fast multi-qubit gates through simultaneous two-qubit gates [0.5949967357689445]
Near-term quantum computers are limited by the decoherence of qubits to only being able to run low-depth quantum circuits with acceptable fidelity.
One way to overcome these limitations is to expand the available gate set from single- and two-qubit gates to multi-qubit gates.
We show that such multi-qubit gates can be realized by the simultaneous application of multiple two-qubit gates to a group of qubits.
arXiv Detail & Related papers (2021-08-25T17:24:31Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z) - Universal non-adiabatic control of small-gap superconducting qubits [47.187609203210705]
We introduce a superconducting composite qubit formed from two capacitively coupled transmon qubits.
We control this low-frequency CQB using solely baseband pulses, non-adiabatic transitions, and coherent Landau-Zener interference.
This work demonstrates that universal non-adiabatic control of low-frequency qubits is feasible using solely baseband pulses.
arXiv Detail & Related papers (2020-03-29T22:48:34Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.