Faster Quantum Simulation Of Markovian Open Quantum Systems Via Randomisation

• URL: http://arxiv.org/abs/2408.11683v2
• Date: Sun, 20 Oct 2024 07:35:34 GMT
• Title: Faster Quantum Simulation Of Markovian Open Quantum Systems Via Randomisation
• Authors: I. J. David, I. Sinayskiy, F. Petruccione,
• Abstract summary: We introduce novel non-probabilistic algorithms for simulating Markovian open quantum systems using randomisation. Our methods maintain the physicality of the system's evolution but also enhance the scalability and precision of quantum simulations. This work is the first to apply randomisation techniques to the simulation of open quantum systems, highlighting their potential to enable faster and more accurate simulations.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: When simulating the dynamics of open quantum systems with quantum computers, it is essential to accurately approximate the system's behaviour while preserving the physicality of its evolution. Traditionally, for Markovian open quantum systems, this has been achieved using first and second-order Trotter-Suzuki product formulas or probabilistic algorithms. In this work, we introduce novel non-probabilistic algorithms for simulating Markovian open quantum systems using randomisation. Our methods, including first and second-order randomised Trotter-Suzuki formulas and the QDRIFT channel, not only maintain the physicality of the system's evolution but also enhance the scalability and precision of quantum simulations. We derive error bounds and step count limits for these techniques, bypassing the need for the mixing lemma typically employed in Hamiltonian simulation proofs. We also present two implementation approaches for these randomised algorithms: classical sampling and quantum forking, demonstrating their gate complexity advantages over deterministic Trotter-Suzuki product formulas. This work is the first to apply randomisation techniques to the simulation of open quantum systems, highlighting their potential to enable faster and more accurate simulations.

Related papers

• Trotterless Simulation of Open Quantum Systems for NISQ Quantum Devices [0.0]
  We propose a new simulation method based on the derivation of a Kraus operator series representation of the system. We identify a class of open quantum systems for which this method produces circuits of time-independent depth.
  arXiv  Detail & Related papers  (2024-10-04T18:37:49Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Adaptive variational simulation for open quantum systems [0.25602836891933073]
  We present an adaptive variational quantum algorithm for simulating open quantum system dynamics. Our results demonstrate that near-future quantum processors are capable of simulating open quantum systems.
  arXiv  Detail & Related papers  (2023-05-11T16:00:13Z)
• Digital Simulation of Single Qubit Markovian Open Quantum Systems: A Tutorial [0.0]
  We introduce the methods used in the simulation of single qubit Markovian open quantum systems. The only currently available algorithm for the digital simulation of single qubit open quantum systems is discussed in detail.
  arXiv  Detail & Related papers  (2023-02-06T17:37:11Z)
• Succinct Description and Efficient Simulation of Non-Markovian Open Quantum Systems [1.713291434132985]
  Non-Markovian open quantum systems represent the most general dynamics when the quantum system is coupled with a bath environment. We provide a succinct representation of the dynamics of non-Markovian open quantum systems with quantifiable error. We also develop an efficient quantum algorithm for simulating such dynamics.
  arXiv  Detail & Related papers  (2021-11-05T03:35:50Z)
• 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)
• Experimental Realization of Nonadiabatic Holonomic Single-Qubit Quantum Gates with Two Dark Paths in a Trapped Ion [41.36300605844117]
  We show nonadiabatic holonomic single-qubit quantum gates on two dark paths in a trapped $171mathrmYb+$ ion based on four-level systems with resonant drives. We find that nontrivial holonomic two-qubit quantum gates can also be realized within current experimental technologies.
  arXiv  Detail & Related papers  (2021-01-19T06:57:50Z)
• 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)

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.