arXiv:2610.29762
Encoding a bosonic mode into qubits for simulating boson-matter interactions
Maarten Stroeks, Jelena Mackeprang, Yaroslav Herasymenko, Barbara Terhal
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.
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