Speed limits of two-qutrit gates

• URL: http://arxiv.org/abs/2510.07742v1
• Date: Thu, 09 Oct 2025 03:30:27 GMT
• Title: Speed limits of two-qutrit gates
• Authors: Bora Basyildiz, Zhexuan Gong, Sahel Ashhab,
• Abstract summary: We study the speed limit for the three-level or qutrit CZ gate.<n>We generate CZ gate protocols using optimal control theory techniques.<n>We derive an analytical speed limit for the qutrit CZ gate using traditional quantum speed limit techniques.
• Score: 1.0923877073891444
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Topological control of quantum speed limits [55.2480439325792]
  We show that even if the quantum state is completely dispersionless, QFI in this state remains momentum-resolved.<n>We find bounds on quantum speed limit which scales as $sqrt|C|$ in a (dispersionless) topological phase.
  arXiv  Detail & Related papers  (2025-07-21T18:00:07Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Speed limits of two-qubit gates with qudits [0.5852077003870417]
  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.
  arXiv  Detail & Related papers  (2023-12-14T18:49:11Z)
• Comparing planar quantum computing platforms at the quantum speed limit [0.0]
  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. We analyze these quantum algorithms in terms of circuit run times and gate counts both in the standard gate model and the parity mapping.
  arXiv  Detail & Related papers  (2023-04-04T12:47: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)
• Speed limits on correlations in bipartite quantum systems [1.3854111346209868]
  We derive speed limits on correlations such as entanglement, Bell-CHSH correlation, and quantum mutual information of quantum systems evolving under dynamical processes. Some of the speed limits we derived are actually attainable and hence these bounds can be considered to be tight.
  arXiv  Detail & Related papers  (2022-07-12T16:23:28Z)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Time-optimal quantum transformations with bounded bandwidth [0.0]
  We derive sharp lower bounds, also known as quantum speed limits, for the time it takes to transform a quantum system into a state. In a final section, we use the quantum speed limits to obtain upper bounds on the power with which energy can be extracted from quantum batteries.
  arXiv  Detail & Related papers  (2020-11-24T08:42:08Z)
• 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)

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.