• Corpus ID: 218628815

# Classical Simulation of Quantum Supremacy Circuits

@article{Huang2020ClassicalSO,
title={Classical Simulation of Quantum Supremacy Circuits},
author={Cupjin Huang and Fang Zhang and Michael Newman and Junjie Cai and Xun Gao and Zhengxiong Tian and Junyin Wu and Haihong Xu and Huanjun Yu and Bo Yuan and Mario Szegedy and Yaoyun Shi and Jianxin Chen},
journal={arXiv: Quantum Physics},
year={2020}
}
• Published 14 May 2020
• Computer Science
• arXiv: Quantum Physics
It is believed that random quantum circuits are difficult to simulate classically. These have been used to demonstrate quantum supremacy: the execution of a computational task on a quantum computer that is infeasible for any classical computer. The task underlying the assertion of quantum supremacy by Arute et al. (Nature, 574, 505--510 (2019)) was initially estimated to require Summit, the world's most powerful supercomputer today, approximately 10,000 years. The same task was performed on the…
58 Citations

## Figures and Tables from this paper

### Boundaries of quantum supremacy via random circuit sampling

• Physics, Computer Science
• 2020
The constraints of the observed quantum runtime advantage in an analytical extrapolation to circuits with a larger number of qubits and gates are examined, suggesting the boundaries of quantum supremacy via random circuit sampling may fortuitously coincide with the advent of scalable, error corrected quantum computing in the near term.

### Statistical Aspects of the Quantum Supremacy Demonstration

• Physics, Computer Science
Statistical Science
• 2022
The relations between quantum computing and some of the statistical aspects involved in demonstrating quantum supremacy are explained in terms that are accessible to statisticians, computer scientists, and mathematicians.

### Leveraging State Sparsity for More Efficient Quantum Simulations

• Computer Science
ACM Transactions on Quantum Computing
• 2022
This work is the first to fully simulate a quantum algorithm to compute elliptic curve discrete logarithms, and its prototype implementation includes optimizations such as gate (re)scheduling, which amortizes data structure accesses and reduces memory usage.

### Simulation Paths for Quantum Circuit Simulation with Decision Diagrams

• Computer Science
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
• 2022
It is shown, conceptually and experimentally, that choosing the right simulation path can make a vast difference in the efﬁciency of classical simulations using decision diagrams and a dedicated simulation path heuristic is designed that allows to improve the performance even further— frequently yielding speedups of several orders of magnitude.

### Improved robustness of quantum supremacy for random circuit sampling

• Computer Science
• 2021
It is proved under the complexity theoretical assumption of the non-collapse of the polynomial hierarchy that approximating the output probabilities of random quantum circuits to within exp(−Ω(m logm)) additive error is hard for any classical computer, where m is the number of gates in the quantum computation.

### Comparative Study of Sampling-Based Simulation Costs of Noisy Quantum Circuits

• Physics
Physical Review Applied
• 2021
This work improves the existing stabilizer-state sampling algorithm based on robustness of magic so that the simulation costs of noisy quantum circuits are reduced even under noise on Clifford gates, and calculates the simulation Costs of a noisy single-qubit rotation gate and confirmed that small noise makes the noisy rotation gate efficiently simulatable, as expected.

### How to Simulate Quantum Measurement without Computing Marginals.

• Computer Science
Physical review letters
• 2022
Algorithms for classically simulating measurement of an n-qubit quantum state in the standard basis, that is, sampling a bit string from the probability distribution determined by the Born rule are described and analyzed.

### Quantum supremacy and hardness of estimating output probabilities of quantum circuits

• Computer Science
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
• 2022
It is proved under the complexity theoretical assumption of the non-collapse of the polynomial hierarchy that approximating the output probabilities of random quantum circuits to within $\exp(-\Omega(m\log m))$ additive error is hard for any classical computer, where $m$ is the number of gates in the quantum computation.

### Closing the “Quantum Supremacy” Gap: Achieving Real-Time Simulation of a Random Quantum Circuit Using a New Sunway Supercomputer

• Computer Science
SC21: International Conference for High Performance Computing, Networking, Storage and Analysis
• 2021
A high-performance tensor-based simulator for random quantum circuits(RQCs) on the new Sunway supercomputer, which effectively expands the scope of simulatable RQCs to include the 10×10(qubits)X(1 + 40 + l)(depth) circuit, with a sustained performance of 1.2 Eflops.

### A quantum circuit simulator and its applications on Sunway TaihuLight supercomputer

• Physics, Computer Science
Scientific reports
• 2021
A new quantum circuit simulator developed on the Sunway TaihuLight supercomputer is presented that is more versatile and of high efficiency, and is expected to have broader applications in developing quantum algorithms in various fields.

## References

SHOWING 1-10 OF 33 REFERENCES

### Quantum Supremacy Is Both Closer and Farther than It Appears

• Computer Science
ArXiv
• 2018
A massively-parallel simulation tool Rollright is developed that does not require inter-process communication (IPC) or proprietary hardware, and two ways to trade circuit fidelity for computational speedups are developed, so as to match the fidelity of a given quantum computer --- a task previously thought impossible.

### Characterizing quantum supremacy in near-term devices

• Physics
• 2016
A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of

### Quantum supremacy using a programmable superconducting processor

• Physics, Computer Science
Nature
• 2019
Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.

### On the complexity and verification of quantum random circuit sampling

• Computer Science
Nature Physics
• 2018
Evidence is provided that quantum random circuit sampling, a near-term quantum computational task, is classically hard but verifiable, making it a leading proposal for achieving quantum supremacy.

### 0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit

• Computer Science
SC17: International Conference for High Performance Computing, Networking, Storage and Analysis
• 2017
This work applies a scheduling algorithm to quantum supremacy circuits in order to reduce the required communication and simulate a 45-qubit circuit on the Cori II supercomputer using 8, 192 nodes and 0.5 petabytes of memory, which constitutes the largest quantum circuit simulation to this date.

### Complexity-Theoretic Foundations of Quantum Supremacy Experiments

• Computer Science
Computational Complexity Conference
• 2017
General theoretical foundations are laid for how to use special-purpose quantum computers with 40--50 high-quality qubits to demonstrate "quantum supremacy": that is, a clear quantum speedup for some task, motivated by the goal of overturning the Extended Church-Turing Thesis as confidently as possible.

### Boundaries of quantum supremacy via random circuit sampling

• Physics, Computer Science
• 2020
The constraints of the observed quantum runtime advantage in an analytical extrapolation to circuits with a larger number of qubits and gates are examined, suggesting the boundaries of quantum supremacy via random circuit sampling may fortuitously coincide with the advent of scalable, error corrected quantum computing in the near term.

### Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral

• Physics, Computer Science
• 2017
It is shown that deferring tensor contractions can extend the boundaries of what can be computed on classical systems and can be used to simulate $7 \times 7$-qubit random circuits to arbitrary depth by leveraging secondary storage.

### On the Classical Hardness of Spoofing Linear Cross-Entropy Benchmarking

• Computer Science
Theory Comput.
• 2020
It is shown that the problem is classically hard, assuming that there is no efficient classical algorithm that, given a random n-qubit quantum circuit C, estimates the probability of C outputting a specific output string with variance even slightly better than that of the trivial estimator that always estimates 1/2^n.

### A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware

• Computer Science
npj Quantum Information
• 2019
Here we present qFlex, a flexible tensor network-based quantum circuit simulator. qFlex can compute both the exact amplitudes, essential for the verification of the quantum hardware, as well as