Stochastic Quantum Circuit Simulation Using Decision Diagrams

• URL: http://arxiv.org/abs/2012.05620v1
• Date: Thu, 10 Dec 2020 12:10:18 GMT
• Title: Stochastic Quantum Circuit Simulation Using Decision Diagrams
• Authors: Thomas Grurl, Richard Kueng, J\"urgen Fu{\ss}, Robert Wille
• Abstract summary: 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.
• Score: 3.9006434061597877
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent years have seen unprecedented advance in the design and control of quantum computers. Nonetheless, their applicability is still restricted and access remains expensive. Therefore, a substantial amount of quantum algorithms research still relies on simulating quantum circuits on classical hardware. However, due to the sheer complexity of simulating real quantum computers, many simulators unrealistically simplify the problem and instead simulate perfect quantum hardware, i.e., they do not consider errors caused by the fragile nature of quantum systems. Stochastic quantum simulation provides a conceptually suitable solution to this problem: physically motivated errors are applied in a probabilistic fashion throughout the simulation. In this work, we propose to use decision diagrams, as well as concurrent executions, to substantially reduce resource-requirements-which are still daunting-for stochastic quantum circuit simulation. 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.

Related papers

• 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)
• Programmable quantum simulations on a trapped-ions quantum computer with a global drive [0.0]
  We experimentally demonstrate a method for quantum simulations on a small-scale trapped ions-based quantum computer. We measure the evolution of a quantum Ising ring and accurately reconstruct the Hamiltonian parameters, showcasing an accurate and high-fidelity simulation.
  arXiv  Detail & Related papers  (2023-08-30T13:49:05Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• 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)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• 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)
• Considering Decoherence Errors in the Simulation of Quantum Circuits Using Decision Diagrams [2.450250748409888]
  We investigate how the consideration of decoherence errors affects the simulation performance of approaches based on decision diagrams. Experiments confirm that this yields improvements of several orders of magnitudes compared to a naive consideration of errors.
  arXiv  Detail & Related papers  (2020-12-10T12:29:24Z)
• 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)
• Just Like the Real Thing: Fast Weak Simulation of Quantum Computation [3.871968228840823]
  We focus on weak simulation that aims to produce outputs which are statistically indistinguishable from those of error-free quantum computers. We develop algorithms for weak simulation based on quantum state representation in terms of decision diagrams. Empirical validation shows, for the first time, that this enables mimicking of physical quantum computers of significant scale.
  arXiv  Detail & Related papers  (2020-07-30T08:00:06Z)

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.