The limits of quantum circuit simulation with low precision arithmetic

• URL: http://arxiv.org/abs/2005.13392v2
• Date: Mon, 27 Jul 2020 01:40:21 GMT
• Title: The limits of quantum circuit simulation with low precision arithmetic
• Authors: Santiago I. Betelu
• Abstract summary: The goal is to estimate how much memory can be saved in simulations that involve random, maximally entangled quantum states. An arithmetic polar representation of $B$ bits is defined for each quantum amplitude. A model is developed to quantify the cumulative errors on a circuit of $Q$ qubits and $G$ gates.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This is an investigation of the limits of quantum circuit simulation with Schrodinger's formulation and low precision arithmetic. The goal is to estimate how much memory can be saved in simulations that involve random, maximally entangled quantum states. An arithmetic polar representation of $B$ bits is defined for each quantum amplitude and a normalization procedure is developed to minimize rounding errors. Then a model is developed to quantify the cumulative errors on a circuit of $Q$ qubits and $G$ gates. Depending on which regime the circuit operates, the model yields explicit expressions for the maximum number of effective gates that can be simulated before rounding errors dominate the computation. The results are illustrated with random circuits and the quantum Fourier transform.

Related papers

• 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)
• Incoherent Approximation of Leakage in Quantum Error Correction [0.03922370499388702]
  Quantum error correcting codes typically do not account for quantum state transitions - leakage - out of the computational subspace. We introduce a Random Phase Approximation (RPA) on quantum channels that preserves the incoherence between the computational and leakage subspaces. We show that RPA yields accurate error correction statistics in the repetition and surface codes with physical error parameters.
  arXiv  Detail & Related papers  (2023-12-16T00:52:23Z)
• Classical variational optimization of PREPARE circuit for quantum phase estimation of quantum chemistry Hamiltonians [0.8009842832476994]
  We propose a method for constructing $textttPREPARE$ circuits for quantum phase estimation of a molecular Hamiltonian in quantum chemistry. The $textttPREPARE$ circuit generates a quantum state which encodes the coefficients of the terms in the Hamiltonian as probability amplitudes.
  arXiv  Detail & Related papers  (2023-08-26T05:32:38Z)
• 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)
• Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications [10.436969366019015]
  We show that any $Theta(n)$-depth circuit can be prepared with a $Theta(log(nd)) with $O(ndlog d)$ ancillary qubits. We discuss applications of the results in different quantum computing tasks, such as Hamiltonian simulation, solving linear systems of equations, and realizing quantum random access memories.
  arXiv  Detail & Related papers  (2022-01-27T13:16:30Z)
• 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)
• Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code [42.394110572265376]
  We demonstrate quantum error correction using the surface code, which is known for its exceptionally high tolerance to errors. In an error correction cycle taking only $1.1,mu$s, we demonstrate the preservation of four cardinal states of the logical qubit.
  arXiv  Detail & Related papers  (2021-12-07T13:58:44Z)
• Error-resilient Monte Carlo quantum simulation of imaginary time [5.625946422295428]
  We propose an algorithm for simulating the imaginary-time evolution and solving the ground-state problem. Compared with quantum phase estimation, the Trotter step number can be thousands of times smaller. Results show that Monte Carlo quantum simulation is promising even without a fully fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2021-09-16T08:51:24Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  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.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Low-depth Hamiltonian Simulation by Adaptive Product Formula [3.050399782773013]
  Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. Here, we propose an adaptive approach to construct a low-depth time evolution circuit. Our work sheds light on practical Hamiltonian simulation with noisy-intermediate-scale-quantum devices.
  arXiv  Detail & Related papers  (2020-11-10T18:00:42Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.