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

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

Maarten Stroeks, Jelena Mackeprang, Yaroslav Herasymenko, Barbara Terhal

quant-phSubmitted Oct 21, 2026• Announced Oct 22, 2026• 0 citations• Revised Oct 26, 2026 (v2)
v1 · Oct 21, 2026v2 · Oct 26, 2026
arXivHTMLPDF

Abstract

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.

AI Summary

The paper compares qubit encodings of a finite-energy bosonic mode for displacement operations and boson–matter dynamics: unary Fock, binary quadrature, and a Dicke-state encoding mapping Fock states to permutation-symmetric qubit states. The question is how encoding accuracy trades against qubit count, circuit depth, entangling-gate count, and hardware noise. The Dicke encoding approximates $a$ by $N_b^{-1/2}\sum_j\sigma_j^-$, introducing excitation-dependent deformation and requiring $N_b\gg N_{\rm cutoff}$. Displacements then use depth-one single-qubit circuits with no CNOTs. Unary displacement circuits use $4(N_b-1)n_T$ CNOTs with a first-order Trotter-error bound $O(|\alpha|^2N_b/n_T)$; binary-quadrature displacements use two QFTs. Numerically, displacement encoding infidelity decreases exponentially with qubit count for unary and binary-quadrature encodings, but polynomially for Dicke encoding. Classical simulations optimize resources for reproducing the mean boson number under a Dicke Hamiltonian with three atoms. Binary quadrature generally requires fewer qubits and CNOTs, whereas Dicke encoding can reduce depth. In one superradiant benchmark, Dicke encoding exceeds the target boson-number error even at 1,000 encoding qubits. Trapped-ion experiments compare unary and Dicke encodings; displacement tests use 13 and 45 qubits, respectively. Low-occupation dynamics shows noise-induced deviations, partly reduced by unary-subspace postselection. The comparison is explicitly noncomprehensive: it uses simple benchmarks, first-order Trotterization, and mainly observable-specific accuracy. The clean Dicke model is classically tractable; binary Fock encoding is not directly benchmarked, binary quadrature is not tested experimentally, and sampling error is excluded from resource optimization.

No sign of AI-generated textIncrementalMissing comparison

Error found: For its stated circuit decomposition, the binary-quadrature resource table undercounts free evolution, which requires 4N_b(N_b−1) CNOTs and makes the quoted 3700-CNOT example cost 4500 evolution CNOTs before vacuum preparation. The binary-quadrature full-pipeline comparisons report preparation costs conditional on successful postselection and omit the expected cost of preparation retries. The binary-quadrature displacement circuit is not exactly the exponential generated by the encoded annihilation operator, so its stated zero implementation error requires a different reference-operator convention. The unary-encoding commutator bound in Equation 'upp' incorrectly omits cutoff dependence, although that analytical bound is not used in the numerical benchmarks.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
Updated references for v2

Related papers

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 +1 more

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.

arXiv:2611.13079•Nov 9, 2026•0 citations

Digital-analog quantum simulation of generalized Dicke models with superconducting circuits

Lucas Lamata

We propose a digital-analog quantum simulation of generalized Dicke models with superconducting circuits, including Fermi- Bose condensates, biased and pulsed Dicke models, for all regimes of light-matter coupling. We encode these classes of problems in a set of superconducting qubits coupled with a bosonic mode implemented by a transmission line resonator. Via digital-analog techniques, an efficient quantum simulation can be performed in state-of-the-art circuit quantum electrodynamics platforms, by suitable decomposition into analog qubit-bosonic blocks and collective single-qubit pulses through digital steps. Moreover, just a single global analog block would be needed during the whole protocol in most of the cases, superimposed with fast periodic pulses to rotate and detune the qubits. Therefore, a large number of digital steps may be attained with this approach, providing a reduced digital error. Additionally, the number of gates per digital step does not grow with the number of qubits, rendering the simulation efficient. This strategy paves the way for the scalable digital-analog quantum simulation of many-body dynamics involving bosonic modes and spin degrees of freedom with superconducting circuits.

arXiv:1608.08025•Scientific Reports•Mar 3, 2017•48 citations

First and second quantized digital quantum simulations of bosonic systems

Mathias Mikkelsen, Hubert Okadome Valencia

We compare the basic resource requirements for first and second quantized bosonic mappings in a system consisting of $N$ particles in $M$ modes. In addition to the standard binary first quantized mapping, we investigate the unary first quantized mapping. Our comparison focuses on the $k$-body reduced density matrix ($k$-RDM) and two standard bosonic Hamiltonians. The first quantized mappings use less resources for off-diagonal terms of the $k$-RDM by a factor of $ \sim N^k$, compared to the second quantized mappings. The number of gates for the first quantized binary mapping increases faster with $M$ compared to the other mappings. Nevertheless, a detailed numeric analysis reveals that the binary first quantized mapping still requires fewer gates than the binary and unary second quantized ones for realistic combinations of $N$ and $M$, while requiring exponentially fewer qubits than the unary mappings. Additionally, the number of CNOT and $R_z(φ)$ gates necessary to express a single Trotter step of the Hamiltonian in the binary first quantized mapping is comparable to the (most efficient for a single Trotter step) unary first quantized one when $M = 2^n$ for both the Bose-Hubbard model and the harmonic trap with short-range interactions. Additionally the binary mapping leads to lower one-norms than the unary mapping making it the overall most efficient choice for qubitization-based quantum phase estimation.

quant-pharXiv:2511.10124•Nov 14, 2025•1 citation

Efficient Simulation of Sparse, Non-Local Fermion Models

Reinis Irmejs, J. Ignacio Cirac

Efficient simulation of interacting fermionic systems is a key application of near-term quantum computers, but is hindered by the overhead required to encode fermionic operators on qubit hardware. Here, we consider models with $N$ fermionic modes in which each participates in at most a constant number $d$ of interactions and study the circuit depth required to implement the Trotterized time evolution on qubit hardware with all-to-all connectivity. We introduce an encoding that augments each physical fermionic mode with a small number of auxiliary fermions, enabling the removal of Jordan--Wigner strings. Although the preparation of the auxiliary fermion state incurs an initial overhead, this state remains invariant under time evolution. As a result, long-time evolution can be implemented with asymptotically optimal circuit depth, reducing a previously multiplicative $O(\log N)$ overhead to an additive overhead. Our results thus establish that the simulation of sparse fermionic models on qubit hardware matches the performance achievable on ideal fermionic hardware up to constant factors and $O(dN)$ ancillary qubits.

quant-pharXiv:2512.15843•Dec 18, 2025•1 citation

Comparison of encoding schemes for quantum computing of S > 1 / 2 spin chains

Erik Lötstedt, Kaoru Yamanouchi

We compare four different encoding schemes for the quantum computing of spin chains with a spin quantum number $S>1/2$: a compact mapping, a direct (or one-hot) mapping, a Dicke mapping, and a qudit mapping. The three different qubit encoding schemes are assessed by conducting Hamiltonian simulation for $1/2 \le S \le 5/2$ using a trapped-ion quantum computer. The qudit mapping is tested by running simulations with a simple noise model. The Dicke mapping, in which the spin states are encoded as superpositions of multi-qubit states, is found to be the most efficient because of the small number of terms in the qubit Hamiltonian. We also investigate the $S$-dependence of the time step length $Δτ$ in the Suzuki-Trotter approximation and find that, in order to obtain the same accuracy for all $S$, $Δτ$ should be inversely proportional to $S$.

arXiv:2502.18838•Physical Review A•May 28, 2025•5 citations

Simulating the Dicke Model on Qubit-Based and hybrid Qubit-Boson-Based Quantum Computers

Aravind P. Babu, Seongjin Ahn, Jing Sun +3 more

The Dicke model provides a fundamental description of collective light-matter interactions and has long served as a testbed for exploring a wide range of physical phenomena in quantum optics and condensed matter physics. In this work, we develop a variational framework for investigating the finite-size Dicke model on both fully qubit-based (digital) and hybrid qubit boson based (digital-analogue) quantum computing platforms. We show that the resulting model reproduces the characteristic critical behavior of the Dicke model in the appropriate large-spin limit while remaining suitable for implementation on both classical emulators of quantum computers and actual trapped ion quantum computers, albeit in the case of latter somewhat limited by noise. Finally, we introduce a complementary hybrid qubit-bosonic variational ansatz that directly exploits the bosonic degree of freedom to reduce quantum resources and discuss its potential implementation on hybrid quantum hardware. Our results establish a scalable, symmetry-aware framework for variational quantum simulations of collective light-matter systems and provide a pathway toward efficient simulations of more general spin-boson models on near-term quantum devices.

quant-pharXiv:2607.18546•Jul 22, 2026•0 citations
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.
The paper compares qubit encodings of a finite-energy bosonic mode for displacement operations and boson–matter dynamics: unary Fock, binary quadrature, and a Dicke-state encoding mapping Fock states to permutation-symmetric qubit states. The question is how encoding accuracy trades against qubit count, circuit depth, entangling-gate count, and hardware noise.
The Dicke encoding approximates aaa by Nb−1/2∑jσj−N_b^{-1/2}\sum_j\sigma_j^-Nb−1/2​∑j​σj−​, introducing excitation-dependent deformation and requiring Nb≫NcutoffN_b\gg N_{\rm cutoff}Nb​≫Ncutoff​. Displacements then use depth-one single-qubit circuits with no CNOTs. Unary displacement circuits use 4(Nb−1)nT4(N_b-1)n_T4(Nb​−1)nT​ CNOTs with a first-order Trotter-error bound O(∣α∣2Nb/nT)O(|\alpha|^2N_b/n_T)O(∣α∣2Nb​/nT​); binary-quadrature displacements use two QFTs. Numerically, displacement encoding infidelity decreases exponentially with qubit count for unary and binary-quadrature encodings, but polynomially for Dicke encoding.
Classical simulations optimize resources for reproducing the mean boson number under a Dicke Hamiltonian with three atoms. Binary quadrature generally requires fewer qubits and CNOTs, whereas Dicke encoding can reduce depth. In one superradiant benchmark, Dicke encoding exceeds the target boson-number error even at 1,000 encoding qubits. Trapped-ion experiments compare unary and Dicke encodings; displacement tests use 13 and 45 qubits, respectively. Low-occupation dynamics shows noise-induced deviations, partly reduced by unary-subspace postselection.
The comparison is explicitly noncomprehensive: it uses simple benchmarks, first-order Trotterization, and mainly observable-specific accuracy. The clean Dicke model is classically tractable; binary Fock encoding is not directly benchmarked, binary quadrature is not tested experimentally, and sampling error is excluded from resource optimization.
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 propose a digital-analog quantum simulation of generalized Dicke models with superconducting circuits, including Fermi- Bose condensates, biased and pulsed Dicke models, for all regimes of light-matter coupling. We encode these classes of problems in a set of superconducting qubits coupled with a bosonic mode implemented by a transmission line resonator. Via digital-analog techniques, an efficient quantum simulation can be performed in state-of-the-art circuit quantum electrodynamics platforms, by suitable decomposition into analog qubit-bosonic blocks and collective single-qubit pulses through digital steps. Moreover, just a single global analog block would be needed during the whole protocol in most of the cases, superimposed with fast periodic pulses to rotate and detune the qubits. Therefore, a large number of digital steps may be attained with this approach, providing a reduced digital error. Additionally, the number of gates per digital step does not grow with the number of qubits, rendering the simulation efficient. This strategy paves the way for the scalable digital-analog quantum simulation of many-body dynamics involving bosonic modes and spin degrees of freedom with superconducting circuits.
We compare the basic resource requirements for first and second quantized bosonic mappings in a system consisting of NNN particles in MMM modes. In addition to the standard binary first quantized mapping, we investigate the unary first quantized mapping. Our comparison focuses on the kkk-body reduced density matrix (kkk-RDM) and two standard bosonic Hamiltonians. The first quantized mappings use less resources for off-diagonal terms of the kkk-RDM by a factor of $ \sim N^k$, compared to the second quantized mappings. The number of gates for the first quantized binary mapping increases faster with MMM compared to the other mappings. Nevertheless, a detailed numeric analysis reveals that the binary first quantized mapping still requires fewer gates than the binary and unary second quantized ones for realistic combinations of NNN and MMM, while requiring exponentially fewer qubits than the unary mappings. Additionally, the number of CNOT and Rz(φ)R_z(φ)Rz​(φ) gates necessary to express a single Trotter step of the Hamiltonian in the binary first quantized mapping is comparable to the (most efficient for a single Trotter step) unary first quantized one when M=2nM = 2^nM=2n for both the Bose-Hubbard model and the harmonic trap with short-range interactions. Additionally the binary mapping leads to lower one-norms than the unary mapping making it the overall most efficient choice for qubitization-based quantum phase estimation.
Efficient simulation of interacting fermionic systems is a key application of near-term quantum computers, but is hindered by the overhead required to encode fermionic operators on qubit hardware. Here, we consider models with NNN fermionic modes in which each participates in at most a constant number ddd of interactions and study the circuit depth required to implement the Trotterized time evolution on qubit hardware with all-to-all connectivity. We introduce an encoding that augments each physical fermionic mode with a small number of auxiliary fermions, enabling the removal of Jordan--Wigner strings. Although the preparation of the auxiliary fermion state incurs an initial overhead, this state remains invariant under time evolution. As a result, long-time evolution can be implemented with asymptotically optimal circuit depth, reducing a previously multiplicative O(log⁡N)O(\log N)O(logN) overhead to an additive overhead. Our results thus establish that the simulation of sparse fermionic models on qubit hardware matches the performance achievable on ideal fermionic hardware up to constant factors and O(dN)O(dN)O(dN) ancillary qubits.
We compare four different encoding schemes for the quantum computing of spin chains with a spin quantum number S>1/2S>1/2S>1/2: a compact mapping, a direct (or one-hot) mapping, a Dicke mapping, and a qudit mapping. The three different qubit encoding schemes are assessed by conducting Hamiltonian simulation for 1/2≤S≤5/21/2 \le S \le 5/21/2≤S≤5/2 using a trapped-ion quantum computer. The qudit mapping is tested by running simulations with a simple noise model. The Dicke mapping, in which the spin states are encoded as superpositions of multi-qubit states, is found to be the most efficient because of the small number of terms in the qubit Hamiltonian. We also investigate the SSS-dependence of the time step length ΔτΔτΔτ in the Suzuki-Trotter approximation and find that, in order to obtain the same accuracy for all SSS, ΔτΔτΔτ should be inversely proportional to SSS.
The Dicke model provides a fundamental description of collective light-matter interactions and has long served as a testbed for exploring a wide range of physical phenomena in quantum optics and condensed matter physics. In this work, we develop a variational framework for investigating the finite-size Dicke model on both fully qubit-based (digital) and hybrid qubit boson based (digital-analogue) quantum computing platforms. We show that the resulting model reproduces the characteristic critical behavior of the Dicke model in the appropriate large-spin limit while remaining suitable for implementation on both classical emulators of quantum computers and actual trapped ion quantum computers, albeit in the case of latter somewhat limited by noise. Finally, we introduce a complementary hybrid qubit-bosonic variational ansatz that directly exploits the bosonic degree of freedom to reduce quantum resources and discuss its potential implementation on hybrid quantum hardware. Our results establish a scalable, symmetry-aware framework for variational quantum simulations of collective light-matter systems and provide a pathway toward efficient simulations of more general spin-boson models on near-term quantum devices.