Fetching the paper…
Reading the bibliography…
The demonstration of quantum speedup, also known as quantum computational supremacy, that is the ability of quantum computers to outperform dramatically their classical counterparts, is an important milestone in the field of quantum computing.
1905
Earlier work this paper cites.
1905
Earlier work this paper cites.
1912
Earlier work this paper cites.
W. Hoeffding, “Probability inequalities for sums of bounded random variables,” Journal of the American statistical association
1963
Earlier work this paper cites.
L. G. Valiant, “The complexity of computing the permanent,” Theoretical computer science
1979
Earlier work this paper cites.
H. Yuen and J. Shapiro, “Optical communication with two-photon coherent states–Part III: Quantum measurements realizable with photoemissive detectors,” IEEE Transactions on Information Theory
1980
Earlier work this paper cites.
S. Wiesner, “Conjugate coding,” ACM Sigact News
1983
Earlier work this paper cites.
C. H. Bennett and G. Brassard, “Quantum cryptography: public key distribution and coin tossing.,” Theorical Computer Science
1984
Earlier work this paper cites.
C. H. Bennett and S. J. Wiesner, “Communication via one-and two-particle operators on Einstein-Podolsky-Rosen states,” Physical Review Letters
1992
Earlier work this paper cites.
M. G. Paris, “Quantum state measurement by realistic heterodyne detection,” Physical Review A
1996
Earlier work this paper cites.
A. Wünsche, “Laguerre 2D-functions and their application in quantum optics,” Journal of Physics A: Mathematical and General
1998
Earlier work this paper cites.
P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Review
1999
Earlier work this paper cites.
C. A. Fuchs and J. Van De Graaf, “Cryptographic distinguishability measures for quantum-mechanical states,” IEEE Transactions on Information Theory
1999
Earlier work this paper cites.
S. D. Bartlett, B. C. Sanders, S. L. Braunstein, and K. Nemoto, “Efficient classical simulation of continuous variable quantum information processes,” Physical Review Letters
2002
Earlier work this paper cites.
G. M. D’Ariano, M. G. Paris, and M. F. Sacchi, “Quantum tomography,” Advances in Imaging and Electron Physics
2003
Earlier work this paper cites.
B. M. Terhal and D. P. DiVincenzo, “Adptive quantum computation, constant depth quantum circuits and arthur-merlin games,” Quantum Information & Computation
2004
Earlier work this paper cites.
2005
Earlier work this paper cites.
2005
Earlier work this paper cites.
2005
Earlier work this paper cites.
S. L. Braunstein and P. van Loock, “Quantum information with continuous variables,” Reviews of Modern Physics
2005
Earlier work this paper cites.
P. Clifford and R. Clifford, “Faster classical Boson Sampling,” arXiv:2005.04214
2005
Earlier work this paper cites.
C. Huang, F. Zhang, M. Newman, J. Cai, X. Gao, Z. Tian, J. Wu, H. Xu, H. Yu, B. Yuan, et al
2005
Earlier work this paper cites.
R. Renner, “Symmetry of large physical systems implies independence of subsystems,” Nature Physics
2007
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations,” Physical Review Letters
2009
Earlier work this paper cites.
D. Shepherd and M. J. Bremner, “Temporally unstructured quantum computation,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
2009
Earlier work this paper cites.
D. Menzies and R. Filip, “Gaussian-optimized preparation of non-Gaussian pure states,” Physical Review A
2009
Cited alongside, same era.
R. Renner and J. I. Cirac, “de Finetti representation theorem for infinite-dimensional quantum systems and applications to quantum cryptography,” Physical Review Letters
2009
Cited alongside, same era.
2010
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,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
2011
Cited alongside, same era.
Cambridge University Press , New York, NY, USA, 10th ed., 2011
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
2018
Later among the works it cites.
D. Mills, A. Pappa, T. Kapourniotis, and E. Kashefi, “Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation,” in EPTCS 266, 2018, pp. 209-221
2018
Later among the works it cites.
Y. Takeuchi and T. Morimae, “Verification of many-qubit states,” Physical Review X
2018
Later among the works it cites.
B. Opanchuk, L. Rosales-Zárate, M. D. Reid, and P. D. Drummond, “Simulating and assessing boson sampling experiments with phase-space representations,” Physical Review A
2018
Later among the works it cites.
F. Flamini, N. Spagnolo, and F. Sciarrino, “Photonic quantum information processing: a review,” Reports on Progress in Physics
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. A. Nielsen and I. L. Chuang, “Quantum Computation and Quantum Information: 10th Anniversary Edition,” · 2011
Cited alongside, same era.
C. Weedbrook, S. Pirandola, R. García-Patrón, N. J. Cerf, T. C. Ralph, J. H. Shapiro, and S. Lloyd, “Gaussian quantum information,” Reviews of Modern Physics
2012
Cited alongside, same era.
S. Aaronson and A. Arkhipov, “The computational Complexity of Linear Optics,” Theory of Computing
2013
Cited alongside, same era.
S. Yokoyama, R. Ukai, S. C. Armstrong, C. Sornphiphatphong, T. Kaji, S. Suzuki, J.-i. Yoshikawa, H. Yonezawa, N. C. Menicucci, and A. Furusawa, “Ultra-large-scale continuous-variable cluster states multiplexed in the time domain,” Nature Photonics
2013
Cited alongside, same era.
A. Leverrier, R. García-Patrón, R. Renner, and N. J. Cerf, “Security of continuous-variable quantum key distribution against general attacks,” Physical Review Letters
2013
Cited alongside, same era.
T. F. Rønnow, Z. Wang, J. Job, S. Boixo, S. V. Isakov, D. Wecker, J. M. Martinis, D. A. Lidar, and M. Troyer, “Defining and detecting quantum speedup,” Science
2014
Cited alongside, same era.
N. Spagnolo, C. Vitelli, M. Bentivegna, D. J. Brod, A. Crespi, F. Flamini, S. Giacomini, G. Milani, R. Ramponi, P. Mataloni, et al
2014
Cited alongside, same era.
A. P. Lund, A. Laing, S. Rahimi-Keshari, T. Rudolph, J. L. O’Brien, and T. C. Ralph, “Boson Sampling from a Gaussian State,” Phys.ical Review Letters
2014
Cited alongside, same era.
2018
Later among the works it cites.
F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell, et al
2019
Later among the works it cites.
A. Gheorghiu, T. Kapourniotis, and E. Kashefi, “Verification of quantum computation: An overview of existing approaches,” Theory of Computing Systems
2019
Later among the works it cites.
D. Hangleiter, M. Kliesch, J. Eisert, and C. Gogolin, “Sample complexity of device-independently certified “quantum supremacy”,” Physical Review Letters
2019
Later among the works it cites.
S. Ferracin, T. Kapourniotis, and A. Datta, “Accrediting outputs of noisy intermediate-scale quantum computing devices,” New Journal of Physics
2019
Later among the works it cites.
T. Kapourniotis and A. Datta, “Nonadaptive fault-tolerant verification of quantum supremacy with noise,” Quantum
2019
Later among the works it cites.
I. Agresti, N. Viggianiello, F. Flamini, N. Spagnolo, A. Crespi, R. Osellame, N. Wiebe, and F. Sciarrino, “Pattern recognition techniques for Boson Sampling validation,” Physical Review X
2019
Later among the works it cites.
D. J. Brod, E. F. Galvão, A. Crespi, R. Osellame, N. Spagnolo, and F. Sciarrino, “Photonic implementation of Boson Sampling: a review,” Advanced Photonics
2019
Later among the works it cites.
H. Wang, J. Qin, X. Ding, M.-C. Chen, S. Chen, X. You, Y.-M. He, X. Jiang, L. You, Z. Wang, et al
2019
Later among the works it cites.
T. Jiang and Y. Ma, “Distances between random orthogonal matrices and independent normals,” Transactions of the American Mathematical Society
2019
Later among the works it cites.
R. Kruse, C. S. Hamilton, L. Sansoni, S. Barkhofen, C. Silberhorn, and I. Jex, “Detailed study of Gaussian Boson Sampling,” Physical Review A
2019
Later among the works it cites.
N. Quesada, “Franck-Condon factors by counting perfect matchings of graphs with loops,” The Journal of chemical physics
2019
Later among the works it cites.
R. García-Patrón, J. J. Renema, and V. Shchesnovich, “Simulating Boson Sampling in lossy architectures,” Quantum
2019
Later among the works it cites.
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, et al
2020
Closest in time.
A. M. Dalzell, A. W. Harrow, D. E. Koh, and R. L. La Placa, “How many qubits are needed for quantum computational supremacy?,” Quantum
2020
Closest in time.
M. Walschaers, “Signatures of many-particle interference,” Journal of Physics B: Atomic, Molecular and Optical Physics
2020
Closest in time.
U. Chabaud, D. Markham, and F. Grosshans, “Stellar representation of non-Gaussian quantum states,” Physical Review Letters
2020
Closest in time.
Y. Ouyang, S.-H. Tan, J. Fitzsimons, and P. P. Rohde, “Homomorphic encryption of linear optics quantum computation on almost arbitrary states of light with asymptotically perfect security,” Physical Review Research
2020
Closest in time.
J. Eisert, D. Hangleiter, N. Walk, I. Roth, D. Markham, R. Parekh, U. Chabaud, and E. Kashefi, “Quantum certification and benchmarking,” Nature Reviews Physics
2020
Closest in time.
U. Chabaud, G. Roeland, M. Walschaers, F. Grosshans, V. Parigi, D. Markham, and N. Treps, “Certification of non-Gaussian states with operational measurements,” PRX Quantum
2021
Closest in time.