Search arXivSearch

arXiv · 2503.23610

Powering Quantum Computation with Quantum Batteries

Abstract

Executing quantum logic in cryogenic quantum computers requires a continuous energy supply from room-temperature control electronics. This dependence on external energy sources creates scalability limitations due to control channel density and heat dissipation. Here, we propose quantum batteries (QBs) as intrinsic quantum energy sources for quantum computation, enabling the thermodynamic limit of zero dissipation for unitary gates. Unlike classical power sources, QBs maintain quantum coherence with their load - a property that, while theoretically studied, remains unexploited in practical quantum technologies. We demonstrate that initializing a bosonic QB in a Fock state can supply the energy required for arbitrary unitary gates regardless of the circuit's depth, via the recycling of pre-charged energy. Crucially, allowing QB-qubit entanglement during computation lowers the QB initial energy requirements below established energy-fidelity bounds. This scheme facilitates a universal gate set controlled by a single parameter per qubit, its resonant frequency. The relative detuning of each qubit from the QB resonant frequency gives rise to qualitatively two gate types, off-resonance and around-resonance. The former facilitates dispersive gates which allow multi-qubit parity probing while the latter enables energy exchange between the QB and the qubits, driving both population transfer and entanglement generation. This mechanism utilizes the all-to-all connectivity of the shared resonator architecture to go beyond the standard single- and two-qubit native gates of current platforms with multi-qubit gate timescales of few pi/g, where g is the qubit-resonator coupling. The resultant speed-up includes also superextensive gates between symmetric Dicke states, characteristic of QB systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yaniv Kurman, Kieran Hymas, Arkady Fedorov, William J. Munro, James Quach. 2026-01-27. Powering Quantum Computation with Quantum Batteries. https://doi.org/10.1103/l39v-jwwz

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fermionic magic resources in disordered quantum spin chains

Fermionic non-Gaussianity quantifies a quantum state's deviation from a classically tractable free-fermionic description, constituting a necessary resource for computational quantum advantage. Here we use fermionic antiflatness (FAF) to measure this deviation across ergodic and many-body localized (MBL) regimes. We focus on the paradigmatic disordered spin-$1\!/2$ XXZ chain and its impurity variant with local interactions. Across highly excited eigenstates, FAF evolves from typical-state behavior at weak disorder to strongly suppressed values deep in the MBL regime, with volume-law scaling in the XXZ chain and an area-law bound in the impurity setting. Rare long-range cat-like eigenstates exhibit a pronounced enhancement of FAF, making it a sensitive diagnostic of mechanisms proposed to destabilize MBL. Starting from product states, we find that in the MBL regime FAF grows slowly in time, approaching saturation via a power-law relaxation. Overall, our results show that MBL suppresses fermionic non-Gaussianity, and the associated complexity beyond free fermions, while ergodicity restores it, motivating explorations of fermionic non-Gaussianity in other ergodicity-breaking phenomena.

quant-ph

Progressive Binarization - Pauli Correlation Encoding: a Continuation Method for Constrained Optimization

Pauli Correlation Encoding (PCE) reduces the qubit requirements of quantum optimization by embedding the problem variables into the expectation values of Pauli observables, so that the number of qubits can be much smaller than the number of variables. PCE has not yet been studied for constrained optimization. We extend it to constrained combinatorial problems, using the budget-constrained MinCut as a case study, and show that the standard formulation fails to reliably enforce the constraint: feasibility hinges on the binarization of the encoded variables, which depends sensitively on hyperparameters that are hard to tune and do not transfer across instances. To address this, we introduce Progressive-Binarization PCE (PB-PCE), an adaptive continuation scheme that progressively increases the binarization parameter while re-optimizing the circuit from the previous solution, driving the variables towards the binary domain. PB-PCE attains near-complete constraint satisfaction (88--100\%) and smaller cut sizes than standard PCE, with a number of stages (10--20) essentially independent of problem size, solving instances of up to 300 variables with only 9-qubit circuits.

quant-ph

A quantum model for synchronizing finite state transition systems

We propose a quantum model for finding a resetting input sequence (RS) which can take a finite state transition system (FA), to particular state independent of its current state. The complexity of finding such sequences for various types of FA can be NP-Hard or even PSPACE-Complete. To this end, we represent the FA states, inputs, and transition function in quantum space. Accordingly, we propose a model to represent the execution of an input sequence of a particular length $l$ starting form an initial FA state. The model is extended considering the application in superposition of all input sequences of length $l$ to an initial state of the FA. The model is further extended considering the application of all input sequences to all initial states of the FA capturing for every input sequence the collection (ordered list) of states reached by applying the sequence to all states of the FA. The amplitude amplification algorithm is then used as it combines similar collections of reached states while preserving all input sequences that reach these collections. A Grover search for a reached collection where its elements correspond to the same FA state provides a RS for the FA. Our approach offers a quadratic gain over the exponential complexity of traditional brute-force method, which is the only method that can be applied to a general FA class.

quant-ph