Who Cited It

Strengths and Weaknesses of Quantum Computing

1997 · SIAM Journal on Computing · 1,500 citations · 8 from inside this corpus

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.

Strengths and Weaknesses of Quantum Computing (1997)Strengths and Weaknesses of Q…A fast quantum mechanical algorithm for database search (1996)A fast quantum mechanical alg…Algorithms for quantum computation: discrete logarithms and factoring (2002)Algorithms for quantum comput…Simulating physics with computers (1982)Simulating physics with compu…Logical Reversibility of Computation (1973)Logical Reversibility of Comp…Rapid solution of problems by quantum computation (1992)Rapid solution of problems by…Quantum Complexity Theory (1997)Quantum Complexity TheoryA fast quantum mechanical algorithm for database search (1996)A fast quantum mechanical alg…Quantum Computing in the NISQ era and beyond (2018)Quantum Computing in the NISQ…Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum C… (1997)Polynomial-Time Algorithms fo…Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum C… (1999)Polynomial-Time Algorithms fo…A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Pro… (2001)A Quantum Adiabatic Evolution…Adiabatic quantum computation (2018)Adiabatic quantum computationQuantum Complexity Theory (1997)Quantum Complexity TheoryQuantum computing (1998)Quantum computing
14 of 14 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.
this paper works it cites works citing it node size = global citations · hover for the full title

Citation edge evidence

Each row is directed from the citing work to the cited work. Source status remains readable without the interactive graph.

What this paper cites, inside the corpus

PaperYearCited
A fast quantum mechanical algorithm for database search19968,800
Algorithms for quantum computation: discrete logarithms and factoring20028,732
Simulating physics with computers19827,615
Logical Reversibility of Computation19733,732
Rapid solution of problems by quantum computation19922,713
Quantum Complexity Theory19971,552

What cites it, inside the corpus

PaperYearCited
A fast quantum mechanical algorithm for database search19968,800
Quantum Computing in the NISQ era and beyond20188,662
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum C…19976,013
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum C…19993,923
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Pro…20012,110
Adiabatic quantum computation20181,597
Quantum Complexity Theory19971,552
Quantum computing19981,373

Links

Download BibTeX · Download RIS · DOI · Open access copy · OpenAlex record

Topics

Quantum Computing Algorithms and ArchitectureComputer Science
Computability, Logic, AI AlgorithmsComputer Science
Quantum Information and CryptographyComputer 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

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:58+00:00.

sha256 88a60cdbb94c6a13…