Quantum complexity theory

@inproceedings{Bernstein1993QuantumCT,
  title={Quantum complexity theory},
  author={Ethan Bernstein and Umesh V. Vazirani},
  booktitle={STOC '93},
  year={1993}
}
In this dissertation we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing Machine in Deutsch's model of a quantum Turing Machine. This construction is substantially more complicated than the corresponding construction for classical Turing Machines--in fact, even simple primitives such as looping, branching and composition are not straightforward in the context of quantum Turing Machines. We establish how… Expand
Quantum Complexity Theory
TLDR
This paper gives the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church--Turing thesis, and proves that bits of precision suffice to support a step computation. Expand
Another Quantum Turing Machines
TLDR
This paper considers that the superposition of configurations, a basic concept of the quantum Turing machines, should also be applied to the probabilistic Turing machines to solve the satisfiability and the validity problems in polynomial time. Expand
Quantum Computation 1 the Need for Quantum Mechanics
Historically, Turing machines have been the paradigm by which we de ned computability and e ciency. This is based on Church's thesis that everything e ectively computable can also be computed on aExpand
Computational Power of the Quantum Turing Automata
TLDR
An overview of the current beliefs of quantum complexity theorists is presented and the impacts these beliefs may have on the future of the field are discussed. Expand
Universality and programmability of quantum computers
TLDR
The extent to which universality has in fact been established by the pioneers in the field is examined and this key notion in theoretical computer science is scrutinised in quantum computing by distinguishing various connotations and concomitant results and problems. Expand
Quantum Kolmogorov Complexity and the Quantum Turing Machine
The purpose of this thesis is to give a formal definition of quantum Kolmogorov complexity (QC), and rigorous mathematical proofs of its basic properties. The definition used here is similar to thatExpand
Classically controlled quantum computation
TLDR
This work introduces a Classically controlled Quantum Turing Machine (CQTM), which is a Turing machine with a quantum tape for acting on quantum data, and a classical transition function for formalised classical control, and proves that any classical Turing machine can be simulated by a CQTM without loss of efficiency. Expand
Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity
  • Markus P. Mueller
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 2008
TLDR
A rigorous proof is given that quantum Kolmogorov complexity as defined by Berthiaume is invariant, i.e., depends on the choice of the UQTM only up to an additive constant. Expand
Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition
  • S. Perdrix
  • Computer Science, Mathematics
  • Electron. Notes Theor. Comput. Sci.
  • 2011
TLDR
It is claimed in this paper that the well-formedness condition of the quantum Turing machine is too strong and it is introduced a weaker condition, leading to a larger class of Turing machines called Observable Quantum Turing Machines (OQTMs). Expand
Quantum Computability
TLDR
It is shown that when quantum Turing machines are restricted to have transition amplitudes which are algebraic numbers, BQP, EQP, and nondeterministic quantum polynomial time (NQP) are all contained in PP, hence in P and PSPACE. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 71 REFERENCES
Quantum theory, the Church–Turing principle and the universal quantum computer
  • D. Deutsch
  • Mathematics
  • Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1985
It is argued that underlying the Church–Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every finitely realizibleExpand
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
The quantum challenge to structural complexity theory
  • A. Berthiaume, G. Brassard
  • Computer Science
  • [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference
  • 1992
TLDR
There are cryptographic tasks that are demonstrably impossible to implement with unlimited computing power probabilistic interactive turning machines, yet they can be implemented even in practice by quantum mechanical apparatus. Expand
On one-dimensional quantum cellular automata
  • J. Watrous
  • Mathematics, Computer Science
  • Proceedings of IEEE 36th Annual Foundations of Computer Science
  • 1995
TLDR
It is demonstrated that any quantum Turing machine can be efficiently simulated by a one dimensional quantum cellular automaton with constant slowdown, and this can be accomplished by consideration of a restricted class of one dimensionalquantum cellular automata called one dimensional partitioned quantum Cellular automata. Expand
Oracle Quantum Computing
This paper continues the study of the power of oracles to separate quantum com.plexity classes from classical (including probabilistic and nondeterministic) complexity classes, which we initiated inExpand
The stabilisation of quantum computations
A quantum computer is a device capable of performing computational tasks that depend on characteristically quantum mechanical effects, in particular coherent quantum superposition. Such devices canExpand
Quantum mechanical hamiltonian models of turing machines
Quantum mechanical Hamiltonian models, which represent an aribtrary but finite number of steps of any Turing machine computation, are constructed here on a finite lattice of spin-1/2 systems.Expand
Two-bit gates are universal for quantum computation.
  • DiVincenzo
  • Physics, Medicine
  • Physical review. A, Atomic, molecular, and optical physics
  • 1995
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. TheExpand
Characterizing classes of functions computable by quantum parallelism
  • R. Jozsa
  • Mathematics
  • Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
  • 1991
Computation by quantum parallelism involves associating a quantum state v(f) to each function f: Zm → Zn. v(f) is formed from superpositions of states labelled by the values of f, the standard choiceExpand
A 1-Tape 2-Symbol Reversible Turing Machine
TLDR
It is seen that a 1-tape 2-symbol reversible Turing machine is computation universal. Expand
...
1
2
3
4
5
...