Quantum supremacy, a term that signifies a quantum computer's ability to perform a computational task that is practically impossible for even the most powerful classical supercomputers, has been a significant goal in quantum computing. One of the leading proposed methods for demonstrating this supremacy involves sampling the output distribution of random quantum circuits. This approach leverages the unique properties of quantum mechanics to generate
complex patterns that are exceedingly difficult for classical systems to replicate, pushing the boundaries of what computing can achieve. The concept has been central to major claims of quantum supremacy and has sparked considerable debate within the scientific community.
The Mechanics of Random Quantum Circuit Sampling
At its core, sampling the output distribution of random quantum circuits involves a specific experimental setup. Theoretical work published in 2018 suggested that quantum supremacy could be achieved with a "two-dimensional lattice of 7x7 qubits and around 40 clock cycles," provided that error rates could be sufficiently reduced. This scheme is a variation of a quantum random sampling method where qubits are subjected to random quantum circuits. These circuits are composed of quantum gates drawn from a universal gate set, meaning they are capable of performing any possible quantum computation. Following the application of these gates, measurements are taken in the computational basis, which essentially reads out the state of the qubits.
The incorporation of randomness into these circuits offers several advantages. It can be used for the validation of quantum computers, as demonstrated by Google in their 2019 claim of quantum supremacy. Additionally, it aids in understanding the universal structure of non-equilibrium and thermalization processes in quantum many-body dynamics. The constituents of these general quantum circuits include qubits, unitary gates, and measurements. The time evolution of these circuits is discrete, with states evolving step by step through the application of unitary operators. These operators can entangle states, leading to complex quantum behavior.
Google's Sycamore Processor and the Supremacy Claim
In September 2019, Google made a significant announcement, claiming to have achieved quantum supremacy. Their Sycamore processor, equipped with 54 qubits (53 of which were functional), was used to perform a series of operations. Google stated that these operations took 200 seconds for the Sycamore processor, a task that would require a state-of-the-art classical supercomputer approximately 10,000 years to complete. This demonstration involved sampling one instance of a quantum circuit a million times, showcasing a dramatic speedup over classical methods.
The research supporting Google's claim was subsequently published in the peer-reviewed scientific journal Nature, marking it as a major scientific achievement. The ability of the Sycamore processor to perform a specific calculation significantly faster than the most powerful existing supercomputer highlighted the potential of quantum computing. However, the landscape of classical simulation is not static; in 2024, the Google team estimated that, due to advancements in classical tensor network algorithms, simulating 53 qubits might only take six seconds on the Frontier supercomputer, indicating the dynamic nature of this computational race.
The IBM Rebuttal and the Evolving Definition of Supremacy
Google's announcement was met with a direct challenge from IBM, a competitor in the quantum computing space. IBM contended that the calculation Google claimed would take 10,000 years could, in fact, be performed in just 2.5 days on its own Summit supercomputer, provided its architecture was optimized for the task. This rebuttal sparked a significant debate over the precise threshold and definition of "quantum supremacy," highlighting the complexities in comparing quantum and classical computational capabilities.
This debate underscores that quantum supremacy is not merely about performing a task faster, but also about the efficiency and optimization of classical algorithms. The ongoing improvements in classical simulation techniques mean that the bar for demonstrating quantum supremacy is continually being raised. Despite the debate, the core achievement of Google's Sycamore processor in performing a specific calculation much faster than existing supercomputers remains a landmark in the field, pushing forward the experimental realization of quantum computing's potential.

















