First-Order Trotter Error from a Second-Order Perspective

• URL: http://arxiv.org/abs/2107.08032v1
• Date: Fri, 16 Jul 2021 17:53:44 GMT
• Title: First-Order Trotter Error from a Second-Order Perspective
• Authors: David Layden
• Abstract summary: Simulating quantum dynamics beyond the reach of classical computers is one of the main envisioned applications of quantum computers. The approximation error of these algorithms is often poorly understood, even in the most basic cases, which are particularly relevant for experiments. Recent studies have reported anomalously low approximation error with unexpected scaling in such cases, which they attribute to quantum interference between the errors from different steps of the algorithm. Our method generalizes state-of-the-art error bounds without the technical caveats of prior studies, and elucidates how each part of the total error arises from the underlying quantum circuit.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Simulating quantum dynamics beyond the reach of classical computers is one of the main envisioned applications of quantum computers. The most promising quantum algorithms to this end in the near-term are the simplest, which use the Trotter formula and its higher-order variants to approximate the dynamics of interest. The approximation error of these algorithms is often poorly understood, even in the most basic cases, which are particularly relevant for experiments. Recent studies have reported anomalously low approximation error with unexpected scaling in such cases, which they attribute to quantum interference between the errors from different steps of the algorithm. Here we provide a simpler picture of these effects by relating the Trotter formula to its second-order variant. Our method generalizes state-of-the-art error bounds without the technical caveats of prior studies, and elucidates how each part of the total error arises from the underlying quantum circuit. We compare our bound to the true error numerically, and find a close match over many orders of magnitude in the simulation parameters. Our findings reduce the required circuit depth for the most basic quantum simulation algorithms, and illustrate a useful method for bounding simulation error more broadly.

Related papers

• Error Interference in Quantum Simulation [10.119306277142051]
  We introduce a novel method that directly estimates the long-time algorithmic errors with multiple segments. We identify the sufficient and necessary condition for strict error interference and introduce the concept of approximate error interference. Our work demonstrates significant improvements over prior ones and opens new avenues for error analysis in quantum simulation.
  arXiv  Detail & Related papers  (2024-11-05T16:53:22Z)
• 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)
• Compilation of a simple chemistry application to quantum error correction primitives [44.99833362998488]
  We estimate the resources required to fault-tolerantly perform quantum phase estimation on a minimal chemical example. We find that implementing even a simple chemistry circuit requires 1,000 qubits and 2,300 quantum error correction rounds.
  arXiv  Detail & Related papers  (2023-07-06T18:00:10Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• On proving the robustness of algorithms for early fault-tolerant quantum computers [0.0]
  We introduce a randomized algorithm for the task of phase estimation and give an analysis of its performance under two simple noise models. We calculate that the randomized algorithm can succeed with arbitrarily high probability as long as the required circuit depth is less than 0.916 times the dephasing scale.
  arXiv  Detail & Related papers  (2022-09-22T21:28:12Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• 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)
• 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)
• Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehicles [0.0]
  We present a case study for two industrial NP-Hard problems drawn from the strongly developing field of smart-charging of electric vehicles. Quantum algorithms exhibit the same approximation ratios than conventional approximation algorithms, or improve them. The next step will be to confirm them on larger instances, on actual devices, and for more complex versions of the problems addressed.
  arXiv  Detail & Related papers  (2020-12-29T17:10:31Z)
• Multi-exponential Error Extrapolation and Combining Error Mitigation Techniques for NISQ Applications [0.0]
  Noise in quantum hardware remains the biggest roadblock for the implementation of quantum computers. Error extrapolation is an error mitigation technique that has been successfully implemented experimentally. We extend this to multi-exponential error extrapolation and provide more rigorous proof for its effectiveness under Pauli noise.
  arXiv  Detail & Related papers  (2020-07-02T17:18:47Z)
• Term Grouping and Travelling Salesperson for Digital Quantum Simulation [6.945601123742983]
  Digital simulation of quantum dynamics by evaluating the time evolution of a Hamiltonian is the initially proposed application of quantum computing. The large number of quantum gates required for emulating the complete second quantization form of the Hamiltonian makes such an approach unsuitable for near-term devices. We propose a new term ordering strategy, max-commute-tsp, that simultaneously mitigates both algorithmic and physical errors.
  arXiv  Detail & Related papers  (2020-01-16T18:33:24Z)

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.