Joint Cutting for Hybrid Schrödinger-Feynman Simulation of Quantum Circuits

• URL: http://arxiv.org/abs/2502.06959v1
• Date: Mon, 10 Feb 2025 19:01:04 GMT
• Title: Joint Cutting for Hybrid Schrödinger-Feynman Simulation of Quantum Circuits
• Authors: Laura S. Herzog, Lukas Burgholzer, Christian Ufrecht, Daniel D. Scherer, Robert Wille,
• Abstract summary: "Joint cutting" can outperform the standard HSF simulation by up to a factor $approx 4000times$. The proposed refinement can help decrease simulation times and highlight the remaining challenges.
• Score: 4.1053323247531255
• License:
• Abstract: Despite the continuous advancements in size and robustness of real quantum devices, reliable large-scale quantum computers are not yet available. Hence, classical simulation of quantum algorithms remains crucial for testing new methods and estimating quantum advantage. Pushing classical simulation methods to their limit is essential, particularly due to their inherent exponential complexity. Besides the established Schr\"odinger-style full statevector simulation, so-called Hybrid Schr\"odinger-Feynman (HSF) approaches have shown promise to make simulations more efficient. HSF simulation employs the idea of "cutting" the circuit into smaller parts, reducing their execution times. This, however, comes at the cost of an exponential overhead in the number of cuts. Inspired by the domain of Quantum Circuit Cutting, we propose an HSF simulation method based on the idea of "joint cutting" to significantly reduce the aforementioned overhead. This means that, prior to the cutting procedure, gates are collected into "blocks" and all gates in a block are jointly cut instead of individually. We investigate how the proposed refinement can help decrease simulation times and highlight the remaining challenges. Experimental evaluations show that "joint cutting" can outperform the standard HSF simulation by up to a factor $\approx 4000\times$ and the Schr\"odinger-style simulation by a factor $\approx 200\times$ for suitable instances. The implementation is available at https://github.com/cda-tum/mqt-qsim-joint-cutting.

Related papers

• Circuit Partitioning and Full Circuit Execution: A Comparative Study of GPU-Based Quantum Circuit Simulation [0.0]
  Executing large quantum circuits is not feasible using the currently available NISQ (noisy intermediate-scale quantum) devices. This study presents a comparative analysis of two simulation methods: circuit-splitting and full-circuit execution using distributed memory. Results indicate that full-circuit executions are faster than circuit-splitting for simulations performed on a single node.
  arXiv  Detail & Related papers  (2025-02-17T03:04:43Z)
• Exponentially accurate open quantum simulation via randomized dissipation with minimal ancilla [0.35794129023851595]
  Some quantum algorithms for simulating Lindblad dynamics achieve logarithmically short circuit depth in terms of accuracy $varepsilon$ by coherently encoding all possible jump processes with a large ancilla consumption. We present a quantum algorithm for simulating general Lindblad dynamics with multiple jump operators aimed at an observable estimation, that achieves both a logarithmically short circuit depth and a minimum ancilla size.
  arXiv  Detail & Related papers  (2024-12-27T04:43:19Z)
• State of practice: evaluating GPU performance of state vector and tensor network methods [2.4851820343103035]
  This article investigates the limits of current state-of-the-art simulation techniques on a test bench made of eight widely used quantum subroutines. We highlight how to select the best simulation strategy, obtaining a speedup of up to an order of magnitude.
  arXiv  Detail & Related papers  (2024-01-11T09:22:21Z)
• Online Detection of Golden Circuit Cutting Points [12.76725337820984]
  We introduce the concept of a golden cutting point, which identifies unnecessary basis components during reconstruction and avoids related down-stream computation. We demonstrate the applicability of our method on Qiskit's Aer simulator and observe a reduced wall time from identifying and avoiding obsolete measurements.
  arXiv  Detail & Related papers  (2023-08-20T03:56:31Z)
• On Quantum Annealing Without a Physical Quantum Annealer [0.0]
  We propose and evaluate a hybrid quantum classical: Quantum Accelerated Simulated Annealing (QASA) Our simulation results show QASA performing comparably to SA but for a reduced amount of steps.
  arXiv  Detail & Related papers  (2023-07-19T00:37:34Z)
• Simulation-free Schr\"odinger bridges via score and flow matching [89.4231207928885]
  We present simulation-free score and flow matching ([SF]$2$M) Our method generalizes both the score-matching loss used in the training of diffusion models and the recently proposed flow matching loss used in the training of continuous flows. Notably, [SF]$2$M is the first method to accurately model cell dynamics in high dimensions and can recover known gene regulatory networks simulated data.
  arXiv  Detail & Related papers  (2023-07-07T15:42:35Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• 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)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)
• 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.