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:1905.11482 · Journal of Physics A Mathematical and Theoretical

An upper bound on the time required to implement unitary operations

Juneseo Lee, Christian Arenz, Daniel Klaus Burgarth, Herschel Rabitz

Published Feb 10, 2020• 4 citations
arXivHTMLPDF

Abstract

Abstract We derive an upper bound for the time needed to implement a generic unitary transformation in a d dimensional quantum system using d control fields. We show that given the ability to control the diagonal elements of the Hamiltonian, which allows for implementing any unitary transformation under the premise of controllability, the time T needed is upper bounded by where is the smallest coupling constant present in the system. We study the tightness of the bound by numerically investigating randomly generated systems, with specific focus on a system consisting of d energy levels that interact in a tight-binding like manner.

DOI
10.1088/1751-8121/ab7498

Related papers

The roles of drift and control field constraints upon quantum control speed limits

Christian Arenz, Benjamin Russell, Daniel Klaus Burgarth +1 more

In this work we derive a lower bound for the minimum time required to implement a target unitary transformation through a classical time-dependent field in a closed quantum system. The bound depends on the target gate, the strength of the internal Hamiltonian and the highest permitted control field amplitude. These findings reveal some properties of the reachable set of operations, explicitly analyzed for a single qubit. Moreover, for fully controllable systems, we identify a lower bound for the time at which all unitary gates become reachable. We use numerical gate optimization in order to study the tightness of the obtained bounds. It is shown that in the single qubit case our analytical findings describe the relationship between the highest control field amplitude and the minimum evolution time remarkably well. Finally, we discuss both challenges and ways forward for obtaining tighter bounds for higher dimensional systems, offering a discussion about the mathematical form and the physical meaning of the bound.

arXiv:1704.06289•New Journal of Physics•Oct 23, 2017•35 citations

Efficient implementation of unitary transformations

Seth Lloyd, Reevu Maity

Quantum computation and quantum control operate by building unitary transformations out of sequences of elementary quantum logic operations or applications of control fields. This paper puts upper bounds on the minimum time required to implement a desired unitary transformation on a d-dimensional Hilbert space when applying sequences of Hamiltonian transformations. We show that strategies of building up a desired unitary out of non-infinitesimal and infinitesimal unitaries, or equivalently, using power and band limited controls, can yield the best possible scaling in time $O(d^2)$.

arXiv:1901.03431•Jan 10, 2019•7 citations

Efficiently controlling qubit networks

Christian Arenz, HERSCHEL A. RABITZ

Future quantum devices often rely on favourable scaling with respect to the system components. To achieve desirable scaling, it is therefore crucial to implement unitary transformations in an efficient manner. We develop an upper bound for the minimum time required to implement a unitary transformation on a generic qubit network in which each of the qubits is subject to local time dependent controls. The set of gates is characterized that can be implemented in a time that scales at most polynomially in the number of qubits. Furthermore, we show how qubit systems can be concatenated through controllable two body interactions, making it possible to implement the gate set efficiently on the combined system. Finally a system is identified for which the gate set can be implemented with fewer controls. The considered model is particularly important, since it describes electron-nuclear spin interactions in NV centers.

Bulletin of the American Physical Society•Mar 8, 2018•0 citations

Tight bound for the total time in digital-analog quantum computation

Mikel Garcia-de-Andoin, Mikel Sanz

Digital-analog quantum computing (DAQC) is a universal computational paradigm that combines the evolution under an entangling Hamiltonian with the application of single-qubit gates. Since any unitary operation can be decomposed into a sequence of evolutions generated by two-body Hamiltonians, DAQC is inherently well-suited for realizing such operations. Suboptimal upper bounds for the total time required to perform these evolutions have been previously proposed. Here, we improve these limits by providing a tight bound for this crucial parameter, which shows a linear dependence with the number of couplings. This result enables a precise estimation of the time resources needed for quantum simulations and quantum algorithms implemented within the DAQC framework, facilitating a rigorous comparison with other approaches.

quant-pharXiv:2512.11619•Physical Review Research•Dec 15, 2025•0 citations

Dependence of the quantum speed limit on system size and control complexity

Juneseo Lee, Christian Arenz, HERSCHEL A. RABITZ +1 more

We extend the work in 2017 New J. Phys. 19 103015 by deriving a lower bound for the minimum time necessary to implement a unitary transformation on a generic, closed quantum system with an arbitrary number of classical control fields. This bound is explicitly analyzed for a specific N -level system similar to those used to represent simple models of an atom, or the first excitation sector of a Heisenberg spin chain, both of which are of interest in quantum control for quantum computation. Specifically, it is shown that the resultant bound depends on the dimension of the system, and on the number of controls used to implement a specific target unitary operation. The value of the bound determined numerically, and an estimate of the true minimum gate time are systematically compared for a range of system dimension and number of controls; special attention is drawn to the relationship between these two variables. It is seen that the bound captures the scaling of the minimum time well for the systems studied, and quantitatively is correct in the order of magnitude.

arXiv:1803.00027•New Journal of Physics•May 22, 2018•21 citations

Quantum speed limits from symmetries in quantum control

Marco Wiedmann, Daniel Klaus Burgarth

Abstract In quantum control, quantum speed limits provide fundamental lower bounds on the time that is needed to implement certain unitary transformations. Using Lie algebraic methods, we link these speed limits to symmetries of the control Hamiltonians and provide quantitative bounds that can be calculated without solving the controlled system dynamics. In particular we focus on two scenarios: On one hand, we provide bounds on the time that is needed for a control system to implement a given target unitary U and on the other hand we bound the time to implement the most difficult to reach evolution e − i θ H s of a target Hamiltonian H s . We apply our abstract bounds on physically relevant systems like coupled qubits, spin chains, globally controlled Rydberg atoms and NMR molecules and compare our results to the existing literature. We hope that our bounds can aid experimentalists to identify bottlenecks and design faster quantum control systems.

arXiv:2506.10069•Journal of Physics A Mathematical and Theoretical•Jan 29, 2026•2 citations
Abstract We derive an upper bound for the time needed to implement a generic unitary transformation in a d dimensional quantum system using d control fields. We show that given the ability to control the diagonal elements of the Hamiltonian, which allows for implementing any unitary transformation under the premise of controllability, the time T needed is upper bounded by where is the smallest coupling constant present in the system. We study the tightness of the bound by numerically investigating randomly generated systems, with specific focus on a system consisting of d energy levels that interact in a tight-binding like manner.
In this work we derive a lower bound for the minimum time required to implement a target unitary transformation through a classical time-dependent field in a closed quantum system. The bound depends on the target gate, the strength of the internal Hamiltonian and the highest permitted control field amplitude. These findings reveal some properties of the reachable set of operations, explicitly analyzed for a single qubit. Moreover, for fully controllable systems, we identify a lower bound for the time at which all unitary gates become reachable. We use numerical gate optimization in order to study the tightness of the obtained bounds. It is shown that in the single qubit case our analytical findings describe the relationship between the highest control field amplitude and the minimum evolution time remarkably well. Finally, we discuss both challenges and ways forward for obtaining tighter bounds for higher dimensional systems, offering a discussion about the mathematical form and the physical meaning of the bound.
Quantum computation and quantum control operate by building unitary transformations out of sequences of elementary quantum logic operations or applications of control fields. This paper puts upper bounds on the minimum time required to implement a desired unitary transformation on a d-dimensional Hilbert space when applying sequences of Hamiltonian transformations. We show that strategies of building up a desired unitary out of non-infinitesimal and infinitesimal unitaries, or equivalently, using power and band limited controls, can yield the best possible scaling in time O(d2)O(d^2)O(d2).
Future quantum devices often rely on favourable scaling with respect to the system components. To achieve desirable scaling, it is therefore crucial to implement unitary transformations in an efficient manner. We develop an upper bound for the minimum time required to implement a unitary transformation on a generic qubit network in which each of the qubits is subject to local time dependent controls. The set of gates is characterized that can be implemented in a time that scales at most polynomially in the number of qubits. Furthermore, we show how qubit systems can be concatenated through controllable two body interactions, making it possible to implement the gate set efficiently on the combined system. Finally a system is identified for which the gate set can be implemented with fewer controls. The considered model is particularly important, since it describes electron-nuclear spin interactions in NV centers.
Digital-analog quantum computing (DAQC) is a universal computational paradigm that combines the evolution under an entangling Hamiltonian with the application of single-qubit gates. Since any unitary operation can be decomposed into a sequence of evolutions generated by two-body Hamiltonians, DAQC is inherently well-suited for realizing such operations. Suboptimal upper bounds for the total time required to perform these evolutions have been previously proposed. Here, we improve these limits by providing a tight bound for this crucial parameter, which shows a linear dependence with the number of couplings. This result enables a precise estimation of the time resources needed for quantum simulations and quantum algorithms implemented within the DAQC framework, facilitating a rigorous comparison with other approaches.
We extend the work in 2017 New J. Phys. 19 103015 by deriving a lower bound for the minimum time necessary to implement a unitary transformation on a generic, closed quantum system with an arbitrary number of classical control fields. This bound is explicitly analyzed for a specific N -level system similar to those used to represent simple models of an atom, or the first excitation sector of a Heisenberg spin chain, both of which are of interest in quantum control for quantum computation. Specifically, it is shown that the resultant bound depends on the dimension of the system, and on the number of controls used to implement a specific target unitary operation. The value of the bound determined numerically, and an estimate of the true minimum gate time are systematically compared for a range of system dimension and number of controls; special attention is drawn to the relationship between these two variables. It is seen that the bound captures the scaling of the minimum time well for the systems studied, and quantitatively is correct in the order of magnitude.
Abstract In quantum control, quantum speed limits provide fundamental lower bounds on the time that is needed to implement certain unitary transformations. Using Lie algebraic methods, we link these speed limits to symmetries of the control Hamiltonians and provide quantitative bounds that can be calculated without solving the controlled system dynamics. In particular we focus on two scenarios: On one hand, we provide bounds on the time that is needed for a control system to implement a given target unitary U and on the other hand we bound the time to implement the most difficult to reach evolution e − i θ H s of a target Hamiltonian H s . We apply our abstract bounds on physically relevant systems like coupled qubits, spin chains, globally controlled Rydberg atoms and NMR molecules and compare our results to the existing literature. We hope that our bounds can aid experimentalists to identify bottlenecks and design faster quantum control systems.