Cross-entropy benchmarking

Last updated

Cross-entropy benchmarking (XEB) is a statistical measure used to evaluate the performance in random circuit sampling experiments. It quantifies how strongly experimental samples correlate with the ideal output distribution and has been used in demonstrations of quantum supremacy. [1]

Contents

Definition

Let be an -qubit quantum circuit. The output probability for bitstrings for acting on all 0 input is . Given samples obtained from an experimental device, the (linear) cross-entropy benchmarking fidelity is defined as [2]

Interpretation

If , the samples were collected from a noiseless quantum computer. If , then the samples could have been obtained via random guessing. [3] This means that if a quantum computer did generate those samples, then the quantum computer is too noisy and thus has no chance of performing beyond-classical computations. Since it takes an exponential amount of resources to classically simulate a quantum circuit, there comes a point when the biggest supercomputer that runs the best classical algorithm for simulating quantum circuits can't compute the XEB. Crossing this point is known as achieving quantum supremacy; and after entering the quantum supremacy regime, XEB can only be estimated. [2]

Sampling-based quantum supremacy experiments

The Sycamore processor was the first to demonstrate quantum supremacy via XEB. Instances of random circuits with and 20 cycles were run to obtain an XEB of . [2] Generating samples took 200 seconds on the quantum processor when it would have taken 10,000 years on Summit at the time of the experiment. Improvements in classical algorithms have shortened the runtime to about a week on Sunway TaihuLight thus collapsing Sycamore's claim to quantum supremacy. [4] As of 2021, the latest demonstration of quantum supremacy by Zuchongzhi 2.1 with , 24 cycles and an XEB of holds. It takes around 4 hours to generate samples on Zuchongzhi 2.1 when it would take 10,000 years on Sunway. [4]

See also

References

  1. Boixo, S.; et al. (2018). "Characterizing Quantum Supremacy in Near-Term Devices". Nature Physics. 14 (6): 595–600. arXiv: 1608.00263 . Bibcode:2018NatPh..14..595B. doi:10.1038/s41567-018-0124-x. S2CID   4167494.
  2. 1 2 3 Arute, F.; et al. (2019). "Quantum supremacy using a programmable superconducting processor". Nature. 574 (7779): 505–510. arXiv: 1910.11333 . Bibcode:2019Natur.574..505A. doi:10.1038/s41586-019-1666-5. PMID   31645734. S2CID   204836822.
  3. Aaronson, S. (2021). "Open Problems Related to Quantum Query Complexity". arXiv: 2109.06917 [quant-ph].
  4. 1 2 Liu, X.; et al. (2021). "Redefining the Quantum Supremacy Baseline With a New Generation Sunway Supercomputer". arXiv: 2111.01066 [quant-ph].