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:2611.13079

Quantum simulation of real-time bosonic dynamics with binary and unary position encodings on superconducting and trapped-ion processors

Masanori Hanada, Jiwoo Seo, Seok-Kyun Son, 윤중기

Published Nov 9, 2026• 0 citations
arXivHTMLPDF

Abstract

Simulating a bosonic degree of freedom on qubit hardware requires discretizing its position space, and the qubit encoding of the resulting lattice determines the circuits that realize its real-time dynamics. We compare binary and unary encodings of a position lattice on superconducting (IBM) and trapped-ion (IonQ) processors. Binary encoding applies the kinetic term through the quantum Fourier transform; unary encoding uses one qubit per site, single-qubit rotations for the potential and excitation-conserving exchange gates for the kinetic term. For a single degree of freedom the unary dynamics is a free-fermion problem, and its product formula compresses exactly into a nearest-neighbor circuit of fixed size. With about two hundred two-qubit gates, these circuits resolve tunneling in a symmetric double well on both processors, with the right-well probability falling from 0.97 to 0.06 on IBM and from 0.96 to 0.12 on IonQ, whereas binary product-formula circuits with several thousand two-qubit gates do not reproduce the transfer. Noiseless emulation indicates that this contrast reflects the compilation as well as the encoding: without the fixed-size optimization, a unary product formula that captures the transfer also requires several thousand two-qubit gates. Post-selection on the single-excitation subspace removes leakage, and because every energy eigenstate of the symmetric grid populates both wells equally, the measured population reversal bounds the coherence between energy eigenstates from below. Coupled-oscillator benchmarks, where inter-register interactions prevent this exact compression, show that the preferred encoding depends on the grid size and the evolution time.

DOI
10.48550/arxiv.2611.13079

Related papers

Encoding a bosonic mode into qubits for simulating boson-matter interactions

Maarten Stroeks, Jelena Mackeprang, Yaroslav Herasymenko +1 more

We explore the space-time cost of encoding of a bosonic mode into a set of qubits via various encodings, and their resilience to noise. In particular, we compare the performance of the unary Fock state encoding, an unexplored encoding of Fock states into Dicke states (``Dicke'' encoding), and the binary quadrature encoding. We do so by considering a displacement as well as a simulation of a Dicke model, coupling a bosonic mode to a set of atoms represented as qubits. Using classical simulations, we assess the accuracy and optimized space-time costs in terms of number of qubits, circuit depth and CNOT count of a quantum simulation of the time dynamics using these encodings. Although our study is far from comprehensive, we find that the binary quadrature encoding is overall most favorable in terms of being very space-efficient and relatively time-efficient due to the use of the quantum Fourier transform. Our novel Dicke encoding leads to very shallow circuits, but pays in terms of using many more qubits. We probe the use of an H2-2 Quantinuum trapped-ion qubit device (56 qubits) for displacement and Dicke model simulation in the low boson-number regime, where we find that noise leads to visible deviations from ideal circuit dynamics.

quant-pharXiv:2610.29762•Oct 22, 2026•0 citations

On Performance and Limitations of Quantum Wave Packet Dynamics Simulated using NISQ Hardware

Tamila Kuanysheva, Jonathan Andrade-Plascencia, Jayakrushna Sahoo +2 more

We investigate one-dimensional quantum wave-packet dynamics using a grid-based encoding of the wave function onto qubit registers. Time evolution is implemented using a split operator approach, with the kinetic energy operator realized via the Quantum Fourier Transform (QFT) and arbitrary discretized potentials represented by commuting Pauli-Z gates. The algorithm is benchmarked against classical grid-based simulations and validated using a noiseless Qiskit Statevector simulator before being implemented on current quantum hardware (IBM Quantum and IonQ) for qubit counts ranging from two to five. Good agreement with benchmark calculations is obtained for two- and three-qubit implementations, while deviations increase at larger qubit counts due to hardware noise and increased circuit depth. Among the devices examined, the algorithm maintains closer agreement with the benchmark on the trapped-ion IonQ Forte processor as the number of qubits increases.

quant-pharXiv:2605.20078•May 20, 2026•1 citation

Structure-Preserving Quantum Simulation of Wave Equations on a Trapped-Ion Processor

Abhishek Shringi, Hsuan-Cheng Wu, Ahmed Shokry +2 more

Wave equations provide a natural testbed for near-term quantum simulation of partial differential equations, but hardware demonstrations have remained limited in spatial dimension, equation class, system size, and physically meaningful output. We develop and benchmark structure-preserving, Fourier-based quantum circuits for the one- and two dimensional acoustic wave equations and Dirac dynamics with variable mass on the Quantinuum H2-2 trapped-ion processor. The experiments include one-dimensional grids with up to \(1024\) points and \(32\times32\) two-dimensional grids, corresponding to an encoded state-space dimension of up to \(4096\). Rather than reconstructing the full fields, we estimate subdomain kinetic energies directly from measurement samples. Across all tested acoustic and Dirac dynamics problems, the H2-2 results track the classical kinetic-energy dynamics with mean absolute errors between \(5.9\times10^{-3}\) and \(2.4\times10^{-2}\). At fixed retained bandwidth, the compiled gate counts grow approximately quadratically with the number of grid qubits; the acoustic circuit sizes are essentially independent of evolution time, whereas the cost also grows with the number of product-formula steps. These results provide hardware-level evidence that accurate observable dynamics can remain resolvable for structured wave problems with thousands of encoded degrees of freedom on a present-day trapped-ion processor.

quant-pharXiv:2607.28499•Jul 31, 2026•1 citation

Quantum Simulation of Molecular Dynamics Processes─A Benchmark Study Using a Classical Simulator and Present-Day Quantum Hardware

Tamila Kuanysheva, Brian K. Kendrick, Łukasz Cincio +1 more

We explore how the fundamental problems in quantum molecular dynamics can be modeled using classical simulators (emulators) of quantum computers and the actual quantum hardware available to us today. The list of problems we tackle includes propagation of a free wave packet, vibration of a harmonic oscillator, and tunneling through a barrier. Each of these problems starts with the initial wave packet setup. Although Qiskit provides a general method for initializing wave functions, in most cases it generates deep quantum circuits. While these circuits perform well on noiseless simulators, they suffer from excessive noise on quantum hardware. To overcome this issue, we designed a shallower quantum circuit for preparing a Gaussian-like initial wave packet, which improves the performance of real hardware. Next, quantum circuits are implemented to apply the kinetic and potential energy operators for the evolution of a wave function over time. The results of our modeling on classical emulators of quantum hardware agree perfectly with the results obtained using the traditional (classical) methods. This serves as a benchmark and demonstrates that the quantum algorithms and Qiskit codes we developed are accurate. However, the results obtained on the actual quantum hardware available today, such as IBM's superconducting qubits and IonQ's trapped ions, indicate large discrepancies due to hardware limitations. This work highlights both the potential and challenges of using quantum computers to solve fundamental quantum molecular dynamics problems.

arXiv:2507.21030•The Journal of Physical Chemistry A•Jul 3, 2025•2 citations

Quantum simulation of real-time Yukawa dynamics with qubits and qumodes

Jack Y. Araz, Jeffrey Forshaw, Ross Jenkinson

Real-time quantum simulation of field theories offers access to scattering and decay dynamics, circumventing the limitations of Euclidean lattice methods. However, representing bosonic fields on qubits requires a finite-dimensional approximation and can entail costly multi-qubit operations. Hybrid qubit-qumode architectures avoid this by encoding bosonic fields directly in oscillators. We formulate scattering in the (1+1)-dimensional Yukawa theory for such a device, with staggered fermions on qubits and the scalar on qumodes. Trapped ions are a natural candidate, with the fermions on the internal states of the ions and the scalar on their collective motion, so that the Yukawa coupling becomes a native spin-dependent displacement. Emulating the device with tensor networks, we study the decay of a single scalar particle and fermion-antifermion scattering around the resonance region, using observables that can be measured on the device natively. We compare the results with those obtained using lattice perturbation theory. The emulation is able to resolve corrections beyond the Dyson summation of the one-loop self-energy.

quant-pharXiv:2611.00201•Nov 3, 2026•0 citations

Hybrid Oscillator-Qubit Quantum Processors: Simulating Fermions, Bosons, and Gauge Fields

Eleanor Crane, Kevin C. Smith, Teague Tomesh +9 more

Key to solving many societally relevant problems in materials science, quantum chemistry, and nuclear physics is understanding their fundamental microscopic quantum behavior. All of these problems can be phrased as fermionic (e.g., electrons, quarks) and bosonic particles (e.g., lattice vibrations, photons) interacting with each other. However, solving these systems of strongly interacting fermions and bosons is out of reach for classical computers and also non-error-corrected qubit-only quantum computers. In this paper, we introduce a hybrid qubit and bosonic-oscillator quantum-simulation framework, which is so efficient that it could simulate some of these strongly correlated problems even without error correction. Specifically, we leverage the available universal bosonic gate set with O ( 1 ) operations per gate as a function of the bosonic cutoff. This enables our framework to provide exact decompositions of higher-order fermion-boson interactions, including notoriously challenging terms such as ( 2 + 1 ) D gauge theories. We show how to compile dynamics, ancilla-free partial error detection, nonlocal observable measurements, and ground-state energy estimation using both qubit-boson variational quantum eigensolvers and quantum signal processing. We introduce a “post-qubit quantum advantage” experiment which is out of reach for both near-term qubit-only quantum computers and classical computers. We justify this proposal by estimating bosonic gate fidelities through high–boson-occupation Lindblad simulation and by comparing to qubit-only algorithms. For the latter, we develop a new qubit-based algorithm for simulating a beam splitter with a boson number cutoff N max , which scales as O ˜ ( N max 1 + o ( 1 ) ) , asymptotically outperforming previously known qubit methods. However, to reach the same circuit fidelity as qubit-boson hardware with 99.9% per-gate fidelity, a qubit quantum computer using the best-known method would still need fidelities of at least 99.9999%, likely requiring substantial error correction. Our framework can be used in superconducting hardware, which we focus on, as well as trapped-ion and neutral-atom hardware. This work establishes digital hybrid qubit-boson quantum simulation as a promising and advantageous method for solving the many challenging, strongly correlated, fermion-boson models of relevance to science and technology.

arXiv:2409.03747•Physical Review X•Jul 23, 2026•96 citations
Simulating a bosonic degree of freedom on qubit hardware requires discretizing its position space, and the qubit encoding of the resulting lattice determines the circuits that realize its real-time dynamics. We compare binary and unary encodings of a position lattice on superconducting (IBM) and trapped-ion (IonQ) processors. Binary encoding applies the kinetic term through the quantum Fourier transform; unary encoding uses one qubit per site, single-qubit rotations for the potential and excitation-conserving exchange gates for the kinetic term. For a single degree of freedom the unary dynamics is a free-fermion problem, and its product formula compresses exactly into a nearest-neighbor circuit of fixed size. With about two hundred two-qubit gates, these circuits resolve tunneling in a symmetric double well on both processors, with the right-well probability falling from 0.97 to 0.06 on IBM and from 0.96 to 0.12 on IonQ, whereas binary product-formula circuits with several thousand two-qubit gates do not reproduce the transfer. Noiseless emulation indicates that this contrast reflects the compilation as well as the encoding: without the fixed-size optimization, a unary product formula that captures the transfer also requires several thousand two-qubit gates. Post-selection on the single-excitation subspace removes leakage, and because every energy eigenstate of the symmetric grid populates both wells equally, the measured population reversal bounds the coherence between energy eigenstates from below. Coupled-oscillator benchmarks, where inter-register interactions prevent this exact compression, show that the preferred encoding depends on the grid size and the evolution time.
We explore the space-time cost of encoding of a bosonic mode into a set of qubits via various encodings, and their resilience to noise. In particular, we compare the performance of the unary Fock state encoding, an unexplored encoding of Fock states into Dicke states (``Dicke'' encoding), and the binary quadrature encoding. We do so by considering a displacement as well as a simulation of a Dicke model, coupling a bosonic mode to a set of atoms represented as qubits. Using classical simulations, we assess the accuracy and optimized space-time costs in terms of number of qubits, circuit depth and CNOT count of a quantum simulation of the time dynamics using these encodings. Although our study is far from comprehensive, we find that the binary quadrature encoding is overall most favorable in terms of being very space-efficient and relatively time-efficient due to the use of the quantum Fourier transform. Our novel Dicke encoding leads to very shallow circuits, but pays in terms of using many more qubits. We probe the use of an H2-2 Quantinuum trapped-ion qubit device (56 qubits) for displacement and Dicke model simulation in the low boson-number regime, where we find that noise leads to visible deviations from ideal circuit dynamics.
We investigate one-dimensional quantum wave-packet dynamics using a grid-based encoding of the wave function onto qubit registers. Time evolution is implemented using a split operator approach, with the kinetic energy operator realized via the Quantum Fourier Transform (QFT) and arbitrary discretized potentials represented by commuting Pauli-Z gates. The algorithm is benchmarked against classical grid-based simulations and validated using a noiseless Qiskit Statevector simulator before being implemented on current quantum hardware (IBM Quantum and IonQ) for qubit counts ranging from two to five. Good agreement with benchmark calculations is obtained for two- and three-qubit implementations, while deviations increase at larger qubit counts due to hardware noise and increased circuit depth. Among the devices examined, the algorithm maintains closer agreement with the benchmark on the trapped-ion IonQ Forte processor as the number of qubits increases.
Wave equations provide a natural testbed for near-term quantum simulation of partial differential equations, but hardware demonstrations have remained limited in spatial dimension, equation class, system size, and physically meaningful output. We develop and benchmark structure-preserving, Fourier-based quantum circuits for the one- and two dimensional acoustic wave equations and Dirac dynamics with variable mass on the Quantinuum H2-2 trapped-ion processor. The experiments include one-dimensional grids with up to 102410241024 points and 32×3232\times3232×32 two-dimensional grids, corresponding to an encoded state-space dimension of up to 409640964096. Rather than reconstructing the full fields, we estimate subdomain kinetic energies directly from measurement samples. Across all tested acoustic and Dirac dynamics problems, the H2-2 results track the classical kinetic-energy dynamics with mean absolute errors between 5.9×10−35.9\times10^{-3}5.9×10−3 and 2.4×10−22.4\times10^{-2}2.4×10−2. At fixed retained bandwidth, the compiled gate counts grow approximately quadratically with the number of grid qubits; the acoustic circuit sizes are essentially independent of evolution time, whereas the cost also grows with the number of product-formula steps. These results provide hardware-level evidence that accurate observable dynamics can remain resolvable for structured wave problems with thousands of encoded degrees of freedom on a present-day trapped-ion processor.
We explore how the fundamental problems in quantum molecular dynamics can be modeled using classical simulators (emulators) of quantum computers and the actual quantum hardware available to us today. The list of problems we tackle includes propagation of a free wave packet, vibration of a harmonic oscillator, and tunneling through a barrier. Each of these problems starts with the initial wave packet setup. Although Qiskit provides a general method for initializing wave functions, in most cases it generates deep quantum circuits. While these circuits perform well on noiseless simulators, they suffer from excessive noise on quantum hardware. To overcome this issue, we designed a shallower quantum circuit for preparing a Gaussian-like initial wave packet, which improves the performance of real hardware. Next, quantum circuits are implemented to apply the kinetic and potential energy operators for the evolution of a wave function over time. The results of our modeling on classical emulators of quantum hardware agree perfectly with the results obtained using the traditional (classical) methods. This serves as a benchmark and demonstrates that the quantum algorithms and Qiskit codes we developed are accurate. However, the results obtained on the actual quantum hardware available today, such as IBM's superconducting qubits and IonQ's trapped ions, indicate large discrepancies due to hardware limitations. This work highlights both the potential and challenges of using quantum computers to solve fundamental quantum molecular dynamics problems.
Real-time quantum simulation of field theories offers access to scattering and decay dynamics, circumventing the limitations of Euclidean lattice methods. However, representing bosonic fields on qubits requires a finite-dimensional approximation and can entail costly multi-qubit operations. Hybrid qubit-qumode architectures avoid this by encoding bosonic fields directly in oscillators. We formulate scattering in the (1+1)-dimensional Yukawa theory for such a device, with staggered fermions on qubits and the scalar on qumodes. Trapped ions are a natural candidate, with the fermions on the internal states of the ions and the scalar on their collective motion, so that the Yukawa coupling becomes a native spin-dependent displacement. Emulating the device with tensor networks, we study the decay of a single scalar particle and fermion-antifermion scattering around the resonance region, using observables that can be measured on the device natively. We compare the results with those obtained using lattice perturbation theory. The emulation is able to resolve corrections beyond the Dyson summation of the one-loop self-energy.
Key to solving many societally relevant problems in materials science, quantum chemistry, and nuclear physics is understanding their fundamental microscopic quantum behavior. All of these problems can be phrased as fermionic (e.g., electrons, quarks) and bosonic particles (e.g., lattice vibrations, photons) interacting with each other. However, solving these systems of strongly interacting fermions and bosons is out of reach for classical computers and also non-error-corrected qubit-only quantum computers. In this paper, we introduce a hybrid qubit and bosonic-oscillator quantum-simulation framework, which is so efficient that it could simulate some of these strongly correlated problems even without error correction. Specifically, we leverage the available universal bosonic gate set with O ( 1 ) operations per gate as a function of the bosonic cutoff. This enables our framework to provide exact decompositions of higher-order fermion-boson interactions, including notoriously challenging terms such as ( 2 + 1 ) D gauge theories. We show how to compile dynamics, ancilla-free partial error detection, nonlocal observable measurements, and ground-state energy estimation using both qubit-boson variational quantum eigensolvers and quantum signal processing. We introduce a “post-qubit quantum advantage” experiment which is out of reach for both near-term qubit-only quantum computers and classical computers. We justify this proposal by estimating bosonic gate fidelities through high–boson-occupation Lindblad simulation and by comparing to qubit-only algorithms. For the latter, we develop a new qubit-based algorithm for simulating a beam splitter with a boson number cutoff N max , which scales as O ˜ ( N max 1 + o ( 1 ) ) , asymptotically outperforming previously known qubit methods. However, to reach the same circuit fidelity as qubit-boson hardware with 99.9% per-gate fidelity, a qubit quantum computer using the best-known method would still need fidelities of at least 99.9999%, likely requiring substantial error correction. Our framework can be used in superconducting hardware, which we focus on, as well as trapped-ion and neutral-atom hardware. This work establishes digital hybrid qubit-boson quantum simulation as a promising and advantageous method for solving the many challenging, strongly correlated, fermion-boson models of relevance to science and technology.