Quantum circuits with mixed states
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Molecular scale heat engines and scalable quantum computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Normal subgroup reconstruction and quantum computation using group representations
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Self-testing of universal and fault-tolerant sets of quantum gates
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An introduction to quantum computing for non-physicists
ACM Computing Surveys (CSUR)
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Quantum algorithms for solvable groups
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum mechanical algorithms for the nonabelian hidden subgroup problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Counting by quantum eigenvalue estimation
Theoretical Computer Science
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Almost-everywhere superiority for Quantum polynomial time
Information and Computation
Why haven't more quantum algorithms been found?
Journal of the ACM (JACM)
Quantum Factoring, Discrete Logarithms, and the Hidden Subgroup Problem
Computing in Science and Engineering
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Quantum algorithms for some hidden shift problems
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Separating Quantum and Classical Learning
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Average-Case Quantum Query Complexity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On Quantum Computation with Some Restricted Amplitudes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Quantum Public-Key Cryptosystems
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Introduction to Recent Quantum Algorithms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On Quantum Versions of the Yao Principle
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
One complexity theorist's view of quantum computing
Theoretical Computer Science - Algorithms,automata, complexity and games
Mathematical models of quantum computation
New Generation Computing
Hidden translation and orbit coset in quantum computing
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Exponential algorithmic speedup by a quantum walk
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The power of basis selection in fourier sampling: hidden subgroup problems in affine groups
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Quantum and classical query complexities of local search are polynomially related
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Quantum lower bounds for the collision and the element distinctness problems
Journal of the ACM (JACM)
The quantum query complexity of the hidden subgroup problem is polynomial
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Quantum computing without entanglement
Theoretical Computer Science
The query complexity of order-finding
Information and Computation
A lower bound on the quantum query complexity of read-once functions
Journal of Computer and System Sciences
Progress in Quantum Algorithms
Quantum Information Processing
Deterministic polynomial-time quantum algorithms for Simon's problem
Computational Complexity
Tensor norms and the classical communication complexity of nonlocal quantum measurement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fast quantum algorithms for computing the unit group and class group of a number field
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Quantum algorithms for the triangle problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The Symmetric Group Defies Strong Fourier Sampling
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Improved Bounds on Quantum Learning Algorithms
Quantum Information Processing
A polynomial quantum algorithm for approximating the Jones polynomial
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Computing with highly mixed states
Journal of the ACM (JACM)
Revisiting a limit on efficient quantum computation
Proceedings of the 44th annual Southeast regional conference
On the power of Ambainis lower bounds
Theoretical Computer Science
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
Journal of the ACM (JACM)
The quantum query complexity of the abelian hidden subgroup problem
Theoretical Computer Science
Quantum algorithms for Simon's problem over general groups
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Determining the equivalence for one-way quantum finite automata
Theoretical Computer Science
A Symbolic Classical Computer Language for Simulation of Quantum Algorithms
QI '09 Proceedings of the 3rd International Symposium on Quantum Interaction
Quantum Testers for Hidden Group Properties
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Quantum algorithms for Simon's problem over nonabelian groups
ACM Transactions on Algorithms (TALG)
Constant-time solution to Simon's decision problem with the known subgroup range in quantum computer
CI '07 Proceedings of the Third IASTED International Conference on Computational Intelligence
An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On quantum algorithms for noncommutative hidden subgroups
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Lower bounds on quantum query complexity for read-once decision trees with parity nodes
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Nonadaptive quantum query complexity
Information Processing Letters
Complexity classes of equivalence problems revisited
Information and Computation
On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism
SIAM Journal on Computing
Upper bounds on the noise threshold for fault-tolerant quantum computing
Quantum Information & Computation
Counting, fanout and the complexity of quantum ACC
Quantum Information & Computation
Quantum solution to the hidden subgroup problem for poly-near-hamiltonian groups
Quantum Information & Computation
Quantum advantage without entanglement
Quantum Information & Computation
Hidden symmetry detection on a quantum computer
Quantum Information & Computation
Quantum computation from a quantum logical perspective
Quantum Information & Computation
Quantum measurements for hidden subgroup problems with optimal sample complexity
Quantum Information & Computation
Quantum communication complexity of block-composed functions
Quantum Information & Computation
Quantum algorithms for shifted subset problems
Quantum Information & Computation
On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems
Quantum Information & Computation
Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups
Quantum Information & Computation
Solid-state crystal lattice NMR quantum computation
Quantum Information & Computation
McEliece and niederreiter cryptosystems that resist quantum fourier sampling attacks
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Quantum property testing for bounded-degree graphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On the uselessness of quantum queries
Theoretical Computer Science
How many query superpositions are needed to learn?
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
A quantum lower bound for the query complexity of simon's problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Quantum noisy rational function reconstruction
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Reflections for quantum query algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the black-box complexity of sperner's lemma
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Simulating quantum computers with probabilistic methods
Quantum Information & Computation
Mathematical model of stored logic based computation
Mathematical and Computer Modelling: An International Journal
Quantum Testers for Hidden Group Properties
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Reduction from non-injective hidden shift problem to injective hidden shift problem
Quantum Information & Computation
Superlinear advantage for exact quantum algorithms
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Exponential quantum speed-ups are generic
Quantum Information & Computation
Quantum Information Processing
Quantum Information Processing
| Hi-index | 0.01 |
The quantum model of computation is a model, analogous to the probabilistic Turing machine (PTM), in which the normal laws of chance are replaced by 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 functions, 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 PTM. In fact, drawing on this work, Shor has recently developed remarkable new quantum polynomial-time algorithms for the discrete logarithm and integer factoring problems.