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:2510.07742

Speed limits of two-qutrit gates

Bora Basyildiz, Zhexuan Gong, Sahel Ashhab

Published Oct 9, 2025• 0 citations
arXivHTMLPDF

Abstract

The speed of elementary quantum gates sets a limit on the speed at which quantum circuits can be applied and, as a result, the size of the computations that can be performed on a quantum computer. This limitation stems from the fact that present-day quantum hardware systems have finite coherence times that limit the total computation time. The speeds of qubit gates in various hardware settings have been well studied over the past few decades. The recent interest in multi-level quantum systems naturally creates a need for similar investigations of the speeds of multi-level or qudit gates. In this work, we perform an empirical study of the speed limit for the three-level or qutrit CZ gate. Our analysis focuses on a theoretical model for capacitively coupled superconducting transmons but can be extended to other systems. We generate CZ gate protocols using optimal control theory techniques and observe when the fidelity crosses certain thresholds. In addition to the empirical approach, we derive an analytical speed limit for the qutrit CZ gate using traditional quantum speed limit techniques. We compare the speed limits derived using these two different approaches and discuss the gap that remains between them. We also compare the time needed to implement the qutrit CZ gate with its qubit counterpart.

DOI
10.48550/arxiv.2510.07742

Related papers

Speed limits of two-qubit gates with qudits

Bora Basyildiz, Casey Jameson, Zhexuan Gong

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.

arXiv:2312.09218•Dec 14, 2023•1 citation

Comparing planar quantum computing platforms at the quantum speed limit

Daniel Basilewitsch, Clemens Dlaska, Wolfgang Lechner

An important aspect that strongly impacts the experimental feasibility of quantum circuits is the ratio of gate times and typical error time scales. Algorithms with circuit depths that significantly exceed the error time scales will result in faulty quantum states and error correction is inevitable. We present a comparison of the theoretical minimal gate time, i.e., the quantum speed limit (QSL), for realistic two- and multi-qubit gate implementations in neutral atoms and superconducting qubits. Subsequent to finding the QSLs for individual gates by means of optimal control theory we use them to quantify the circuit QSL of the quantum Fourier transform and the quantum approximate optimization algorithm. In particular, we analyze these quantum algorithms in terms of circuit run times and gate counts both in the standard gate model and the parity mapping. We find that neutral atom and superconducting qubit platforms show comparable weighted circuit QSLs with respect to the system size. Published by the American Physical Society 2024

arXiv:2304.01756•Physical Review Research•Apr 5, 2024•4 citations

Speed limits for quantum gates with weakly anharmonic qubits

Sahel Ashhab, Fumiki Yoshihara, Tomoko Fuse +3 more

We consider the implementation of two-qubit gates when the physical systems used to realize the qubits are weakly anharmonic and therefore possess additional quantum states in the accessible energy range. We analyze the effect of the additional quantum states on the maximum achievable speed for quantum gates in the qubit state space. By calculating the minimum gate time using optimal control theory, we find that higher energy levels can help make two-qubit gates significantly faster than the reference value based on simple qubits. This speedup is a result of the higher coupling strength between higher energy levels. We then analyze the situation where the pulse optimization algorithm avoids pulses that excite the higher levels. We find that in this case the presence of the additional states can lead to a significant reduction in the maximum achievable gate speed. We also compare the optimal control gate times with those obtained using the cross-resonance/selective-darkening gate protocol. We find that the latter, with some parameter optimization, can be used to achieve a relatively fast implementation of the CNOT gate. These results can help the search for optimized gate implementations in realistic quantum computing architectures, such as those based on superconducting qubits. They also provide guidelines for desirable conditions on anharmonicity that would allow optimal utilization of the higher levels to achieve fast quantum gates.

•Sep 3, 2021•0 citations

Speed limits for two-qubit gates with weakly anharmonic qubits

Sahel Ashhab, Fumiki Yoshihara, Tomoko Fuse +3 more

We consider the implementation of two-qubit gates when the physical systems used to realize the qubits possess additional quantum states in the accessible energy range. We use optimal control theory to determine the maximum achievable gate speed for two-qubit gates in the qubit subspace of the many-level Hilbert space, and we analyze the effect of the additional quantum states on the gate speed. We identify two competing mechanisms. On one hand, higher energy levels are generally more strongly coupled to each other. Under suitable conditions, this stronger coupling can be utilized to make two-qubit gates significantly faster than the reference value based on simple qubits. On the other hand, a weak anharmonicity constrains the speed at which the system can be adequately controlled: according to the intuitive picture, faster operations require stronger control fields, which are more likely to excite higher levels in a weakly anharmonic system, which in turn leads to faster decoherence and uncontrolled leakage outside the qubit space. To account for this constraint, we modify the pulse optimization algorithm to avoid pulses that lead to appreciable population of the higher levels. In this case, we find that the presence of the higher levels can lead to a significant reduction in the maximum achievable gate speed. We also compare the optimal-control gate speeds with those obtained using the cross-resonance or selective-darkening gate protocol. We find that this protocol, with some parameter optimization, can be used to achieve a relatively fast implementation of the controlled-NOT gate. These results can help the search for optimized gate implementations in realistic quantum computing architectures, such as those based on superconducting circuits. They also provide guidelines for desirable conditions on anharmonicity that would allow optimal utilization of the higher levels to achieve fast quantum gates.

arXiv:2109.01469•Physical Review A•Apr 25, 2022•16 citations

Implementing two-qubit gates at the quantum speed limit

J.E. Howard, Alexander Lidiak, Casey Jameson +8 more

The speed of elementary quantum gates, particularly two-qubit gates, ultimately sets the limit on the speed at which quantum circuits can operate. In this work, we experimentally demonstrate commonly used two-qubit gates at nearly the fastest possible speed allowed by the physical interaction strength between two superconducting transmon qubits. We achieve this quantum speed limit by implementing experimental gates designed using a machine-learning-inspired optimal control method. Importantly, our method only requires the single-qubit drive strength to be moderately larger than the interaction strength to achieve an arbitrary two-qubit gate close to its analytical speed limit with high fidelity. Thus the method is applicable to a variety of platforms, including those with comparable single-qubit and two-qubit gate speeds, or those with always-on interactions. We expect our method to offer significant speedups for non-native two-qubit gates that are typically achieved with a long sequence of single-qubit and native two-qubit gates.

arXiv:2206.07716•Physical Review Research•Dec 1, 2023•19 citations

Single-qubit gates in frequency-crowded transmon systems

Ron Schutjens, Fadi Abu Dagga, Daniel J. Egger +1 more

Recent experimental work on superconducting transmon qubits in three-dimensional (3D) cavities shows that their coherence times are increased by an order of magnitude compared to their two-dimensional cavity counterparts. However, to take advantage of these coherence times while scaling up the number of qubits it is advantageous to address individual qubits which are all coupled to the same 3D cavity fields. The challenge in controlling this system comes from spectral crowding, where the leakage transition of qubits is close to computational transitions in other qubits. Here, it is shown that fast pulses are possible which address single qubits using two-quadrature control of the pulse envelope, while the derivative removal by adiabatic gate method of Motzoi et al. [Phys. Rev. Lett. 103, 110501 (2009)] alone only gives marginal improvements over the conventional Gaussian pulse shape. On the other hand, a first-order result using the Magnus expansion gives a fast analytical pulse shape which gives a high-fidelity gate for a specific gate time, up to a phase factor on the second qubit. Further numerical analysis corroborates these results and yields to even faster gates, showing that leakage-state anharmonicity does not provide a fundamental quantum speed limit.

arXiv:1306.2279•Physical Review A•Nov 25, 2013•85 citations
The speed of elementary quantum gates sets a limit on the speed at which quantum circuits can be applied and, as a result, the size of the computations that can be performed on a quantum computer. This limitation stems from the fact that present-day quantum hardware systems have finite coherence times that limit the total computation time. The speeds of qubit gates in various hardware settings have been well studied over the past few decades. The recent interest in multi-level quantum systems naturally creates a need for similar investigations of the speeds of multi-level or qudit gates. In this work, we perform an empirical study of the speed limit for the three-level or qutrit CZ gate. Our analysis focuses on a theoretical model for capacitively coupled superconducting transmons but can be extended to other systems. We generate CZ gate protocols using optimal control theory techniques and observe when the fidelity crosses certain thresholds. In addition to the empirical approach, we derive an analytical speed limit for the qutrit CZ gate using traditional quantum speed limit techniques. We compare the speed limits derived using these two different approaches and discuss the gap that remains between them. We also compare the time needed to implement the qutrit CZ gate with its qubit counterpart.
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.
An important aspect that strongly impacts the experimental feasibility of quantum circuits is the ratio of gate times and typical error time scales. Algorithms with circuit depths that significantly exceed the error time scales will result in faulty quantum states and error correction is inevitable. We present a comparison of the theoretical minimal gate time, i.e., the quantum speed limit (QSL), for realistic two- and multi-qubit gate implementations in neutral atoms and superconducting qubits. Subsequent to finding the QSLs for individual gates by means of optimal control theory we use them to quantify the circuit QSL of the quantum Fourier transform and the quantum approximate optimization algorithm. In particular, we analyze these quantum algorithms in terms of circuit run times and gate counts both in the standard gate model and the parity mapping. We find that neutral atom and superconducting qubit platforms show comparable weighted circuit QSLs with respect to the system size. Published by the American Physical Society 2024
We consider the implementation of two-qubit gates when the physical systems used to realize the qubits are weakly anharmonic and therefore possess additional quantum states in the accessible energy range. We analyze the effect of the additional quantum states on the maximum achievable speed for quantum gates in the qubit state space. By calculating the minimum gate time using optimal control theory, we find that higher energy levels can help make two-qubit gates significantly faster than the reference value based on simple qubits. This speedup is a result of the higher coupling strength between higher energy levels. We then analyze the situation where the pulse optimization algorithm avoids pulses that excite the higher levels. We find that in this case the presence of the additional states can lead to a significant reduction in the maximum achievable gate speed. We also compare the optimal control gate times with those obtained using the cross-resonance/selective-darkening gate protocol. We find that the latter, with some parameter optimization, can be used to achieve a relatively fast implementation of the CNOT gate. These results can help the search for optimized gate implementations in realistic quantum computing architectures, such as those based on superconducting qubits. They also provide guidelines for desirable conditions on anharmonicity that would allow optimal utilization of the higher levels to achieve fast quantum gates.
We consider the implementation of two-qubit gates when the physical systems used to realize the qubits possess additional quantum states in the accessible energy range. We use optimal control theory to determine the maximum achievable gate speed for two-qubit gates in the qubit subspace of the many-level Hilbert space, and we analyze the effect of the additional quantum states on the gate speed. We identify two competing mechanisms. On one hand, higher energy levels are generally more strongly coupled to each other. Under suitable conditions, this stronger coupling can be utilized to make two-qubit gates significantly faster than the reference value based on simple qubits. On the other hand, a weak anharmonicity constrains the speed at which the system can be adequately controlled: according to the intuitive picture, faster operations require stronger control fields, which are more likely to excite higher levels in a weakly anharmonic system, which in turn leads to faster decoherence and uncontrolled leakage outside the qubit space. To account for this constraint, we modify the pulse optimization algorithm to avoid pulses that lead to appreciable population of the higher levels. In this case, we find that the presence of the higher levels can lead to a significant reduction in the maximum achievable gate speed. We also compare the optimal-control gate speeds with those obtained using the cross-resonance or selective-darkening gate protocol. We find that this protocol, with some parameter optimization, can be used to achieve a relatively fast implementation of the controlled-NOT gate. These results can help the search for optimized gate implementations in realistic quantum computing architectures, such as those based on superconducting circuits. They also provide guidelines for desirable conditions on anharmonicity that would allow optimal utilization of the higher levels to achieve fast quantum gates.
The speed of elementary quantum gates, particularly two-qubit gates, ultimately sets the limit on the speed at which quantum circuits can operate. In this work, we experimentally demonstrate commonly used two-qubit gates at nearly the fastest possible speed allowed by the physical interaction strength between two superconducting transmon qubits. We achieve this quantum speed limit by implementing experimental gates designed using a machine-learning-inspired optimal control method. Importantly, our method only requires the single-qubit drive strength to be moderately larger than the interaction strength to achieve an arbitrary two-qubit gate close to its analytical speed limit with high fidelity. Thus the method is applicable to a variety of platforms, including those with comparable single-qubit and two-qubit gate speeds, or those with always-on interactions. We expect our method to offer significant speedups for non-native two-qubit gates that are typically achieved with a long sequence of single-qubit and native two-qubit gates.
Recent experimental work on superconducting transmon qubits in three-dimensional (3D) cavities shows that their coherence times are increased by an order of magnitude compared to their two-dimensional cavity counterparts. However, to take advantage of these coherence times while scaling up the number of qubits it is advantageous to address individual qubits which are all coupled to the same 3D cavity fields. The challenge in controlling this system comes from spectral crowding, where the leakage transition of qubits is close to computational transitions in other qubits. Here, it is shown that fast pulses are possible which address single qubits using two-quadrature control of the pulse envelope, while the derivative removal by adiabatic gate method of Motzoi et al. [Phys. Rev. Lett. 103, 110501 (2009)] alone only gives marginal improvements over the conventional Gaussian pulse shape. On the other hand, a first-order result using the Magnus expansion gives a fast analytical pulse shape which gives a high-fidelity gate for a specific gate time, up to a phase factor on the second qubit. Further numerical analysis corroborates these results and yields to even faster gates, showing that leakage-state anharmonicity does not provide a fundamental quantum speed limit.