Fetching the paper…
Reading the bibliography…
Sampling problems demonstrating beyond classical computing power with noisy intermediate scale quantum devices have been experimentally realized.
1907
Earlier work this paper cites.
G. D. Kahanamoku-Meyer, Forging quantum data: classically defeating an IQP-based quantum test, Quantum 7
1912
Earlier work this paper cites.
F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes (Elsevier, 1977)
1977
Earlier work this paper cites.
P. Shor, Algorithms for quantum computation: discrete logarithms and factoring, in Proceedings 35th Annual Symposium on Foundations of Computer Science (IEEE Comput. Soc. Press, 1994)
1994
Earlier work this paper cites.
L. K. Grover, A fast quantum mechanical algorithm for database search, in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC ’96 (ACM Press, Philadelphia, Pennsylvania, United States, 1996) pp. 212–219
1996
Earlier work this paper cites.
D. Vertigan, Bicycle Dimension and Special Points of the Tutte Polynomial, Journal of Combinatorial Theory, Series B 74
1998
Earlier work this paper cites.
D. Gottesman, The Heisenberg Representation of Quantum Computers, in Group22: Proceedings of the XXII International Colloquium on Group Theoretical Methods in Physics (Cambridge, MA, 1999) pp. 32–43, arXiv: quant-ph/9807006
1999
Earlier work this paper cites.
D. Gottesman and I. L. Chuang, Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations, Nature (London) 402
1999
Earlier work this paper cites.
S. Aaronson and D. Gottesman, Improved Simulation of Stabilizer Circuits, Phys. Rev. A 70
2004
Earlier work this paper cites.
2005
Earlier work this paper cites.
2005
Earlier work this paper cites.
2008
Earlier work this paper cites.
Y.-H. Kim and K. Seo, Two Congruence Classes for Symmetric Binary Matrices over F2, WSEAS Trans. Math. 7
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.
A. Broadbent, J. Fitzsimons, and E. Kashefi, Universal blind quantum computation, in 2009 50th Annual IEEE Symposium on Foundations of Computer Science (2009) pp. 517–526
2009
Earlier work this paper cites.
D. Shepherd and M. J. Bremner, Temporally unstructured quantum computation, Proc. R. Soc. A 465
2009
Cited alongside, same era.
2010
Cited alongside, same era.
D. Aharonov, M. Ben-Or, and E. Eban, Interactive Proofs For Quantum Computations, in The First Symposium on Innovations in Computer Science (ICS 2010) (Tsinghua University Press, Beijing, Beijing, China, 2010) pp. 453–469, arXiv: 0810.5375
2010
Cited alongside, same era.
2010
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
Later among the works it cites.
J. F. Fitzsimons, M. Hajdušek, and T. Morimae, Post hoc verification of quantum computation, Phys. Rev. Lett. 120
2018
Later among the works it cites.
U. Mahadev, Classical Verification of Quantum Computations, in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, Paris, 2018) pp. 259–267, arXiv: 1804.01082
2018
Later among the works it cites.
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) (IEEE, Paris, 2018) pp. 320–331, arXiv: 1804.00640
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
S. Aaronson and A. Arkhipov, The computational complexity of linear optics, in Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing , STOC ’11 (Association for Computing Machinery, New York, NY, USA, 2011) pp. 333–342
2011
Cited alongside, same era.
M. J. Bremner, R. Jozsa, and D. J. Shepherd, Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy, Proc. R. Soc. A 467
2011
Cited alongside, same era.
B. W. Reichardt, F. Unger, and U. Vazirani, Classical command of quantum systems, Nature 496
2013
Cited alongside, same era.
R. A. Pendavingh, On the evaluation at (-i,i) of the Tutte polynomial of a binary matroid, J. Algebr. Comb. 39
2014
Cited alongside, same era.
Z. Ji, Classical verification of quantum proofs, in Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing , STOC ’16 (Association for Computing Machinery, New York, NY, USA, 2016) pp. 885–898
2016
Cited alongside, same era.
M. J. Bremner, A. Montanaro, and D. J. Shepherd, Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations, Phys. Rev. Lett. 117
2016
Cited alongside, same era.
J. F. Fitzsimons and E. Kashefi, Unconditionally verifiable blind quantum computation, Physical Review A 96
2017
Cited alongside, same era.
H.-S. Zhong, H. Wang, Y.-H. Deng, M.-C. Chen, L.-C. Peng, Y.-H. Luo, J. Qin, D. Wu, X. Ding, 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, C.-Y. Lu, and J.-W. Pan, Quantum computational advantage using photons, Science 370
2020
Later among the works it cites.
R. Snoyman, A Proof of Quantumness (2020), honors thesis, UNSW
2020
Later among the works it cites.
Q. Zhu, S. Cao, F. Chen, M.-C. Chen, X. Chen, T.-H. Chung, H. Deng, Y. Du, D. Fan, M. Gong, C. Guo, C. Guo, S. Guo, L. Han, L. Hong, H.-L. Huang, Y.-H. Huo, L. Li, N. Li, S. Li, Y. Li, F. Liang, C. Lin, J. Lin, H. Qian, D. Qiao, H. Rong, H. Su, L. Sun, L. Wang, S. Wang, D. Wu, Y. Wu, Y. Xu, K. Yan, W. Yang, Y. Yang, Y. Ye, J. Yin, C. Ying, J. Yu, C. Zha, C. Zhang, H. Zhang, K. Zhang, Y. Zhang, H. Zhao, Y. Zhao, L. Zhou, C.-Y. Lu, C.-Z. Peng, X. Zhu, and J.-W. Pan, Quantum computational advantage via 60-qubit 24-cycle random circuit sampling, Science Bulletin , S2095927321006733 (2021)
2021
Later among the works it cites.
2021
Later among the works it cites.
R. L. Mann, Simulating quantum computations with Tutte polynomials, npj Quantum Inf 7
2021
Later among the works it cites.
X. Chen, B. Cheng, Z. Li, X. Nie, N. Yu, M.-H. Yung, and X. Peng, Experimental Cryptographic Verification for Near-Term Quantum Cloud Computing, Sci. Bull. 66
2021
Later among the works it cites.
G. D. Kahanamoku-Meyer, S. Choi, U. V. Vazirani, and N. Y. Yao, Classically verifiable quantum advantage from a computational Bell test, Nat. Phys. 18
2022
Later among the works it cites.
2023
Closest in time.
2023
Closest in time.
R. Movassagh, The hardness of random quantum circuits, Nat. Phys. 10.1038/s41567-023-02131-2 (2023)
2023
Closest in time.