Bosonic field digitization for quantum computers

• URL: http://arxiv.org/abs/2108.10793v3
• Date: Sat, 30 Apr 2022 12:18:25 GMT
• Title: Bosonic field digitization for quantum computers
• Authors: Alexandru Macridin, Andy C. Y. Li, Stephen Mrenna, Panagiotis Spentzouris
• Abstract summary: We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
• Score: 62.997667081978825
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 to accurately predict error scaling as a function of the resolution and parameters of the model 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 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 wavefunction sampling and the finite representation size. Numerical simulations of small size $\Phi^4$ problems demonstrate that the boson mass optimizing the sampling of the ground state wavefunction is a good approximation to the optimal boson mass yielding the minimum low-energy subspace size. However, we find that accurate sampling of general wavefunctions does not necessarily result in accurate representation. We develop methods for validating and adjusting the discretization parameters to achieve more accurate simulations.

Related papers

• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Heisenberg-limited Bayesian phase estimation with low-depth digital quantum circuits [0.0]
  We develop and analyze a scheme that achieves near-optimal precision up to a constant overhead for Bayesian phase estimation. We show that the proposed scheme outperforms known schemes in the literature that utilize a similar set of initial states. We also propose an efficient phase unwinding protocol to extend the dynamic range of the proposed scheme.
  arXiv  Detail & Related papers  (2024-07-08T14:59:16Z)
• Quantum Semidefinite Programming with Thermal Pure Quantum States [0.5639904484784125]
  We show that a quantization'' of the matrix multiplicative-weight algorithm can provide approximate solutions to SDPs quadratically faster than the best classical algorithms. We propose a modification of this quantum algorithm and show that a similar speedup can be obtained by replacing the Gibbs-state sampler with the preparation of thermal pure quantum (TPQ) states.
  arXiv  Detail & Related papers  (2023-10-11T18:00:53Z)
• Message-Passing Neural Quantum States for the Homogeneous Electron Gas [41.94295877935867]
  We introduce a message-passing-neural-network-based wave function Ansatz to simulate extended, strongly interacting fermions in continuous space. We demonstrate its accuracy by simulating the ground state of the homogeneous electron gas in three spatial dimensions.
  arXiv  Detail & Related papers  (2023-05-12T04:12:04Z)
• Avoiding barren plateaus in the variational determination of geometric entanglement [0.0]
  We introduce a method capable of avoiding the barren plateau phenomenon in the variational determination of the geometric measure of entanglement for a large number of qubits. We analytically demonstrate that the local functions can be efficiently estimated and optimized. In particular, the method allows for escaping from barren plateaus induced by hardware noise or global functions defined on high-dimensional systems.
  arXiv  Detail & Related papers  (2023-04-26T08:58:50Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Provably accurate simulation of gauge theories and bosonic systems [2.406160895492247]
  We develop methods for bounding the rate of growth of local quantum numbers. For the Hubbard-Holstein model, we compute a bound on $Lambda$ that achieves accuracy $epsilon$. We also establish a criterion for truncating the Hamiltonian with a provable guarantee on the accuracy of time evolution.
  arXiv  Detail & Related papers  (2021-10-13T18:00:02Z)
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers [3.7747526957907303]
  We propose an alternative method to estimate the ground state energy of a Hamiltonian with Heisenberg-limited precision scaling. Our algorithm also produces an approximate cumulative distribution function of the spectral measure.
  arXiv  Detail & Related papers  (2021-02-22T20:21:56Z)

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.