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:2108.10793 · Physical Review A

Bosonic field digitization for quantum computers

Alexandru Macridin, Andy C. Y. Li, S. Mrenna, Panagiotis Spentzouris

Published May 4, 2022• 35 citations
arXivHTMLPDF

Abstract

Quantum simulation of quantum field theory is a flagship application of quantum computers that promises to deliver capabilities beyond classical computing. The realization of quantum advantage will require methods that can accurately predict error scaling as a function of the resolution and parameters of the model and that can be implemented efficiently on quantum hardware. In this paper, we address the representation of lattice bosonic fields in a discretized field amplitude basis, develop methods to predict error scaling, and present efficient qubit implementation strategies. A low-energy subspace of the bosonic Hilbert space, defined by a boson occupation number cutoff, can be represented with exponentially good accuracy by a low-energy subspace of a finite-size Hilbert space. The finite representation construction and the associated errors are directly related to the accuracy of the Nyquist-Shannon sampling and the finite Fourier transforms of the boson number states in the field and the conjugate-field bases. We analyze the relation between the boson mass, the discretization parameters used for wave function sampling, and the finite representation size. Numerical simulations of small size ${\mathrm{\ensuremath{\Phi}}}^{4}$ problems demonstrate that the boson mass optimizing the sampling of the ground state wave function is a good approximation to the optimal boson mass yielding the minimum low-energy subspace size. However, we find that accurate sampling of general wave functions does not necessarily result in accurate representation. We develop methods for validating and adjusting the discretization parameters to achieve more accurate simulations.

DOI
10.1103/physreva.105.052405

Related papers

Digital quantum computation of fermion-boson interacting systems

Alexandru Macridin, Panagiotis Spentzouris, James Frederick Amundson +1 more

We introduce a method for representing the low-energy subspace of a bosonic field theory on the qubit space of digital quantum computers. This discretization leads to an exponentially precise description of the subspace of the continuous theory thanks to the Nyquist-Shannon sampling theorem. The method makes the implementation of quantum algorithms for purely bosonic systems as well as fermion-boson interacting systems feasible. We present algorithmic circuits for computing the time evolution of these systems. The complexity of the algorithms scales polynomially with the system size. The algorithm is a natural extension of the existing quantum algorithms for simulating fermion systems in quantum chemistry and condensed-matter physics to systems involving bosons and fermion-boson interactions and has a broad variety of potential applications in particle physics, condensed matter, etc. Due to the relatively small amount of additional resources required by the inclusion of bosons in our algorithm, the simulation of electron-phonon and similar systems can be placed in the same near-future reach as the simulation of interacting electron systems. We benchmark our algorithm by implementing it for a two-site Holstein polaron problem on an Atos Quantum Learning Machine quantum simulator. The polaron quantum simulations are in excellent agreement with the results obtained by exact diagonalization.

arXiv:1805.09928•Physical Review A•Oct 9, 2018•115 citations

Digitization of scalar fields for quantum computing

Natalie Klco, Martin J. Savage A

Qubit, operator, and gate resources required for the digitization of lattice $\ensuremath{\lambda}{\ensuremath{\phi}}^{4}$ scalar field theories onto quantum computers are considered, building upon the foundational work by Jordan et al. [Quantum Inf. Comput. 14, 1014 (2014); Science 336, 1130 (2012)], with a focus towards noisy intermediate-scale quantum devices. The Nyquist-Shannon sampling theorem, introduced in this context by Macridin et al. [Phys. Rev. A 98, 042312 (2018)] building on the work of Somma [Quantum Inf. Comput. 16, 1125 (2016)], provides a guide with which to evaluate the efficacy of two field-space bases, the eigenstates of the field operator, as used by Jordan et al., and eigenstates of a harmonic oscillator, to describe ($0+1$)- and ($d+1$)-dimensional scalar field theory. We show how techniques associated with improved actions, which are heavily utilized in lattice QCD calculations to systematically reduce lattice-spacing artifacts, can be used to reduce the impact of the field digitization in $\ensuremath{\lambda}{\ensuremath{\phi}}^{4}$, but are found to be inferior to a complete digitization improvement of the Hamiltonian using a quantum Fourier transform. When the Nyquist-Shannon sampling theorem is satisfied, digitization errors scale as $|log|log|{\ensuremath{\epsilon}}_{\mathrm{dig}}|||\ensuremath{\sim}{n}_{Q}$ (number of qubits describing the field at a given spatial site) for the low-lying states, leaving the familiar power-law lattice-spacing and finite-volume effects that scale as $|log|{\ensuremath{\epsilon}}_{\mathrm{latt}}||\ensuremath{\sim}{N}_{Q}$ (total number of qubits in the simulation). For localized (delocalized) field-space wave functions, it is found that ${n}_{Q}\ensuremath{\sim}4(7)$ qubits per spatial lattice site are sufficient to reduce theoretical digitization errors below error contributions associated with approximation of the time-evolution operator and noisy implementation on near-term quantum devices. Only classical computing resources have been used to obtain the results presented in this work.

arXiv:1808.10378•Physical Review A•May 23, 2019•208 citations

Estimating truncation effects of quantum bosonic systems using sampling algorithms

Masanori Hanada, Junyu Liu, Enrico Rinaldi +1 more

Abstract To simulate bosons on a qubit- or qudit-based quantum computer, one has to regularize the theory by truncating infinite-dimensional local Hilbert spaces to finite dimensions. In the search for practical quantum applications, it is important to know how big the truncation errors can be. In general, it is not easy to estimate errors unless we have a good quantum computer. In this paper, we show that traditional sampling methods on classical devices, specifically Markov Chain Monte Carlo, can address this issue for a rather generic class of bosonic systems with a reasonable amount of computational resources available today. As a demonstration, we apply this idea to the scalar field theory on a two-dimensional lattice, with a size that goes beyond what is achievable using exact diagonalization methods. This method can be used to estimate the resources needed for realistic quantum simulations of bosonic theories, and also, to check the validity of the results of the corresponding quantum simulations.

arXiv:2212.08546•Machine Learning Science and Technology•Oct 13, 2023•15 citations

Provably accurate simulation of gauge theories and bosonic systems

Yu Tong, Victor V. Albert, Jarrod R. McClean +2 more

Quantum many-body systems involving bosonic modes or gauge fields have infinite-dimensional local Hilbert spaces which must be truncated to perform simulations of real-time dynamics on classical or quantum computers. To analyze the truncation error, we develop methods for bounding the rate of growth of local quantum numbers such as the occupation number of a mode at a lattice site, or the electric field at a lattice link. Our approach applies to various models of bosons interacting with spins or fermions, and also to both abelian and non-abelian gauge theories. We show that if states in these models are truncated by imposing an upper limit Λ on each local quantum number, and if the initial state has low local quantum numbers, then an error at most ϵ can be achieved by choosing Λ to scale polylogarithmically with ϵ−1 , an exponential improvement over previous bounds based on energy conservation. For the Hubbard-Holstein model, we numerically compute a bound on Λ that achieves accuracy ϵ , obtaining significantly improved estimates in various parameter regimes. We also establish a criterion for truncating the Hamiltonian with a provable guarantee on the accuracy of time evolution. Building on that result, we formulate quantum algorithms for dynamical simulation of lattice gauge theories and of models with bosonic modes; the gate complexity depends almost linearly on spacetime volume in the former case, and almost quadratically on time in the latter case. We establish a lower bound showing that there are systems involving bosons for which this quadratic scaling with time cannot be improved. By applying our result on the truncation error in time evolution, we also prove that spectrally isolated energy eigenstates can be approximated with accuracy ϵ by truncating local quantum numbers at Λ=polylog(ϵ−1) .

arXiv:2110.06942•Quantum•Sep 22, 2022•106 citations

Towards Precision Quantum Simulation of Lattice Gauge Theories

Siddharth Hariprakash

Quantum simulation of lattice gauge theories offers a path to first-principles calculations of real-time dynamics and finite-density phenomena that are inaccessible to classical Euclidean Monte Carlo methods. Realizing this potential requires a pipeline of controlled approximations---lattice discretization, truncation, digitization, state preparation, time evolution, measurement, and continuum extrapolation---each contributing errors and computational costs. General algorithmic asymptotic complexity arguments capture only part of the cost picture: the practical resources required for end-to-end simulation depend on numerical pre-factors, the cost of the subroutines that various algorithms call, and structural features of the lattice theory, all of which the asymptotic scaling leaves unspecified. This thesis develops contributions that aim to make such dependencies explicit and quantitative. We begin with a rigorous analysis of the asymptotic gate complexity of product formulas and Quantum Signal Processing (QSP) for the time evolution of general classes of lattice Hamiltonians, identifying the parameter regimes in which each method is favorable and estimating the associated pre-factors numerically. Since the cost of QSP-based simulation is dominated (in regimes of practical interest) by the block-encoding subroutine it calls, we also develop several novel block-encoding constructions tailored to bosonic lattice field theories and show that signal-processing techniques can be repurposed as highly efficient block-encoding subroutines. We then turn to the problem of truncating the Kogut--Susskind electric-field Hilbert space. Existing error bounds rely on energy-conservation arguments and require the truncation to grow with simulation time. By exploiting Hilbert space fragmentation we derive the tightest error bounds known to date: they decay factorially in the truncation parameter and are independent of simulation time. We validate them numerically for U(1) pure gauge theory and the Schwinger model. Finally, we address the continuum limit in the presence of approximate time evolution. For product formulas, we show that Trotter errors correspond to irrelevant operators that vanish in the continuum limit, which yields a renormalization trajectory independent of the Trotter step size. More generally, we introduce the Statistically-Bounded Time Evolution (SBTE) protocol, an algorithm-independent framework that treats approximation errors as a systematic uncertainty to be driven below the working statistical precision. This decouples the continuum-limit prescription from the choice of time-evolution algorithm and provides a basis for end-to-end cost comparisons across simulation methods.

•May 1, 2026•0 citations

Digital Quantum Simulation of the Holstein-Primakoff Transformation on Noisy Qubits

Kelvin Yip, Alessandro Monteros, Sahel Ashhab +1 more

Quantum simulation of many-body systems offers a powerful approach to exploring collective quantum dynamics beyond classical computational reach. Although spin and fermionic models have been extensively simulated on digital quantum computers, the simulation of bosonic systems on programmable quantum processors is often hindered by the intrinsically large Hilbert space of bosonic modes. In this work, we study the digital quantum simulation of bosonic modes using the Holstein-Primakoff (HP) transformation and implement this protocol on a cloud-based superconducting quantum processor. Two representative models are realized on quantum hardware: (i) the driven harmonic oscillator and (ii) the Jaynes-Cummings model. Using data obtained from the quantum simulations, we systematically examine the interplay between algorithmic and hardware-induced errors to identify optimal simulation parameters. The dominant algorithmic errors arise from the finite number of qubits used in the HP mapping and the finite number of Trotter steps in the time evolution, while hardware errors mainly originate from gate infidelity, decoherence, and readout errors. This study advances the digital quantum simulation of many-body systems involving bosonic degrees of freedom on currently available cloud quantum processors and provides a framework that can be extended to more complex spin-boson and multimode cavity models.

quant-pharXiv:2602.17806•Physical Review A•Feb 23, 2026•1 citation
Quantum simulation of quantum field theory is a flagship application of quantum computers that promises to deliver capabilities beyond classical computing. The realization of quantum advantage will require methods that can accurately predict error scaling as a function of the resolution and parameters of the model and that can be implemented efficiently on quantum hardware. In this paper, we address the representation of lattice bosonic fields in a discretized field amplitude basis, develop methods to predict error scaling, and present efficient qubit implementation strategies. A low-energy subspace of the bosonic Hilbert space, defined by a boson occupation number cutoff, can be represented with exponentially good accuracy by a low-energy subspace of a finite-size Hilbert space. The finite representation construction and the associated errors are directly related to the accuracy of the Nyquist-Shannon sampling and the finite Fourier transforms of the boson number states in the field and the conjugate-field bases. We analyze the relation between the boson mass, the discretization parameters used for wave function sampling, and the finite representation size. Numerical simulations of small size \ensuremathΦ4{\mathrm{\ensuremath{\Phi}}}^{4}\ensuremathΦ4 problems demonstrate that the boson mass optimizing the sampling of the ground state wave function is a good approximation to the optimal boson mass yielding the minimum low-energy subspace size. However, we find that accurate sampling of general wave functions does not necessarily result in accurate representation. We develop methods for validating and adjusting the discretization parameters to achieve more accurate simulations.
We introduce a method for representing the low-energy subspace of a bosonic field theory on the qubit space of digital quantum computers. This discretization leads to an exponentially precise description of the subspace of the continuous theory thanks to the Nyquist-Shannon sampling theorem. The method makes the implementation of quantum algorithms for purely bosonic systems as well as fermion-boson interacting systems feasible. We present algorithmic circuits for computing the time evolution of these systems. The complexity of the algorithms scales polynomially with the system size. The algorithm is a natural extension of the existing quantum algorithms for simulating fermion systems in quantum chemistry and condensed-matter physics to systems involving bosons and fermion-boson interactions and has a broad variety of potential applications in particle physics, condensed matter, etc. Due to the relatively small amount of additional resources required by the inclusion of bosons in our algorithm, the simulation of electron-phonon and similar systems can be placed in the same near-future reach as the simulation of interacting electron systems. We benchmark our algorithm by implementing it for a two-site Holstein polaron problem on an Atos Quantum Learning Machine quantum simulator. The polaron quantum simulations are in excellent agreement with the results obtained by exact diagonalization.
Qubit, operator, and gate resources required for the digitization of lattice $\ensuremath{\lambda}{\ensuremath{\phi}}^{4}$ scalar field theories onto quantum computers are considered, building upon the foundational work by Jordan et al. [Quantum Inf. Comput. 14, 1014 (2014); Science 336, 1130 (2012)], with a focus towards noisy intermediate-scale quantum devices. The Nyquist-Shannon sampling theorem, introduced in this context by Macridin et al. [Phys. Rev. A 98, 042312 (2018)] building on the work of Somma [Quantum Inf. Comput. 16, 1125 (2016)], provides a guide with which to evaluate the efficacy of two field-space bases, the eigenstates of the field operator, as used by Jordan et al., and eigenstates of a harmonic oscillator, to describe (0+10+10+1)- and (d+1d+1d+1)-dimensional scalar field theory. We show how techniques associated with improved actions, which are heavily utilized in lattice QCD calculations to systematically reduce lattice-spacing artifacts, can be used to reduce the impact of the field digitization in $\ensuremath{\lambda}{\ensuremath{\phi}}^{4}$, but are found to be inferior to a complete digitization improvement of the Hamiltonian using a quantum Fourier transform. When the Nyquist-Shannon sampling theorem is satisfied, digitization errors scale as $|log|log|{\ensuremath{\epsilon}}_{\mathrm{dig}}|||\ensuremath{\sim}{n}_{Q}$ (number of qubits describing the field at a given spatial site) for the low-lying states, leaving the familiar power-law lattice-spacing and finite-volume effects that scale as $|log|{\ensuremath{\epsilon}}_{\mathrm{latt}}||\ensuremath{\sim}{N}_{Q}$ (total number of qubits in the simulation). For localized (delocalized) field-space wave functions, it is found that ${n}_{Q}\ensuremath{\sim}4(7)$ qubits per spatial lattice site are sufficient to reduce theoretical digitization errors below error contributions associated with approximation of the time-evolution operator and noisy implementation on near-term quantum devices. Only classical computing resources have been used to obtain the results presented in this work.
Abstract To simulate bosons on a qubit- or qudit-based quantum computer, one has to regularize the theory by truncating infinite-dimensional local Hilbert spaces to finite dimensions. In the search for practical quantum applications, it is important to know how big the truncation errors can be. In general, it is not easy to estimate errors unless we have a good quantum computer. In this paper, we show that traditional sampling methods on classical devices, specifically Markov Chain Monte Carlo, can address this issue for a rather generic class of bosonic systems with a reasonable amount of computational resources available today. As a demonstration, we apply this idea to the scalar field theory on a two-dimensional lattice, with a size that goes beyond what is achievable using exact diagonalization methods. This method can be used to estimate the resources needed for realistic quantum simulations of bosonic theories, and also, to check the validity of the results of the corresponding quantum simulations.
Quantum many-body systems involving bosonic modes or gauge fields have infinite-dimensional local Hilbert spaces which must be truncated to perform simulations of real-time dynamics on classical or quantum computers. To analyze the truncation error, we develop methods for bounding the rate of growth of local quantum numbers such as the occupation number of a mode at a lattice site, or the electric field at a lattice link. Our approach applies to various models of bosons interacting with spins or fermions, and also to both abelian and non-abelian gauge theories. We show that if states in these models are truncated by imposing an upper limit Λ on each local quantum number, and if the initial state has low local quantum numbers, then an error at most ϵ can be achieved by choosing Λ to scale polylogarithmically with ϵ−1 , an exponential improvement over previous bounds based on energy conservation. For the Hubbard-Holstein model, we numerically compute a bound on Λ that achieves accuracy ϵ , obtaining significantly improved estimates in various parameter regimes. We also establish a criterion for truncating the Hamiltonian with a provable guarantee on the accuracy of time evolution. Building on that result, we formulate quantum algorithms for dynamical simulation of lattice gauge theories and of models with bosonic modes; the gate complexity depends almost linearly on spacetime volume in the former case, and almost quadratically on time in the latter case. We establish a lower bound showing that there are systems involving bosons for which this quadratic scaling with time cannot be improved. By applying our result on the truncation error in time evolution, we also prove that spectrally isolated energy eigenstates can be approximated with accuracy ϵ by truncating local quantum numbers at Λ=polylog(ϵ−1) .
Quantum simulation of lattice gauge theories offers a path to first-principles calculations of real-time dynamics and finite-density phenomena that are inaccessible to classical Euclidean Monte Carlo methods. Realizing this potential requires a pipeline of controlled approximations---lattice discretization, truncation, digitization, state preparation, time evolution, measurement, and continuum extrapolation---each contributing errors and computational costs. General algorithmic asymptotic complexity arguments capture only part of the cost picture: the practical resources required for end-to-end simulation depend on numerical pre-factors, the cost of the subroutines that various algorithms call, and structural features of the lattice theory, all of which the asymptotic scaling leaves unspecified. This thesis develops contributions that aim to make such dependencies explicit and quantitative. We begin with a rigorous analysis of the asymptotic gate complexity of product formulas and Quantum Signal Processing (QSP) for the time evolution of general classes of lattice Hamiltonians, identifying the parameter regimes in which each method is favorable and estimating the associated pre-factors numerically. Since the cost of QSP-based simulation is dominated (in regimes of practical interest) by the block-encoding subroutine it calls, we also develop several novel block-encoding constructions tailored to bosonic lattice field theories and show that signal-processing techniques can be repurposed as highly efficient block-encoding subroutines. We then turn to the problem of truncating the Kogut--Susskind electric-field Hilbert space. Existing error bounds rely on energy-conservation arguments and require the truncation to grow with simulation time. By exploiting Hilbert space fragmentation we derive the tightest error bounds known to date: they decay factorially in the truncation parameter and are independent of simulation time. We validate them numerically for U(1) pure gauge theory and the Schwinger model. Finally, we address the continuum limit in the presence of approximate time evolution. For product formulas, we show that Trotter errors correspond to irrelevant operators that vanish in the continuum limit, which yields a renormalization trajectory independent of the Trotter step size. More generally, we introduce the Statistically-Bounded Time Evolution (SBTE) protocol, an algorithm-independent framework that treats approximation errors as a systematic uncertainty to be driven below the working statistical precision. This decouples the continuum-limit prescription from the choice of time-evolution algorithm and provides a basis for end-to-end cost comparisons across simulation methods.
Quantum simulation of many-body systems offers a powerful approach to exploring collective quantum dynamics beyond classical computational reach. Although spin and fermionic models have been extensively simulated on digital quantum computers, the simulation of bosonic systems on programmable quantum processors is often hindered by the intrinsically large Hilbert space of bosonic modes. In this work, we study the digital quantum simulation of bosonic modes using the Holstein-Primakoff (HP) transformation and implement this protocol on a cloud-based superconducting quantum processor. Two representative models are realized on quantum hardware: (i) the driven harmonic oscillator and (ii) the Jaynes-Cummings model. Using data obtained from the quantum simulations, we systematically examine the interplay between algorithmic and hardware-induced errors to identify optimal simulation parameters. The dominant algorithmic errors arise from the finite number of qubits used in the HP mapping and the finite number of Trotter steps in the time evolution, while hardware errors mainly originate from gate infidelity, decoherence, and readout errors. This study advances the digital quantum simulation of many-body systems involving bosonic degrees of freedom on currently available cloud quantum processors and provides a framework that can be extended to more complex spin-boson and multimode cavity models.