Fetching the paper…
Reading the bibliography…
Quantum random sampling is the leading proposal for demonstrating a computational advantage of quantum computers over classical computers.
1902
Earlier work this paper cites.
1905
Earlier work this paper cites.
1905
Earlier work this paper cites.
1905
Earlier work this paper cites.
1906
Earlier work this paper cites.
1907
Earlier work this paper cites.
Movassagh, R (2020), “Quantum supremacy and random circuits,” arXiv:1909.06210
1909
Earlier work this paper cites.
1910
Earlier work this paper cites.
1910
Earlier work this paper cites.
1912
Earlier work this paper cites.
Einstein, A, B. Podolsky, and N. Rosen (1935), “Can quantum-mechanical description of physical reality be considered complete?” Phys. Rev. 47
1935
Earlier work this paper cites.
Finetti, B De (1937), “La prévision: ses lois logiques, ses sources subjectives,” Ann. Inst. H. Poincaré 7
1937
Earlier work this paper cites.
Muller, D E (1954), “Application of Boolean algebra to switching circuit design and to error detection,” Trans. I.R.E. Prof. Group Elec. Comp. EC-3
1954
Earlier work this paper cites.
Reed, I S (1954), “A class of multiple-error-correcting codes and the decoding scheme,” Trans. IRE Prof. Gr. Inf. Th. 4
1954
Earlier work this paper cites.
Porter, C E, and R. G. Thomas (1956), “Fluctuations of nuclear reaction widths,” Phys. Rev. 104
1956
Earlier work this paper cites.
Reed, I S, and G. Solomon (1960), “Polynomial codes over certain finite fields,” J. Soc. Ind. Appl. Math. 8
1960
Earlier work this paper cites.
Ryser, H J (1963), Combinatorial mathematics (American Mathematical Soc.)
1963
Earlier work this paper cites.
Bell, J S (1964), “On the Einstein Podolsky Rosen paradox,” Physics 1
1964
Earlier work this paper cites.
Freedman, S J, and J. F. Clauser (1972), “Experimental test of local hidden-variable theories,” Phys. Rev. Lett. 28
1972
Earlier work this paper cites.
Hudson, R L, and G. R. Moody (1976), “Locally normal symmetric states and an analogue of de Finetti’s theorem,” Z. Wahrsch. verw. Geb. 33
1976
Earlier work this paper cites.
Valiant, L G (1979), “The complexity of computing the permanent,” Th. Comp. Sc. 8
1979
Earlier work this paper cites.
Benioff, P (1980), “The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines,” J. Stat. Phys. 22
1980
Earlier work this paper cites.
Toffoli, T (1980), “Reversible computing,” in International Colloquium on Automata, Languages and Programming (ICALP 80) , Lecture Notes in Computer Science, Vol. 85, edited by Jaco de Bakker and Jan van Leeuwen (Springer) pp. 632–644
1980
Earlier work this paper cites.
Feynman, R P (1982), “Simulating physics with computers,” Int. J. Theor. Phys. 21
1982
Earlier work this paper cites.
Fredkin, E, and T. Toffoli (1982), “Conservative logic,” Int. J. Theor. Phys. 21
1982
Earlier work this paper cites.
Lautemann, C (1983), “BPP and the polynomial hierarchy,” Inf. Proc. Lett. 17
1983
Earlier work this paper cites.
Stockmeyer, L (1983), “The complexity of approximate counting,” Proc. 15th Ann. ACM Symp. Th. Comp. , STOC ’83, 118–126
1983
Earlier work this paper cites.
Deutsch, D (1985), “Quantum theory, the Church–Turing principle and the universal quantum computer,” Proc. R. Soc. Lond. A 400
1985
Earlier work this paper cites.
Feynman, R P (1985), “Quantum mechanical computers,” Opt. News 11
1985
Earlier work this paper cites.
Jerrum, M R, L. G. Valiant, and V. V. Vazirani (1986), “Random generation of combinatorial structures from a uniform distribution,” Th. Comp. Sc. 43
1986
Earlier work this paper cites.
Levin, L A (1986), “Average case complete problems,” SIAM J. Comput. 15
1986
Earlier work this paper cites.
Vergis, A, K. Steiglitz, and B. Dickinson (1986), “The complexity of analog computation,” Math. Comp. Sim. 28
1986
Earlier work this paper cites.
Welch, L R, and E. R. Berlekamp (1986), “Error correction for algebraic block codes,” Patent
1986
Earlier work this paper cites.
Beaver, D, and J. Feigenbaum (1990), “Hiding instances in multi-oracle queries,” in STACS 90 , Lecture Notes in Computer Science, edited by C. Choffrut and T. Lengauer (Springer) pp. 37–48
1990
Earlier work this paper cites.
Gemmell, P, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson (1991), “Self-testing/correcting for polynomials and for approximate functions,” in Proc. T23rd Ann. ACM Symp. Th. Comp. , STOC ’91 (Association for Computing Machinery, New York, NY, USA) pp. 33–42
1991
Earlier work this paper cites.
Lipton, R (1991), “New directions in testing,” in Distributed Computing and Cryptography , Vol. 2 (AMS) pp. 191–202
1991
Earlier work this paper cites.
Toda, S (1991), “PP is as hard as the polynomial-time hierarchy,” SIAM J. Comput. 20
1991
Earlier work this paper cites.
Gemmell, P, and M. Sudan (1992), “Highly resilient correctors for polynomials,” Inf. Proc. Lett. 43
1992
Earlier work this paper cites.
Li, M, and P. M. B. Vitányi (1992), “Average case complexity under the universal distribution equals worst-case complexity,” Inf. Proc. Lett. 42
1992
Earlier work this paper cites.
Paturi, R (1992), “On the degree of polynomials that approximate symmetric Boolean functions (preliminary version),” in Proc. 24fourth Ann. ACM Symp. The. Comp. , STOC ’92 (Association for Computing Machinery) pp. 468–474
1992
Earlier work this paper cites.
Toda, S, and M. Ogiwara (1992), “Counting classes are at least as hard as the polynomial-time hierarchy,” SIAM J. Comput. 21
1992
Earlier work this paper cites.
Bernstein, E, and U. Vazirani (1993), “Quantum complexity theory,” in Proc. 25th Ann. ACM Symp. Th. Comp. , STOC ’93 (Association for Computing Machinery, New York, NY, USA) pp. 11–20
1993
Earlier work this paper cites.
Jerrum, M R, and A. Sinclair (1993), “Polynomial-time approximation algorithms for the Ising model,” SIAM J. Comp. 22
1993
Earlier work this paper cites.
Kushilevitz, E, and Y. Mansour (1993), “Learning decision trees using the Fourier spectrum,” SIAM J. Comput. 22
1993
Earlier work this paper cites.
Fenner, S A, L. J. Fortnow, and S. A. Kurtz (1994), “Gap-definable counting classes,” J. Comp. Sys. Sc. 48
1994
Earlier work this paper cites.
Shor, P W (1994), “Algorithms for quantum computation: Discrete logarithms and factoring,” in Proce. 35th Ann. Symp. Found. Comp. Sc. , pp. 124–134
1994
Earlier work this paper cites.
Simon, D R (1994), “On the power of quantum computation,” in Proceedings of the 35th Annual Symposium on Foundations of Computer Science , SFCS ’94 (IEEE Computer Society, USA) pp. 116–123
1994
Earlier work this paper cites.
Aharonov, D, and M. Ben-Or (1996), “Polynomial simulations of decohered quantum computers,” in Proceedings of 37th Conference on Foundations of Computer Science , pp. 46–55
1996
Earlier work this paper cites.
Barvinok, A I (1996), “Two algorithmic results for the traveling salesman problem,” Math. OR 21
1996
Earlier work this paper cites.
Brouwer, P W, and C. W. J. Beenakker (1996), “Diagrammatic method of integration over the unitary group, with applications to quantum transport in mesoscopic systems,” J. Math. Phys. 37
1996
Earlier work this paper cites.
Grover, L K (1996), “A fast quantum mechanical algorithm for database search,” in Proce. 28th Ann. ACM Symp. Th. Comp. - STOC ’96 (ACM Press, Philadelphia, Pennsylvania, United States) pp. 212–219
1996
Earlier work this paper cites.
Lloyd, S (1996), “Universal quantum simulators,” Science 273
1996
Earlier work this paper cites.
Nachtergaele, B (1996), “The spectral gap for some spin chains with discrete symmetry breaking,” Commun.Math. Phys. 175
1996
Earlier work this paper cites.
Shor, P W (1996), “Fault-tolerant quantum computation,” in Proc. 37th Conf. Found. Comp. Sc. , pp. 56–65
1996
Earlier work this paper cites.
Aharonov, D, and M. Ben-Or (1997), “Fault-tolerant quantum computation with constant error,” in Proc. 29th Ann. ACM Symp. Th. Comp. , STOC ’97 (Association for Computing Machinery, New York, NY, USA) pp. 176–188
1997
Earlier work this paper cites.
Bernstein, E, and U. Vazirani (1997), “Quantum complexity theory,” SIAM J. Comp. 26
1997
Earlier work this paper cites.
Gottesman, D (1997), Stabilizer codes and quantum error correction , Ph.D. thesis (California Institute of Technology, Pasadena, CA), arXiv:quant-ph/9705052
1997
Earlier work this paper cites.
Shor, P W (1997), “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM J. Comput. 26
1997
Earlier work this paper cites.
Simon, D R (1997), “On the power of quantum computation,” SIAM J. Comput. 26
1997
Earlier work this paper cites.
Sudan, M (1997), “Decoding of Reed Solomon codes beyond the error-correction bound,” J. Complex. 13
1997
Earlier work this paper cites.
Fenner, S, F. Green, S. Homer, and R. Pruim (1998), “Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy,” arXiv:quant-ph/9812056
1998
Earlier work this paper cites.
Jaksch, D, C. Bruder, J. I. Cirac, C. W. Gardiner, and P. Zoller (1998), “Cold bosonic atoms in optical lattices,” Phys. Rev. Lett. 81
1998
Earlier work this paper cites.
Linial, N, A. Samorodnitsky, and A. Wigderson (1998), “A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents,” in Proc. 13th Ann. ACM Symp. Th. Comp. , STOC ’98 (Association for Computing Machinery, New York, NY, USA) pp. 644–652
1998
Earlier work this paper cites.
Barvinok, A (1999), “Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor,” Rand. Struc. Alg. 14
1999
Earlier work this paper cites.
Cai, J-Y, A. Pavan, and D. Sivakumar (1999), “On the hardness of permanent,” in STACS 99 , Lecture Notes in Computer Science, edited by C. Meinel and S. Tison (Springer, Berlin, Heidelberg) pp. 90–99
1999
Earlier work this paper cites.
Farhi, E, J. Goldstone, S. Gutmann, and M. Sipser (2000), “Quantum computation by adiabatic evolution,” arXiv:quant-ph/0001106
2000
Earlier work this paper cites.
Vandersypen, L M K, M. Steffen, G. Breyta, C. S. Yannoni, R. Cleve, and I. L. Chuang (2000), “Experimental realization of an order-finding algorithm with an NMR quantum computer,” Phys. Rev. Lett. 85
2000
Earlier work this paper cites.
Raussendorf, R, and H. J. Briegel (2001), “A one-way quantum computer,” Phys. Rev. Lett. 86
2001
Earlier work this paper cites.
Vandersypen, L M K, M. Steffen, G. Breyta, C. S. Yannoni, M. H. Sherwood, and I. L. Chuang (2001), “Experimental realization of Shor’s quantum factoring algorithm using nuclear magnetic resonance,” Nature 414
2001
Earlier work this paper cites.
Caves, C M, C. A. Fuchs, and R. Schack (2002), “Unknown quantum states: The quantum de Finetti representation,” J. Math. Phys. 43
2002
Earlier work this paper cites.
Gurvits, L, and A. Samorodnitsky (2002), “A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary,” Disc. Comp. Geom. 27
2002
Earlier work this paper cites.
Shi, Y (2002), “Both Toffoli and controlled-NOT need little help to do universal quantum computation,” arXiv:quant-ph/0205115
2002
Earlier work this paper cites.
Aharonov, D (2003), “A simple proof that Toffoli and Hadamard are quantum universal,” arXiv:quant-ph/0301040
2003
Earlier work this paper cites.
Gurvits, L (2003), “Classical deterministic complexity of Edmonds’ problem and quantum entanglement,” arXiv:quant-ph/0303055
2003
Earlier work this paper cites.
Mandel, O, M. Greiner, A. Widera, T. Rom, T. W. Hänsch, and I. Bloch (2003), “Controlled collisions for multi-particle entanglement of optically trapped atoms,” Nature 425
2003
Earlier work this paper cites.
Raussendorf, R, D. E. Browne, and H. J. Briegel (2003), “Measurement-based quantum computation on cluster states,” Phys. Rev. A 68
2003
Earlier work this paper cites.
Aaronson, S, and D. Gottesman (2004), “Improved simulation of stabilizer circuits,” Phys. Rev. A 70
2004
Earlier work this paper cites.
Blais, A, R.-S. Huang, A. Wallraff, S. M. Girvin, and R. J. Schoelkopf (2004), “Cavity quantum electrodynamics for superconducting electrical circuits: An architecture for quantum computation,” Phys. Rev. A 69
2004
Earlier work this paper cites.
Bourennane, M, M. Eibl, C. Kurtsiefer, S. Gaertner, H. Weinfurter, O. Gühne, P. Hyllus, D. Bruß, M. Lewenstein, and A. Sanpera (2004), “Experimental detection of multipartite entanglement using witness operators,” Phys. Rev. Lett. 92
2004
Earlier work this paper cites.
Canonne, C L, and K. Wimmer (2020), “Testing data binnings,” arXiv:2004.12893
2004
Earlier work this paper cites.
Jerrum, M R, A. Sinclair, and E. Vigoda (2004), “A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries,” J. ACM 51
2004
Earlier work this paper cites.
Terhal, B M, and D. P. DiVincenzo (2004), “Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games,” Quant. Inf. Comp. 4
2004
Earlier work this paper cites.
Aaronson, S (2005), “Quantum computing, post-selection, and probabilistic polynomial-time,” Proc. Roy. Soc. A 461
2005
Earlier work this paper cites.
2005
Earlier work this paper cites.
2005
Earlier work this paper cites.
2005
Earlier work this paper cites.
Clifford, P, and R. Clifford (2020), “Faster classical boson sampling,” arXiv:2005.04214
2005
Earlier work this paper cites.
Dawson, C M, H. L. Haselgrove, A. P. Hines, D. Mortimer, M. A. Nielsen, and T. J. Osborne (2005), “Quantum computing and polynomial equations over the finite field ℤ 2 \mathbb{Z}_{2} ,” Quant. Inf. Comp. 5
2005
Earlier work this paper cites.
2005
Earlier work this paper cites.
Kiesel, N, C. Schmid, U. Weber, G. Tóth, O. Gühne, R. Ursin, and H. Weinfurter (2005), “Experimental analysis of a four-qubit photon cluster state,” Phys. Rev. Lett. 95
2005
Earlier work this paper cites.
König, R, and R. Renner (2005), “A de Finetti representation for finite symmetric quantum states,” J. Math. Phys. 46
2005
Earlier work this paper cites.
Ledoux, M (2005), The concentration of measure phenomenon , Mathematical Surveys and Monographs, Vol. 89 (American Mathematical Society, Providence, Rhode Island)
2005
Earlier work this paper cites.
Raussendorf, R, S. Bravyi, and J. Harrington (2005), “Long-range quantum entanglement in noisy cluster states,” Phys. Rev. A 71
2005
Earlier work this paper cites.
Schollwöck, U (2005), “The density-matrix renormalization group,” Rev. Mod. Phys. 77
2005
Earlier work this paper cites.
Tóth, G, and O. Gühne (2005), “Entanglement detection in the stabilizer formalism,” Phys. Rev. A 72
2005
Earlier work this paper cites.
2005
Earlier work this paper cites.
Gambetta, J, A. Blais, D. I. Schuster, A. Wallraff, L. Frunzio, J. Majer, M. H. Devoret, S. M. Girvin, and R. J. Schoelkopf (2006), “Qubit-photon interactions in a cavity: Measurement-induced dephasing and number splitting,” Phys. Rev. A 74
2006
Earlier work this paper cites.
Guruswami, V (2006), “List decoding in average-case complexity and pseudorandomness,” in 2006 IEEE Information Theory Workshop - ITW ’06 Punta Del Este , pp. 32–36
2006
Earlier work this paper cites.
Jiang, T (2006), “How many entries of a typical orthogonal matrix can be approximated by independent normals?” Ann. Probab. 34
2006
Earlier work this paper cites.
Raussendorf, R, J. Harrington, and K. Goyal (2006), “A fault-tolerant one-way quantum computer,” Ann. Phys. 321
2006
Earlier work this paper cites.
De Raedt, K, K. Michielsen, H. De Raedt, B. Trieu, G. Arnold, M. Richter, Th. Lippert, H. Watanabe, and N. Ito (2007), “Massively parallel quantum computer simulator,” Comp. Phys. Comm. 176
2007
Earlier work this paper cites.
Kok, P, W. J. Munro, K. Nemoto, T. C. Ralph, J. P. Dowling, and G. J. Milburn (2007), “Linear optical quantum computing with photonic qubits,” Rev. Mod. Phys. 79
2007
Earlier work this paper cites.
Rakhmanov, E A (2007), “Bounds for polynomials with a unit discrete norm,” Ann. Math. 165
2007
Earlier work this paper cites.
Schuch, N, M. M. Wolf, F. Verstraete, and J. I. Cirac (2007), “Computational complexity of projected entangled pair states,” Phys. Rev. Lett. 98
2007
Earlier work this paper cites.
Bloch, I, J. Dalibard, and W. Zwerger (2008), “Many-body physics with ultracold gases,” Rev. Mod. Phys. 80
2008
Earlier work this paper cites.
Clarke, J, and F. K. Wilhelm (2008), “Superconducting quantum bits,” Nature 453
2008
Earlier work this paper cites.
Markov, I L, and Y. Shi (2008), “Simulating quantum computation by contracting tensor networks,” SIAM J. Comput. 38
2008
Earlier work this paper cites.
Nagaj, D, and P. Wocjan (2008), “Hamiltonian quantum cellular automata in one dimension,” Phys. Rev. A 78
2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
Scheel, S (2008), “Permanents in linear optical networks,” Acta Phys. Slov. 58
2008
Earlier work this paper cites.
Tao, T, and V. Vu (2008), “On the permanent of random Bernoulli matrices,” arXiv:0804.2362
2008
Earlier work this paper cites.
Verstraete, F, J. I. Cirac, and V. Murg (2008), “Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems,” Adv. Phys. 57
2008
Earlier work this paper cites.
Vollbrecht, K G H, and J. I. Cirac (2008), “Quantum simulators, continuous-time automata, and translationally invariant systems,” Phys. Rev. Lett. 100
2008
Earlier work this paper cites.
2009
Earlier work this paper cites.
Arora, S, and B. Barak (2009), Computational complexity a modern approach (Cambridge University Press)
2009
Earlier work this paper cites.
2009
Earlier work this paper cites.
Gühne, O, and G. Tóth (2009), “Entanglement detection,” Phys. Rep. 474
2009
Earlier work this paper cites.
Harrow, A W, A. Hassidim, and S. Lloyd (2009), “Quantum algorithm for linear systems of equations,” Phys. Rev. Lett. 103
2009
Earlier work this paper cites.
Harrow, A W, and R. A. Low (2009), “Random quantum circuits are approximate 2-designs,” Commun. Math. Phys. 291
2009
Earlier work this paper cites.
Jiang, T (2009), “The entries of circular orthogonal ensembles,” J. Math. Phys. 50
2009
Earlier work this paper cites.
2009
Earlier work this paper cites.
2009
Earlier work this paper cites.
Aaronson, S (2010), “BQP and the polynomial hierarchy,” in Proc. 42nd ACM Symp. Th. Comp. , STOC ’10 (Association for Computing Machinery, New York, NY, USA) pp. 141–150
2010
Earlier work this paper cites.
Bremner, M J, R. Jozsa, and D. J. Shepherd (2010), “Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy,” Proc. Roy. Soc. A 467
2010
Earlier work this paper cites.
Cramer, M, M. B. Plenio, S. T. Flammia, R. Somma, D. Gross, S. D. Bartlett, O. Landon-Cardinal, D. Poulin, and Y.-K. Liu (2010), “Efficient quantum state tomography,” Nature Comm. 1
2010
Earlier work this paper cites.
Glynn, D G (2010), “The permanent of a square matrix,” Eur. J. Comb. 31
2010
Earlier work this paper cites.
Haake, F (2010), Quantum signatures of chaos , Springer Series in Synergetics, Vol. 54 (Springer Berlin Heidelberg, Berlin, Heidelberg)
2010
Earlier work this paper cites.
Kok, P, and B. W. Lovett (2010), Introduction to optical quantum information processing (Cambridge University Press, Cambridge; New York)
2010
Earlier work this paper cites.
Lee, V E, N. Ruan, R. Jin, and C. Aggarwal (2010), in Managing and mining graph data (Springer, Berlin) pp. 303–336
2010
Earlier work this paper cites.
Nielsen, M A, and I. L. Chuang (2010), Quantum Computation and Quantum Information , 10th ed. (Cambridge University Press, Cambridge ; New York)
2010
Earlier work this paper cites.
Trotzky, S, L. Pollet, F. Gerbier, U. Schnorrberger, I. Bloch, N.V. Prokof’ev, B. Svistunov, and M. Troyer (2010), “Suppression of the critical temperature for superfluidity near the Mott transition: validating a quantum simulator,” Nature Phys. 6
2010
Earlier work this paper cites.
Arkhipov, A, and G. Kuperberg (2011), “The bosonic birthday paradox,” arXiv:1106.0849
2011
Earlier work this paper cites.
De las Cuevas, G, W. Dür, M. Van den Nest, and M. A. Martin-Delgado (2011), “Quantum algorithms for classical lattice models,” New J. Phys. 13
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
Flammia, S T, and Y.-K. Liu (2011), “Direct fidelity estimation from few Pauli measurements,” Phys. Rev. Lett. 106
2011
Earlier work this paper cites.
2012
Earlier work this paper cites.
Barber, D (2012), Bayesian reasoning and machine learning (Cambridge)
2012
Earlier work this paper cites.
Björklund, A (2012), “Counting perfect matchings as fast as ryser,” in Proc. 2012 Ann. ACM-SIAM Symp. Disc. Alg. (SODA) , Proceedings (Society for Industrial and Applied Mathematics) pp. 914–921
2012
Earlier work this paper cites.
Blatt, R, and C. F. Roos (2012), “Quantum simulations with trapped ions,” Nature Phys. 8
2012
Cited alongside, same era.
Childs, A M, and N. Wiebe (2012), “Hamiltonian simulation using linear combinations of unitary operations,” Quant. Inf. Comp. 12
2012
Cited alongside, same era.
2012
Cited alongside, same era.
Ferris, A J, and G. Vidal (2012), “Perfect sampling with unitary tensor networks,” Phys. Rev. B 85
2012
Cited alongside, same era.
2012
Cited alongside, same era.
Renema, J J, A. Menssen, W. R. Clements, G. Triginer, W. S. Kolthammer, and I. A. Walmsley (2018), “Efficient classical algorithm for boson sampling with partially distinguishable photons,” Phys. Rev. Lett. 120
2018
Later among the works it cites.
Sekatski, P, J.-D. Bancal, S. Wagner, and N. Sangouard (2018), “Certifying the building blocks of quantum computers from Bell’s theorem,” Phys. Rev. Lett. 121
2018
Later among the works it cites.
Takeuchi, Y, and T. Morimae (2018), “Verification of many-qubit states,” Phys. Rev. X 8
2018
Later among the works it cites.
Watrous, J (2018), The theory of quantum information , 1st ed. (Cambridge University Press)
2018
Later among the works it cites.
Wu, J, Y. Liu, B. Zhang, X. Jin, Y. Wang, H. Wang, and X. Yang (2018), “A benchmark test of boson sampling on Tianhe-2 supercomputer,” Natl. Sc. Rev. 5
2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Murphy, K P (2012), Machine learning: a probabilistic perspective , Adaptive computation and machine learning series (MIT Press, Cambridge, MA, USA)
2012
Cited alongside, same era.
Nagaj, D (2012), “Universal two-body-Hamiltonian quantum computing,” Phys. Rev. A 85
2012
Cited alongside, same era.
Preskill, J (2012), “Quantum computing and the entanglement frontier,” arXiv:1203.5813
2012
Cited alongside, same era.
2012
Cited alongside, same era.
Trotzky, S, Y.-A. Chen, A. Flesch, I. P. McCulloch, U. Schollwöck, J. Eisert, and I. Bloch (2012), “Probing the relaxation towards equilibrium in an isolated strongly correlated one-dimensional Bose gas,” Nature Phys. 8
2012
Cited alongside, same era.
Aaronson, S, and A. Arkhipov (2013), “The computational complexity of linear optics,” Th. Comp. 9
2013
Cited alongside, same era.
Baiardi, A, J. Bloino, and V. Barone (2013), “General time dependent approach to vibronic spectroscopy including Franck–Condon, Herzberg–Teller, and Duschinsky effects,” J. Chem. Theory Comput. 9
2013
Cited alongside, same era.
Later among the works it cites.
Zhong, H-S, Y. Li, W. Li, L.-C. Peng, Z.-E. Su, Y. Hu, Y.-M. He, X. Ding, W. Zhang, H. Li, L. Zhang, Z. Wang, L. You, X.-L. Wang, X. Jiang, L. Li, Y.-A. Chen, N.-L. Liu, C.-Y. Lu, and J.-W. Pan (2018), “12-photon entanglement and scalable scattershot boson sampling with optimal entangled-photon pairs from parametric down-conversion,” Phys. Rev. Lett. 121
2018
Later among the works it cites.
Arute, F, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. S. L. Brandão, D. A. Buell, B. Burkett, Y. Chen, Z. Chen, B. Chiaro, R. Collins, W. Courtney, A. Dunsworth, E. Farhi, B. Foxen, A. Fowler, C. Gidney, M. Giustina, R. Graff, K. Guerin, S. Habegger, M. P. Harrigan, M. J. Hartmann, A. Ho, M. Hoffmann, T. Huang, T. S. Humble, S. V. Isakov, E. Jeffrey, Z. Jiang, D. Kafri, K. Kechedzhi, J. Kelly, P. V. Klimov, S. Knysh, A. Korotkov, F. Kostritsa, D. Landhuis, M. Lindmark, E. Lucero, D. Lyakh, S. Mandra, J. R. McClean, M. McEwen, A. Megrant, X. Mi, K. Michielsen, M. Mohseni, J. Mutus, O. Naaman, M. Neeley, C. Neill, M. Y. Niu, E. Ostby, A. Petukhov, J. C. Platt, C. Quintana, E. G. Rieffel, P. Roushan, N. C. Rubin, D. Sank, K. J. Satzinger, V. Smelyanskiy, K. J. Sung, M. D. Trevithick, A. Vainsencher, B. Villalonga, T. White, Z. J. Yao, P. Yeh, A. Zalcman, H. Neven, and J. M. Martinis (2019), “Quantum supremacy using a programmable superconducting processor,” Nature 574
2019
Later among the works it cites.
Barvinok, A (2019), “Computing permanents of complex diagonally dominant matrices and tensors,” Isr. J. Math. 232
2019
Later among the works it cites.
Björklund, A, B. Gupt, and N. Quesada (2019), “A faster Hafnian formula for complex matrices and its benchmarking on a supercomputer,” ACM J. Exp. Algorithmics 24
2019
Later among the works it cites.
Boone, K, A. Carignan-Dugas, J. J. Wallman, and J. Emerson (2019), “Randomized benchmarking under different gatesets,” Phys. Rev. A 99
2019
Later among the works it cites.
Bouland, A, B. Fefferman, C. Nirkhe, and U. Vazirani (2019), “On the complexity and verification of quantum random circuit sampling,” Nature Phys. 15
2019
Later among the works it cites.
Brod, D J, E. F. Galvão, A. Crespi, R. Osellame, N. Spagnolo, and F. Sciarrino (2019), “Photonic implementation of boson sampling: A review,” Adv. Phot. 1
2019
Later among the works it cites.
De Raedt, H, F. Jin, D. Willsch, M. Willsch, N. Yoshioka, N. Ito, S. Yuan, and K. Michielsen (2019), “Massively parallel quantum computer simulator, eleven years later,” Comp. Phys. Comm. 237
2019
Later among the works it cites.
Erhard, A, J. J. Wallman, L. Postler, M. Meth, R. Stricker, E. A. Martinez, P. Schindler, T. Monz, J. Emerson, and R. Blatt (2019), “Characterizing large-scale quantum computers via cycle benchmarking,” Nat. Comm. 10
2019
Later among the works it cites.
García-Patrón, R, J. J. Renema, and V. S. Shchesnovich (2019), “Simulating boson sampling in lossy architectures,” Quantum 3
2019
Later among the works it cites.
2019
Later among the works it cites.
Guo, C, Y. Liu, M. Xiong, S. Xue, X. Fu, A. Huang, X. Qiang, P. Xu, J. Liu, S. Zheng, H.-L. Huang, M. Deng, D. Poletti, W.-S. Bao, and J. Wu (2019), “General-purpose quantum circuit simulator with projected entangled-pair states and the quantum supremacy frontier,” Phys. Rev. Lett. 123
2019
Later among the works it cites.
Gupt, B, J. Izaac, and N. Quesada (2019), “The Walrus: A library for the calculation of Hafnians, Hermite polynomials and Gaussian boson sampling,” J. Open Source Soft. 4
2019
Later among the works it cites.
Hangleiter, D, M. Kliesch, J. Eisert, and C. Gogolin (2019), “Sample complexity of device-independently certified quantum supremacy,” Phys. Rev. Lett. 122
2019
Later among the works it cites.
Havlícek, Vojtech, Antonio D. Córcoles, Kristan Temme, Aram W. Harrow, Abhinav Kandala, Jerry M. Chow, and Jay M. Gambetta (2019), “Supervised learning with quantum-enhanced feature spaces,” Nature 567
2019
Later among the works it cites.
Hayashi, M, and Y. Takeuchi (2019), “Verifying commuting quantum computations via fidelity estimation of weighted graph states,” New J. Phys. 21
2019
Later among the works it cites.
Hebenstreit, M, R. Jozsa, B. Kraus, S. Strelchuk, and M. Yoganathan (2019), “All pure fermionic non-Gaussian states are magic states for matchgate computations,” Phys. Rev. Lett. 123
2019
Later among the works it cites.
Helsen, J, X. Xue, L. M. K. Vandersypen, and S. Wehner (2019), “A new class of efficient randomized benchmarking protocols,” npj Quant. Inf. 5
2019
Later among the works it cites.
Kalev, A, A. Kyrillidis, and N. M. Linke (2019), “Validating and certifying stabilizer states,” Phys. Rev. A 99
2019
Later among the works it cites.
Kapourniotis, T, and A. Datta (2019), “Nonadaptive fault-tolerant verification of quantum supremacy with noise,” Quantum 3
2019
Later among the works it cites.
Kruse, R, C. S. Hamilton, L. Sansoni, S. Barkhofen, C. Silberhorn, and I. Jex (2019), “A detailed study of Gaussian boson sampling,” Phys. Rev. A 100
2019
Later among the works it cites.
Low, G H, and I. L. Chuang (2019), “Hamiltonian simulation by qubitization,” Quantum 3
2019
Later among the works it cites.
Morimae, T, Y. Takeuchi, and M. Hayashi (2019), “Verification of hypergraph states,” Phys. Rev. A 96
2019
Later among the works it cites.
Morimae, T, and S. Tamaki (2019), “Fine-grained quantum computational supremacy,” Quant. Inf. Comp. 19
2019
Later among the works it cites.
Moylett, A E, R. García-Patrón, J. J. Renema, and P. S. Turner (2019), “Classically simulating near-term partially-distinguishable and lossy boson sampling,” Quant. Sci. Tech. 5
2019
Later among the works it cites.
Muraleedharan, G, A. Miyake, and I. H. Deutsch (2019), “Quantum computational supremacy in the sampling of bosonic random walkers on a one-dimensional lattice,” New J. Phys. 21
2019
Later among the works it cites.
Nikolopoulos, G M (2019), “Cryptographic one-way function based on boson sampling,” Quant. Inf. Proc. 18
2019
Later among the works it cites.
Paesani, S, Y. Ding, R. Santagati, L. Chakhmakhchyan, C. Vigliar, K. Rottwitt, L. K. Oxenløwe, J. Wang, M. G. Thompson, and A. Laing (2019), “Generation and sampling of quantum states of light in a silicon chip,” Nat. Phys. 15
2019
Later among the works it cites.
Phillips, D S, M. Walschaers, J. J. Renema, I. A. Walmsley, N. Treps, and J. Sperling (2019), “Benchmarking of Gaussian boson sampling using two-point correlators,” Phys. Rev. A 99
2019
Later among the works it cites.
Quesada, N (2019), “Franck-Condon factors by counting perfect matchings of graphs with loops,” J. Chem. Phys. 150
2019
Later among the works it cites.
Quesada, N, L. G. Helt, J. Izaac, J. M. Arrazola, R. Shahrokhshahi, C. R. Myers, and K. K. Sabapathy (2019), “Simulating realistic non-Gaussian state preparation,” Phys. Rev. A 100
2019
Later among the works it cites.
Raz, R, and A. Tal (2019), “Oracle separation of BQP and PH,” in Proc. 51st Ann. ACM SIGACT Symp. Th. Comp. - STOC 2019 (ACM Press, Phoenix, AZ, USA) pp. 13–23
2019
Later among the works it cites.
2019
Later among the works it cites.
Shchesnovich, V S (2019), “Noise in boson sampling and the threshold of efficient classical simulatability,” Phys. Rev. A 100
2019
Later among the works it cites.
Takeuchi, Y, A. Mantri, T. Morimae, A. Mizutani, and J. F. Fitzsimons (2019), “Resource-efficient verification of quantum computing using serfling’s bound,” npj Quant. Inf. 5
2019
Later among the works it cites.
Villalonga, B, S. Boixo, B. Nelson, C. Henze, E. Rieffel, R. Biswas, and S. Mandrà (2019), “A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware,” npj Quant. Inf. 5
2019
Later among the works it cites.
Wang, H, J. Qin, X. Ding, M.-C. Chen, S. Chen, X. You, Y.-M. He, X. Jiang, L. You, Z. Wang, C. Schneider, J. J. Renema, S. Höfling, C.-Y. Lu, and J.-W. Pan (2019), “Boson sampling with 20 input photons and a 60-mode interferometer in a 10 14 1{0}^{14} -dimensional Hilbert space,” Phys. Rev. Lett. 123
2019
Later among the works it cites.
Yoganathan, M, R. Jozsa, and S. Strelchuk (2019), “Quantum advantage of unitary Clifford circuits with magic state inputs,” Proc. R. Soc. A 475
2019
Later among the works it cites.
Zhou, T, and A. Nahum (2019), “Emergent statistical mechanics of entanglement in random unitary circuits,” Phys. Rev. B 99
2019
Later among the works it cites.
Zhu, H, and M. Hayashi (2019), “Efficient verification of hypergraph states,” Phys. Rev. Appl. 12
2019
Later among the works it cites.
Aaronson, S (2019), “Aspects of certified randomness from quantum supremacy,” PowerPoint presentation, accessed on 2020-09-04
2020
Later among the works it cites.
Baez, M L, M. Goihl, J. Haferkamp, J. Bermejo-Vega, M. Gluza, and J. Eisert (2020), “Dynamical structure factors of dynamical quantum simulators,” PNAS 117
2020
Later among the works it cites.
Bao, Y, S. Choi, and E. Altman (2020), “Theory of the phase transition in random unitary circuits with measurements,” Phys. Rev. B 101
2020
Later among the works it cites.
Bravyi, S, D. Gosset, R. König, and M. Tomamichel (2020), “Quantum advantage with noisy shallow circuits,” Nature Phys. 16
2020
Later among the works it cites.
Cerfontaine, P, R. Otten, and H. Bluhm (2020), “Self-consistent calibration of quantum-gate sets,” Phys. Rev. Appl. 13
2020
Later among the works it cites.
Chen, M-C, R. Li, L. Gan, X. Zhu, G. Yang, C.-Y. Lu, and J.-W. Pan (2020), “Quantum-teleportation-inspired algorithm for sampling large random quantum circuits,” Phys. Rev. Lett. 124
2020
Later among the works it cites.
Dalzell, A M, A. W. Harrow, D. E. Koh, and R. L. La Placa (2020), “How many qubits are needed for quantum computational supremacy?” Quantum 4
2020
Later among the works it cites.
Eisert, J, D. Hangleiter, N. Walk, I. Roth, D. Markham, R. Parekh, U. Chabaud, and E. Kashefi (2020), “Quantum certification and benchmarking,” Nature Rev. Phys. 2
2020
Later among the works it cites.
Foxen, B, C. Neill, A. Dunsworth, P. Roushan, B. Chiaro, A. Megrant, J. Kelly, Zijun Chen, K. Satzinger, R. Barends, F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, S. Boixo, D. Buell, B. Burkett, Yu Chen, R. Collins, E. Farhi, A. Fowler, C. Gidney, M. Giustina, R. Graff, M. Harrigan, T. Huang, S. V. Isakov, E. Jeffrey, Z. Jiang, D. Kafri, K. Kechedzhi, P. Klimov, A. Korotkov, F. Kostritsa, D. Landhuis, E. Lucero, J. McClean, M. McEwen, X. Mi, M. Mohseni, J. Y. Mutus, O. Naaman, M. Neeley, M. Niu, A. Petukhov, C. Quintana, N. Rubin, D. Sank, V. Smelyanskiy, A. Vainsencher, T. C. White, Z. Yao, P. Yeh, A. Zalcman, H. Neven, and J. M. Martinis (2020), “Demonstrating a continuous set of two-qubit gates for near-term quantum algorithms,” Phys. Rev. Lett. 125
2020
Later among the works it cites.
Gupt, B, J. M. Arrazola, N. Quesada, and T. R. Bromley (2020), “Classical benchmarking of Gaussian boson sampling on the Titan supercomputer,” Quant. Inf. Proc. 19
2020
Later among the works it cites.
Jahangiri, S, J. M. Arrazola, N. Quesada, and N. Killoran (2020), “Point processes with Gaussian boson sampling,” Phys. Rev. E 101
2020
Later among the works it cites.
Jian, C-M, Y.-Z. You, R. Vasseur, and A. W. W. Ludwig (2020), “Measurement-induced criticality in random quantum circuits,” Phys. Rev. B 101
2020
Later among the works it cites.
Markham, D, and A. Krause (2020), “A simple protocol for certifying graph states and applications in quantum networks,” Cryptography 4
2020
Later among the works it cites.
Mezher, R, J. Ghalbouni, J. Dgheim, and D. Markham (2020), “Fault-tolerant quantum speedup from constant depth quantum circuits,” Phys. Rev. Res. 2
2020
Later among the works it cites.
Negrevergne, C, R. Somma, G. Ortiz, E. Knill, and R. Laflamme (2020), “Liquid-state NMR simulations of quantum many-body problems,” Phys. Rev. A 71
2020
Later among the works it cites.
Pan, F, P. Zhou, S. Li, and P. Zhang (2020), “Contracting arbitrary tensor networks: General approximate algorithm and applications in graphical models and quantum circuit simulations,” Phys. Rev. Lett. 125
2020
Later among the works it cites.
Quesada, N, and J. M. Arrazola (2020), “Exact simulation of Gaussian boson sampling in polynomial space and exponential time,” Phys. Rev. Res. 2
2020
Later among the works it cites.
Roga, W, and M. Takeoka (2020), “Classical simulation of boson sampling with sparse output,” Sci. Rep. 10
2020
Later among the works it cites.
Schuld, M, K. Brádler, R. Israel, D. Su, and B. Gupt (2020), “Measuring the similarity of graphs with a Gaussian boson sampler,” Phys. Rev. A 101
2020
Later among the works it cites.
Schutski, R, T. Khakhulin, I. Oseledets, and D. Kolmakov (2020), “Simple heuristics for efficient parallel tensor contraction and quantum circuit simulation,” Phys. Rev. A 102
2020
Later among the works it cites.
Villalonga, B, D. Lyakh, S. Boixo, H. Neven, T. S. Humble, R. Biswas, E. G. Rieffel, A. Ho, and S. Mandrà (2020), “Establishing the quantum supremacy frontier with a 281 Pflop/s simulation,” Quant. Sci. Tech. 5
2020
Later among the works it cites.
Wang, C S, J. C. Curtis, B. J. Lester, Y. Zhang, Y. Y. Gao, J. Freeze, V. S. Batista, P. H. Vaccaro, I. L. Chuang, L. Frunzio, L. Jiang, S. M. Girvin, and R. J. Schoelkopf (2020), “Efficient multiphoton sampling of molecular vibronic spectra on a superconducting bosonic processor,” Phys. Rev. X 10
2020
Later among the works it cites.
Zhong, H-S, 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 (2020), “Quantum computational advantage using photons,” Science 370
2020
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
Bennink, R S (2021), “Efficient verification of anticoncentrated quantum states,” npj Quant. Inf. 7
2021
Later among the works it cites.
2021
Later among the works it cites.
Childs, A M, Y. Su, M. C. Tran, N. Wiebe, and S. Zhu (2021), “Theory of Trotter error with commutator scaling,” Phys. Rev. X 11
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
Ebadi, S, T. T. Wang, H. Levine, A. Keesling, G. Semeghini, A. Omran, D. Bluvstein, R. Samajdar, H. Pichler, W. W. Ho, S. Choi, S. Sachdev, M. Greiner, V. Vuletić, and M. D. Lukin (2021), “Quantum phases of matter on a 256-atom programmable quantum simulator,” Nature 595
2021
Later among the works it cites.
Egan, L, D. M. Debroy, C. Noel, A. Risinger, D. Zhu, D. Biswas, M. Newman, M. Li, K. R. Brown, M. Cetina, and C. Monroe (2021), “Fault-tolerant control of an eerror-corrected qubit,” Nature 598
2021
Later among the works it cites.
2021
Later among the works it cites.
Gray, J, and S. Kourtis (2021), “Hyper-optimized tensor network contraction,” Quantum 5
2021
Later among the works it cites.
Guanzon, J J, A. P. Lund, and T. C. Ralph (2021), “Multimode metrology via scattershot sampling,” Phys. Rev. A 104
2021
Later among the works it cites.
Guo, C, Y. Zhao, and H.-L. Huang (2021), “Verifying random quantum circuits with arbitrary geometry using tensor network states algorithm,” Phys. Rev. Lett. 126
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
Jurcevic, P, A. Javadi-Abhari, L. S. Bishop, I. Lauer, D. F. Bogorin, M. Brink, L. Capelluto, O. Günlük, T. Itoko, N. Kanazawa, A. Kandala, G. A. Keefe, K. Krsulich, W. Landers, E. P. Lewandowski, D. T. McClure, G. Nannicini, A. Narasgond, H. M. Nayfeh, E. Pritchett, M. B. Rothwell, S. Srinivasan, N. Sundaresan, C. Wang, K. X. Wei, C. J. Wood, J.-B. Yau, E. J. Zhang, O. E. Dial, J. M. Chow, and J. M. Gambetta (2021), “Demonstration of quantum volume 64 on a superconducting quantum computing system,” Quantum Sci. Technol. 6
2021
Later among the works it cites.
Kliesch, M, and I. Roth (2021), “Theory of quantum system certification,” PRX Quantum 2
2021
Later among the works it cites.
Kondo, Y, R. Mori, and R. Movassagh (2022), “Quantum supremacy and hardness of estimating output probabilities of quantum circuits,” in 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, Berkeley, CA) pp. 1296–1307
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
Novo, L, J. Bermejo-Vega, and R. García-Patrón (2021), “Quantum advantage from energy measurements of many-body quantum systems,” Quantum 5
2021
Later among the works it cites.
Oh, C, K. Noh, B. Fefferman, and L. Jiang (2021), “Classical simulation of lossy boson sampling using matrix product operators,” Phys. Rev. A 104
2021
Later among the works it cites.
2021
Later among the works it cites.
Qassim, H, H. Pashayan, and D. Gosset (2021), “Improved upper bounds on the stabilizer rank of magic states,” Quantum 5
2021
Later among the works it cites.
Shchesnovich, V S (2021), “Distinguishing noisy boson sampling from classical simulations,” Quantum 5
2021
Later among the works it cites.
Stilck França, D, and R. García-Patrón (2021), “Limitations of optimization algorithms on noisy quantum devices,” Nat. Phys. 17
2021
Later among the works it cites.
Valido, A A, and J. J. García-Ripoll (2021), “Gaussian phase sensitivity of boson-sampling-inspired strategies,” Phys. Rev. A 103
2021
Later among the works it cites.
2021
Later among the works it cites.
Wu, Y, W.-S. Bao, 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. 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, Q. Zhu, C.-Y. Lu, C.-Z. Peng, X. Zhu, and J.-W. Pan (2021), “Strong quantum computational advantage using a superconducting quantum processor,” Phys. Rev. Lett. 127
2021
Later among the works it cites.
Zhong, H-S, 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 (2021), “Phase-programmable Gaussian boson sampling using stimulated squeezed light,” Phys. Rev. Lett. 127
2021
Later among the works it cites.
2021
Later among the works it cites.
Aaronson, S (2018), “Certified randomness from quantum supremacy,” PowerPoint presentation, accessed on 2022-05-14
2022
Closest in time.
2022
Closest in time.
Brieger, R, I. Roth, and M. Kliesch (2022), “Compressive gate set tomography,” arXiv:2112.05176
2022
Closest in time.
Bulmer, J F F, B. A. Bell, R. S. Chadwick, A. E. Jones, D. Moise, A. Rigazzi, J. Thorbecke, U.-U. Haus, T. Van Vaerenbergh, R. B. Patel, I. A. Walmsley, and A. Laing (2022), “The boundary for quantum advantage in Gaussian boson sampling,” Science Adv. 8
2022
Closest in time.
2022
Closest in time.
Deshpande, A, A. Mehta, T. Vincent, N. Quesada, M. Hinsche, M. Ioannou, L. Madsen, J. Lavoie, H. Qi, J. Eisert, D. Hangleiter, B. Fefferman, and I. Dhand (2022), “Quantum computational advantage via high-dimensional Gaussian boson sampling,” Science Adv. 8
2022
Closest in time.
Drummond, P D, B. Opanchuk, A. Dellios, and M. D. Reid (2022), “Simulating complex networks in phase space: Gaussian boson sampling,” Phys. Rev. A 105
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
Helsen, J, I. Roth, E. Onorati, A. H. Werner, and J. Eisert (2022), “A general framework for randomized benchmarking,” PRX Quantum 3
2022
Closest in time.
Huh, J (2022), “A fast quantum algorithm for computing matrix permanent,” arXiv:2205.01328v2
2022
Closest in time.
Kahanamoku-Meyer, G D, S. Choi, U. V. Vazirani, and N. Y. Yao (2022), “Classically verifiable quantum advantage from a computational Bell test,” Nature Phys. 18
2022
Closest in time.
Krinner, S, N. Lacroix, A. Remm, A. Di Paolo, E. Genois, C. Leroux, C. Hellings, S. Lazar, F. Swiadek, J. Herrmann, G. J. Norris, C. K. Andersen, M. Müller, A. Blais, C. Eichler, and A. Wallraff (2022), “Realizing repeated quantum error correction in a distance-three surface code,” Nature 605
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
Liu, Z, and A. Gheorghiu (2022), “Depth-efficient proofs of quantumness,” Quantum 6
2022
Closest in time.
Lundow, P H, and K. Markström (2022), “Efficient computation of permanents, with applications to Boson sampling and random matrices,” J. Comp. Phys. 455
2022
Closest in time.
Madsen, L S, 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 (2022), “Quantum computational advantage with a programmable photonic processor,” Nature 606
2022
Closest in time.
2022
Closest in time.
Napp, J C, R. L. La Placa, A. M. Dalzell, F. G. S. L. Brandão, and A. W. Harrow (2022), “Efficient classical simulation of random shallow 2D quantum circuits,” Phys. Rev. X 12
2022
Closest in time.
Oszmaniec, M, N. Dangniam, M. E. S. Morales, and Z. Zimborás (2022), “Fermion sampling: A robust quantum computational advantage scheme using fermionic linear optics and magic input states,” PRX Quantum 3
2022
Closest in time.
Pan, F, K. Chen, and P. Zhang (2022), “Solving the sampling problem of the Sycamore quantum circuits,” Phys. Rev. Lett. 129
2022
Closest in time.
Pan, F, and P. Zhang (2022), “Simulation of quantum circuits using the big-batch tensor network method,” Phys. Rev. Lett. 128
2022
Closest in time.
Quesada, N, R. S. Chadwick, B. A. Bell, J. M. Arrazola, T. Vincent, H. Qi, and R. García-Patrón (2022), “Quadratic speed-up for simulating Gaussian boson sampling,” PRX Quantum 3
2022
Closest in time.
Ringbauer, M, M. Hinsche, T. Feldker, P. K. Faehrmann, J. Bermejo-Vega, C. Edmunds, R. Stricker, C. D. Marciniak, M. Meth, I. Pogorelov, L. Postler, R. Blatt, P. Schindler, J. Eisert, T. Monz, and D. Hangleiter (2022), “Verifiable measurement-based quantum random sampling with trapped ions,” (forthcoming)
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
Stilck França, D, and R. Garcia-Patron (2022), “A game of quantum advantage: Linking verification and simulation,” Quantum 6
2022
Closest in time.
Thekkadath, G S, S. Sempere-Llagostera, B.A. Bell, R.B. Patel, M.S. Kim, and I.A. Walmsley (2022), “Experimental demonstration of Gaussian boson sampling with displacement,” PRX Quantum 3
2022
Closest in time.
Trevisan, L (2008), “Lecture 6: Approximate counting,” in Lecture Notes on Computational Complexity , accessed: 4/2/2022
2022
Closest in time.
2022
Closest in time.
Zhu, Q, 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 (2022), “Quantum computational advantage via 60-qubit 24-cycle random circuit sampling,” Science Bulletin 67
2022
Closest in time.
2023
Closest in time.
Hong, C K, Z. Y. Ou, and L. Mandel (1987), “Measurement of sub-picosecond time intervals between two photons by interference,” Phys. Rev. Lett. 59
2046
Closest in time.