An Introduction to Quantum Complexity Theory

@article{Cleve2000AnIT,
  title={An Introduction to Quantum Complexity Theory},
  author={R. Cleve},
  journal={arXiv: Quantum Physics},
  year={2000},
  pages={103}
}
  • R. Cleve
  • Published 2000
  • Mathematics, Physics
  • arXiv: Quantum Physics
We give a basic overview of computational complexity, query complexity, and communication complexity, with quantum information incorporated into each of these scenarios. The aim is to provide simple but clear definitions, and to highlight the interplay between the three scenarios and currently-known quantum algorithms. 
Introduction to Recent Quantum Algorithms
TLDR
The aim is to give a basic overview of the primary techniques used in proving upper and lower bounds and illustrate how to apply the techniques to a variety of problems, including the threshold function, parity, searching and sorting. Expand
Quantum Computational Complexity
  • J. Watrous
  • Mathematics, Computer Science
  • Encyclopedia of Complexity and Systems Science
  • 2009
TLDR
Property of quantum complexity classes based on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems are presented. Expand
Quantum Algorithm III
TLDR
An algorithm introduced by Ohya and Volovich is discussed which can solve the NP-complete satisfiability (SAT) problem in polynomial time and goes beyond the quantum Turing machine paradigm. Expand
An Introduction to Quantum Computing
TLDR
This book discusses quantum algorithms, a quantum model of computation, and algorithms with super-polynomial speed-up, as well as quantum computational complexity theory and lower bounds. Expand
Universal quantum processors with arbitrary radix n
Here is discussed the Hamiltonian approach to construction of deterministic universal (in approximate sense) programmable quantum circuits with qubits or any other quantum systems with dimension ofExpand
Quantum programming languages
TLDR
The state of the art in the development of quantum programming languages is investigated, two kinds of such languages are distinguished, those targeting at practical applications or the programming of actual quantum computers and those targeting the theoretical analysis of quantum programs. Expand
Quantum Algorithms for Element Distinctness
We present several applications of quantum amplitude amplification for deciding whether all elements in the image of a given function are distinct, for finding an intersection of two sorted tables,Expand
A Stochastic Limit Approach to the SAT Problem
TLDR
In this paper, a new concept of quantum adaptive stochastic systems is proposed, and it is shown that it can be used to solve the problem above. Expand
Quantum Challenges
TLDR
The aim of the talk is to present and to analyse the current situation in quantum information processing and to point out main quantum challenges that need to be attacked in order to make a further progress in this fascinating and promising area. Expand
Quantum Algorithms
  • M. Mosca
  • Computer Science, Physics
  • Encyclopedia of Complexity and Systems Science
  • 2009
TLDR
This work provides an explicit algorithm for generating any prescribed interference pattern with an arbitrary precision for quantum algorithms and shows how they are related to diierent instances of quantum phase estimation. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 53 REFERENCES
Realizable Universal Quantum Logic Gates.
TLDR
This work identifies a 2-bit quantum gate that is sufficient to build any quantum logic network and proposes an explicit construction of this gate, which is based on cavity QED techniques and may be realizable with current technology. Expand
Complexity limitations on quantum computation
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantumExpand
Quantum gates and circuits
  • D. DiVincenzo
  • Mathematics, Physics
  • Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1998
A historical review is given of the emergence of the idea of the quantum logic gate from the theory of reversible Boolean gates. I highlight the quantum XOR or controlled NOT as the fundamentalExpand
Fast quantum verification for the formulas of predicate calculus
Quantum algorithm is constructed which veries the formula s of predicate calculus in time O( p N) with bounded error probability, where N is the time required for classical algorithms. This algorithmExpand
The Probabilistic Communication Complexity of Set Intersection
It is shown that, for inputs of length n, the probabilistic (bounded error) communication complexity of set intersection is $\Theta ( n )$. Since set intersection can be recognized nondeterministic...
Quantum algorithms revisited
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantumExpand
Quantum Counting
TLDR
This work generalizes the Grover iteration in the light of a concept called amplitude amplification, and shows that the quadratic speedup obtained by the quantum searching algorithm over classical brute force can still be obtained for a large family of search problems for which good classical heuristics exist. Expand
Quantum computational networks
  • D. Deutsch
  • Mathematics
  • Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1989
The theory of quantum computational networks is the quantum generalization of the theory of logic circuits used in classical computing machines. Quantum gates are the generalization of classicalExpand
Quantum measurements and the Abelian Stabilizer Problem
  • A. Kitaev
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 1996
TLDR
A polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm is presented, based on a procedure for measuring an eigenvalue of a unitary operator. Expand
Quantum Circuit Complexity
  • A. Yao
  • Mathematics, Computer Science
  • FOCS
  • 1993
TLDR
It is shown that any function computable in polynomial time by a quantum Turing machine has aPolynomial-size quantum circuit, and this result enables us to construct a universal quantum computer which can simulate a broader class of quantum machines than that considered by E. Bernstein and U. Vazirani (1993), thus answering an open question raised by them. Expand
...
1
2
3
4
5
...