Entanglement accelerates quantum simulation
- URL: http://arxiv.org/abs/2406.02379v1
- Date: Tue, 4 Jun 2024 14:57:21 GMT
- Title: Entanglement accelerates quantum simulation
- Authors: Qi Zhao, You Zhou, Andrew M. Childs,
- Abstract summary: We show that product-formula approximations can perform better for entangled systems.
This shows that entanglement is not only an obstacle to classical simulation, but also a feature that can accelerate quantum algorithms.
- Score: 12.442922876322886
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum entanglement is an essential feature of many-body systems that impacts both quantum information processing and fundamental physics. The growth of entanglement is a major challenge for classical simulation methods. In this work, we investigate the relationship between quantum entanglement and quantum simulation, showing that product-formula approximations can perform better for entangled systems. We establish a tighter upper bound for algorithmic error in terms of entanglement entropy and develop an adaptive simulation algorithm incorporating measurement gadgets to estimate the algorithmic error. This shows that entanglement is not only an obstacle to classical simulation, but also a feature that can accelerate quantum algorithms.
Related papers
- An Efficient Classical Algorithm for Simulating Short Time 2D Quantum Dynamics [2.891413712995642]
We introduce an efficient classical algorithm for simulating short-time dynamics in 2D quantum systems.
Our results reveal the inherent simplicity in the complexity of short-time 2D quantum dynamics.
This work advances our understanding of the boundary between classical and quantum computation.
arXiv Detail & Related papers (2024-09-06T09:59:12Z) - Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Quantum Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation.
We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
arXiv Detail & Related papers (2024-04-10T14:27:07Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z) - Randomizing multi-product formulas for Hamiltonian simulation [2.2049183478692584]
We introduce a scheme for quantum simulation that unites the advantages of randomized compiling on the one hand and higher-order multi-product formulas on the other.
Our framework reduces the circuit depth by circumventing the need for oblivious amplitude amplification.
Our algorithms achieve a simulation error that shrinks exponentially with the circuit depth.
arXiv Detail & Related papers (2021-01-19T19:00:23Z) - Quantum Assisted Simulator [0.0]
We provide a novel hybrid quantum-classical algorithm for simulating the dynamics of quantum systems.
Unlike existing variational quantum simulation algorithms, our algorithm does not require any classical-quantum feedback loop.
arXiv Detail & Related papers (2020-11-12T13:52:44Z) - An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem.
The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
arXiv Detail & Related papers (2020-05-06T14:18:44Z) - Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular
Simulations on Quantum Computing Devices [0.0]
We introduce a quantum solver of contracted eigenvalue equations, the quantum analogue of classical methods for the energies.
We demonstrate the algorithm though computations on both a quantum simulator and two IBM quantum processing units.
arXiv Detail & Related papers (2020-04-23T18:35:26Z)
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.