Open AccessPosted Content
Simulating the Sycamore quantum supremacy circuits
Reads0
Chats0
TLDR
In this paper, a tensor network method for simulating quantum circuits is proposed, which is massively more efficient in computing a large number of correlated bitstring amplitudes and probabilities than existing methods.Abstract:
We propose a general tensor network method for simulating quantum circuits. The method is massively more efficient in computing a large number of correlated bitstring amplitudes and probabilities than existing methods. As an application, we study the sampling problem of Google's Sycamore circuits, which are believed to be beyond the reach of classical supercomputers and have been used to demonstrate quantum supremacy. Using our method, employing a small computational cluster containing 60 graphical processing units (GPUs), we have generated one million correlated bitstrings with some entries fixed, from the Sycamore circuit with 53 qubits and 20 cycles, with linear cross-entropy benchmark (XEB) fidelity equals 0.739, which is much higher than those in Google's quantum supremacy experiments.read more
Citations
More filters
Journal ArticleDOI
Quantum computational advantage via 60-qubit 24-cycle random circuit sampling
Qingling Zhu,Sirui Cao,Fusheng Chen,Ming-Cheng Chen,X. H. Chen,Tung-Hsun Chung,Hui Deng,Yajie Du,Daojin Fan,Ming Gong,Cheng Guo,Chu Guo,Shaojun Guo,L. Han,Linyin Hong,He-Liang Huang,Yongheng Huo,Liping Li,Na Li,Shaowei Li,Yuan Li,Futian Liang,Chun Lin,Jin Lin,Haoran Qian,Dan Qiao,Hao Rong,Hong Su,Lihua Sun,Liangyuan Wang,Shiyu Wang,Dachao Wu,Yulin Wu,Yu Xu,Kai Yan,Weifeng Yang,Yang Yang,Yangsen Ye,Jianghan Yin,Chong Ying,Jiale Yu,Chen Zha,Cha Zhang,Haibin Zhang,Kaili Zhang,Yiming Zhang,H. L. Zhao,Youwei Zhao,Liang Zhou,Chao-Yang Lu,Cheng-Zhi Peng,Xiaobo Zhu,Jian-Wei Pan +52 more
TL;DR: Zuchongzhi 2.1 as mentioned in this paper has 66 qubits in a two-dimensional array in a tunable coupler architecture, and the readout fidelity is improved to an average of 97.74%.
Proceedings ArticleDOI
Closing the "Quantum Supremacy" Gap: Achieving Real-Time Simulation of a Random Quantum Circuit Using a New Sunway Supercomputer
Yong,Fang,Haohuan Fu,Yuling Yang,Song Jiawei,Zhao Pengpeng,Zhen Wang,Peng Dajia,Huarong Chen,Chu Guo,Heliang Huang,Wenzhao Wu,Dexun Chen +12 more
TL;DR: In this paper, a tensor-based simulator for random quantum circuits (RQCs) on the new Sunway supercomputer was developed, which achieved a sustained performance of 1.2 Eflops (single-precision) or 4.4 EFLops (mixed-precision) with a new milestone for classical simulation of quantum circuits.
Posted Content
The Argument against Quantum Computers, the Quantum Laws of Nature, and Google's Supremacy Claims.
TL;DR: A computational complexity argument against the feasibility of quantum computers was described, which identified a very low-level complexity class of probability distributions described by noisy intermediate-scale quantum computers, and explained why it would allow neither good-quality quantum error-correction nor a demonstration of "quantum supremacy".
Posted Content
Statistical Aspects of the Quantum Supremacy Demonstration
TL;DR: 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.
Posted Content
Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale
Thien Nguyen,Dmitry I. Lyakh,Eugene F. Dumitrescu,David Clark,Jeff Larkin,Alexander McCaskey +5 more
TL;DR: A modernized version of the Tensor Network Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the eXtreme-scale ACCelerator (XACC) framework, and introduces an end-to-end virtual quantum development environment which can scale from laptops to future exascale platforms.
References
More filters
Journal ArticleDOI
Random matrix physics: Spectrum and strength fluctuations
TL;DR: In this article, it was shown that the general nature of deviations from uniformity in the spectrum of a complicated nucleus is essentially the same in all regions of the spectrum and over the entire Periodic Table.
Journal ArticleDOI
Fluctuations of Nuclear Reaction Widths
Charles E. Porter,R. G. Thomas +1 more
TL;DR: In this paper, the fluctuations of the neutron reduced widths from the resonance region of intermediate and heavy nuclei have been analyzed by a statistical procedure which is based on the method of maximum likelihood.
Journal ArticleDOI
Spectral redemption in clustering sparse networks
Florent Krzakala,Cristopher Moore,Elchanan Mossel,Joe Neeman,Allan Sly,Lenka Zdeborová,Pan Zhang +6 more
TL;DR: A way of encoding sparse data using a “nonbacktracking” matrix, and it is shown that the corresponding spectral algorithm performs optimally for some popular generative models, including the stochastic block model.
Journal ArticleDOI
Characterizing quantum supremacy in near-term devices
Sergio Boixo,Sergei V. Isakov,Vadim Smelyanskiy,Ryan Babbush,Nan Ding,Zhang Jiang,Michael J. Bremner,John M. Martinis,John M. Martinis,Hartmut Neven +9 more
TL;DR: In this paper, the authors proposed the task of sampling from the output distribution of random quantum circuits as a demonstration of quantum supremacy and showed that this sampling task must take exponential time in a classical computer.
Journal ArticleDOI
Simulating Quantum Computation by Contracting Tensor Networks
Igor L. Markov,Yaoyun Shi +1 more
TL;DR: It is proved that a quantum circuit with T gates whose underlying graph has a treewidth d can be simulated deterministically in T^{O(1)}\exp[O(d)]$ time, which, in particular, is polynomial in $T$ if d=O(\log T)$.
Related Papers (5)
Quantum supremacy using a programmable superconducting processor
Frank Arute,Kunal Arya,Ryan Babbush,Dave Bacon,Joseph C. Bardin,Joseph C. Bardin,Rami Barends,Rupak Biswas,Sergio Boixo,Fernando G. S. L. Brandão,Fernando G. S. L. Brandão,David A. Buell,B. Burkett,Yu Chen,Zijun Chen,Ben Chiaro,Roberto Collins,William Courtney,Andrew Dunsworth,Edward Farhi,Brooks Foxen,Brooks Foxen,Austin G. Fowler,Craig Gidney,Marissa Giustina,R. Graff,Keith Guerin,Steve Habegger,Matthew P. Harrigan,Michael J. Hartmann,Michael J. Hartmann,Alan Ho,Markus R. Hoffmann,Trent Huang,Travis S. Humble,Sergei V. Isakov,Evan Jeffrey,Zhang Jiang,Dvir Kafri,Kostyantyn Kechedzhi,Julian Kelly,Paul V. Klimov,Sergey Knysh,Alexander N. Korotkov,Alexander N. Korotkov,Fedor Kostritsa,David Landhuis,Mike Lindmark,E. Lucero,Dmitry I. Lyakh,Salvatore Mandrà,Jarrod R. McClean,Matt McEwen,Anthony Megrant,Xiao Mi,Kristel Michielsen,Kristel Michielsen,Masoud Mohseni,Josh Mutus,Ofer Naaman,Matthew Neeley,Charles Neill,Murphy Yuezhen Niu,Eric Ostby,Andre Petukhov,John Platt,Chris Quintana,Eleanor Rieffel,Pedram Roushan,Nicholas C. Rubin,Daniel Sank,Kevin J. Satzinger,Vadim Smelyanskiy,Kevin J. Sung,Kevin J. Sung,Matthew D. Trevithick,Amit Vainsencher,Benjamin Villalonga,Benjamin Villalonga,Theodore White,Z. Jamie Yao,Ping Yeh,Adam Zalcman,Hartmut Neven,John M. Martinis,John M. Martinis +85 more