Fetching the paper…
Reading the bibliography…
The quantum advantage threshold determines when a quantum processing unit (QPU) is more efficient with respect to classical computing hardware in terms of algorithmic complexity.
Vladimir Alexandrovich Marchenko and Leonid Andreevich Pastur, “Distribution of eigenvalues for some sets of random matrices,” Matematicheskii Sbornik 114
1967
Earlier work this paper cites.
G. Lindblad, “On the generators of quantum dynamical semigroups,” Communications in Mathematical Physics 48
1976
Earlier work this paper cites.
Ethan Bernstein and Umesh Vazirani, “Quantum complexity theory,” in Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing , STOC ’93 (Association for Computing Machinery, New York, NY, USA, 1993) p. 11–20
1993
Earlier work this paper cites.
G. H. Golub and C. F. Van Loan, Matrix Computations , 3rd ed., Johns Hopkins Studies in Mathematical Sciences (The Johns Hopkins University Press, Baltimore, MD, 1996)
1996
Earlier work this paper cites.
Guifré Vidal, “Efficient classical simulation of slightly entangled quantum computations,” Phys. Rev. Lett. 91
2003
Earlier work this paper cites.
Wu-Chun Feng, “Making a case for efficient supercomputing: It is time for the computing community to use alternative metrics for evaluating performance.” Queue 1
2003
Earlier work this paper cites.
Jack J. Dongarra, Piotr Luszczek, and Antoine Petitet, “The LINPACK benchmark: past, present and future,” Concurrency and Computation: Practice and Experience 15
2003
Earlier work this paper cites.
Michael A. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information , 9th ed. (Cambridge Univ. Press, Cambridge, United Kingdom, 2007)
2007
Earlier work this paper cites.
Heinz-Peter Breuer and Francesco Petruccione, The Theory of Open Quantum Systems , 1st ed. (Clarendon Press, Oxford, 2009) pp. XXI, 613 S
2009
Earlier work this paper cites.
J. Eisert, M. Cramer, and M. B. Plenio, “ Colloquium
2010
Earlier work this paper cites.
Scott Hemmert, “Green hpc: From nice to necessity,” Computing in Science & Engineering 12
2010
Earlier work this paper cites.
Ulrich Schollwöck, “The density-matrix renormalization group in the age of matrix product states,” Annals of Physics 326
2011
Earlier work this paper cites.
Olli Mämmelä, Mikko Majanen, Robert Basmadjian, Hermann De Meer, André Giesler, and Willi Homberg, “Energy-aware job scheduler for high-performance computing,” Computer Science-Research and Development 27
2012
Earlier work this paper cites.
Román Orús, “A practical introduction to tensor networks: Matrix product states and projected entangled pair states,” Annals of Physics 349
2014
Earlier work this paper cites.
Andrew J. Daley, “Quantum trajectories and open many-body quantum systems,” Advances in Physics 63
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
Rami Barends, Julian Kelly, Anthony Megrant, Andrzej Veitia, Daniel Sank, Evan Jeffrey, Ted C White, Josh Mutus, Austin G Fowler, Brooks Campbell, et al. , “Superconducting quantum circuits at the surface code threshold for fault tolerance,” Nature 508
2014
Earlier work this paper cites.
Dong-Joon Lim, Timothy R. Anderson, and Tom Shott, “Technological forecasting of supercomputer development: The march to exascale computing,” Omega 51
2015
Earlier work this paper cites.
Thomas Häner and Damian S. Steiger, “0.5 petabyte simulation of a 45-qubit quantum circuit,” in Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis , SC ’17 (ACM, New York, NY, USA, 2017) pp. 33:1–33:10
2017
Earlier work this paper cites.
Joni Ikonen, Juha Salmilehto, and Mikko Möttönen, “Energy-efficient quantum computing,” npj Quantum Information 3
2017
Cited alongside, same era.
Thorsten Kurth, Sean Treichler, Joshua Romero, Mayur Mudigonda, Nathan Luehr, Everett Phillips, Ankur Mahesh, Michael Matheson, Jack Deslippe, Massimiliano Fatica, Prabhat Prabhat, and Michael Houston, “Exascale deep learning for climate analytics,” in SC18: International Conference for High Performance Computing, Networking, Storage and Analysis (2018) pp. 649–660
2018
Cited alongside, same era.
Martin Suchara, Yuri Alexeev, Frederic Chong, Hal Finkel, Henry Hoffmann, Jeffrey Larson, James Osborn, , and Graeme Smith, “Hybrid quantum-classical computing architectures,” in Proceedings of the 3rd International Workshop on Post-Moore Era Supercomputing, 2018. (2018)
2018
Cited alongside, same era.
John Preskill, “Quantum Computing in the NISQ era and beyond,” Quantum 2
2018
Cited alongside, same era.
Qiskit developers, “Qiskit: An open-source framework for quantum computing,” (2021)
2021
Later among the works it cites.
2021
Later among the works it cites.
Marco Ballarin, Quantum Computer Simulation via Tensor Networks , Master’s thesis , Università degli Studi di Padova (2021)
2021
Later among the works it cites.
“Green500 lists,” Last visited: 6/7/2021
2021
Later among the works it cites.
F. Meinert, T. Pfau, and C. Hölzl, “Quantum computing device, use, and method,” (2021), EU Patent Application No. EP20214187.5
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Daniel Jaschke and Lincoln D. Carr, “Open source matrix product states: exact diagonalization and other entanglement-accurate methods revisited in quantum systems,” Journal of Physics A: Mathematical and Theoretical 51
2018
Cited alongside, same era.
Simone Montangero, Introduction to Tensor Network Methods (Springer, 2018)
2018
Cited alongside, same era.
Daniel Jaschke, Simone Montangero, and Lincoln D. Carr, “One-dimensional many-body entangled open quantum systems with tensor network methods,” Quantum Science and Technology 4
2018
Cited alongside, same era.
2019
Cited alongside, same era.
Benjamin Villalonga, Sergio Boixo, Bron Nelson, Christopher Henze, Eleanor Rieffel, Rupak Biswas, and Salvatore Mandrà, “A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware,” npj Quantum Information 5
2019
Cited alongside, same era.
Kenneth Wright, Kristin M Beck, Sea Debnath, JM Amini, Y Nam, N Grzesiak, J-S Chen, NC Pisenti, M Chmielewski, C Collins, K. M. Hudek, J. Mizrahi, J. D. Wong-Campos, S. Allen, J. Apisdorf, P. Solomon, M. Williams, A. M. Ducore, A. Blinov, S. M. Kreikemeier, V. Chaplin, M. Keesan, C. Monroe, and J. Kim, “Benchmarking an 11-qubit quantum computer,” Nature communications 10
2019
Cited alongside, same era.
Harry Levine, Alexander Keesling, Giulia Semeghini, Ahmed Omran, Tout T. Wang, Sepehr Ebadi, Hannes Bernien, Markus Greiner, Vladan Vuletić, Hannes Pichler, and Mikhail D. Lukin, “Parallel implementation of high-fidelity multiqubit gates with neutral atoms,” Phys. Rev. Lett. 123
2019
Cited alongside, same era.
Benjamin Villalonga, Dmitry Lyakh, Sergio Boixo, Hartmut Neven, Travis S Humble, Rupak Biswas, Eleanor G Rieffel, Alan Ho, and Salvatore Mandrà, “Establishing the quantum supremacy frontier with a 281 pflop/s simulation,” Quantum Science and Technology 5
2020
Cited alongside, same era.
Alice Pagano, Optimal quantum gates for Rydberg atoms quantum computer , Master’s thesis , Università degli Studi di Padova (2021)
2021
Later among the works it cites.
I. Pogorelov, T. Feldker, Ch. D. Marciniak, L. Postler, G. Jacob, O. Krieglsteiner, V. Podlesnic, M. Meth, V. Negnevitsky, M. Stadler, B. Höfer, C. Wächter, K. Lakhmanskiy, R. Blatt, P. Schindler, and T. Monz, “Compact ion-trap quantum computing demonstrator,” PRX Quantum 2
2021
Later among the works it cites.
2021
Later among the works it cites.
Xiaoling Wu, Xinhui Liang, Yaoqi Tian, Fan Yang, Cheng Chen, Yong-Chun Liu, Meng Khoon Tey, and Li You, “A concise review of Rydberg atom based quantum computation and quantum simulation,” Chinese Physics B 30
2021
Later among the works it cites.
2021
Later among the works it cites.
Alexia Auffèves, “Quantum technologies need a quantum energy initiative,” PRX Quantum 3
2022
Closest in time.
Alexandru Paler and Robert Basmadjian, “Energy cost of quantum circuit optimisation: Predicting that optimising Shor’s algorithm circuit uses 1 GWh,” ACM Transactions on Quantum Computing 3
2022
Closest in time.
Jacob F. F. Bulmer, Bryn A. Bell, Rachel S. Chadwick, Alex E. Jones, Diana Moise, Alessandro Rigazzi, Jan Thorbecke, Utz-Uwe Haus, Thomas Van Vaerenbergh, Raj B. Patel, Ian A. Walmsley, and Anthony Laing, “The boundary for quantum advantage in Gaussian boson sampling,” Science Advances 8
2022
Closest in time.
Feng Pan, Keyang Chen, and Pan Zhang, “Solving the sampling problem of the sycamore quantum circuits,” Phys. Rev. Lett. 129
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
John Brennan, Lee O’Riordan, Kenneth Hanley, Myles Doyle, Momme Allalen, David Brayford, Luigi Iapichino, and Niall Moran, “Qxtools: A julia framework for distributed quantum circuit simulation,” Journal of Open Source Software 7
2022
Closest in time.
Alice Pagano, Sebastian Weber, Daniel Jaschke, Tilman Pfau, Florian Meinert, Simone Montangero, and Hans Peter Büchler, “Error budgeting for a controlled-phase gate with strontium-88 Rydberg atoms,” Phys. Rev. Research 4
2022
Closest in time.