Hybrid Schr\"odinger-Feynman Simulation of Quantum Circuits With Decision Diagrams

• URL: http://arxiv.org/abs/2105.07045v1
• Date: Fri, 14 May 2021 19:38:56 GMT
• Title: Hybrid Schr\"odinger-Feynman Simulation of Quantum Circuits With Decision Diagrams
• Abstract summary: We show that a hybrid Schr"odinger-Feynman scheme for the simulation is possible. We discuss the resulting problems in its realization, and propose solutions. This significantly advances the state of the art in decision diagram-based simulation.
• Score: 3.610459670994051
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Classical simulations of quantum computations are vital for the future development of this emerging technology. To this end, decision diagrams have been proposed as a complementary technique which frequently allows to tackle the inherent exponential complexity of these simulations. In the worst case, however, they still cannot escape this complexity. Additionally, while other techniques make use of all the available processing power, decision diagram-based simulation to date cannot exploit the many processing units of today's systems. In this work, we show that both problems can be tackled together by employing a hybrid Schr\"odinger-Feynman scheme for the simulation. More precisely, we show that realizing such a scheme with decision diagrams is indeed possible, we discuss the resulting problems in its realization, and propose solutions how they can be handled. Experimental evaluations confirm that this significantly advances the state of the art in decision diagram-based simulation -- allowing to simulate certain hard circuits within minutes that could not be simulated in a whole day thus far.

Related papers

• End-to-End Complexity Analysis for Quantum Simulation of the Extended Jaynes-Cummings Models [2.5789509846010574]
  We present an end-to-end framework for the quantum simulation of the Jaynes-Cummings model (eJCM)<n>We develop explicit quantum algorithms and circuits for simulating the system's time evolution.<n>This work establishes a complete roadmap for simulating the eJCM on future quantum computers.
  arXiv  Detail & Related papers  (2025-09-16T21:23:53Z)
• Quantum Simulation-Based Optimization of a Cooling System [0.0]
  Quantum algorithms promise up to exponential speedups for specific tasks relevant to numerical simulations. However, these advantages quickly vanish when considering data input and output on quantum computers. The recently introduced Quantum Simulation-Based Optimization (QuSO) treats simulations as subproblems within a larger optimization.
  arXiv  Detail & Related papers  (2025-04-21T21:58:21Z)
• 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)
• Hamiltonian simulation for hyperbolic partial differential equations by scalable quantum circuits [1.6268784011387605]
  This paper presents a method that enables us to explicitly implement the quantum circuit for Hamiltonian simulation. We show that the space and time complexities of the constructed circuit are exponentially smaller than those of conventional classical algorithms.
  arXiv  Detail & Related papers  (2024-02-28T15:17:41Z)
• Lattice real-time simulations with learned optimal kernels [49.1574468325115]
  We present a simulation strategy for the real-time dynamics of quantum fields inspired by reinforcement learning. It builds on the complex Langevin approach, which it amends with system specific prior information.
  arXiv  Detail & Related papers  (2023-10-12T06:01:01Z)
• Going Beyond Gadgets: The Importance of Scalability for Analogue Quantum Simulators [2.3388423124918387]
  Quantum hardware has the potential to efficiently solve computationally difficult problems in physics and chemistry. We show that previous theoretical approaches to analogue quantum simulation suffer from fundamental barriers which prohibit scalable experimental implementation.
  arXiv  Detail & Related papers  (2023-06-23T18:57:57Z)
• Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation [65.93830818469833]
  tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind. We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level. We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
  arXiv  Detail & Related papers  (2023-02-13T19:00:00Z)
• Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation [1.2704529528199062]
  One of the key problems in quantum circuit simulation is the construction of a contraction tree. We introduce a novel time algorithm for constructing an optimal contraction tree. We show that our method achieves superior results on a majority of tested quantum circuits.
  arXiv  Detail & Related papers  (2022-09-07T02:50:30Z)
• Simulation Paths for Quantum Circuit Simulation with Decision Diagrams [72.03286471602073]
  We study the importance of the path that is chosen when simulating quantum circuits using decision diagrams. We propose an open-source framework that allows to investigate dedicated simulation paths.
  arXiv  Detail & Related papers  (2022-03-01T19:00:11Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• 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)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.