Fetching the paper…
Reading the bibliography…
Quantum computers are now on the brink of outperforming their classical counterparts.
1910
Earlier work this paper cites.
1910
Earlier work this paper cites.
L. Stockmeyer, The Complexity of Approximate Counting , in Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (ACM, 1983) pp. 118–126
1983
Earlier work this paper cites.
C. Fuchs and J. van de Graaf, Cryptographic Distinguishability Measures for Quantum-Mechanical States , IEEE Transactions on Information Theory 45
1999
Earlier work this paper cites.
R. Raussendorf and H. J. Briegel, A one-way quantum computer , Phys. Rev. Lett. 86
2001
Earlier work this paper cites.
R. Raussendorf, D. E. Browne, and H. J. Briegel, Measurement-Based Quantum Computation on Cluster States , Phys. Rev. A 68
2003
Earlier work this paper cites.
2005
Earlier work this paper cites.
A. M. Childs, D. W. Leung, and M. A. Nielsen, Unified Derivations of Measurement-Based Schemes for Quantum Computation , Phys. Rev. A 71
2005
Earlier work this paper cites.
G. Kirchmair, J. Benhelm, F. Zähringer, R. Gerritsma, C. F. Roos, and R. Blatt, Deterministic Entanglement of Ions in Thermal States of Motion , New J. Phys. 11
2009
Earlier work this paper cites.
M. Cramer, M. B. Plenio, S. T. Flammia, R. Somma, D. Gross, S. D. Bartlett, O. Landon-Cardinal, D. Poulin, and Y.-K. Liu, Efficient Quantum State Tomography , Nat. Commun. 1
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.
2012
Earlier work this paper cites.
2012
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. P. Lanyon, P. Jurcevic, M. Zwerger, C. Hempel, E. A. Martinez, W. Dür, H. J. Briegel, R. Blatt, and C. F. Roos, Measurement-Based Quantum Computation with Trapped Ions , Phys. Rev. Lett. 111
2013
Earlier work this paper cites.
P. Schindler, D. Nigg, T. Monz, J. T. Barreiro, E. Martinez, S. X. Wang, Stephan Quint, M. F. Brandl, V. Nebendahl, C. F. Roos, M. Chwalla, M. Hennrich, and Rainer Blatt, A Quantum Information Processor with Trapped Ions , New J. Phys. 15
2013
Earlier work this paper cites.
L. Aolita, C. Gogolin, M. Kliesch, and J. Eisert, Reliable Quantum Certification of Photonic State Preparations , Nat. Comm. 6
2015
Earlier work this paper cites.
M. J. Bremner, A. Montanaro, and D. J. Shepherd, Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations , Phys. Rev. Lett. 117
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.
S. Aaronson and L. Chen, Complexity-Theoretic Foundations of Quantum Supremacy Experiments , in 32nd Computational Complexity Conference (CCC 2017) , Leibniz International Proceedings in Informatics (LIPIcs), Vol. 79, edited by R. O’Donnell (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2017) pp. 22:1–22:67
2017
Earlier work this paper cites.
X. Gao, S.-T. Wang, and L.-M. Duan, Quantum Supremacy for Simulating a Translation-Invariant Ising Spin Model , Phys. Rev. Lett. 118
2017
Earlier work this paper cites.
D. Hangleiter, M. Kliesch, M. Schwarz, and J. Eisert, Direct Certification of a Class of Quantum Simulations , Quantum Sci. Technol. 2
2017
Earlier work this paper cites.
A. Mantri, T. F. Demarie, and J. F. Fitzsimons, Universality of Quantum Computation with Cluster States and (X, Y)-Plane Measurements , Sci Rep 7
2017
Earlier work this paper cites.
D. Hangleiter, M. Kliesch, M. Schwarz, and J. Eisert, Direct Certification of a Class of Quantum Simulations , Quantum Sci. Technol. 2
2017
Earlier work this paper cites.
K. Fujii and T. Morimae, Commuting Quantum Circuits and Complexity of Ising Partition Functions , New J. Phys. 19
2017
Cited alongside, same era.
S. Aaronson and L. Chen, Complexity-Theoretic Foundations of Quantum Supremacy Experiments , in 32nd Computational Complexity Conference (CCC 2017) , Leibniz International Proceedings in Informatics (LIPIcs), Vol. 79, edited by R. O’Donnell (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2017) pp. 22:1–22:67
2017
Cited alongside, same era.
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 , Nat. Phys 14
2018
Cited alongside, same era.
2021
Later among the works it cites.
H.-S. Zhong, Y.-H. Deng, J. Qin, H. Wang, M.-C. Chen, L.-C. Peng, Y.-H. Luo, D. Wu, S.-Q. Gong, H. Su, Y. Hu, P. Hu, X.-Y. Yang, W.-J. Zhang, H. Li, Y. Li, X. Jiang, L. Gan, G. Yang, L. You, Z. Wang, L. Li, N.-L. Liu, J. J. Renema, C.-Y. Lu, and J.-W. Pan, Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light , Phys. Rev. Lett. 127
2021
Later among the works it cites.
I. Pogorelov, T. Feldker, C. 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.
U. Chabaud, F. Grosshans, E. Kashefi, and D. Markham, Efficient Verification of Boson Sampling , Quantum 5
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Z. Brakerski, P. Christiano, U. Mahadev, U. Vazirani, and T. Vidick, A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device , in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (2018) pp. 320–331
2018
Cited alongside, same era.
U. M. Mahadev, Classical Verification and Blind Delegation of Quantum Computations , Ph.D. thesis, University of California, Berkeley (2018)
2018
Cited alongside, same era.
J. Bermejo-Vega, D. Hangleiter, M. Schwarz, R. Raussendorf, and J. Eisert, Architectures for Quantum Simulation Showing a Quantum Speedup , Phys. Rev. X 8
2018
Cited alongside, same era.
J. Bermejo-Vega, D. Hangleiter, M. Schwarz, R. Raussendorf, and J. Eisert, Architectures for Quantum Simulation Showing a Quantum Speedup , Phys. Rev. X 8
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.
D. Hangleiter, J. Bermejo-Vega, M. Schwarz, and J. Eisert, Anticoncentration Theorems for Schemes Showing a Quantum Speedup , Quantum 2
2018
Cited alongside, same era.
A. Bouland, B. Fefferman, C. Nirkhe, and U. Vazirani, On the Complexity and Verification of Quantum Random Circuit Sampling , Nat. Phys 15
2019
Cited alongside, same era.
F. Arute et al. , Quantum Supremacy Using a Programmable Superconducting Processor , Nature 574
2019
Cited alongside, same era.
2021
Later among the works it cites.
F. Pan, K. Chen, and P. Zhang, Solving the Sampling Problem of the Sycamore Quantum Circuits , Phys. Rev. Lett. 129
2022
Later among the works it cites.
Q. Zhu et al. , Quantum Computational Advantage via 60-Qubit 24-Cycle Random Circuit Sampling , Science Bulletin 67
2022
Later among the works it cites.
L. S. Madsen, F. Laudenbach, M. F. Askarani, F. Rortais, T. Vincent, J. F. F. Bulmer, F. M. Miatto, L. Neuhaus, L. G. Helt, M. J. Collins, A. E. Lita, T. Gerrits, S. W. Nam, V. D. Vaidya, M. Menotti, I. Dhand, Z. Vernon, N. Quesada, and J. Lavoie, Quantum Computational Advantage with a Programmable Photonic Processor , Nature 606
2022
Later among the works it cites.
M. Ringbauer, M. Meth, L. Postler, R. Stricker, R. Blatt, P. Schindler, and T. Monz, A Universal Qudit Quantum Processor with Trapped Ions , Nat. Phys. 18
2022
Later among the works it cites.
K. Tiurev and A. S. Sørensen, Fidelity Measurement of a Multiqubit Cluster State with Minimal Effort , Phys. Rev. Res. 4
2022
Later among the works it cites.
2022
Later among the works it cites.
Q. Zhu et al. , Quantum Computational Advantage via 60-Qubit 24-Cycle Random Circuit Sampling , Science Bulletin 67
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.
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.
2023
Closest in time.
D. Zhu, G. D. Kahanamoku-Meyer, L. Lewis, C. Noel, O. Katz, B. Harraz, Q. Wang, A. Risinger, L. Feng, D. Biswas, L. Egan, A. Gheorghiu, Y. Nam, T. Vidick, U. Vazirani, N. Y. Yao, M. Cetina, and C. Monroe, Interactive Protocols for Classically-Verifiable Quantum Advantage , Nat. Phys 19
2023
Closest in time.
D. Aharonov, X. Gao, Z. Landau, Y. Liu, and U. Vazirani, A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling , in Proceedings of the 55th Annual ACM Symposium on Theory of Computing (2023) pp. 945–957
2023
Closest in time.
Qiskit contributors, Qiskit: An Open-source Framework for Quantum Computing , (2023)
2023
Closest in time.
D. Hangleiter and J. Eisert, Computational Advantage of Quantum Random Sampling , Rev. Mod. Phys. 95
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.
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.
R. Stricker, J. Carrasco, M. Ringbauer, L. Postler, M. Meth, C. Edmunds, P. Schindler, R. Blatt, P. Zoller, B. Kraus, and T. Monz, Towards Experimental Classical Verification of Quantum Computation , Quantum Sci. Tech. 9
2024
Closest in time.
2024
Closest in time.
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
Closest in time.