Fetching the paper…

Reading the bibliography…

2019

Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits

Pednault, Edwin, Gunnels, John A., Nannicini, Giacomo et al.

Original
PDF
Post on X

Understand

In a recent paper, we showed that secondary storage can extend the range of quantum circuits that can be practically simulated with classical algorithms.

Here we refine those techniques and apply them to the simulation of Sycamore circuits with 53 and 54 qubits, with the entanglement pattern ABCDCDAB that has proven difficult to classically simulate with other approaches.
Our analysis shows that on the Summit supercomputer at Oak Ridge National Laboratories, such circuits can be simulated with high fidelity to arbitrary depth in a matter of days, outputting all the amplitudes.

Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits · Around

Built on

Simulating quantum computation by contracting tensor networks
I. L. Markov and Y. Shi · 2008
Earlier work this paper cites.
Complexity-theoretic foundations of quantum supremacy experiments
Original
S. Aaronson and L. Chen · 2016
Earlier work this paper cites.
Simulation of low-depth quantum circuits as complex undirected graphical models
Original
S. Boixo, S. V. Isakov, V. N. Smelyanskiy, and H. Neven · 2017
Earlier work this paper cites.
Quantum computers ready to leap out of the lab in 2017
D. Castelvecchi · 2017
Earlier work this paper cites.
0.5 petabyte simulation of a 45-qubit quantum circuit
T. Häner and D. S. Steiger · 2017
Earlier work this paper cites.
Quantum computing—breaking through the 49 qubit simulation barrier
E. Pednault · 2017
Earlier work this paper cites.

Similar

Breaking the 49-qubit barrier in the simulation of quantum circuits
Original
E. Pednault, J. A. Gunnels, G. Nannicini, L. Horesh, T. Magerlein, E. Solomonik, and R. Wisnieff · 2017
Cited alongside, same era.
Characterizing quantum supremacy in near-term devices
S. Boixo, S. V. Isakov, V. N. Smelyanskiy, R. Babbush, N. Ding, Z. Jiang, M. J. Bremnen, J. M. Martinis, and H. Neven · 2018
Cited alongside, same era.
Classical simulation of intermediate-size quantum circuits
Original
J. Chen, F. Zhang, M. Chen, C. Huang, M. Newman, and Y. Shi · 2018
Cited alongside, same era.
64-qubit quantum circuit simulation
Original
Z. Chen, Q. Zhou, C. Xue, X. Yang, G. Guo, and G. Guo · 2018
Cited alongside, same era.
Quantum supremacy circuit simulation on sunway taihulight
Original

Then

A flexible high-performance simulator for the verification and benchmarking of quantum circuits implemented on real hardware
Original
B. Villalonga, S. Boixo, B. Nelson, C. Henze, E. Rieffel, R. Biswas, and S. Mandrà · 2018
Later among the works it cites.
Quantum teleportation-inspired algorithm for sampling large random quantum circuits
Original
M.-C. Chen, R. Li, L. Gan, X. Zhu, G. Yang, C.-Y. Lu, and J.-W. Pan · 2019
Closest in time.
General-purpose quantum circuit simulator with projected entangled-pair states and the quantum supremacy frontier
Original
C. Guo, Y. Liu, M. Xiong, S. Xue, X. Fu, A. Huang, X. Qiang, P. Xu, J. Liu, S. Zheng, H.-L. Huang, M. Deng, D. Poletti, W.-S. Bao, and J. Wu · 2019
Closest in time.
Quantum supremacy using a programmable superconducting processor
E. G. Rieffel and al · 2019
Closest in time.
Establishing the quantum supremacy frontier with a 281 pflop/s simulation

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

R. Li, B. Wu, M. Ying, X. Sun, and G. Yang · 2018

Cited alongside, same era.

Quantum supremacy is both closer and farther than it appears

Original

I. L. Markov, A. Fatima, S. V. Isakov, and S. Boixo · 2018

Cited alongside, same era.

B. Villalonga, D. Lyakh, S. Boixo, H. Neven, T. S. Humble, R. Biswas, E. G. Rieffel, A. Ho, and S. Mandrà · 2019

Closest in time.

Alibaba cloud quantum development kit: Large-scale classical simulation of quantum circuits

F. Zhang, C. Huang, M. Newman, J. Cai, H. Yu, Z. Tian, B. Yuan, H. Xu, J. Wu, X. Gao, J. Chen, M. Szegedy, and Y. Shi · 2019

Closest in time.