The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Fourier Transforms and Quantum Computation
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Evolving blackbox quantum algorithms using genetic programming
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Adversary Lower Bounds for Nonadaptive Quantum Algorithms
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
A review of procedures to evolve quantum algorithms
Genetic Programming and Evolvable Machines
A Symbolic Classical Computer Language for Simulation of Quantum Algorithms
QI '09 Proceedings of the 3rd International Symposium on Quantum Interaction
BQP and the polynomial hierarchy
Proceedings of the forty-second ACM symposium on Theory of computing
Adversary lower bounds for nonadaptive quantum algorithms
Journal of Computer and System Sciences
Limitations of quantum coset states for graph isomorphism
Journal of the ACM (JACM)
Quantum algorithms for highly non-linear Boolean functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The computational complexity of linear optics
Proceedings of the forty-third annual ACM symposium on Theory of computing
Quantum guessing via Deutsch-Jozsa
Quantum Information & Computation
Quantum lower bound for recursive Fourier sampling
Quantum Information & Computation
Quantum computation from a quantum logical perspective
Quantum Information & Computation
How a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem
Quantum Information & Computation
Solid-state crystal lattice NMR quantum computation
Quantum Information & Computation
Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Knot theory, jones polynomial and quantum computing
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Quantum strategies are better than classical in almost any XOR game
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
The quantum query complexity of algebraic properties
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A quantum-inspired evolutionary algorithm for optimization numerical problems
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
Quantum set intersection and its application to associative memory
The Journal of Machine Learning Research
An improved quantum-behaved particle swarm optimization algorithm
Applied Intelligence
Histogram-based segmentation of quantum images
Theoretical Computer Science
| Hi-index | 0.00 |
The quantum model of computation is a probabilistic model, similar to the probabilistic Turing Machine, in which the laws of chance are those obeyed by particles on a quantum mechanical scale, rather than the rules familiar to us from the macroscopic world. We present here a problem of distinguishing between two fairly natural classes of function, which can provably be solved exponentially faster in the quantum model than in the classical probabilistic one, when the function is given as an oracle drawn equiprobably from the uniform distribution on either class. We thus offer compelling evidence that the quantum model may have significantly more complexity theoretic power than the probabilistic Turing Machine. In fact, drawing on this work, Shor (1994) has recently developed remarkable new quantum polynomial-time algorithms for the discrete logarithm and integer factoring problems.