Exponentially accurate open quantum simulation via randomized dissipation with minimal ancilla

• URL: http://arxiv.org/abs/2412.19453v1
• Date: Fri, 27 Dec 2024 04:43:19 GMT
• Title: Exponentially accurate open quantum simulation via randomized dissipation with minimal ancilla
• Authors: Jumpei Kato, Kaito Wada, Kosuke Ito, Naoki Yamamoto,
• Abstract summary: 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.
• Score: 0.35794129023851595
• License:
• Abstract: Simulating open quantum systems is an essential technique for understanding complex physical phenomena and advancing quantum technologies. 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. Minimizing the space complexity while achieving such a logarithmic depth remains an important challenge. In this work, 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. Toward simulating an exponentially accurate Taylor expansion of the Lindblad propagator to ensure the circuit depth of $\mathcal{O} (\log(1/\varepsilon))$, we develop a novel random circuit compilation method that leverages dissipative processes with only a single jump operator; importantly, the proposed method requires the minimal-size, $4 + \lceil \log M \rceil$, ancilla qubits where each single jump operator has at most $M$ Pauli strings. This work represents a significant step towards making open quantum system simulations more feasible on early fault-tolerant quantum computing devices.

Related papers

• Efficient Quantum Circuit Compilation for Near-Term Quantum Advantage [17.38734393793605]
  We propose an approximate method for compiling target quantum circuits into brick-wall layouts. This new circuit design consists of two-qubit CNOT gates that can be directly implemented on real quantum computers.
  arXiv  Detail & Related papers  (2025-01-13T15:04:39Z)
• Practical Quantum Circuit Implementation for Simulating Coupled Classical Oscillators [1.3140209441982318]
  We present and implement a detailed quantum circuit construction for simulating one-dimensional spring-mass systems. This circuit-based Hamiltonian simulation approach can substantially reduce computational costs and potentially enable larger-scale many-body studies on future quantum hardware.
  arXiv  Detail & Related papers  (2025-01-10T16:53:56Z)
• Exponentially reduced circuit depths in Lindbladian simulation [11.176767117446696]
  Quantum computers can efficiently simulate Lindbladian dynamics, enabling powerful applications in open system simulation, thermal and ground-state preparation, autonomous quantum error correction, dissipative engineering, and more. Existing methods face a critical trade-off: either relying on resource-intensive multi-qubit operations or employing deep quantum circuits to suppress simulation errors using experimentally friendly methods. We propose an efficient Lindbladian simulation framework that minimizes circuit depths while remaining experimentally accessible.
  arXiv  Detail & Related papers  (2024-12-30T16:31:25Z)
• Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
  We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale. Our experiments show that this approach significantly outperforms the adiabatic algorithm.
  arXiv  Detail & Related papers  (2024-05-31T17:07:43Z)
• A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method [39.671915199737846]
  We introduce a multiple-circuit algorithm for a quantum lattice Boltzmann method (QLBM) solve of the incompressible Navier--Stokes equations. The presented method is validated and demonstrated for 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• Efficient quantum algorithm to simulate open systems through a single environmental qubit [0.0]
  We present an efficient algorithm for simulating open quantum systems dynamics described by the Lindblad master equation on quantum computers. Under fixed accuracy conditions, our algorithm enables a reduction in the number of trotter steps compared to other approaches.
  arXiv  Detail & Related papers  (2023-11-16T16:45:30Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Commutation simulator for open quantum dynamics [0.0]
  We propose an innovative method to investigate directly the properties of a time-dependent density operator $hatrho(t)$. We can directly compute the expectation value of the commutation relation and thus of the rate of change of $hatrho(t)$. A simple but important example is demonstrated in the single-qubit case and we discuss extension of the method for practical quantum simulation with many qubits.
  arXiv  Detail & Related papers  (2022-06-01T16:03:43Z)
• Unimon qubit [42.83899285555746]
  Superconducting qubits are one of the most promising candidates to implement quantum computers. Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
  arXiv  Detail & Related papers  (2022-03-11T12:57:43Z)
• 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)

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.