Linear Cross Entropy Benchmarking with Clifford Circuits

• URL: http://arxiv.org/abs/2206.08293v1
• Date: Thu, 16 Jun 2022 16:49:22 GMT
• Title: Linear Cross Entropy Benchmarking with Clifford Circuits
• Authors: Jianxin Chen, Dawei Ding, Cupjin Huang and Linghang Kong
• Abstract summary: We run numerical simulations for classes of Clifford circuits with noise and observe exponential decays. We perform simulations of systems up to 1,225 qubits, where the classical processing task can be easily dealt with by a workstation.
• Score: 6.885865913527472
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With the advent of quantum processors exceeding $100$ qubits and the high engineering complexities involved, there is a need for holistically benchmarking the processor to have quality assurance. Linear cross-entropy benchmarking (XEB) has been used extensively for systems with $50$ or more qubits but is fundamentally limited in scale due to the exponentially large computational resources required for classical simulation. In this work we propose conducting linear XEB with Clifford circuits, a scheme we call Clifford XEB. Since Clifford circuits can be simulated in polynomial time, Clifford XEB can be scaled to much larger systems. To validate this claim, we run numerical simulations for particular classes of Clifford circuits with noise and observe exponential decays. When noise levels are low, the decay rates are well-correlated with the noise of each cycle assuming a digital error model. We perform simulations of systems up to 1,225 qubits, where the classical processing task can be easily dealt with by a workstation. Furthermore, using the theoretical guarantees in Chen et al. (arXiv:2203.12703), we prove that Clifford XEB with our proposed Clifford circuits must yield exponential decays under a general error model for sufficiently low errors. Our theoretical results explain some of the phenomena observed in the simulations and shed light on the behavior of general linear XEB experiments.

Related papers

• Clifford Perturbation Approximation for Quantum Error Mitigation [6.8335953981503454]
  Quantum error mitigation (QEM) is critical for harnessing the potential of near-term quantum devices. We propose a learning-based error mitigation framework called Clifford Perturbation Data Regression (CPDR) CPDR constructs training sets by Clifford circuits with small perturbations.
  arXiv  Detail & Related papers  (2024-12-12T18:01:54Z)
• 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)
• 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)
• Simulating Quantum Circuits by Model Counting [0.0]
  We show for the first time that a strong simulation of universal quantum circuits can be efficiently tackled through weighted model counting. Our work paves the way to apply the existing array of powerful classical reasoning tools to realize efficient quantum circuit compilation.
  arXiv  Detail & Related papers  (2024-03-11T22:40:15Z)
• Simulation of noisy Clifford circuits without fault propagation [3.1727619150610837]
  We propose a simulation algorithm for all Clifford circuits that does not require fault propagation. Our algorithm, which we name adjoint-based code (ABC) simulation, relies on the fact that propagation forward is the adjoint of propagation backward.
  arXiv  Detail & Related papers  (2023-09-27T01:30:03Z)
• 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)
• Extending Classically Simulatable Bounds of Clifford Circuits with Nonstabilizer States via Framed Wigner Functions [3.9482012852779085]
  Wigner function formalism has played a pivotal role in examining the non-classical aspects of quantum states and their classical simulatability. We propose a novel classical simulation method for qubit Clifford circuits based on the framed Wigner function.
  arXiv  Detail & Related papers  (2023-07-31T14:02:33Z)
• Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation [65.93830818469833]
  tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind. We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level. We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
  arXiv  Detail & Related papers  (2023-02-13T19:00:00Z)
• 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)
• 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)
• 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)

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.