The DOI matches its Crossref record.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Decoherence, einselection, and the quantum origins of the classical
Zurek, W. H. (2003) · Reviews of Modern Physics · doi:10.1103/revmodphys.75.715 · Cited by 4,295
A threshold of ln n for approximating set cover
Feige, U. (1998) · Journal of the ACM · doi:10.1145/285055.285059 · Cited by 3,086
Approximation algorithms for combinatorial problems
Johnson, D. S. (1974) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(74)80044-9 · Cited by 2,197
Software protection and simulation on oblivious RAMs
Goldreich, O., & Ostrovsky, R. (1996) · Journal of the ACM · doi:10.1145/233551.233553 · Cited by 1,617
Rock: A robust clustering algorithm for categorical attributes
Guha, S., Rastogi, R., & Shim, K. (2000) · Information Systems · doi:10.1016/s0306-4379(00)00022-3 · Cited by 1,472
Proof verification and the hardness of approximation problems
Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1998) · Journal of the ACM · doi:10.1145/278298.278306 · Cited by 1,413
Goldreich, O., Micali, S., & Wigderson, A. (1991) · Journal of the ACM · doi:10.1145/116825.116852 · Cited by 1,349
Which Problems Have Strongly Exponential Complexity?
Impagliazzo, R., Paturi, R., & Zane, F. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2001.1774 · Cited by 1,331
Probabilistic checking of proofs: a new characterization of NP
Arora, S., & Safra, S. (1998) · Journal of the ACM · doi:10.1145/273865.273901 · Cited by 1,153
Two-bit gates are universal for quantum computation
DiVincenzo, D. P. (1995) · Physical Review A · doi:10.1103/physreva.51.1015 · Cited by 1,069
Property testing and its connection to learning and approximation
Goldreich, O., Goldwasser, S., & Ron, D. (1998) · Journal of the ACM · doi:10.1145/285055.285060 · Cited by 1,020
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Emerson, E. A., & Halpern, J. Y. (1986) · Journal of the ACM · doi:10.1145/4904.4999 · Cited by 1,009
Minimum disclosure proofs of knowledge
Brassard, G., Chaum, D., & Crépeau, C. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90005-0 · Cited by 959
Belief, awareness, and limited reasoning
Fagin, R., & Halpern, J. Y. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90003-8 · Cited by 885
Power of One Bit of Quantum Information
Knill, E., & Laflamme, R. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.5672 · Cited by 884
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Leighton, T., & Rao, S. (1999) · Journal of the ACM · doi:10.1145/331524.331526 · Cited by 820
Inductive inference of formal languages from positive data
Angluin, D. (1980) · Information and Control · doi:10.1016/s0019-9958(80)90285-5 · Cited by 745
A Calculus for Cryptographic Protocols: The Spi Calculus
Abadi, M., & Gordon, A. D. (1999) · Information and Computation · doi:10.1006/inco.1998.2740 · Cited by 668
Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E., & Warmuth, M. K. (1997) · Journal of the ACM · doi:10.1145/258128.258179 · Cited by 634
Efficient Deep Learning: A Survey on Making Deep Learning Models Smaller, Faster, and Better
Menghani, G. (2023) · ACM Computing Surveys · doi:10.1145/3578938 · Cited by 605
A survey of graph layout problems
Díaz, J., Petit, J., & Serna, M. (2002) · ACM Computing Surveys · doi:10.1145/568522.568523 · Cited by 599
Experimental Quantum Error Correction
Cory, D. G., Price, M. D., Maas, W., Knill, E., Laflamme, R., Zurek, W. H., Havel, T. F., & Somaroo, S. S. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.2152 · Cited by 581
Computational Capacity of the Universe
Lloyd, S. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.237901 · Cited by 571
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
Lewko, A., & Waters, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-11799-2_27 · Cited by 556
Fast algorithms for bin packing
Johnson, D. S. (1974) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(74)80026-7 · Cited by 540
Quantum computations without definite causal structure
Chiribella, G., D’Ariano, G. M., Perinotti, P., & Valiron, B. (2013) · Physical Review A · doi:10.1103/physreva.88.022318 · Cited by 521
Secure Multi-Party Computation: Theory, practice and applications
Zhao, C., Zhao, S., Zhao, M., Chen, Z., Gao, C.-Z., Li, H., & Tan, Y.-A. (2019) · Information Sciences · doi:10.1016/j.ins.2018.10.024 · Cited by 508
Introduction to Statistical Learning Theory
Bousquet, O., Boucheron, S., & Lugosi, G. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28650-9_8 · Cited by 503
Schlosshauer, M. (2019) · Physics Reports · doi:10.1016/j.physrep.2019.10.001 · Cited by 487
Operator quantum error-correcting subsystems for self-correcting quantum memories
Bacon, D. (2006) · Physical Review A · doi:10.1103/physreva.73.012340 · Cited by 486
A new approach to the minimum cut problem
Karger, D. R., & Stein, C. (1996) · Journal of the ACM · doi:10.1145/234533.234534 · Cited by 485
Insecurity of quantum secure computations
Lo, H.-K. (1997) · Physical Review A · doi:10.1103/physreva.56.1154 · Cited by 479
Convergence assessment techniques for Markov chain Monte Carlo
BROOKS, S. P., & ROBERTS, G. O. (1998) · Statistics and Computing · doi:10.1023/a:1008820505350 · Cited by 463
Efficient algorithms for finding maximum matching in graphs
Galil, Z. (1986) · ACM Computing Surveys · doi:10.1145/6462.6502 · Cited by 461
Fiat, A., Karp, R. M., Luby, M., McGeoch, L. A., Sleator, D. D., & Young, N. E. (1991) · Journal of Algorithms · doi:10.1016/0196-6774(91)90041-v · Cited by 457
On the Indifferentiability of the Sponge Construction
Bertoni, G., Daemen, J., Peeters, M., & Van Assche, G. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_11 · Cited by 425
Competitive algorithms for server problems
Manasse, M. S., McGeoch, L. A., & Sleator, D. D. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90003-w · Cited by 425
Discrete Single-Photon Quantum Walks with Tunable Decoherence
Broome, M. A., Fedrizzi, A., Lanyon, B. P., Kassal, I., Aspuru-Guzik, A., & White, A. G. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.153602 · Cited by 420
Perfectly secure message transmission
Dolev, D., Dwork, C., Waarts, O., & Yung, M. (1993) · Journal of the ACM · doi:10.1145/138027.138036 · Cited by 412
An introduction to quantum computing for non-physicists
Rieffel, E., & Polak, W. (2000) · ACM Computing Surveys · doi:10.1145/367701.367709 · Cited by 407
An Economics Approach to Hard Computational Problems
Huberman, B. A., Lukose, R. M., & Hogg, T. (1997) · Science · doi:10.1126/science.275.5296.51 · Cited by 390
Composable Security Proof for Continuous-Variable Quantum Key Distribution with Coherent States
Leverrier, A. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.070501 · Cited by 382
Topological Order with a Twist: Ising Anyons from an Abelian Model
Bombin, H. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.030403 · Cited by 369
I-structures: data structures for parallel computing
Arvind, Nikhil, R. S., & Pingali, K. K. (1989) · ACM Transactions on Programming Languages and Systems · doi:10.1145/69558.69562 · Cited by 360
Operating Quantum States in Single Magnetic Molecules: Implementation of Grover’s Quantum Algorithm
Godfrin, C., Ferhat, A., Ballou, R., Klyatskaya, S., Ruben, M., Wernsdorfer, W., & Balestro, F. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.187702 · Cited by 357
Equivalence between modularity optimization and maximum likelihood methods for community detection
Newman, M. E. J. (2016) · Physical Review E · doi:10.1103/physreve.94.052315 · Cited by 344
Beyond lightning: A survey on security challenges in cloud computing
Rong, C., Nguyen, S. T., & Jaatun, M. G. (2013) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2012.04.015 · Cited by 334
Quantum lower bounds for the collision and the element distinctness problems
Aaronson, S., & Shi, Y. (2004) · Journal of the ACM · doi:10.1145/1008731.1008735 · Cited by 328
CrypTFlow2: Practical 2-Party Secure Inference
Rathee, D., Rathee, M., Kumar, N., Chandran, N., Gupta, D., Rastogi, A., & Sharma, R. (2020) · Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3372297.3417274 · Cited by 326
Phase transitions in the coloring of random graphs
Zdeborová, L., & Krząkała, F. (2007) · Physical Review E · doi:10.1103/physreve.76.031131 · Cited by 306
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
Bounding the inefficiency of equilibria in nonatomic congestion games
Roughgarden, T., & Tardos, É. (2004) · Games and Economic Behavior · doi:10.1016/j.geb.2003.06.004 · Cited by 298
Scalable Gate Architecture for a One-Dimensional Array of Semiconductor Spin Qubits
Zajac, D. M., Hazard, T. M., Mi, X., Nielsen, E., & Petta, J. R. (2016) · Physical Review Applied · doi:10.1103/physrevapplied.6.054013 · Cited by 291
Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings
Maller, M., Bowe, S., Kohlweiss, M., & Meiklejohn, S. (2019) · Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3319535.3339817 · Cited by 290
Quantum computation and quantum information
Nagy, M., & Akl, S. G. (2006) · International Journal of Parallel, Emergent and Distributed Systems · doi:10.1080/17445760500355678 · Cited by 287
Sparsification—a technique for speeding up dynamic graph algorithms
Eppstein, D., Galil, Z., Italiano, G. F., & Nissenzweig, A. (1997) · Journal of the ACM · doi:10.1145/265910.265914 · Cited by 282
A Random Sampling Scheme for Path Planning
Barraquand, J., Kavraki, L., Latombe, J.-C., Motwani, R., Li, T.-Y., & Raghavan, P. (1997) · The International Journal of Robotics Research · doi:10.1177/027836499701600604 · Cited by 277
Efficient networks for quantum factoring
Beckman, D., Chari, A. N., Devabhaktuni, S., & Preskill, J. (1996) · Physical Review A · doi:10.1103/physreva.54.1034 · Cited by 268
Quantum Simulation of Time-Dependent Hamiltonians and the Convenient Illusion of Hilbert Space
Poulin, D., Qarry, A., Somma, R., & Verstraete, F. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.170501 · Cited by 265
Bell’s Inequalities and Quantum Communication Complexity
Brukner, Č., Żukowski, M., Pan, J.-W., & Zeilinger, A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.127901 · Cited by 265
Duan, L.-M., & Guo, G.-C. (1998) · Physical Review A · doi:10.1103/physreva.57.737 · Cited by 259
Device-independent quantum random-number generation
Liu, Y., Zhao, Q., Li, M.-H., Guan, J.-Y., Zhang, Y., Bai, B., Zhang, W., Liu, W.-Z., Wu, C., Yuan, X., et al. (2018) · Nature · doi:10.1038/s41586-018-0559-3 · Cited by 258
The complexity of reasoning about knowledge and time. I. Lower bounds
Halpern, J. Y., & Vardi, M. Y. (1989) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(89)90039-1 · Cited by 252
Fault-Tolerant Quantum Computation with Long-Range Correlated Noise
Aharonov, D., Kitaev, A., & Preskill, J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.050504 · Cited by 243
Quantum Speedup for Active Learning Agents
Paparo, G. D., Dunjko, V., Makmal, A., Martin-Delgado, M. A., & Briegel, H. J. (2014) · Physical Review X · doi:10.1103/physrevx.4.031002 · Cited by 192
Does quantum mechanics play a non-trivial role in life?
Davies, P. C. W. (2004) · Biosystems · doi:10.1016/j.biosystems.2004.07.001 · Cited by 187
Coherent quantum transport in photonic lattices
Perez-Leija, A., Keil, R., Kay, A., Moya-Cessa, H., Nolte, S., Kwek, L.-C., Rodríguez-Lara, B. M., Szameit, A., & Christodoulides, D. N. (2013) · Physical Review A · doi:10.1103/physreva.87.012309 · Cited by 182
Quantum Speedup by Quantum Annealing
Somma, R. D., Nagaj, D., & Kieferová, M. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.050501 · Cited by 176
Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer
Tame, M. S., Prevedel, R., Paternostro, M., Böhi, P., Kim, M. S., & Zeilinger, A. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.140501 · Cited by 124
Experimental realization of quantum algorithm for solving linear systems of equations
Pan, J., Cao, Y., Yao, X., Li, Z., Ju, C., Chen, H., Peng, X., Kais, S., & Du, J. (2014) · Physical Review A · doi:10.1103/physreva.89.022313 · Cited by 110
Searching a quantum phone book
Brassard, G. (1997) · Science · doi:10.1126/science.275.5300.627 · Cited by 103
Experimental Realization of a Quantum Autoencoder: The Compression of Qutrits via Machine Learning
Pepper, A., Tischler, N., & Pryde, G. J. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.060501 · Cited by 97
Decision trees do not generalize to new variations
Bengio, Y., Delalleau, O., & Simard, C. (2010) · Computational Intelligence · doi:10.1111/j.1467-8640.2010.00366.x · Cited by 89
Quantum learning robust against noise
Cross, A. W., Smith, G., & Smolin, J. A. (2015) · Physical Review A · doi:10.1103/physreva.92.012327 · Cited by 80
Noise thresholds for optical cluster-state quantum computation
Dawson, C. M., Haselgrove, H. L., & Nielsen, M. A. (2006) · Physical Review A · doi:10.1103/physreva.73.052306 · Cited by 79
Dominant Reaction Pathways by Quantum Computing
Hauke, P., Mattiotti, G., & Faccioli, P. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.028104 · Cited by 20
Metadata
- Publisher
- ACM
- Published
- 2024-06-10
- OpenAlex
- W1531368347
- Cited by
- 1,730
- References
- 0
- Type
- paratext
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.