Classical Sampling of Random Quantum Circuits with Bounded Fidelity

Understand

Random circuit sampling has become a popular means for demonstrating the superiority of quantum computers over classical supercomputers.

• While quantum chips are evolving rapidly, classical sampling algorithms are also getting better and better.
• The major challenge is to generate bitstrings exhibiting an XEB fidelity above that of the quantum chips.
• Here we present a classical sampling algorithm for producing the probability distribution of any given random quantum circuit, where the fidelity can be rigorously bounded.