Fetching the paper…
Reading the bibliography…
A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1).
D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A
1985
Earlier work this paper cites.
D. Deutsch, R. Jozsa. Rapid solutions of problems by quantum computation. Proceedings of the Royal Society of London A
1992
Earlier work this paper cites.
B. Kalyanasundaram and G. Schnitger. The probabilistic communication complexity of set intersection. SIAM Journal on Computing
1992
Earlier work this paper cites.
A. Razborov. On the distributional complexity of disjointness. Theoretical Computer Science
1992
Earlier work this paper cites.
C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, W. K. Wootters, Teleporting an Unknown Quantum State via Dual Classical and Einstein-Podolsky-Rosen Channels, Physical Review Letters
1993
Earlier work this paper cites.
On the degree of Boolean functions as real polynomials
N. Nisan and M. Szegedy · 1994
Earlier work this paper cites.
N. Nisan, A. Wigderson. On rank vs. communication complexity. Combinatorica
1995
Earlier work this paper cites.
G. Brassard and P. Høyer. An exact quantum polynomial-time algorithm for Simon’s problem. Proceedings of the Israeli Symposium on Theory of Computing and Systems (ISTCS)
1997
Earlier work this paper cites.
P. Shor. Algorithms for Quantum Computation: Discrete Logarithms and Factoring. SIAM Journal on Computing
1997
Earlier work this paper cites.
D. Simon. On the power of quantum computation. SIAM Journal on Computing
1997
Earlier work this paper cites.
R. Cleve, A. Ekert, C. Macchiavello, M. Mosca. Quantum algorithms revisited. Proceedings of the Royal Society of London A
1998
Cited alongside, same era.
D. Aharonov. Quantum computation. Annual Reviews of Computational Physics VI
1999
Cited alongside, same era.
M. Nielsen, I. Chuang. Quantum Computation and Quantum Information
2000
Cited alongside, same era.
R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. Journal of the ACM
2001
Cited alongside, same era.
G. Brassard, P. Høyer, M. Mosca, A. Tapp. Quantum amplitude amplification and estimation. In Quantum Computation and Quantum Information Science
2002
Cited alongside, same era.
H. Buhrman, R. de Wolf. Complexity measures and decision tree complexity: a survey. Theoretical Computer Science
E. Farhi, J. Goldstone, S. Gutmann, A Quantum Algorithm for the Hamiltonian NAND Tree. Theory of Computing
2008
Later among the works it cites.
H. Buhrman, R. Cleve, S. Massar, R. de Wolf. Non-locality and Communication Complexity. Reviews of Modern Physics
2010
Later among the works it cites.
K. Balodis. Personal communication, November 27, 2012
2012
Closest in time.
J. Iraids. Personal communication, December 19, 2012
2012
Closest in time.
2012
Closest in time.
R. de Wolf. Personal communication. November 6, 2012
2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2002
Cited alongside, same era.
T. Hayes, S. Kutin, and D. van Melkebeek. The quantum black-box complexity of majority. Algorithmica
2002
Cited alongside, same era.
A. Ambainis. Polynomial degree vs. quantum query complexity. Journal of Computer and System Sciences
2006
Cited alongside, same era.
A. Ambainis. Quantum walk algorithm for element distinctness. SIAM Journal on Computing
2007
Cited alongside, same era.
H. Buhrman, R. Cleve, A. Wigderson. Quantum vs. classical communication and computation. Proceedings of STOC’98
Cited in the paper.
Quantum oracle interrogation: Getting all information for almost half the price
W. van Dam
Cited in the paper.
L. K. Grover. A fast quantum mechanical algorithm for database search. Proceedings of STOC’96
Cited in the paper.
Closest in time.
2013
Closest in time.
2013
Closest in time.