Fetching the paper…
Reading the bibliography…
Achieving quantum computational advantage requires solving a classically intractable problem on a quantum device.
J. S. Bell, “On the Einstein Podolsky Rosen paradox,” Physics 1
1964
Earlier work this paper cites.
J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, “Proposed experiment to test local hidden-variable theories,” Physical review letters 23
1969
Earlier work this paper cites.
M. O. Rabin, “Digitalized signatures and public-key functions as intractable as factorization,” Technical Report (Massachusetts Institute of Technology, USA, 1979)
1979
Earlier work this paper cites.
S. Goldwasser, S. Micali, and R. L. Rivest, “A “paradoxical” solution to the signature problem,” in Advances in Cryptology, Proceedings of CRYPTO ’84, Santa Barbara, California, USA, August 19-22, 1984, Proceedings (1984) p. 467
1984
Earlier work this paper cites.
S. Goldwasser, S. Micali, and R. L. Rivest, “A digital signature scheme secure against adaptive chosen-message attacks,” SIAM Journal on computing 17
1988
Earlier work this paper cites.
S. Goldwasser, S. Micali, and C. Rackoff, “The Knowledge Complexity of Interactive Proof Systems,” SIAM Journal on Computing 18
1989
Earlier work this paper cites.
C. Lund, L. Fortnow, H. Karloff, and N. Nisan, “Algebraic methods for interactive proof systems,” in Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science (1990) pp. 2–10 vol.1
1990
Earlier work this paper cites.
A. Shamir, “IP = PSPACE,” Journal of the ACM 39
1992
Earlier work this paper cites.
K. Mølmer and A. Sørensen, “Multiparticle entanglement of hot trapped ions,” Phys. Rev. Lett. 82
1999
Earlier work this paper cites.
E. Solano, R. L. de Matos Filho, and N. Zagury, “Deterministic bell states and measurement of the motional state of two trapped ions,” Phys. Rev. A 59
1999
Earlier work this paper cites.
G. Milburn, S. Schneider, and D. James, “Ion trap quantum computing with warm ions,” Fortschritte der Physik 48
2000
Earlier work this paper cites.
D. Kielpinski, C. Monroe, and D. J. Wineland, “Architecture for a large-scale ion-trap quantum computer,” Nature 417
2002
Earlier work this paper cites.
J. Gray and S. Kourtis, “Hyper-optimized tensor network contraction,” Quantum 5
2002
Earlier work this paper cites.
2005
Earlier work this paper cites.
S. Olmschenk, K. C. Younge, D. L. Moehring, D. N. Matsukevich, P. Maunz, and C. Monroe, “Manipulation and detection of a trapped yb + {\mathrm{yb}}^{+} hyperfine qubit,” Phys. Rev. A 76
2007
Earlier work this paper cites.
O. Regev, “On lattices, learning with errors, random linear codes, and cryptography,” Journal of the ACM (JACM) 56
2009
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information , 10th ed. (Cambridge University Press, Cambridge ; New York, 2010)
2010
Earlier work this paper cites.
D. Aharonov, M. Ben-Or, and E. Eban, “Interactive Proofs For Quantum Computations,” (2010) pp. 453–469
2010
Earlier work this paper cites.
O. Regev, “The learning with errors problem,” Invited survey in CCC 7
2010
Earlier work this paper cites.
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
Earlier work this paper cites.
R. Lindner and C. Peikert, “Better Key Sizes (and Attacks) for LWE-Based Encryption,” in Topics in Cryptology – CT-RSA 2011 , Lecture Notes in Computer Science, edited by A. Kiayias (Springer, Berlin, Heidelberg, 2011) pp. 319–339
2011
Earlier work this paper cites.
A. Banerjee, C. Peikert, and A. Rosen, “Pseudorandom functions and lattices,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques (Springer, 2012) pp. 719–737
2012
Cited alongside, same era.
J. Alwen, S. Krenn, K. Pietrzak, and D. Wichs, “Learning with rounding, revisited,” in Annual Cryptology Conference (Springer, 2013) pp. 57–74
2013
Cited alongside, same era.
T. Choi, S. Debnath, T. A. Manning, C. Figgatt, Z.-X. Gong, L.-M. Duan, and C. Monroe, “Optimal quantum control of multimode couplings between trapped ion qubits for scalable entanglement,” Phys. Rev. Lett. 112
2014
Cited alongside, same era.
S. Debnath, N. M. Linke, C. Figgatt, K. A. Landsman, K. Wright, and C. Monroe, “Demonstration of a small programmable quantum computer with atomic qubits,” Nature 536
2016
Cited alongside, same era.
P. L. W. Maunz, “High optical access trap 2.0.” (2016), 10.2172/1237003
2021
Closest in time.
W. K. Hensinger, “Quantum computer based on shuttling trapped ions,” (2021)
2021
Closest in time.
J. M. Pino, J. M. Dreiling, C. Figgatt, J. P. Gaebler, S. A. Moses, M. Allman, C. Baldwin, M. Foss-Feig, D. Hayes, K. Mayer, et al. , “Demonstration of the trapped-ion quantum ccd computer architecture,” Nature 592
2021
Closest in time.
2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
A. P. Lund, M. J. Bremner, and T. C. Ralph, “Quantum sampling problems, bosonsampling and quantum supremacy,” npj Quantum Information 3
2017
Cited alongside, same era.
A. W. Harrow and A. Montanaro, “Quantum computational supremacy,” Nature 549
2017
Cited alongside, same era.
U. Mahadev, “Classical verification of quantum computations,” in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, 2018) pp. 259–267
2018
Cited alongside, same era.
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, 2018) pp. 320–331
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,” Nature Physics 14
2018
Cited alongside, same era.
Y. Li, X. Chen, and M. P. Fisher, “Quantum zeno effect and the many-body entanglement transition,” Physical Review B 98
2018
Cited alongside, same era.
I. Cong, S. Choi, and M. D. Lukin, “Quantum convolutional neural networks,” Nature Physics 15
2019
Cited alongside, same era.
C. Monroe, W. C. Campbell, L.-M. Duan, Z.-X. Gong, A. V. Gorshkov, P. Hess, R. Islam, K. Kim, N. M. Linke, G. Pagano, et al. , “Programmable quantum simulations of spin systems with trapped ions,” Reviews of Modern Physics 93
2021
Closest in time.
L. Egan, D. M. Debroy, C. Noel, A. Risinger, D. Zhu, D. Biswas, M. Newman, M. Li, K. R. Brown, M. Cetina, et al. , “Fault-tolerant operation of a quantum error-correction code,” Nature 598
2021
Closest in time.
2021
Closest in time.
Q. Zhu, S. Cao, F. Chen, M.-C. Chen, X. Chen, T.-H. Chung, H. Deng, Y. Du, D. Fan, M. Gong, et al. , “Quantum computational advantage via 60-qubit 24-cycle random circuit sampling,” Science Bulletin , 240–245 (2021)
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
Yong, Liu, Xin, Liu, Fang, Li, H. Fu, Y. Yang, J. Song, P. Zhao, Z. Wang, D. Peng, H. Chen, C. Guo, H. Huang, W. Wu, and D. Chen, “Closing the ”Quantum Supremacy” Gap: Achieving Real-Time Simulation of a Random Quantum Circuit Using a New Sunway Supercomputer,” Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis , 1–12 (2021) , arXiv: 2110.14502
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
D. Bluvstein, H. Levine, G. Semeghini, T. T. Wang, S. Ebadi, M. Kalinowski, A. Keesling, N. Maskara, H. Pichler, M. Greiner, et al. , “A quantum processor based on coherent transport of entangled atom arrays,” Nature 604
2022
Closest in time.