Optimal-order Trotter-Suzuki decomposition for quantum simulation on noisy quantum computers

• URL: http://arxiv.org/abs/2405.01131v2
• Date: Sat, 7 Sep 2024 15:32:01 GMT
• Title: Optimal-order Trotter-Suzuki decomposition for quantum simulation on noisy quantum computers
• Authors: A. A. Avtandilyan, W. V. Pogosov,
• Abstract summary: We show that when the gate error is decreased by approximately an order of magnitude relative to typical modern values, higher-order Trotterization becomes advantageous. This form of Trotterization yields a global minimum of the overall simulation error.
• Score: 0.05343200742664294
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The potential of employing higher orders of the Trotter-Suzuki decomposition of the evolution operator for more effective simulations of quantum systems on a noisy quantum computer is explored. By examining the transverse-field Ising model and the XY model, it is demonstrated that when the gate error is decreased by approximately an order of magnitude relative to typical modern values, higher-order Trotterization becomes advantageous. This form of Trotterization yields a global minimum of the overall simulation error, comprising both the mathematical error of Trotterization and the physical error arising from gate execution.

Related papers

• Trotter Errors and the Emergence of Chaos in Quantum Simulation [0.0]
  We run quantum simulations on a small, highly accurate quantum processor. We show how one can optimize simulation accuracy by balancing algorithmic (Trotter) errors against native errors specific to the quantum hardware at hand.
  arXiv  Detail & Related papers  (2022-12-07T18:39:33Z)
• Trapped-Ion Quantum Simulation of Collective Neutrino Oscillations [55.41644538483948]
  We study strategies to simulate the coherent collective oscillations of a system of N neutrinos in the two-flavor approximation using quantum computation. We find that the gate complexity using second order Trotter- Suzuki formulae scales better with system size than with other decomposition methods such as Quantum Signal Processing.
  arXiv  Detail & Related papers  (2022-07-07T09:39:40Z)
• Improved Quantum Computing with the Higher-order Trotter Decomposition [9.713857446596721]
  We use Trotter decompositions to reduce the propagator into a combination of single-qubit operations and fixed-time system evolutions. We show that the higher-order Trotter decompositions can provide efficient Ans"atze for the variational quantum algorithm.
  arXiv  Detail & Related papers  (2022-05-05T09:01:14Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Analytical and experimental study of center line miscalibrations in M\o lmer-S\o rensen gates [51.93099889384597]
  We study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate. We compute the gate evolution operator which allows us to obtain relevant key properties. We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2021-12-10T10:56:16Z)
• Trotter errors from dynamical structural instabilities of Floquet maps in quantum simulation [0.0]
  We study the behavior of errors in the quantum simulation of spin systems with long-range multi-body interactions. We identify a regime where the Floquet operator underlying the Trotter decomposition undergoes sharp changes even for small variations in the simulation step size.
  arXiv  Detail & Related papers  (2021-10-07T15:41:20Z)
• First-Order Trotter Error from a Second-Order Perspective [0.0]
  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.
  arXiv  Detail & Related papers  (2021-07-16T17:53:44Z)
• 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)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)
• 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.