Simulating quantum circuit expectation values by Clifford perturbation theory

• URL: http://arxiv.org/abs/2306.04797v2
• Date: Tue, 11 Jul 2023 15:41:13 GMT
• Title: Simulating quantum circuit expectation values by Clifford perturbation theory
• Authors: Tomislav Begu\v{s}i\'c and Kasra Hejazi and Garnet Kin-Lic Chan
• Abstract summary: We consider the expectation value problem for circuits composed of Clifford gates and non-Clifford Pauli rotations. We introduce a perturbative approach based on the truncation of the exponentially growing sum of Pauli terms in the Heisenberg picture. Results indicate that this systematically improvable perturbative method offers a viable alternative to exact methods for approxing expectation values of large near-Clifford circuits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The classical simulation of quantum circuits is of central importance for benchmarking near-term quantum devices. The fact that gates belonging to the Clifford group can be simulated efficiently on classical computers has motivated a range of methods that scale exponentially only in the number of non-Clifford gates. Here, we consider the expectation value problem for circuits composed of Clifford gates and non-Clifford Pauli rotations, and introduce a heuristic perturbative approach based on the truncation of the exponentially growing sum of Pauli terms in the Heisenberg picture. Numerical results are shown on a Quantum Approximate Optimization Algorithm (QAOA) benchmark for the E3LIN2 problem and we also demonstrate how this method can be used to quantify coherent and incoherent errors of local observables in Clifford circuits. Our results indicate that this systematically improvable perturbative method offers a viable alternative to exact methods for approximating expectation values of large near-Clifford circuits.

Related papers

• QuCLEAR: Clifford Extraction and Absorption for Significant Reduction in Quantum Circuit Size [8.043057448895343]
  Currently available quantum devices suffer from noisy quantum gates, which degrade the fidelity of executed quantum circuits. We present QuCLEAR, a compilation framework designed to optimize quantum circuits.
  arXiv  Detail & Related papers  (2024-08-23T18:03:57Z)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• Classical benchmarking of zero noise extrapolation beyond the exactly-verifiable regime [1.2569180784533303]
  We compare the experimental results to matrix product operator simulations of the Heisenberg evolution. We observe a discrepancy of up to $20%$ among the different classical approaches.
  arXiv  Detail & Related papers  (2023-06-30T17:57:26Z)
• Partitioning Quantum Chemistry Simulations with Clifford Circuits [1.0286890995028481]
  Current quantum computing hardware is restricted by the availability of only few, noisy qubits. We investigate the limits of their classical and near-classical treatment while staying within the framework of quantum circuits.
  arXiv  Detail & Related papers  (2023-03-02T13:05:19Z)
• 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)
• Clifford Circuit Initialisation for Variational Quantum Algorithms [0.0]
  We present an initialisation method for variational quantum algorithms applicable to intermediate scale quantum computers. We numerically demonstrate the effectiveness of the technique, and how it depends on Hamiltonian structure, number of qubits and circuit depth.
  arXiv  Detail & Related papers  (2022-07-04T15:59:33Z)
• 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)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Simulating quench dynamics on a digital quantum computer with data-driven error mitigation [62.997667081978825]
  We present one of the first implementations of several Clifford data regression based methods which are used to mitigate the effect of noise in real quantum data. We find in general Clifford data regression based techniques are advantageous in comparison with zero-noise extrapolation. This is the largest systems investigated so far in a study of this type.
  arXiv  Detail & Related papers  (2021-03-23T16:56:14Z)
• Quadratic Clifford expansion for efficient benchmarking and initialization of variational quantum algorithms [0.8808007156832224]
  Variational quantum algorithms are considered to be appealing applications of near-term quantum computers. We propose a perturbative approach for efficient benchmarking of variational quantum algorithms.
  arXiv  Detail & Related papers  (2020-11-19T16:09:00Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.