Fetching the paper…
Reading the bibliography…
It is believed that random quantum circuits are difficult to simulate classically.
Density matrix formulation for quantum renormalization groups
Steven R White · 1992
Earlier work this paper cites.
Efficient classical simulation of slightly entangled quantum computations
Guifré Vidal · 2003
Earlier work this paper cites.
The density-matrix renormalization group
Ulrich Schollwöck · 2005
Earlier work this paper cites.
Classical simulation of infinite-size quantum lattice systems in one spatial dimension
Guifré Vidal · 2007
Earlier work this paper cites.
Simulating quantum computation by contracting tensor networks
Igor L Markov and Yaoyun Shi · 2008
Earlier work this paper cites.
Quantum computing and the entanglement frontier
John Preskill · 2012
Earlier work this paper cites.
Efficient algorithms for maximum likelihood decoding in the surface code
Sergey Bravyi, Martin Suchara, and Alexander Vargo · 2014
Earlier work this paper cites.
Tensor networks and quantum error correction
Andrew J Ferris and David Poulin · 2014
Earlier work this paper cites.
k-way hypergraph partitioning via n -level recursive bisection
Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, and Christian Schulz · 2016
Earlier work this paper cites.
Complexity-theoretic foundations of quantum supremacy experiments
Scott Aaronson and Lijie Chen · 2017
Earlier work this paper cites.
0.5 petabyte simulation of a 45-qubit quantum circuit
Thomas Häner and Damian S Steiger · 2017
Earlier work this paper cites.
Breaking the 49-qubit barrier in the simulation of quantum circuits
Edwin Pednault, John A Gunnels, Giacomo Nannicini, Lior Horesh, Thomas Magerlein, Edgar Solomonik, Erik W Draeger, Eric T Holland, and Robert Wisnieff · 2017
Cited alongside, same era.
Engineering a direct k -way hypergraph partitioning algorithm
Yaroslav Akhremtsev, Tobias Heuer, Peter Sanders, and Sebastian Schlag · 2017
Cited alongside, same era.
Characterizing quantum supremacy in near-term devices
Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael J Bremner, John M Martinis, and Hartmut Neven · 2018
Cited alongside, same era.
Statistical mechanical models for quantum codes with correlated noise
Christopher T Chubb and Steven T Flammia · 2018
Cited alongside, same era.
Quantum supremacy is both closer and farther than it appears
Leveraging secondary storage to simulate deep 54-qubit sycamore circuits
Edwin Pednault, John A Gunnels, Giacomo Nannicini, Lior Horesh, and Robert Wisnieff · 2019
Later among the works it cites.
Alibaba cloud quantum development platform: Large-scale classical simulation of quantum circuits
Fang Zhang, Cupjin Huang, Michael Newman, Junjie Cai, Huanjun Yu, Zhengxiong Tian, Bo Yuan, Haihong Xu, Junyin Wu, Xun Gao, Jianxin Chen, Mario Szegedy, and Yaoyun Shi · 2019
Later among the works it cites.
Quantum supremacy using a programmable superconducting processor
Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando GSL Brandao, David A Buell, et al · 2019
Later among the works it cites.
Alibaba cloud quantum development platform: Applications to quantum algorithm design
Cupjin Huang, Mario Szegedy, Fang Zhang, Xun Gao, Jianxin Chen, and Yaoyun Shi · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Igor L Markov, Aneeqa Fatima, Sergei V Isakov, and Sergio Boixo · 2018
Cited alongside, same era.
Classical simulation of intermediate-size quantum circuits
Jianxin Chen, Fang Zhang, Cupjin Huang, Michael Newman, and Yaoyun Shi · 2018
Cited alongside, same era.
Nvidia tensor core programmability, performance & precision
Stefano Markidis, Steven Wei Der Chien, Erwin Laure, Ivy Bo Peng, and Jeffrey S Vetter · 2018
Cited alongside, same era.
On the complexity and verification of quantum random circuit sampling
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani · 2019
Cited alongside, same era.
On the classical hardness of spoofing linear cross-entropy benchmarking
Scott Aaronson and Sam Gunn · 2019
Cited alongside, same era.
Quantum supremacy using a programmable superconducting processor
Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando GSL Brandao, David A Buell, et al · 2019
Cited alongside, same era.
A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
Benjamin Villalonga, Sergio Boixo, Bron Nelson, Christopher Henze, Eleanor Rieffel, Rupak Biswas, and Salvatore Mandrà · 2019
Cited alongside, same era.
Parameterization of tensor network contraction
Bryan O’Gorman · 2019
Later among the works it cites.
Nikolaus Hansen, Youhei Akimoto, and Petr Baudis · 2019
Later among the works it cites.
Boundaries of quantum supremacy via random circuit sampling
Alexander Zlokapa, Sergio Boixo, and Daniel Lidar · 2020
Closest in time.
Hyper-optimized tensor network contraction
Johnnie Gray and Stefanos Kourtis · 2020
Closest in time.
Alibaba cloud quantum development platform: Surface code simulations with crosstalk
Cupjin Huang, Xiaotong Ni, Fang Zhang, Michael Newman, Dawei Ding, Xun Gao, Tenghui Wang, Hui-Hai Zhao, Feng Wu, Gengyan Zhang, Chunqing Deng, Hsiang-Sheng Ku, Jianxin Chen, and Yaoyun Shi · 2020
Closest in time.
Simple heuristics for efficient parallel tensor contraction and quantum circuit simulation
Roman Schutski, Dmitry Kolmakov, Taras Khakhulin, and Ivan Oseledets · 2020
Closest in time.