Fetching the paper…
Reading the bibliography…
Classical simulation of a programmable quantum processor is crucial in identifying the threshold of a quantum advantage.
1908
Earlier work this paper cites.
D. N. Page, Average entropy of a subsystem, Phys. Rev. Lett. 71
1993
Earlier work this paper cites.
S. K. Foong and S. Kanno, Proof of page’s conjecture on the average entropy of a subsystem, Phys. Rev. Lett. 72
1994
Earlier work this paper cites.
S. Sen, Average entropy of a quantum subsystem, Phys. Rev. Lett. 77
1996
Earlier work this paper cites.
T. Nishino, Y. Hieida, K. Okunishi, N. Maeshima, Y. Akutsu, and A. Gendiar, Two-dimensional tensor product variational formulation, Prog. Theor. Phys. 105
2001
Earlier work this paper cites.
N. Maeshima, Y. Hieida, Y. Akutsu, T. Nishino, and K. Okunishi, Vertical density matrix algorithm: A higher-dimensional numerical renormalization scheme based on the tensor product state ansatz, Phys. Rev. E 64
2001
Earlier work this paper cites.
G. Vidal, Efficient classical simulation of slightly entangled quantum computations, Phys. Rev. Lett. 91
2003
Earlier work this paper cites.
G. Vidal, Efficient simulation of one-dimensional quantum many-body systems, Phys. Rev. Lett. 93
2004
Earlier work this paper cites.
J. Berges, S. Borsányi, and C. Wetterich, Prethermalization, Phys. Rev. Lett. 93
2004
Earlier work this paper cites.
S. Bravyi and A. Kitaev, Universal quantum computation with ideal clifford gates and noisy ancillas, Phys. Rev. A 71
2005
Earlier work this paper cites.
G. Vidal, Classical simulation of infinite-size quantum lattice systems in one spatial dimension, Phys. Rev. Lett. 98
2007
Earlier work this paper cites.
N. Schuch, M. M. Wolf, F. Verstraete, and J. I. Cirac, Computational complexity of projected entangled pair states, Phys. Rev. Lett. 98
2007
Earlier work this paper cites.
V. M. F. Verstraete and J. Cirac, Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems, Adv. Phys. 57
2008
Earlier work this paper cites.
H. C. Jiang, Z. Y. Weng, and T. Xiang, Accurate determination of tensor network state of quantum lattice models in two dimensions, Phys. Rev. Lett. 101
2008
Earlier work this paper cites.
I. L. Markov and Y. Shi, Simulating quantum computation by contracting tensor networks, SIAM J. Comput. 38
2008
Earlier work this paper cites.
J. Jordan, R. Orús, G. Vidal, F. Verstraete, and J. I. Cirac, Classical simulation of infinite-size quantum lattice systems in two spatial dimensions, Phys. Rev. Lett. 101
2008
Earlier work this paper cites.
J. Eisert, M. Cramer, and M. B. Plenio, Colloquium: Area laws for the entanglement entropy, Rev. Mod. Phys. 82
2010
Earlier work this paper cites.
P. Corboz, R. Orús, B. Bauer, and G. Vidal, Simulation of strongly correlated fermions in two spatial dimensions with fermionic projected entangled-pair states, Phys. Rev. B 81
2010
Earlier work this paper cites.
U. Schollwöck, The density-matrix renormalization group in the age of matrix product states, Ann. Phys. (N.Y.) 326
2011
Earlier work this paper cites.
H. Kalis, D. Klagges, R. Orús, and K. P. Schmidt, Fate of the cluster state on the square lattice in a magnetic field, Phys. Rev. A 86
2012
Earlier work this paper cites.
S.-J. Ran, W. Li, B. Xi, Z. Zhang, and G. Su, Optimized decimation of tensor networks with super-orthogonalization for two-dimensional quantum lattice models, Phys. Rev. B 86
2012
Earlier work this paper cites.
W. Li, J. von Delft, and T. Xiang, Efficient simulation of infinite tree tensor network states on the bethe lattice, Phys. Rev. B 86
2012
Earlier work this paper cites.
S. Aaronson and A. Arkhipov, The computational complexity of linear optics, Theory Comput. 9
2013
Earlier work this paper cites.
M. Howard, J. Wallman, V. Veitch, and J. Emerson, Contextuality supplies the ‘magic’ for quantum computation, Nature 510
2014
Earlier work this paper cites.
R. Orús, A practical introduction to tensor networks: Matrix product states and projected entangled pair states, Ann. Phys. (N.Y.) 349
2014
Earlier work this paper cites.
H. N. Phien, I. P. McCulloch, and G. Vidal, Fast convergence of imaginary time evolution tensor network algorithms by recycling the environment, Phys. Rev. B 91
2015
Earlier work this paper cites.
M. Howard and E. Campbell, Application of a resource theory for magic states to fault-tolerant quantum computing, Phys. Rev. Lett. 118
2017
Earlier work this paper cites.
S. Yang, Z.-C. Gu, and X.-G. Wen, Loop optimization for tensor network renormalization, Phys. Rev. Lett. 118
2017
Cited alongside, same era.
B.-X. Zheng, C.-M. Chung, P. Corboz, G. Ehlers, M.-P. Qin, R. M. Noack, H. Shi, S. R. White, S. Zhang, and G. K.-L. Chan, Stripe order in the underdoped region of the two-dimensional hubbard model, Science 358
2017
Cited alongside, same era.
M. Hauru, C. Delcamp, and S. Mizera, Renormalization of tensor networks using graph-independent local truncations, Phys. Rev. B 97
2018
Cited alongside, same era.
S. Boixo, S. V. Isakov, V. N. Smelyanskiy, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven, Characterizing quantum supremacy in near-term devices, Nat. Phys. 14
2018
Cited alongside, same era.
F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. S. L. Brandao, D. A. Buell, et al. , Quantum supremacy using a programmable superconducting processor, Nature 574
A. Deshpande, P. Niroula, O. Shtanko, A. V. Gorshkov, B. Fefferman, and M. J. Gullans, Tight bounds on the convergence of noisy random circuits to the uniform distribution, PRX Quantum 3
2022
Later among the works it cites.
D. Hangleiter and J. Eisert, Computational advantage of quantum random sampling, Rev. Mod. Phys. 95
2023
Later among the works it cites.
T. Ayral, T. Louvet, Y. Zhou, C. Lambert, E. M. Stoudenmire, and X. Waintal, Density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity, PRX Quantum 4
2023
Later among the works it cites.
J. Choi, A. L. Shaw, I. S. Madjarov, X. Xie, R. Finkelstein, J. P. Covey, J. S. Cotler, D. K. Mark, H.-Y. Huang, A. Kale, H. Pichler, F. G. S. L. Brandão, S. Choi, and M. Endres, Preparing random states and benchmarking with many-body quantum chaos, Nature 613
2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
R. Orús, Tensor networks for complex quantum systems, Nat. Rev. Phys. 1
2019
Cited alongside, same era.
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, General-purpose quantum circuit simulator with projected entangled-pair states and the quantum supremacy frontier, Phys. Rev. Lett. 123
2019
Cited alongside, same era.
R. Haghshenas, M. J. O’Rourke, and G. K.-L. Chan, Conversion of projected entangled pair states into a canonical form, Phys. Rev. B 100
2019
Cited alongside, same era.
F. Pan, P. Zhou, S. Li, and P. Zhang, Contracting arbitrary tensor networks: General approximate algorithm and applications in graphical models and quantum circuit simulations, Phys. Rev. Lett. 125
2020
Cited alongside, same era.
Y. Zhou, E. M. Stoudenmire, and X. Waintal, What limits the simulation of quantum computers?, Phys. Rev. X 10
2020
Cited alongside, same era.
M. P. Zaletel and F. Pollmann, Isometric tensor network states in two dimensions, Phys. Rev. Lett. 124
2020
Cited alongside, same era.
T. Soejima, K. Siva, N. Bultinck, S. Chatterjee, F. Pollmann, and M. P. Zaletel, Isometric tensor network representation of string-net liquids, Phys. Rev. B 101
2020
Cited alongside, same era.
J. Tindall and M. Fishman, Gauging tensor networks with belief propagation, SciPost Phys. 15
2023
Later among the works it cites.
W. Kadow, F. Pollmann, and M. Knap, Isometric tensor network representations of two-dimensional thermal states, Phys. Rev. B 107
2023
Later among the works it cites.
Y. Kim, A. Eddins, S. Anand, K. X. Wei, E. van den Berg, S. Rosenblatt, H. Nayfeh, Y. Wu, M. Zaletel, K. Temme, and A. Kandala, Evidence for the utility of quantum computing before fault tolerance, Nature 618
2023
Later among the works it cites.
F. Pan, H. Gu, L. Kuang, B. Liu, and P. Zhang, Efficient quantum circuit simulation by tensor network methods on modern GPUs, ACM Trans. Quantum Comput. 5
2024
Later among the works it cites.
X.-H. Zhao, H.-S. Zhong, F. Pan, Z.-H. Chen, R. Fu, Z. Su, X. Xie, C. Zhao, P. Zhang, W. Ouyang, C.-Y. Lu, J.-W. Pan, and M.-C. Chen, Leapfrogging Sycamore: harnessing 1432 GPUs for 7× faster quantum random circuit sampling, Natl. Sci. Rev. 12
2024
Later among the works it cites.
A. Morvan, B. Villalonga, X. Mi, S. Mandrà, A. Bengtsson, P. V. Klimov, Z. Chen, S. Hong, C. Erickson, I. K. Drozdov, et al. , Phase transitions in random circuit sampling, Nature 634
2024
Later among the works it cites.
X. Gao, M. Kalinowski, C.-N. Chou, M. D. Lukin, B. Barak, and S. Choi, Limitations of linear cross-entropy as a measure for quantum advantage, PRX Quantum 5
2024
Later among the works it cites.
R.-Y. Sun, T. Shirakawa, and S. Yunoki, Improved real-space parallelizable matrix-product state compression and its application to unitary quantum dynamics simulation, Phys. Rev. B 110
2024
Later among the works it cites.
A. Sinha, M. M. Rams, and J. Dziarmaga, Efficient representation of minimally entangled typical thermal states in two dimensions via projected entangled pair states, Phys. Rev. B 109
2024
Later among the works it cites.
K. Homma, T. Okubo, and N. Kawashima, Nuclear norm regularized loop optimization for tensor network, Phys. Rev. Res. 6
2024
Later among the works it cites.
A. M. Dalzell, N. Hunter-Jones, and F. G. S. L. Brandão, Random quantum circuits transform local noise into global white noise, Commun. Math. Phys. 405
2024
Later among the works it cites.
A. L. Shaw, Z. Chen, J. Choi, D. K. Mark, P. Scholl, R. Finkelstein, A. Elben, S. Choi, and M. Endres, Benchmarking highly entangled states on a 60-atom analogue quantum simulator, Nature 628
2024
Later among the works it cites.
J. Tindall, M. Fishman, E. M. Stoudenmire, and D. Sels, Efficient tensor network simulation of IBM’s eagle kicked ising experiment, PRX Quantum 5
2024
Later among the works it cites.
T. Begušić, J. Gray, and G. K.-L. Chan, Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance, Sci. Adv. 10
2024
Later among the works it cites.
S. Patra, S. S. Jahromi, S. Singh, and R. Orús, Efficient tensor network simulation of IBM’s largest quantum processors, Phys. Rev. Res. 6
2024
Later among the works it cites.
A. Paviglianiti, G. Lami, M. Collura, and A. Silva, Estimating nonstabilizerness dynamics without simulating it, PRX Quantum 6
2025
Closest in time.
M. DeCross, R. Haghshenas, M. Liu, E. Rinaldi, J. Gray, Y. Alexeev, C. H. Baldwin, J. P. Bartolotta, M. Bohn, E. Chertkov, et al. , Computational power of random quantum circuits in arbitrary geometries, Phys. Rev. X 15
2025
Closest in time.
2025
Closest in time.
D. Gao, D. Fan, C. Zha, J. Bei, G. Cai, J. Cai, S. Cao, F. Chen, J. Chen, K. Chen, et al. , Establishing a new benchmark in quantum computational advantage with 105-qubit zuchongzhi 3.0 processor, Phys. Rev. Lett. 134
2025
Closest in time.
M. McGinley, W. W. Ho, and D. Malz, Measurement-induced entanglement and complexity in random constant-depth 2d quantum circuits, Phys. Rev. X 15
2025
Closest in time.
D. A. Puente, E. L. Weerda, K. Schröder, and M. Rizzi, Efficient optimization and conceptual barriers in variational finite projected entangled pair states, Phys. Rev. B 111
2025
Closest in time.
G. Lami, J. De Nardis, and X. Turkeshi, Anticoncentration and state design of random tensor networks, Phys. Rev. Lett. 134
2025
Closest in time.