Observable-Driven Speed-ups in Quantum Simulations
- URL: http://arxiv.org/abs/2407.14497v1
- Date: Fri, 19 Jul 2024 17:49:04 GMT
- Title: Observable-Driven Speed-ups in Quantum Simulations
- Authors: Wenjun Yu, Jue Xu, Qi Zhao,
- Abstract summary: We elucidate how observable knowledge can accelerate quantum simulations.
For short-time simulations, we deliberately design and tailor product formulas to achieve size-independent errors.
In arbitrary-time simulations, we reveal that Pauli-summation structured observables generally reduce average errors.
- Score: 11.882098830118638
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: As quantum technology advances, quantum simulation becomes increasingly promising, with significant implications for quantum many-body physics and quantum chemistry. Despite being one of the most accessible simulation methods, the product formula encounters challenges due to the pessimistic gate count estimation. In this work, we elucidate how observable knowledge can accelerate quantum simulations. By focusing on specific families of observables, we reduce product-formula simulation errors and gate counts in both short-time and arbitrary-time scenarios. For short-time simulations, we deliberately design and tailor product formulas to achieve size-independent errors for local and certain global observables. In arbitrary-time simulations, we reveal that Pauli-summation structured observables generally reduce average errors. Specifically, we obtain quadratic error reductions proportional to the number of summands for observables with evenly distributed Pauli coefficients. Our advanced error analyses, supported by numerical studies, indicate improved gate count estimation. We anticipate that the explored speed-ups can pave the way for efficiently realizing quantum simulations and demonstrating advantages on near-term quantum devices.
Related papers
- 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) - Stochastic error cancellation in analog quantum simulation [0.7204413136269974]
We consider an error model in which the actual Hamiltonian of the simulator differs from the target Hamiltonian.
We analyze the error accumulated in observables in this setting and show that, due to error cancellation, the error scales as the square root of the number of qubits instead of linearly.
arXiv Detail & Related papers (2023-11-24T19:25:08Z) - Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
We explore the applicability of quantum-data learning to practical problems in high-energy physics.
We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states.
The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
arXiv Detail & Related papers (2023-06-29T18:00:01Z) - Robust Extraction of Thermal Observables from State Sampling and
Real-Time Dynamics on Quantum Computers [49.1574468325115]
We introduce a technique that imposes constraints on the density of states, most notably its non-negativity, and show that this way, we can reliably extract Boltzmann weights from noisy time series.
Our work enables the implementation of the time-series algorithm on present-day quantum computers to study finite temperature properties of many-body quantum systems.
arXiv Detail & Related papers (2023-05-30T18:00:05Z) - 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) - 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) - Error Bounds for Variational Quantum Time Evolution [4.38301148531795]
Variational quantum time evolution allows us to simulate the time dynamics of quantum systems with near-term compatible quantum circuits.
Due to the variational nature of this method the accuracy of the simulation is a priori unknown.
We derive global phase error bounds for the state simulation accuracy with variational quantum time evolution.
arXiv Detail & Related papers (2021-07-30T18:00:25Z) - Stochastic Quantum Circuit Simulation Using Decision Diagrams [3.9006434061597877]
A substantial amount of quantum algorithms research still relies on simulating quantum circuits on classical hardware.
We propose to use decision diagrams, as well as concurrent executions, to substantially reduce resource-requirements.
Backed up by rigorous theory, empirical studies show that this approach allows for a substantially faster and much more scalable simulation for certain quantum circuits.
arXiv Detail & Related papers (2020-12-10T12:10:18Z) - Reinforcement Learning for Digital Quantum Simulation [0.0]
We introduce a reinforcement learning algorithm to build optimized quantum circuits for digital quantum simulation.
We consistently obtain quantum circuits that reproduce physical observables with as little as three entangling gates for long times and large system sizes.
arXiv Detail & Related papers (2020-06-29T18:00:11Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z)
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.