Trading modes against energy
- URL: http://arxiv.org/abs/2509.18854v1
- Date: Tue, 23 Sep 2025 09:41:50 GMT
- Title: Trading modes against energy
- Authors: Lukas Brenner, Beatriz Dias, Robert Koenig,
- Abstract summary: We show how energy is required to weakly simulate an $n$-qubit quantum circuit.<n>We encode qubits into high-dimensional approximate Gottesman-Kitaev-Preskill codes.
- Score: 0.13764085113103217
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We ask how much energy is required to weakly simulate an $n$-qubit quantum circuit (i.e., produce samples from its output distribution) by a unitary circuit in a hybrid qubit-oscillator model. The latter consists of a certain number of bosonic modes coupled to a constant number of qubits by a Jaynes-Cummings Hamiltonian. We find that efficient approximate weak simulation of an $n$-qubit quantum circuit of polynomial size with inverse polynomial error is possible with (1) a linear number of bosonic modes and a polynomial amount of energy, or (2) a sublinear (polynomial) number of modes and a subexponential amount of energy, or (3) a constant number of modes and an exponential amount of energy. Our construction encodes qubits into high-dimensional approximate Gottesman-Kitaev-Preskill (GKP) codes. It provides new insight into the trade-off between system size (i.e., number of modes) and the amount of energy required to perform quantum computation in the continuous-variable setting.
Related papers
- Phase-space open-systems dynamics of second-order nonlinear interactions with pulsed quantum light [0.0]
We present an efficient framework to calculate the relation between the quantum states at the input and output of a nonlinear element.<n>The methods presented here can be used to optimize the amplification or frequency conversion of broadband quantum states.
arXiv Detail & Related papers (2025-12-03T16:30:48Z) - Simulating high-accuracy nuclear motion Hamiltonians in discrete variable representation using Walsh-Hadamard QROM with fault-tolerant quantum computers [0.0]
We present a quantum algorithm for simulating rovibrational Hamiltonians on fault-tolerant quantum computers.<n>The quantum volume required for computing the rovibrational spectrum of water can be reduced by up to $105$ times.
arXiv Detail & Related papers (2025-10-21T20:31:12Z) - The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the multimode extreme bosonic Gaussian channels [53.253900735220796]
Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes.<n>Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
arXiv Detail & Related papers (2024-10-18T13:59:50Z) - Simulating electronic structure on bosonic quantum computers [34.84696943963362]
We propose an approach to map the electronic Hamiltonian into a qumode bosonic problem that can be solved on bosonic quantum devices.<n>This work establishes a new pathway for simulating many-fermion systems, highlighting the potential of hybrid qubit-qumode quantum devices.
arXiv Detail & Related papers (2024-04-16T02:04:11Z) - Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries.
One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system.
We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
arXiv Detail & Related papers (2023-10-11T15:59:54Z) - Quantum emulation of the transient dynamics in the multistate
Landau-Zener model [50.591267188664666]
We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity.
Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
arXiv Detail & Related papers (2022-11-26T15:04:11Z) - Quantum algorithms for grid-based variational time evolution [36.136619420474766]
We propose a variational quantum algorithm for performing quantum dynamics in first quantization.
Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
arXiv Detail & Related papers (2022-03-04T19:00:45Z) - Variational Adiabatic Gauge Transformation on real quantum hardware for
effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
We introduce the Variational Adiabatic Gauge Transformation (VAGT)
VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit.
The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
arXiv Detail & Related papers (2021-11-16T20:50:08Z) - An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian
Simulation [55.41644538483948]
Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates.
We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions.
The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
arXiv Detail & Related papers (2021-08-06T19:38:03Z) - Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware.
We present an algorithm that compresses the Trotter steps into a single block of quantum gates.
This results in a fixed depth time evolution for certain classes of Hamiltonians.
arXiv Detail & Related papers (2021-08-06T19:38:01Z)
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.