Exponential improvement in quantum simulations of bosons

• URL: http://arxiv.org/abs/2505.02553v2
• Date: Wed, 14 May 2025 16:49:42 GMT
• Title: Exponential improvement in quantum simulations of bosons
• Authors: Masanori Hanada, Shunji Matsuura, Emanuele Mendicelli, Enrico Rinaldi,
• Abstract summary: Hamiltonian quantum simulation of bosons on digital quantum computers requires truncating the Hilbert space to finite dimensions.<n>For lattice quantum field theories such as Yang-Mills theory and QCD, several Hamiltonian formulations and corresponding truncations have been put forward in recent years.<n>We show that the universal framework, advocated by three of the authors, provides a natural avenue to solve the exponential scaling of circuit complexity with $Q$.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hamiltonian quantum simulation of bosons on digital quantum computers requires truncating the Hilbert space to finite dimensions. The method of truncation and the choice of basis states can significantly impact the complexity of the quantum circuit required to simulate the system. For example, a truncation in the Fock basis where each boson is encoded with a register of $Q$ qubits, can result in an exponentially large number of Pauli strings required to decompose the truncated Hamiltonian. This, in turn, can lead to an exponential increase in $Q$ in the complexity of the quantum circuit. For lattice quantum field theories such as Yang-Mills theory and QCD, several Hamiltonian formulations and corresponding truncations have been put forward in recent years. There is no exponential increase in $Q$ when resorting to the orbifold lattice Hamiltonian, while we do not know how to remove the exponential complexity in $Q$ in the commonly used Kogut-Susskind Hamiltonian. Specifically, when using the orbifold lattice Hamiltonian, the continuum limit, or, in other words, the removal of the ultraviolet energy cutoff, is obtained with circuits whose resources scale like $Q$, while they scale like $\mathcal{O}(\exp(Q))$ for the Kogut-Susskind Hamiltonian: this can be seen as an exponential speed up in approaching the physical continuum limit for the orbifold lattice Hamiltonian formulation. We show that the universal framework, advocated by three of the authors (M.~H., S.~M., and E.~R.) and collaborators provides a natural avenue to solve the exponential scaling of circuit complexity with $Q$, and it is the reason why using the orbifold lattice Hamiltonian is advantageous. We also point out that Hamiltonian formulations based on a gauge-invariant Hilbert space require an exponential increase in the resource requirement with respect to using an extended Hilbert space.

Related papers

• Universal framework with exponential speedup for the quantum simulation of quantum field theories including QCD [0.0]
  We present a quantum simulation framework universally applicable to a wide class of quantum systems.<n>Specifically, we generalize an efficient quantum simulation protocol developed for bosonic theories.<n>Our protocols do not assume oracles, but rather present explicit constructions with rigorous resource estimations.
  arXiv  Detail & Related papers  (2025-06-23T18:00:00Z)
• Accelerating Fermionic System Simulation on Quantum Computers [1.655267861296594]
  A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems.<n>We introduce a grouping strategy that partitions Hamiltonian terms into $mathcalO(N4)$ groups.<n>We propose a parallel Hamiltonian evolution scheme that reduces the circuit depth of Hamiltonian evolution by a factor of $N$.
  arXiv  Detail & Related papers  (2025-05-13T03:44:07Z)
• Quantum particle in the wrong box (or: the perils of finite-dimensional approximations) [1.4260624980098286]
  We show that the solutions of the Schr"odinger equations generated by truncated Hamiltonians do not converge to the solution of the Schr"odinger equation corresponding to the actual Hamiltonian.<n> Importantly, numerical simulations will unavoidably reproduce the wrong dynamics in the limit, and yet there is no numerical test that can reveal this failure.
  arXiv  Detail & Related papers  (2024-12-20T13:39:06Z)
• Fault-tolerant fermionic quantum computing [39.58317527488534]
  We introduce fermionic fault-tolerant quantum computing, a framework which removes this overhead altogether.<n>We show how our framework can be implemented in neutral atoms, overcoming the apparent inability of neutral atoms to implement non-number-conserving gates.
  arXiv  Detail & Related papers  (2024-11-13T19:00:02Z)
• Simulating Quantum Many-Body States with Neural-Network Exponential Ansatz [0.0]
  We develop a surrogate neural network solver that generates the exponential ansatz parameters using the Hamiltonian parameters as inputs. We illustrate the effectiveness of this approach by training neural networks of several quantum many-body systems.
  arXiv  Detail & Related papers  (2024-11-12T15:48:23Z)
• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma.<n>This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles.<n>We show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• Hybrid Oscillator-Qubit Quantum Processors: Simulating Fermions, Bosons, and Gauge Fields [31.51988323782987]
  We develop a hybrid oscillator-qubit processor framework for quantum simulation of strongly correlated fermions and bosons. This framework gives exact decompositions of particle interactions as well as approximate methods based on the Baker-Campbell Hausdorff formulas. While our work focusses on an implementation in superconducting hardware, our framework can also be used in trapped ion, and neutral atom hardware.
  arXiv  Detail & Related papers  (2024-09-05T17:58:20Z)
• Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
  We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer. Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model. We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
  arXiv  Detail & Related papers  (2024-05-14T15:28:37Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• On the complexity of implementing Trotter steps [2.1369834525800138]
  We develop methods to perform faster Trotter steps with complexity sublinear in number of terms. We also realize faster Trotter steps when certain blocks of Hamiltonian coefficients have low rank. Our result suggests the use of Hamiltonian structural properties as both necessary and sufficient to implement Trotter synthesis steps with lower gate complexity.
  arXiv  Detail & Related papers  (2022-11-16T19:00:01Z)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)
• On quantum algorithms for the Schr\"odinger equation in the semi-classical regime [27.175719898694073]
  We consider Schr"odinger's equation in the semi-classical regime. Such a Schr"odinger equation finds many applications, including in Born-Oppenheimer molecular dynamics and Ehrenfest dynamics.
  arXiv  Detail & Related papers  (2021-12-25T20:01:54Z)
• 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.