Related references
Note: Only part of the references are listed.Revisiting Deutsch-Jozsa algorithm
Daowen Qiu et al.
INFORMATION AND COMPUTATION (2020)
Generalization and demonstration of an entanglement-based Deutsch-Jozsa-like algorithm using a 5-qubit quantum computer
Sayan Gangopadhyay et al.
QUANTUM INFORMATION PROCESSING (2018)
Quantum Query as a state decomposition
S. A. Grillo et al.
THEORETICAL COMPUTER SCIENCE (2018)
Generalized Deutsch-Jozsa problem and the optimal quantum algorithm
Daowen Qiu et al.
PHYSICAL REVIEW A (2018)
Virtual boundaries of Hadamard spaces with admissible actions of higher rank
Sebastian Grensing
MATHEMATISCHE ZEITSCHRIFT (2016)
Postprocessing for speeding up general quantum search algorithms
Avatar Tulsi
PHYSICAL REVIEW A (2015)
Quantum search with multiple walk steps per oracle query
Thomas G. Wong et al.
PHYSICAL REVIEW A (2015)
On Exact Quantum Query Complexity
Ashley Montanaro et al.
ALGORITHMICA (2015)
Quantum Algorithm for Linear Systems of Equations
Aram W. Harrow et al.
PHYSICAL REVIEW LETTERS (2009)
Quantum algorithms for the ordered search problem via semidefinite programming
Andrew M. Childs et al.
PHYSICAL REVIEW A (2007)
A sum of squares approximation of nonnegative polynomials
JB Lasserre
SIAM JOURNAL ON OPTIMIZATION (2006)
Nondeterministic quantum query and communication complexities
R De Wolf
SIAM JOURNAL ON COMPUTING (2003)
Complexity measures and decision tree complexity: a survey
H Buhrman et al.
THEORETICAL COMPUTER SCIENCE (2002)
Quantum lower bounds by quantum arguments
A Ambainis
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2002)
Quantum lower bounds by polynomials
R Beals et al.
JOURNAL OF THE ACM (2001)
Share Paper
