Approximation Methods for Simulation and Equivalence Checking of Noisy Quantum Circuits

• URL: http://arxiv.org/abs/2503.10340v1
• Date: Thu, 13 Mar 2025 13:19:30 GMT
• Title: Approximation Methods for Simulation and Equivalence Checking of Noisy Quantum Circuits
• Authors: Mingyu Huang, Ji Guan, Wang Fang, Mingsheng Ying,
• Abstract summary: In the current NISQ era, simulating and verifying noisy quantum circuits is crucial.<n>This paper introduces an approximation algorithm for simulating and assessing the equivalence of noisy quantum circuits.
• Score: 3.2559508547981917
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the current NISQ (Noisy Intermediate-Scale Quantum) era, simulating and verifying noisy quantum circuits is crucial but faces challenges such as quantum state explosion and complex noise representations, constraining simulation, and equivalence checking to circuits with a limited number of qubits. This paper introduces an approximation algorithm for simulating and assessing the equivalence of noisy quantum circuits, specifically designed to improve scalability under low-noise conditions. The approach utilizes a novel tensor network diagram combined with singular value decomposition to approximate the tensors of quantum noises. The implementation is based on Google's TensorNetwork Python package for contraction. Experimental results on realistic quantum circuits with realistic hardware noise models indicate that our algorithm can simulate and check the equivalence of QAOA (Quantum Approximate Optimization Algorithm) circuits with around 200 qubits, surpassing the state-of-the-art methods by noise number and execution time.

Related papers

• Non-zero noise extrapolation: accurately simulating noisy quantum circuits with tensor networks [0.5062312533373298]
  We develop and test a method for significantly improving the accuracy of tensor network simulations of noisy quantum circuits.<n>Our method comes with the advantages that it (i.e. high gate-fidelity) is especially tailored to the low-noise regime.
  arXiv  Detail & Related papers  (2025-01-22T21:42:24Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Classical simulations of noisy variational quantum circuits [0.0]
  Noisely affects quantum computations so that they not only become less accurate but also easier to simulate classically as systems scale up. We construct a classical simulation algorithm, LOWESA, for estimating expectation values of noisy parameterised quantum circuits.
  arXiv  Detail & Related papers  (2023-06-08T17:52:30Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Approximation Algorithm for Noisy Quantum Circuit Simulation [3.55689240295244]
  This paper introduces a novel approximation algorithm for simulating noisy quantum circuits. Our method offers a speedup over the commonly-used approximation (sampling) algorithm -- quantum trajectories method.
  arXiv  Detail & Related papers  (2022-11-30T14:20:22Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• 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)
• Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
  We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
  arXiv  Detail & Related papers  (2021-05-20T17:06:52Z)
• Logical Abstractions for Noisy Variational Quantum Algorithm Simulation [25.515765956985188]
  Existing quantum circuit simulators do not address the common traits of variational algorithms. We present a quantum circuit simulation toolchain based on logical abstractions targeted for simulating variational algorithms.
  arXiv  Detail & Related papers  (2021-03-31T17:20:13Z)
• Approximate Equivalence Checking of Noisy Quantum Circuits [8.36229449571485]
  We study the problem of equivalence checking in the NISQ (Noisy Intermediate-Scale Quantum) computing realm where quantum noise is present inevitably. The notion of approximate equivalence of (possibly noisy) quantum circuits is defined based on the Jamiolkowski fidelity. We present two algorithms, aiming at different situations where the number of noises varies, for computing the fidelity between an ideal quantum circuit and its noisy implementation.
  arXiv  Detail & Related papers  (2021-03-22T05:47:41Z)

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.