Fetching the paper…
Reading the bibliography…
A central challenge in the verification of quantum computers is benchmarking their performance as a whole and demonstrating their computational capabilities.
1905
Earlier work this paper cites.
1905
Earlier work this paper cites.
R. Movassagh, Quantum Supremacy and Random Circuits , (2020), arXiv:1909.06210
1909
Earlier work this paper cites.
P. Erdös and A. Rényi, Probabilistic Methods in Group Theory , J. Anal. Math. 14
1965
Earlier work this paper cites.
P. Erdös and A. Rényi, Probabilistic Methods in Group Theory , J. Anal. Math. 14
1965
Earlier work this paper cites.
D. N. Page, Average Entropy of a Subsystem , Phys. Rev. Lett. 71
1993
Earlier work this paper cites.
D. N. Page, Average Entropy of a Subsystem , Phys. Rev. Lett. 71
1993
Earlier work this paper cites.
A. Barenco, A. Berthiaume, D. Deutsch, A. Ekert, R. Jozsa, and C. Macchiavello, Stabilisation of Quantum Computations by Symmetrisation , (1996), arXiv:quant-ph/9604028
1996
Earlier work this paper cites.
2005
Earlier work this paper cites.
2005
Earlier work this paper cites.
S. Aaronson, The Learnability of Quantum States , Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 463
2007
Earlier work this paper cites.
V. Mnih, C. Szepesvári, and J.-Y. Audibert, Empirical Bernstein Stopping , in Proceedings of the 25th International Conference on Machine Learning , ICML ’08 (Association for Computing Machinery, Helsinki, Finland, 2008) pp. 672–679
2008
Earlier work this paper cites.
V. Mnih, C. Szepesvári, and J.-Y. Audibert, Empirical Bernstein Stopping , in Proceedings of the 25th International Conference on Machine Learning , ICML ’08 (Association for Computing Machinery, Helsinki, Finland, 2008) pp. 672–679
2008
Earlier work this paper cites.
2009
Earlier work this paper cites.
S. Garnerone, T. R. de Oliveira, and P. Zanardi, Typicality in Random Matrix Product States , Phys. Rev. A 81
2010
Earlier work this paper cites.
M. B. Hastings, Locality in Quantum Systems , (2010), arXiv:1008.5137 [math-ph]
2010
Earlier work this paper cites.
S. Garnerone, T. R. de Oliveira, and P. Zanardi, Typicality in Random Matrix Product States , Phys. Rev. A 81
2010
Earlier work this paper cites.
M. B. Hastings, Locality in Quantum Systems , (2010), arXiv:1008.5137 [math-ph]
2010
Earlier work this paper cites.
S. T. Flammia and Y.-K. Liu, Direct Fidelity Estimation from Few Pauli Measurements , Phys. Rev. Lett. 106
2011
Earlier work this paper cites.
S. T. Flammia and Y.-K. Liu, Direct Fidelity Estimation from Few Pauli Measurements , Phys. Rev. Lett. 106
2011
Earlier work this paper cites.
S. Aaronson and A. Arkhipov, The Computational Complexity of Linear Optics , Th. Comp. 9
2013
Earlier work this paper cites.
B. W. Reichardt, F. Unger, and U. Vazirani, Classical Command of Quantum Systems , Nature 496
2013
Earlier work this paper cites.
B. Collins, C. E. Gonzalez-Guillen, and D. Perez-Garcia, Matrix Product States, Random Matrix Theory and the Principle of Maximum Entropy , Communications in Mathematical Physics 320
2013
Earlier work this paper cites.
B. W. Reichardt, F. Unger, and U. Vazirani, Classical Command of Quantum Systems , Nature 496
2013
Earlier work this paper cites.
B. Collins, C. E. Gonzalez-Guillen, and D. Perez-Garcia, Matrix Product States, Random Matrix Theory and the Principle of Maximum Entropy , Communications in Mathematical Physics 320
2013
Earlier work this paper cites.
M. J. Bremner, A. Montanaro, and D. J. Shepherd, Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations , Physical Review Letters 117
2016
Earlier work this paper cites.
J. J. Wallman and J. Emerson, Noise Tailoring for Scalable Quantum Computation via Randomized Compiling , Phys. Rev. A 94
2016
Earlier work this paper cites.
F. G. S. L. Brandão, A. W. Harrow, and M. Horodecki, Local Random Quantum Circuits Are Approximate Polynomial-Designs , Commun. Math. Phys. 346
2016
Earlier work this paper cites.
M. J. Bremner, A. Montanaro, and D. J. Shepherd, Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations , Physical Review Letters 117
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
F. G. S. L. Brandão, A. W. Harrow, and M. Horodecki, Local Random Quantum Circuits Are Approximate Polynomial-Designs , Commun. Math. Phys. 346
2016
Earlier work this paper cites.
J. J. Wallman and J. Emerson, Noise Tailoring for Scalable Quantum Computation via Randomized Compiling , Phys. Rev. A 94
2016
Earlier work this paper cites.
A. Montanaro, Learning Stabilizer States by Bell Sampling , (2017), arXiv:1707.04012
2017
Earlier work this paper cites.
A. Nahum, J. Ruhman, S. Vijay, and J. Haah, Quantum Entanglement Growth under Random Unitary Dynamics , Phys. Rev. X 7
2017
Earlier work this paper cites.
E. T. Campbell and M. Howard, A Unified Framework for Magic State Distillation and Multi-Qubit Gate-Synthesis with Reduced Resource Cost , Phys. Rev. A 95
2017
Earlier work this paper cites.
A. Bermudez, X. Xu, R. Nigmatullin, J. O’Gorman, V. Negnevitsky, P. Schindler, T. Monz, U. G. Poschinger, C. Hempel, J. Home, F. Schmidt-Kaler, M. Biercuk, R. Blatt, S. Benjamin, and M. Müller, Assessing the Progress of Trapped-Ion Processors Towards Fault-Tolerant Quantum Computation , Phys. Rev. X 7
2017
Cited alongside, same era.
J. F. Fitzsimons and E. Kashefi, Unconditionally Verifiable Blind Quantum Computation , Phys. Rev. A 96
2017
Cited alongside, same era.
J. F. Fitzsimons and E. Kashefi, Unconditionally Verifiable Blind Quantum Computation , Phys. Rev. A 96
2017
Cited alongside, same era.
A. Montanaro, Learning Stabilizer States by Bell Sampling , (2017), arXiv:1707.04012
2017
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 , Nature Phys 14
Y. Kondo, R. Mori, and R. Movassagh, Quantum Supremacy and Hardness of Estimating Output Probabilities of Quantum Circuits , in 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) (2022) pp. 1296–1307
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
C.-Y. Lai and H.-C. Cheng, Learning Quantum Circuits of Some $T$ Gates , IEEE Trans. Inform. Theory 68
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
S. J. Beale, J. J. Wallman, M. Gutiérrez, K. R. Brown, and R. Laflamme, Quantum Error Correction Decoheres Noise , Phys. Rev. Lett. 121
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
U. Mahadev, Classical Verification of Quantum Computations , in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (2018) pp. 259–267
2018
Cited alongside, same era.
U. Mahadev, Classical Verification of Quantum Computations , in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (2018) pp. 259–267
2018
Cited alongside, same era.
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, B. Burkett, Y. Chen, Z. Chen, B. Chiaro, R. Collins, W. Courtney, A. Dunsworth, E. Farhi, B. Foxen, A. Fowler, and others , Quantum Supremacy Using a Programmable Superconducting Processor , Nature 574
2019
Cited alongside, same era.
2022
Later among the works it cites.
H. Pashayan, O. Reardon-Smith, K. Korzekwa, and S. D. Bartlett, Fast Estimation of Outcome Probabilities for Quantum Circuits , PRX Quantum 3
2022
Later among the works it cites.
D. Bluvstein, H. Levine, G. Semeghini, T. T. Wang, S. Ebadi, M. Kalinowski, A. Keesling, N. Maskara, H. Pichler, M. Greiner, V. Vuletić, and M. D. Lukin, A Quantum Processor Based on Coherent Transport of Entangled Atom Arrays , Nature 604
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
A. M. Dalzell, N. Hunter-Jones, and F. G. S. L. Brandão, Random Quantum Circuits Anticoncentrate in Log Depth , PRX Quantum 3
2022
Later among the works it cites.
2022
Later among the works it cites.
A. M. Dalzell, N. Hunter-Jones, and F. G. S. L. Brandão, Random Quantum Circuits Anticoncentrate in Log Depth , PRX Quantum 3
2022
Later among the works it cites.
2022
Later among the works it cites.
D. Hangleiter and J. Eisert, Computational Advantage of Quantum Random Sampling , Rev. Mod. Phys. 95
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
T. Haug and M. Kim, Scalable Measures of Magic Resource for Quantum Computers , PRX Quantum 4
2023
Closest in time.
2023
Closest in time.
G. M. Sommers, D. A. Huse, and M. J. Gullans, Crystalline Quantum Circuits , PRX Quantum 4
2023
Closest in time.
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
Closest in time.
D. K. Mark, J. Choi, A. L. Shaw, M. Endres, and S. Choi, Benchmarking Quantum Simulators Using Ergodic Quantum Dynamics , Phys. Rev. Lett. 131
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
J. T. Iosue, A. Ehrenberg, D. Hangleiter, A. Deshpande, and A. V. Gorshkov, Page Curves and Typical Entanglement in Linear Optics , Quantum 7
2023
Closest in time.
D. Hangleiter and J. Eisert, Computational Advantage of Quantum Random Sampling , Rev. Mod. Phys. 95
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
G. M. Sommers, D. A. Huse, and M. J. Gullans, Crystalline Quantum Circuits , PRX Quantum 4
2023
Closest in time.
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
Closest in time.
2023
Closest in time.
J. T. Iosue, A. Ehrenberg, D. Hangleiter, A. Deshpande, and A. V. Gorshkov, Page Curves and Typical Entanglement in Linear Optics , Quantum 7
2023
Closest in time.
2023
Closest in time.
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
Closest in time.
D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. B. Ataides, N. Maskara, I. Cong, X. Gao, P. S. Rodriguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V. Vuletić, and M. D. Lukin, Logical Quantum Processor Based on Reconfigurable Atom Arrays , Nature 626
2024
Closest in time.