Quantum Simulation via Stochastic Combination of Unitaries

• URL: http://arxiv.org/abs/2407.21095v1
• Date: Tue, 30 Jul 2024 18:00:00 GMT
• Title: Quantum Simulation via Stochastic Combination of Unitaries
• Authors: Joseph Peetz, Scott E. Smart, Prineha Narang,
• Abstract summary: We introduce a framework for simulating quantum channels using ensembles of low-depth circuits in place of many-qubit dilations. This naturally enables simulations of open systems, which we demonstrate by preparing damped many-qubit GHZ states on ibm_hanoi. The technique further inspires two Hamiltonian simulation algorithms with independence of the spectral precision, reducing resource requirements by several orders of magnitude for a benchmark system.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum simulation algorithms often require numerous ancilla qubits and deep circuits, prohibitive for near-term hardware. We introduce a framework for simulating quantum channels using ensembles of low-depth circuits in place of many-qubit dilations. This naturally enables simulations of open systems, which we demonstrate by preparing damped many-qubit GHZ states on ibm_hanoi. The technique further inspires two Hamiltonian simulation algorithms with asymptotic independence of the spectral precision, reducing resource requirements by several orders of magnitude for a benchmark system.

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)
• Lower bound for simulation cost of open quantum systems: Lipschitz continuity approach [5.193557673127421]
  We present a general framework to calculate the lower bound for simulating a broad class of quantum Markov semigroups. Our framework can be applied to both unital and non-unital quantum dynamics.
  arXiv  Detail & Related papers  (2024-07-22T03:57:41Z)
• Compact quantum algorithms for time-dependent differential equations [0.0]
  We build on an idea based on linear combination of unitaries to simulate non-unitary, non-Hermitian quantum systems. We generate hybrid quantum-classical algorithms that efficiently perform iterative matrix-vector multiplication and matrix inversion operations.
  arXiv  Detail & Related papers  (2024-05-16T02:14:58Z)
• Deep Quantum Circuit Simulations of Low-Energy Nuclear States [51.823503818486394]
  We present advances in high-performance numerical simulations of deep quantum circuits. circuits up to 21 qubits and more than 115,000,000 gates can be efficiently simulated.
  arXiv  Detail & Related papers  (2023-10-26T19:10:58Z)
• 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)
• 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)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)
• Randomizing multi-product formulas for Hamiltonian simulation [2.2049183478692584]
  We introduce a scheme for quantum simulation that unites the advantages of randomized compiling on the one hand and higher-order multi-product formulas on the other. Our framework reduces the circuit depth by circumventing the need for oblivious amplitude amplification. Our algorithms achieve a simulation error that shrinks exponentially with the circuit depth.
  arXiv  Detail & Related papers  (2021-01-19T19:00:23Z)
• Optimal quantum simulation of open quantum systems [1.9551668880584971]
  Digital quantum simulation on quantum systems require algorithms that can be implemented using finite quantum resources. Recent studies have demonstrated digital quantum simulation of open quantum systems on Noisy Intermediate-Scale Quantum (NISQ) devices. We develop quantum circuits for optimal simulation of Markovian and Non-Markovian open quantum systems.
  arXiv  Detail & Related papers  (2020-12-14T14:00:36Z)
• 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)
• 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.