Cited by 152Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

The DOI matches its Crossref record; 369 of the 377 references it cites were found in a registry or an index.

Computational advantage of quantum random sampling

Open access

Hangleiter, Dominik, Eisert, Jens·2023·Reviews of Modern Physics

DOI 10.1103/revmodphys.95.035001

Open this paper in CoChat — free account Open PDF

Abstract

Quantum computers have improved and recent experiments have claimed quantum advantage -- completion of a computational task that is evidently hard for any conventional computer. The problem solved is that of obtaining samples, by quantum measurement, from a certain probability distribution. This review shows in what precise way quantum random sampling can be seen as a computation. It explains what that computation solves, in what way it outperforms classical computations, and what methods of verification are available. Quantum random sampling becomes a first test of the presumed exponential computational advantage of quantum computers over classical ones.

Integrity signals

Registry

Crossref · 10.1103/revmodphys.95.035001

Cites

369 of 369 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
Einstein, A., Podolsky, B., & Rosen, N. (1935) · Physical Review · doi:10.1103/physrev.47.777 · Cited by 16,654
Ror2 signaling regulates Golgi structure and transport through IFT20 for tumor invasiveness
Nishita, M., Park, S.-Y., Nishio, T., Kamizaki, K., Wang, Z., Tamada, K., Takumi, T., Hashimoto, R., Otani, H., Pazour, G. J., et al. (2017) · Scientific Reports · doi:10.1038/s41598-016-0028-x · Cited by 15,947
On the Einstein Podolsky Rosen paradox
Bell, J. S. (1964) · Physics Physique Fizika · doi:10.1103/physicsphysiquefizika.1.195 · Cited by 12,252
Untitled work
(2012) · Cited by 9,062
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Many-body physics with ultracold gases
Bloch, I., Dalibard, J., & Zwerger, W. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.885 · Cited by 8,114
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
A One-Way Quantum Computer
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Measurement of subpicosecond time intervals between two photons by interference
Hong, C. K., Ou, Z. Y., & Mandel, L. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.2044 · Cited by 4,369
Experimental Test of Bell's Inequalities Using Time- Varying Analyzers
Aspect, A., Dalibard, J., & Roger, G. (1982) · Physical Review Letters · doi:10.1103/physrevlett.49.1804 · Cited by 3,942
Polynomial Codes Over Certain Finite Fields
Reed, I. S., & Solomon, G. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108018 · Cited by 3,802
Cold Bosonic Atoms in Optical Lattices
Jaksch, D., Bruder, C., Cirac, J. I., Gardiner, C. W., & Zoller, P. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.3108 · Cited by 3,685
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325
The density-matrix renormalization group
Schollwöck, U. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.259 · Cited by 3,323
Universal Quantum Simulators
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Cavity quantum electrodynamics for superconducting electrical circuits: An architecture for quantum computation
Blais, A., Huang, R.-S., Wallraff, A., Girvin, S. M., & Schoelkopf, R. J. (2004) · Physical Review A · doi:10.1103/physreva.69.062320 · Cited by 2,989
Linear optical quantum computing with photonic qubits
Kok, P., Munro, W. J., Nemoto, K., Ralph, T. C., Dowling, J. P., & Milburn, G. J. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.135 · Cited by 2,904
Loophole-free Bell inequality violation using electron spins separated by 1.3 kilometres
Hensen, B., Bernien, H., Dréau, A. E., Reiserer, A., Kalb, N., Blok, M. S., Ruitenberg, J., Vermeulen, R. F. L., Schouten, R. N., Abellán, C., et al. (2015) · Nature · doi:10.1038/nature15759 · Cited by 2,852
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Experimental Realization of Einstein-Podolsky-Rosen-Bohm Gedankenexperiment : A New Violation of Bell's Inequalities
Aspect, A., Grangier, P., & Roger, G. (1982) · Physical Review Letters · doi:10.1103/physrevlett.49.91 · Cited by 2,687
Supervised learning with quantum-enhanced feature spaces
Havlíček, V., Córcoles, A. D., Temme, K., Harrow, A. W., Kandala, A., Chow, J. M., & Gambetta, J. M. (2019) · Nature · doi:10.1038/s41586-019-0980-2 · Cited by 2,572
Probing many-body dynamics on a 51-atom quantum simulator
Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., Choi, S., Zibrov, A. S., Endres, M., Greiner, M., et al. (2017) · Nature · doi:10.1038/nature24622 · Cited by 2,460
Quantum computational advantage using photons
Zhong, H.-S., Wang, H., Deng, Y.-H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Qin, J., Wu, D., Ding, X., Hu, Y., et al. (2020) · Science · doi:10.1126/science.abe8770 · Cited by 2,405
Entanglement detection
Gühne, O., & Tóth, G. (2009) · Physics Reports · doi:10.1016/j.physrep.2009.02.004 · Cited by 2,401
The theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Superconducting quantum bits
Clarke, J. L., & Wilhelm, F. K. (2008) · Nature · doi:10.1038/nature07128 · Cited by 2,129
Quantum Signatures of Chaos
Haake, F. (2010) · Springer series in synergetics · doi:10.1007/978-3-642-05428-0 · Cited by 2,072
Quantum computation and quantum information
Paul, T. (2007) · Mathematical Structures in Computer Science · doi:10.1017/s0960129507006317 · Cited by 2,009
Experimental Test of Local Hidden-Variable Theories
Freedman, S. J., & Clauser, J. F. (1972) · Physical Review Letters · doi:10.1103/physrevlett.28.938 · Cited by 1,999
Conservative logic
Fredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896
Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems
Verstraete, F., Murg, V., & Cirac, J. I. (2008) · Advances In Physics · doi:10.1080/14789940801912366 · Cited by 1,841
The Concentration of Measure Phenomenon
Ledoux, M. (2005) · Mathematical surveys and monographs · doi:10.1090/surv/089 · Cited by 1,797
Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
Vandersypen, L. M. K., Steffen, M., Breyta, G., Yannoni, C. S., Sherwood, M. H., & Chuang, I. L. (2001) · Nature · doi:10.1038/414883a · Cited by 1,738
Superconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733
Computational Complexity: A Modern Approach
Arora, S., & Barak, B. (2009) · doi:10.1017/cbo9780511804090 · Cited by 1,690
Bayesian Reasoning and Machine Learning
Barber, D. (2012) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804779 · Cited by 1,675
Measurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655
Quantum simulations with trapped ions
Blatt, R., & Roos, C. F. (2012) · Nature Physics · doi:10.1038/nphys2252 · Cited by 1,629
Significant-Loophole-Free Test of Bell’s Theorem with Entangled Photons
Giustina, M., Versteegh, M. A. M., Wengerowsky, S., Handsteiner, J., Hochrainer, A., Phelan, K., Steinlechner, F., Kofler, J., Larsson, J.-Å., Abellán, C., et al. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.250401 · Cited by 1,529
Reversible Computing
Toffoli, T. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_104 · Cited by 1,523
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515
Quantum Complexity Theory
Bernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
Strong Loophole-Free Test of Local Realism
Shalm, L. K., Meyer-Scott, E., Christensen, B. G., Bierhorst, P., Wayne, M. A., Stevens, M. J., Gerrits, T., Glancy, S., Hamel, D. R., Allman, M. S., et al. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.250402 · Cited by 1,402
The Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
Predicting many properties of a quantum system from very few measurements
Huang, H.-Y., Kueng, R., & Preskill, J. (2020) · Nature Physics · doi:10.1038/s41567-020-0932-7 · Cited by 1,240
Fluctuations of Nuclear Reaction Widths
Porter, C. E., & Thomas, R. G. (1956) · Physical Review · doi:10.1103/physrev.104.483 · Cited by 1,204
Fault-tolerant quantum computation
Shor, P. W. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1996.548464 · Cited by 1,195
Silicon quantum electronics
Zwanenburg, F. A., Dzurak, A. S., Morello, A., Simmons, M. Y., Hollenberg, L. C. L., Klimeck, G., Rogge, S. M. J., Coppersmith, S. N., & Eriksson, M. A. (2013) · Reviews of Modern Physics · doi:10.1103/revmodphys.85.961 · Cited by 1,183
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
Quantum computational advantage with a programmable photonic processor
Madsen, L. S., Laudenbach, F., Askarani, M. F., Rortais, F., Vincent, T., Bulmer, J. F. F., Miatto, F. M., Neuhaus, L., Helt, L. G., Collins, M. J., et al. (2022) · Nature · doi:10.1038/s41586-022-04725-x · Cited by 1,101
Quantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071
Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
Gilyén, A., Su, Y., Low, G. H., & Wiebe, N. (2019) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3313276.3316366 · Cited by 1,070
Strong Quantum Computational Advantage Using a Superconducting Quantum Processor
Wu, Y., Bao, W.-S., Cao, S., Chen, F., Chen, M.-C., Chen, X., Chung, T.-H., Deng, H., Du, Y., Fan, D., et al. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.180501 · Cited by 1,059
Probing the relaxation towards equilibrium in an isolated strongly correlated one-dimensional Bose gas
Trotzky, S., Chen, Y.-A., Flesch, A., McCulloch, I. P., Schollwöck, U., Eisert, J., & Bloch, I. (2012) · Nature Physics · doi:10.1038/nphys2232 · Cited by 1,058
Self-citation
Random generation of combinatorial structures from a uniform distribution
Jerrum, M., Valiant, L. G., & Vazirani, V. V. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90174-x · Cited by 1,041
Quantum mechanical computers
Feynman, R. P. (1985) · Optics News · doi:10.1364/on.11.2.000011 · Cited by 1,023
Quantum phases of matter on a 256-atom programmable quantum simulator
Ebadi, S., Wang, T. T., Levine, H., Keesling, A., Semeghini, G., Omran, A., Bluvstein, D., Samajdar, R., Pichler, H., Ho, W. W., et al. (2021) · Nature · doi:10.1038/s41586-021-03582-4 · Cited by 995
Exploring the many-body localization transition in two dimensions
Choi, J.-Y., Hild, S., Zeiher, J., Schauß, P., Rubio-Abadal, A., Yefsah, T., Khemani, V., Huse, D. A., Bloch, I., & Gross, C. (2016) · Science · doi:10.1126/science.aaf8834 · Cited by 979
Combinatorial Mathematics
Ryser, H. (1963) · Carus Mathematical Monographs · doi:10.5948/upo9781614440147 · Cited by 969
Optimal Hamiltonian Simulation by Quantum Signal Processing
Low, G. H., & Chuang, I. L. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.010501 · Cited by 955
Extending the lifetime of a quantum bit with error correction in superconducting circuits
Ofek, N., Petrenko, A., Heeres, R., Reinhold, P., Leghtas, Z., Vlastakis, B., Liu, Y., Frunzio, L., Girvin, S. M., Jiang, L., et al. (2016) · Nature · doi:10.1038/nature18949 · Cited by 941
Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
Zhou, L., Wang, S.-T., Choi, S., Pichler, H., & Lukin, M. D. (2020) · Physical Review X · doi:10.1103/physrevx.10.021067 · Cited by 913
A class of multiple-error-correcting codes and the decoding scheme
Reed, I. S. (1954) · Transactions of the IRE Professional Group on Information Theory · doi:10.1109/tit.1954.1057465 · Cited by 857
Hamiltonian Simulation by Qubitization
Low, G. H., & Chuang, I. L. (2019) · Quantum · doi:10.22331/q-2019-07-12-163 · Cited by 854
Boson Sampling on a Photonic Chip
Spring, J. B., Metcalf, B. J., Humphreys, P. C., Kolthammer, W. S., Jin, X.-M., Barbieri, M., Datta, A., Thomas-Peter, N., Langford, N. K., Kundys, D., et al. (2013) · Science · doi:10.1126/science.1231692 · Cited by 837
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
Jerrum, M., Sinclair, A., & Vigoda, E. (2001) · Journal of the ACM · doi:10.1145/1008731.1008738 · Cited by 809
Controlled collisions for multi-particle entanglement of optically trapped atoms
Mandel, O., Greiner, M., Widera, A., Rom, T., Hänsch, T. W., & Bloch, I. (2003) · Nature · doi:10.1038/nature02008 · Cited by 789
Demonstration of a small programmable quantum computer with atomic qubits
Debnath, S., Linke, N. M., Figgatt, C., Landsman, K. A., Wright, K., & Monroe, C. (2016) · Nature · doi:10.1038/nature18648 · Cited by 777
Efficient quantum state tomography
Cramer, M., Plenio, M. B., Flammia, S. T., Somma, R. D., Gross, D., Bartlett, S. D., Landon-Cardinal, O., Poulin, D., & Liu, Y.-K. (2010) · Nature Communications · doi:10.1038/ncomms1147 · Cited by 721
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
Sudan, M. (1997) · Journal of Complexity · doi:10.1006/jcom.1997.0439 · Cited by 718
PP is as Hard as the Polynomial-Time Hierarchy
Toda, S. (1991) · SIAM Journal on Computing · doi:10.1137/0220053 · Cited by 715
Experimental boson sampling
Tillmann, M., Dakić, B., Heilmann, R., Nolte, S., Szameit, A., & Walther, P. (2013) · Nature Photonics · doi:10.1038/nphoton.2013.102 · Cited by 709
Quantum computational supremacy
Harrow, A. W., & Montanaro, A. (2017) · Nature · doi:10.1038/nature23458 · Cited by 702
Application of Boolean algebra to switching circuit design and to error detection
Muller, D. E. (1954) · Transactions of the I R E Professional Group on Electronic Computers · doi:10.1109/irepgelc.1954.6499441 · Cited by 694
Realizing repeated quantum error correction in a distance-three surface code
Krinner, S., Lacroix, N., Remm, A., Di Paolo, A., Genois, E., Leroux, C., Hellings, C., Lazar, S., Swiadek, F., Herrmann, J., et al. (2022) · Nature · doi:10.1038/s41586-022-04566-8 · Cited by 686
Integrated multimode interferometers with arbitrary designs for photonic boson sampling
Crespi, A., Osellame, R., Ramponi, R., Brod, D. J., Galvão, E. F., Spagnolo, N., Vitelli, C., Maiorino, E., Mataloni, P., & Sciarrino, F. (2013) · Nature Photonics · doi:10.1038/nphoton.2013.112 · Cited by 662
Theory of Trotter Error with Commutator Scaling
Childs, A. M., Su, Y., Tran, M. C., Wiebe, N., & Zhu, S. (2021) · Physical Review X · doi:10.1103/physrevx.11.011020 · Cited by 646
Photonic Boson Sampling in a Tunable Circuit
Broome, M. A., Fedrizzi, A., Rahimi-Keshari, S., Dove, J., Aaronson, S., Ralph, T. C., & White, A. G. (2013) · Science · doi:10.1126/science.1231440 · Cited by 634
Polynomial-Time Approximation Algorithms for the Ising Model
Jerrum, M., & Sinclair, A. (1993) · SIAM Journal on Computing · doi:10.1137/0222066 · Cited by 571
Boson Sampling with 20 Input Photons and a 60-Mode Interferometer in a 1 0 14 -Dimensional Hilbert Space
Wang, H., Qin, J., Ding, X., Chen, M.-C., Chen, S., You, X., He, Y., Jiang, X. Q., You, L., Wang, Z., et al. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.250503 · Cited by 524
Experimental Detection of Multipartite Entanglement using Witness Operators
Bourennane, M., Eibl, M., Kurtsiefer, C., Gaertner, S., Weinfurter, H., Gühne, O., Hyllus, P., Bruß, D., Lewenstein, M., & Sanpera, A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.087902 · Cited by 522
Universal Blind Quantum Computation
Broadbent, A., Fitzsimons, J., & Kashefi, E. (2009) · 2009 50th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.36 · Cited by 521
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
Gaussian Boson Sampling
Hamilton, C. S., Kruse, R., Sansoni, L., Barkhofen, S., Silberhorn, C., & Jex, I. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.170501 · Cited by 503
Hand-waving and interpretive dance: an introductory course on tensor networks
Bridgeman, J. C., & Chubb, C. T. (2017) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aa6dc3 · Cited by 498
Theory of the phase transition in random unitary circuits with measurements
Bao, Y., Choi, S., & Altman, E. (2020) · Physical review. B./Physical review. B · doi:10.1103/physrevb.101.104301 · Cited by 496
On the power of quantum computation
Simon, D. R. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365701 · Cited by 491
Measurement-induced criticality in random quantum circuits
Jian, C., You, Y., Vasseur, R., & Ludwig, A. W. W. (2020) · Physical review. B./Physical review. B · doi:10.1103/physrevb.101.104302 · Cited by 488
Grand Unification of Quantum Algorithms
Martyn, J. M., Rossi, Z. M., Tan, A. K., & Chuang, I. L. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040203 · Cited by 487
Simulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472
Unknown quantum states: The quantum de Finetti representation
Caves, C. M., Fuchs, C. A., & Schack, R. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1494475 · Cited by 470
A blueprint for demonstrating quantum supremacy with superconducting qubits
Neill, C., Roushan, P., Kechedzhi, K., Boixo, S., Isakov, S. V., Smelyanskiy, V., Megrant, A., Chiaro, B., Dunsworth, A., Arya, K., et al. (2018) · Science · doi:10.1126/science.aao4309 · Cited by 468
Direct Fidelity Estimation from Few Pauli Measurements
Flammia, S. T., & Liu, Y.-K. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.230501 · Cited by 449
Qubit-photon interactions in a cavity: Measurement-induced dephasing and number splitting
Gambetta, J., Blais, A., Schuster, D., Wallraff, A. J., Frunzio, L., Majer, J., Devoret, M., Girvin, S. M., & Schoelkopf, R. J. (2006) · Physical Review A · doi:10.1103/physreva.74.042318 · Cited by 443
Quantum certification and benchmarking
Eisert, J., Hangleiter, D., Walk, N., Roth, I., Markham, D., Parekh, R., Chabaud, U., & Kashefi, E. (2020) · Nature Reviews Physics · doi:10.1038/s42254-020-0186-4 · Cited by 436
Self-citation
Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
Zhong, H.-S., Deng, Y.-H., Qin, J., Wang, H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Wu, D., Gong, S.-Q., Su, H., et al. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.180502 · Cited by 434
12-Photon Entanglement and Scalable Scattershot Boson Sampling with Optimal Entangled-Photon Pairs from Parametric Down-Conversion
Zhong, H.-S., Li, Y., Li, W., Peng, L.-C., Su, Z.-E., Hu, Y., He, Y.-M., Ding, X., Zhang, W., Li, H., et al. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.250505 · Cited by 432
High-efficiency multiphoton boson sampling
Wang, H., He, Y., Li, Y.-H., Su, Z.-E., Li, B., Huang, H.-L., Ding, X., Chen, M.-C., Liu, C., Qin, J., et al. (2017) · Nature Photonics · doi:10.1038/nphoton.2017.63 · Cited by 430
Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
Blume-Kohout, R., Gamble, J. K., Nielsen, E., Rudinger, K., Mizrahi, J., Fortier, K., & Maunz, P. (2017) · Nature Communications · doi:10.1038/ncomms14485 · Cited by 429
Realizing topologically ordered states on a quantum processor
Satzinger, K. J., Liu, Y.-J., Smith, A., Knapp, C., Newman, M., Jones, C., Chen, Z., Quintana, C., Mi, X., Dunsworth, A., et al. (2021) · Repository@Nottingham (University of Nottingham) · doi:10.5281/zenodo.5570481 · Cited by 424
General Time Dependent Approach to Vibronic Spectroscopy Including Franck–Condon, Herzberg–Teller, and Duschinsky Effects
Baiardi, A., Bloino, J., & Barone, V. (2013) · Journal of Chemical Theory and Computation · doi:10.1021/ct400450k · Cited by 423
Average Case Complete Problems
Levin, L. A. (1986) · SIAM Journal on Computing · doi:10.1137/0215020 · Cited by 413
Hamiltonian simulation using linear combinations of unitary operations
Childs, A. M., & Wiebe, N. (2012) · Quantum Information and Computation · doi:10.26421/qic12.11-12-1 · Cited by 408
Quantum advantage with shallow circuits
Bravyi, S. B., Gosset, D., & König, R. (2018) · Science · doi:10.1126/science.aar3106 · Cited by 406
Local Random Quantum Circuits are Approximate Polynomial-Designs
Brandão, F. G. S. L., Harrow, A. W., & Horodecki, M. (2016) · Communications in Mathematical Physics · doi:10.1007/s00220-016-2706-8 · Cited by 404
A fault-tolerant one-way quantum computer
Raussendorf, R., Harrington, J., & Goyal, K. (2006) · Annals of Physics · doi:10.1016/j.aop.2006.01.012 · Cited by 397
Quantum certification and benchmarking
Eisert, J., Hangleiter, D., Walk, N., Roth, I., Markham, D., Parekh, R., Chabaud, U., & Kashefi, E. (2020) · Freie Universität Berlin · doi:10.17169/refubium-30074 · Cited by 383
Self-citation
Observation of Entangled States of a Fully Controlled 20-Qubit System
Friis, N., Marty, O., Maier, C., Hempel, C., Holzäpfel, M., Jurcevic, P., Plenio, M. B., Huber, M., Roos, C., Blatt, R., et al. (2018) · Physical Review X · doi:10.1103/physrevx.8.021012 · Cited by 354
Fault-tolerant control of an error-corrected qubit
Egan, L., Debroy, D. M., Noel, C., Risinger, A., Zhu, D., Biswas, D., Newman, M., Li, M., Brown, K. R., Cetina, M., et al. (2021) · Nature · doi:10.1038/s41586-021-03928-y · Cited by 348
Boson sampling for molecular vibronic spectra
Huh, J., Guerreschi, G. G., Peropadre, B., McClean, J. R., & Aspuru-Guzik, A. (2015) · Nature Photonics · doi:10.1038/nphoton.2015.153 · Cited by 341
Unconditionally verifiable blind quantum computation
Fitzsimons, J. F., & Kashefi, E. (2017) · Physical Review A · doi:10.1103/physreva.96.012303 · Cited by 328
Learning Decision Trees Using the Fourier Spectrum
Eyal Kushilevitz, Z., & Mansour, Y. (1993) · SIAM Journal on Computing · doi:10.1137/0222080 · Cited by 325
Random Quantum Circuits are Approximate 2-designs
Harrow, A. W., & Low, R. A. (2009) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0873-6 · Cited by 324
Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates
Bravyi, S. B., & Gosset, D. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.250501 · Cited by 324
Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
Foxen, B., Neill, C., Dunsworth, A., Roushan, P., Chiaro, B., Megrant, A., Kelly, J., Chen, Z., Satzinger, K. J., Barends, R., et al. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.120504 · Cited by 324
Boson Sampling from a Gaussian State
Lund, A. P., Laing, A., Rahimi-Keshari, S., Rudolph, T., O’Brien, J. L., & Ralph, T. C. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.100502 · Cited by 316
Computational complexity of projected entangled pair states
Schuch, N., Wolf, M. M., Verstraete, F., & Cirac, J. I. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.140506 · Cited by 313
Experimental validation of photonic boson sampling
Spagnolo, N., Vitelli, C., Bentivegna, M., Brod, D. J., Crespi, A., Flamini, F., Giacomini, S., Milani, G., Ramponi, R., Mataloni, P., et al. (2014) · Nature Photonics · doi:10.1038/nphoton.2014.135 · Cited by 312
Quantum computing, postselection, and probabilistic polynomial-time
Aaronson, S. (2005) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2005.1546 · Cited by 312
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Bremner, M. J., Jozsa, R., & Shepherd, D. J. (2011) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2010.0301 · Cited by 308
Self-consistent quantum process tomography
Merkel, S., Gambetta, J., Smolin, J. A., Poletto, S., Corcoles, A. D., Johnson, B., Ryan, C. A., & Steffen, M. (2013) · Physical Review A · doi:10.1103/physreva.87.062119 · Cited by 308
Certified randomness in quantum physics
Acín, A., & Masanes, L. (2016) · Nature · doi:10.1038/nature20119 · Cited by 307
Efficient quantum algorithm for dissipative nonlinear differential equations
Liu, J.-P., Kolden, H. Ø., Krovi, H., Loureiro, N., Trivisa, K., & Childs, A. M. (2021) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2026805118 · Cited by 304
Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations
Bremner, M. J., Montanaro, A., & Shepherd, D. J. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.080501 · Cited by 299
Demonstration of universal parametric entangling gates on a multi-qubit lattice
Reagor, M. J., Osborn, C. B., Tezak, N., Staley, A., Prawiroatmodjo, G. E. D. K., Scheer, M. G., Alidoust, N., Sete, E. A., Didier, N., Silva, M. P. D., et al. (2018) · Science Advances · doi:10.1126/sciadv.aao3603 · Cited by 298
On the complexity and verification of quantum random circuit sampling
Bouland, A., Fefferman, B., Nirkhe, C., & Vazirani, U. (2019) · Nature Physics · doi:10.1038/s41567-018-0318-2 · Cited by 287
Diagrammatic method of integration over the unitary group, with applications to quantum transport in mesoscopic systems
Brouwer, P. W., & Beenakker, C. W. J. (1996) · Journal of Mathematical Physics · doi:10.1063/1.531667 · Cited by 285
Experimental Analysis of a Four-Qubit Photon Cluster State
Kiesel, N., Schmid, C., Weber, U., Tóth, G., Gühne, O., Ursin, R., & Weinfurter, H. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.210502 · Cited by 284
Entanglement detection in the stabilizer formalism
Tóth, G., & Gühne, O. (2005) · Physical Review A · doi:10.1103/physreva.72.022340 · Cited by 281
Introduction to Property Testing
Goldreich, O. (2017) · Cambridge University Press eBooks · doi:10.1017/9781108135252 · Cited by 281
Limitations of optimization algorithms on noisy quantum devices
França, D. S., & García−Patrón, R. (2021) · Nature Physics · doi:10.1038/s41567-021-01356-3 · Cited by 280
Emergent statistical mechanics of entanglement in random unitary circuits
Zhou, T., & Nahum, A. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.99.174205 · Cited by 277
Introduction to Optical Quantum Information Processing
Kok, P., & Lovett, B. W. (2010) · doi:10.1017/cbo9781139193658 · Cited by 273
Soundness and completeness of quantum root-mean-square errors
Ozawa, M. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0113-z · Cited by 265
Quantum computational advantage via 60-qubit 24-cycle random circuit sampling
Zhu, Q., Cao, S., Chen, F., Chen, M.-C., Chen, X., Chung, T.-H., Deng, H., Du, Y., Fan, D., Gong, M., et al. (2022) · Science Bulletin · doi:10.1016/j.scib.2021.10.017 · Cited by 263
Hyper-optimized tensor network contraction
Gray, J., & Kourtis, S. (2021) · Quantum · doi:10.22331/q-2021-03-15-410 · Cited by 261
BQP and the polynomial hierarchy
Aaronson, S. (2010) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1806689.1806711 · Cited by 257
What Limits the Simulation of Quantum Computers?
Zhou, Y., Stoudenmire, E. M., & Waintal, X. (2020) · Physical Review X · doi:10.1103/physrevx.10.041038 · Cited by 254
Characterizing large-scale quantum computers via cycle benchmarking
Erhard, A., Wallman, J. J., Postler, L., Meth, M., Stricker, R., Martinez, E. A., Schindler, P., Monz, T., Emerson, J., & Blatt, R. (2019) · Nature Communications · doi:10.1038/s41467-019-13068-7 · Cited by 254
Experimental scattershot boson sampling
Bentivegna, M., Spagnolo, N., Vitelli, C., Flamini, F., Viggianiello, N., Latmiral, L., Mataloni, P., Brod, D. J., Galvão, E. F., Crespi, A., et al. (2015) · Science Advances · doi:10.1126/sciadv.1400255 · Cited by 239
Hiding instances in multioracle queries
Beaver, D., & Joan Feigenbaum, A. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52282-4_30 · Cited by 237
Massively parallel quantum computer simulator
Raedt, K. D., Michielsen, K. F. L., Raedt, H. A. D., Trieu, B., Arnold, G., Richter, M., Lippert, T., Watanabe, H., & Ito, N. (2006) · Computer Physics Communications · doi:10.1016/j.cpc.2006.08.007 · Cited by 227
On the experimental verification of quantum complexity in linear optics
Carolan, J., Meinecke, J. D. A., Shadbolt, P., Russell, N. J., Ismail, N., Wörhoff, K., Rudolph, T., Thompson, M. G., O’Brien, J. L., Matthews, J. C. F., et al. (2014) · Nature Photonics · doi:10.1038/nphoton.2014.152 · Cited by 225
A Survey of Algorithms for Dense Subgraph Discovery
Lee, V. E., Ruan, N., Jin, R., & Aggarwal, C. C. (2010) · The Kluwer international series on advances in database systems · doi:10.1007/978-1-4419-6045-0_10 · Cited by 217
The complexity of approximate counting
Stockmeyer, L. J. (1983) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800061.808740 · Cited by 216
Generation and sampling of quantum states of light in a silicon chip
Paesani, S., Ding, Y., Santagati, R., Chakhmakhchyan, L., Vigliar, C., Rottwitt, K., Oxenløwe, L. K., Wang, J., Thompson, M. G., & Laing, A. (2019) · Nature Physics · doi:10.1038/s41567-019-0567-8 · Cited by 214
0.5 petabyte simulation of a 45-qubit quantum circuit
Häner, T., & Steiger, D. S. (2017) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3126908.3126947 · Cited by 213
BPP and the polynomial hierarchy
Lautemann, C. (1983) · Information Processing Letters · doi:10.1016/0020-0190(83)90044-3 · Cited by 212
Preparing random states and benchmarking with many-body quantum chaos
Choi, J., Shaw, A. L., Madjarov, I. S., Xie, X., Finkelstein, R., Covey, J. P., Cotler, J. S., Mark, D. K., Huang, H.-Y., Kale, A., et al. (2023) · Nature · doi:10.1038/s41586-022-05442-1 · Cited by 207
Quantum sampling problems, BosonSampling and quantum supremacy
Lund, A. P., Bremner, M. J., & Ralph, T. C. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0018-2 · Cited by 202
Suppression of the critical temperature for superfluidity near the Mott transition
Trotzky, S., Pollet, L., Gerbier, F., Schnorrberger, U., Bloch, I., Prokof’ev, N. V., Svistunov, B., & Troyer, M. (2010) · Nature Physics · doi:10.1038/nphys1799 · Cited by 201
Long-range quantum entanglement in noisy cluster states
Raussendorf, R., Bravyi, S. B., & Harrington, J. (2005) · Physical Review A · doi:10.1103/physreva.71.062313 · Cited by 199
Emergence of coherence and the dynamics of quantum phase transitions
Braun, S. G., Friesdorf, M., Hodgman, S. S., Schreiber, M., Ronzheimer, J. P., Riera, A., del Rey, M., Bloch, I., Eisert, J., & Schneider, U. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1408861112 · Cited by 196
Self-citation
Molecular docking with Gaussian Boson Sampling
Banchi, L., Fingerhuth, M., Babej, T., Ing, C., & Arrazola, J. M. (2020) · Science Advances · doi:10.1126/sciadv.aax1950 · Cited by 196
Boson Sampling with Single-Photon Fock States from a Bright Solid-State Source
Loredo, J. C., Broome, M. A., Hilaire, P., Gazzano, O., Sagnes, I., Lemaitre, A., Almeida, M. P., Senellart, P., & White, A. G. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.130503 · Cited by 194
Achieving quantum supremacy with sparse and noisy commuting quantum computations
Bremner, M. J., Montanaro, A., & Shepherd, D. J. (2017) · Quantum · doi:10.22331/q-2017-04-25-8 · Cited by 191
Solving the Sampling Problem of the Sycamore Quantum Circuits
Pan, F. P., Chen, K., & Zhang, P. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.090502 · Cited by 190
Self-testing/correcting for polynomials and for approximate functions
Gemmell, P. S., Lipton, R., Rubinfeld, R., Sudan, M., & Wigderson, A. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103429 · Cited by 184
Combinatorics and Complexity of Partition Functions
Barvinok, A. I. (2016) · Algorithms and combinatorics · doi:10.1007/978-3-319-51829-9 · Cited by 182
Approximate Unitary t-Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates
Harrow, A. W., & Mehraban, S. A. (2023) · Communications in Mathematical Physics · doi:10.1007/s00220-023-04675-z · Cited by 182
Detailed study of Gaussian boson sampling
Kruse, R., Hamilton, C. S., Sansoni, L., Barkhofen, S., Silberhorn, C., & Jex, I. (2019) · Physical Review A · doi:10.1103/physreva.100.032326 · Cited by 180
The complexity of analog computation
Vergis, A., Steiglitz, K., & Dickinson, B. (1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90105-9 · Cited by 180
Classical boson sampling algorithms with superior performance to near-term experiments
Neville, A., Sparrow, C., Clifford, R., Johnston, E., Birchall, P. M., Montanaro, A., & Laing, A. (2017) · Nature Physics · doi:10.1038/nphys4270 · Cited by 180
Gap-definable counting classes
Fenner, S., Fortnow, L., & Kurtz, S. A. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80024-8 · Cited by 179
General Framework for Randomized Benchmarking
Helsen, J., Roth, I., Onorati, E., Werner, A. H., & Eisert, J. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020357 · Cited by 179
Self-citation
Locally normal symmetric states and an analogue of de Finetti's theorem
Hudson, R. L., & Moody, G. R. (1976) · Probability Theory and Related Fields · doi:10.1007/bf00534784 · Cited by 177
Highly resilient correctors for polynomials
Gemmell, P. S., & Sudan, M. (1992) · Information Processing Letters · doi:10.1016/0020-0190(92)90195-2 · Cited by 174
On the degree of polynomials that approximate symmetric Boolean functions (preliminary version)
Paturi, R. (1992) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/129712.129758 · Cited by 172
Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games
Terhal, B. M., & Divincenzo, D. P. (2004) · Quantum Information and Computation · doi:10.26421/qic4.2-5 · Cited by 171
Sufficient Conditions for Efficient Classical Simulation of Quantum Optics
Rahimi-Keshari, S., Ralph, T. C., & Caves, C. M. (2016) · Physical Review X · doi:10.1103/physrevx.6.021039 · Cited by 167
Theory of Quantum System Certification
Kliesch, M., & Roth, I. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010201 · Cited by 167
Experimental Realization of an Order-Finding Algorithm with an NMR Quantum Computer
Vandersypen, L. M. K., Steffen, M., Breyta, G., Yannoni, C. S., Cleve, R., & Chuang, I. L. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5452 · Cited by 164
Establishing the quantum supremacy frontier with a 281 Pflop/s simulation
Villalonga, B., Lyakh, D. I., Boixo, S., Neven, H., Humble, T. S., Biswas, R., Rieffel, E. G., Ho, A., & Mandrà, S. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab7eeb · Cited by 163
Photonic implementation of boson sampling: a review
Brod, D. J., Galvão, E. F., Crespi, A., Osellame, R., Spagnolo, N., & Sciarrino, F. (2019) · Advanced Photonics · doi:10.1117/1.ap.1.3.034001 · Cited by 159
Quantum computation with realistic magic-state factories
O'Gorman, J., & Campbell, E. T. (2017) · Physical Review A · doi:10.1103/physreva.95.032338 · Cited by 158
Efficient Multiphoton Sampling of Molecular Vibronic Spectra on a Superconducting Bosonic Processor
Wang, C. S., Curtis, J. C., Lester, B., Zhang, Y., Gao, Y. Y., Freeze, J. G., Batista, V. S., Vaccaro, P. H., Chuang, I. L., Frunzio, L., et al. (2020) · Physical Review X · doi:10.1103/physrevx.10.021060 · Cited by 157
Simulation of Quantum Circuits Using the Big-Batch Tensor Network Method
Pan, F., & Zhang, P. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.030501 · Cited by 154
BosonSampling is far from uniform
Aaronson, S., & Arkhipov, A. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-7 · Cited by 152
Perfect sampling with unitary tensor networks
Ferris, A. J., & Vidal, G. (2012) · Physical Review B · doi:10.1103/physrevb.85.165146 · Cited by 152
Quantum advantage with noisy shallow circuits
Bravyi, S., Gosset, D., König, R., & Tomamichel, M. (2020) · Nature Physics · doi:10.1038/s41567-020-0948-z · Cited by 144
Using Gaussian Boson Sampling to Find Dense Subgraphs
Arrazola, J. M., & Bromley, T. R. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.030503 · Cited by 143
Quantum Speed-Ups for Solving Semidefinite Programs
Brandao, F. G. S. L., & Svore, K. M. (2017) · 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) · doi:10.1109/focs.2017.45 · Cited by 142
Sampling of partially distinguishable bosons and the relation to the multidimensional permanent
Tichy, M. C. (2015) · Physical Review A · doi:10.1103/physreva.91.022316 · Cited by 140
Efficient Classical Simulation of Random Shallow 2D Quantum Circuits
Napp, J. C., Placa, R. L. L., Dalzell, A. M., Brandão, F. G. S. L., & Harrow, A. W. (2022) · Physical Review X · doi:10.1103/physrevx.12.021021 · Cited by 140
64-qubit quantum circuit simulation
Chen, Z.-Y., Zhou, Q., Xue, C., Yang, X., Guo, G.-C., & Guo, G.-P. (2018) · Science Bulletin · doi:10.1016/j.scib.2018.06.007 · Cited by 136
Temporally unstructured quantum computation
Shepherd, D., & Bremner, M. J. (2009) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2008.0443 · Cited by 135
The spectral gap for some spin chains with discrete symmetry breaking
Nachtergaele, B. (1996) · Communications in Mathematical Physics · doi:10.1007/bf02099509 · Cited by 133
Stringent and Efficient Assessment of Boson-Sampling Devices
Tichy, M. C., Mayer, K., Buchleitner, A., & Mølmer, K. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.020502 · Cited by 127
Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
Toda, S., & Ogiwara, M. (1992) · SIAM Journal on Computing · doi:10.1137/0221023 · Cited by 126
Massively parallel quantum computer simulator, eleven years later
Raedt, H. A. D., Jin, F., Willsch, D., Willsch, M., Yoshioka, N., Ito, N., Yuan, S., & Michielsen, K. F. L. (2018) · Computer Physics Communications · doi:10.1016/j.cpc.2018.11.005 · Cited by 125
A de Finetti representation for finite symmetric quantum states
König, R., & Renner, R. (2005) · Journal of Mathematical Physics · doi:10.1063/1.2146188 · Cited by 124
Optimal Verification of Entangled States with Local Measurements
Pallister, S., Linden, N., & Montanaro, A. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.170502 · Cited by 124
Architectures for Quantum Simulation Showing a Quantum Speedup
Bermejo-Vega, J., Hangleiter, D., Schwarz, M., Raussendorf, R., & Eisert, J. (2018) · Physical Review X · doi:10.1103/physrevx.8.021010 · Cited by 122
Self-citation

Flagged first, then by citations

8 of the 377 references couldn’t be matched to a known paper.

Research works printed but not linked: 13

10.4086/toc.2013.v009a004 · DOI
Aaronson, S., 2017, Proceeding of the 32nd Computational Complexity Conference (CCC 2017), Riga, 2017
Barak, B., 2021, Proceedings of the 12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021
10.1002/(SICI)1098-2418(1999010)14:1<29::AID-RSA2>3.0.CO;2-X · DOI
Bernstein, E., 1993, Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (STOC ’93), San Diego, 1993
Björklund, A., 2012, Proceedings of the 2012 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’12), Kyoto, 2012, 10.1137/1.9781611973099.73 · DOI
Bouland, A., 2018, Proceedings of the 33rd Computational Complexity Conference (CCC 2018), San Diego, 2018
Clifford, P., 2018, Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’18), New Orleans, 2018, 10.1137/1.9781611975031.10 · DOI
de Finetti, B., 1937, Ann. Inst. Henri Poincaré, 7, 1
10.4086/toc.2015.v011a006 · DOI
10.1126/science.abi8378 · DOI
10.1038/s41534-018-0113-z · DOI
10.1038/s41534-018-0113-z · DOI

Sorted by citations

Gaussian Boson Sampling with Pseudo-Photon-Number-Resolving Detectors and Quantum Computational Advantage
Deng, Y., Gu, Y.-C., Liu, H.-L., Gong, S.-Q., Su, H., Zhang, Z.-J., Tang, H., Jia, M.-H., Xu, J., Chen, M.-C., et al. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.150601 · Cited by 176
Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
Mele, A. A. (2024) · Quantum · doi:10.22331/q-2024-05-08-1340 · Cited by 237
Towards provably efficient quantum algorithms for large-scale machine-learning models
Liu, J., Liu, M., Liu, J.-P., Ye, Z., Wang, Y., Alexeev, Y., Eisert, J., & Jiang, L. (2024) · Nature Communications · doi:10.1038/s41467-023-43957-x · Cited by 117
Self-citation
Understanding quantum machine learning also requires rethinking generalization
Gil-Fuster, E., Eisert, J., & Bravo-Prieto, C. (2024) · Nature Communications · doi:10.1038/s41467-024-45882-z · Cited by 109
Self-citation
Benchmarking quantum computers
Proctor, T. J., Young, K. C., Baczewski, A., & Blume-Kohout, R. (2025) · Nature Reviews Physics · doi:10.1038/s42254-024-00796-z · Cited by 116

See all 152

Authors: Hangleiter, D., & Eisert, J.
Affiliations: National Institute of Standards and Technology (US)
Corresponding author: Hangleiter, Dominik
ORCID: Hangleiter, Dominik
Eisert, Jens
Venue: Reviews of Modern Physics
Publisher: American Physical Society (APS)
Published: 2023-07-20
Volume: 95
Issue: 3
ISSN: 0034-6861 (ISSN-L)
1539-0756
DOI: 10.1103/revmodphys.95.035001
OpenAlex: W4384935381
Cited by: 145
References: 377
Citations by year: 2026: 29 · 2025: 66 · 2024: 36 · 2023: 12
FWCI: 12.66
Type: journal article
Language: en
Open access: green
arxiv.org
Licence: link.aps.org/licenses/aps-default-license (vor)
link.aps.org/licenses/aps-default-accepted-manuscript-license (am, 365 d)
Locations: Reviews of Modern Physics (publishedVersion)
arXiv (Cornell University) (submittedVersion)
Refubium (Universitätsbibliothek der Freien Universität Berlin) (submittedVersion)
HZB Repository (Helmholtz-Zentrum Berlin für Materialien und Energie GmbH (HZB)) (submittedVersion)
Fraunhofer-Publica (Fraunhofer-Gesellschaft) (submittedVersion)
arXiv (Cornell University)
Universitätsbibliothek der FU Berlin Hochschulschriftenstelle u. Dokumentenserver
Funders: U.S. Department of Defense
Simons Institute for the Theory of Computing, University of California Berkeley
Deutsche Forschungsgemeinschaft (CRC 183, EI 519/21-1)
Bundesministerium für Bildung und Forschung
QuantERA
Einstein Stiftung Berlin
Horizon 2020 Framework Programme (817482)
German Federal Ministry of Economics and Climate Protection
Munich Quantum Valley
Topics: Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords: quantum advantage, quantum measurement, probability distributions

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Computational advantage of quantum random sampling

Abstract

Overview

Integrity signals

Verification

Claims the paper makes

Claims other papers make about this one

Citations

Cites

Cited by

Related

Metadata

Record

About these checks