The energetic cost of loading classical data in quantum computers
quant-ph, cs.ET
Submitted: 2026-11-10
Updated: 2026-11-10
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: Quantum algorithms for machine learning, chemistry, and cryptanalysis often assume coherent access to classical data at negligible physical cost.
Terminology
Abstract
Quantum algorithms for machine learning, chemistry, and cryptanalysis often assume coherent access to classical data at negligible physical cost. We instead treat data loading as a hardware process and quantify the dynamic energetic cost of a quantum random access memory (QRAM) query on a superconducting processor. Using the metric-noise-resource framework, we relate query fidelity and power to gate duration, relative two-qubit drive strength, and the distribution of attenuation across a multi-stage refrigerator, while accounting for thermal photons and gate errors. We analyze the linear-depth multiplexer and the noise-resilient bucket-brigade architectures, adapting the latter to a native superconducting gate set and refining its fidelity analysis using the fully decomposed gate schedule. For a representative bucket-brigade QRAM query with a 12-qubit address register we obtain a query fidelity of 0.969. The query consumes 3.51 times10-4, J of dynamic energy, corresponding to an average dynamic power of 4.38, W and a peak of 64.4, W. Our optimization shows that, at fixed target fidelity, the operating point and attenuation profile can change the average power by a factor of two or more.
Sources
- Quantum algorithms for zero-sum games
- A Faster Quantum Algorithm for Semidefinite Programming via Robust IPM Framework
- Do you know what q-means?
- Creating superpositions that correspond to efficiently integrable probability distributions
- Quantum Energetic Advantage before Computational Advantage in Boson Sampling
- Energetics of Trapped-Ion Quantum Computation
- Unveiling Energetic Advantage in Superconducting Cat-Qubits Quantum Computation
- Energetics of Rydberg-atom Quantum Computing
- Energetics of Fault-Tolerant Spin-Qubit Quantum Computation
- Analysis and Suppression of Errors in Quantum Random Access Memory under Extended Noise Models
- Towards identifying possible fault-tolerant advantage of quantum linear system algorithms in terms of space, time and energy
- Benchmarking a quantum annealing processor with the time-to-target metric
- An Improved Volumetric Metric for Quantum Computers via more Representative Quantum Circuit Shapes
- Benchmarking Quantum Processor Performance at Scale
- Approximate Quantum Random Access Memory Architectures
- Scalable Passive QRAM
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements