Hamiltonian quantum gates -- energetic advantage from entangleability
arXiv:2507.01758 · doi:10.1088/2058-9565/ae0daf
Abstract
Hamiltonian quantum gates controlled by classical electromagnetic fields form the basis of any realistic model of quantum computers. In this letter, we derive a lower bound on the field energy required to implement such gates and relate this energy to the expected gate error. We study the entangleability (ability to entangle qubits) of Hamiltonians and highlight how this feature of quantum gates can provide a means for more energetically efficient computation. Ultimately, we show that a universal quantum computer can be realized with vanishingly low energetic requirements but at the expense of arbitrarily large complexity.
7 Pages, 1 figure
References in corpus (23)
- Quantum entanglement
- Driven coherent oscillations of a single electron spin in a quantum dot
- A Two Qubit Logic Gate in Silicon
- A single-atom electron spin qubit in silicon
- Demonstration of a small programmable quantum computer with atomic qubits
- Quantum speed limits: from Heisenberg's uncertainty principle to optimal quantum control
- A compact ion-trap quantum computing demonstrator
- An improved Landauer Principle with finite-size corrections
- Quantum technologies need a Quantum Energy Initiative
- Microwaves in Quantum Computing
- A non-equilibrium quantum Landauer principle
- Cost of counterdiabatic driving and work output
- Tight, robust, and feasible quantum speed limits for open dynamics
- Finite-Time Quantum Landauer Principle and Quantum Coherence
- Validity of Landauer's principle in the quantum regime
- Entangling power and quantum circuit complexity
- Landauer's principle at zero temperature
- From quantum speed limits to energy-efficient quantum gates
- Energy-Consumption Advantage of Quantum Computation
- The thermodynamic cost of quantum operations
- Landauer Principle and Thermodynamics of Computation
- Nonequilibrium quantum bounds to Landauer's principle: Tightness and effectiveness
- Generalized Zurek's bound on the cost of an individual classical or quantum computation