Linear Cross Entropy Benchmarking with Clifford Circuits
arXiv:2206.08293 · doi:10.1103/PhysRevA.108.052613
Abstract
With the advent of quantum processors exceeding 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 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.
References in corpus (41)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A Quantum Engineer's Guide to Superconducting Qubits
- Black holes and the butterfly effect
- Black holes as mirrors: quantum information in random subsystems
- Trapped-Ion Quantum Computing: Progress and Challenges
- Strong quantum computational advantage using a superconducting quantum processor
- Fast Scramblers
- Randomized Benchmarking of Quantum Gates
- Robust randomized benchmarking of quantum processes
- Validating quantum computers using randomized model circuits
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Scalable Noise Estimation with Random Unitary Operators
- Towards the fast scrambling conjecture
- Stim: a fast stabilizer circuit simulator
- Random Quantum Circuits are Approximate 2-designs
- Local random quantum circuits are approximate polynomial-designs
- Characterization of addressability by simultaneous randomized benchmarking
- Information Scrambling in Computationally Complex Quantum Circuits
- Characterizing large-scale quantum computers via cycle benchmarking
- Matchgates and classical simulation of quantum circuits
- Estimating the Coherence of Noise
- Dynamically Generated Logical Qubits
- Three Qubit Randomized Benchmarking
- A general framework for randomized benchmarking
- Randomized Benchmarking of Multi-Qubit Gates
- Approximate unitary -designs by short random quantum circuits using nearest-neighbor and long-range gates
- Efficient Generation of Generic Entanglement
- Direct randomized benchmarking for multi-qubit devices
- Characterizing Universal Gate Sets via Dihedral Benchmarking
- Decoupling with random quantum circuits
- Randomized benchmarking with gate-dependent noise
- Scalable randomized benchmarking of non-Clifford gates
- Scalable randomized benchmarking of quantum computers using mirror circuits
- Exact convergence times for generation of random bipartite entanglement
- Characterization of Leakage Errors via Randomized Benchmarking
- Efficient error characterization in Quantum Information Processing
- Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
- Fast Estimation of Sparse Quantum Noise
- Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled-S gate
- Randomized Benchmarking Beyond Groups
- Scalable fast benchmarking for individual quantum gates with local twirling