Generalized Cross-Entropy Benchmarking for Random Circuits with Ergodicity

Abstract

Cross-entropy benchmarking is a central technique used to certify a quantum chip in recent experiments. To better understand its mathematical foundation and develop new benchmarking schemes, we introduce the concept of ergodicity to random circuit sampling and find that the Haar random quantum circuit satisfies an ergodicity condition -- the average of certain types of post-processing function over the output bit strings is close to the average over the unitary ensemble. For noiseless random circuits, we prove that the ergodicity holds for polynomials of degree $t$ with positive coefficients and when the random circuits form a unitary $2t$-design. For strong enough noise, the ergodicity condition is violated. This suggests that ergodicity is a property that can be exploited to certify a quantum chip. We formulate the deviation of ergodicity as a measure for quantum chip benchmarking and show that it can be used to estimate the circuit fidelity for global depolarizing noise and weakly correlated noise. For a quadratic post-processing function, our framework recovers Google's result on estimating the circuit fidelity via linear cross-entropy benchmarking (XEB), and we give a sufficient condition on the noise model characterizing when such estimation is valid. Our results establish an interesting connection between ergodicity and noise in random circuits and provide new insights into designing quantum benchmarking schemes.

15 pages, 4 figures. Comments are welcome

References in corpus (16)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Strong quantum computational advantage using a superconducting quantum processor
• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• Direct Fidelity Estimation from Few Pauli Measurements
• Quantum Process Tomography: Resource Analysis of Different Strategies
• Evenly distributed unitaries: on the structure of unitary designs
• Aspects of generic entanglement
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• When are correlations quantum? -- Verification and quantification of entanglement by simple measurements
• Entanglement Typicality
• Concentration of measure for quantum states with a fixed expectation value
• On the Classical Hardness of Spoofing Linear Cross-Entropy Benchmarking
• Generalized Wigner-von Neumann entropy and its typicality
• On the Complexity of Random Quantum Computations and the Jones Polynomial
• Sampling of globally depolarized random quantum circuit