Strengths and Weaknesses of Quantum Computing
Charles H. Bennett, Ethan Bernstein, Gilles Brassard, Umesh Vazirani
The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
What this paper cites, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| A fast quantum mechanical algorithm for database search | 1996 | 8,800 |
| Algorithms for quantum computation: discrete logarithms and factoring | 2002 | 8,732 |
| Simulating physics with computers | 1982 | 7,615 |
| Logical Reversibility of Computation | 1973 | 3,732 |
| Rapid solution of problems by quantum computation | 1992 | 2,713 |
| Quantum Complexity Theory | 1997 | 1,552 |
What cites it, inside the corpus
Links
Topics
| Quantum Computing Algorithms and Architecture | Computer Science |
| Computability, Logic, AI Algorithms | Computer Science |
| Quantum Information and Cryptography | Computer Science |
Is this record sound?
complete
Nothing in this record contradicts itself and no field we check is missing.
- supports4 author record(s) attached.
- supports18 reference(s) recorded.
- neutralThe DOI carries no year to check against.
- supportsA title is present.
Provenance
sha256 88a60cdbb94c6a13…