How to simulate free will in a computational device
ACM Computing Surveys (CSUR)
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
Computational complexity of uniform quantum circuit families and quantum Turing machines
Theoretical Computer Science
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
On Quantum Computation with Some Restricted Amplitudes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Quantum Circuits with Unbounded Fan-out
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Analysis of Quantum Functions (Preliminary Version)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
On Deniability in Quantum Key Exchange
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science - Algorithms,automata, complexity and games
One complexity theorist's view of quantum computing
Theoretical Computer Science - Algorithms,automata, complexity and games
PSPACE Has Constant-Round Quantum Interactive Proof Systems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum zero-error algorithms cannot be composed
Information Processing Letters
Polynomial time quantum computation with advice
Information Processing Letters
On the complexity of simulating space-bounded quantum computations
Computational Complexity
Quantum branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
Approximate Counting and Quantum Computation
Combinatorics, Probability and Computing
Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
A common algebraic description for probabilistic and quantum computations
Theoretical Computer Science - Mathematical foundations of computer science 2004
Revisiting a limit on efficient quantum computation
Proceedings of the 44th annual Southeast regional conference
Uniformity of quantum circuit families for error-free algorithms
Theoretical Computer Science
Entropy and algorithmic complexity in quantum information theory
Natural Computing: an international journal
ACM SIGACT News
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
Determining the equivalence for one-way quantum finite automata
Theoretical Computer Science
A new connection between quantum circuits, graphs and the Ising partition function
Quantum Information Processing
Quantum Information Processing
Languages Recognized with Unbounded Error by Quantum Finite Automata
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Theory of one-tape linear-time Turing machines
Theoretical Computer Science
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
BQP and the polynomial hierarchy
Proceedings of the forty-second ACM symposium on Theory of computing
Computational depth complexity of measurement-based quantum computation
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
Counting, fanout and the complexity of quantum ACC
Quantum Information & Computation
Quantum computing and polynomial equations over the finite field Z2
Quantum Information & Computation
The Jones polynomial: quantum algorithms and applications in quantum complexity theory
Quantum Information & Computation
Quantum interactive proofs with weak error bounds
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Quantum weakly nondeterministic communication complexity
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Bounds on the power of constant-depth quantum circuits
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Universal sets of quantum information processing primitives and their optimal use
General Theory of Information Transfer and Combinatorics
Computation with multiple CTCs of fixed length and width
Natural Computing: an international journal
Proving the Power of Postselection
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
Hi-index | 0.01 |
In this paper some theoretical and (potentially) practical aspects of quantum computing are considered. Using the tools of transcendental number theory it is demonstrated that quantum Turing machines (QTM) with rational amplitudes are sufficient to define the class of bounded error quantum polynomial time (BQP) introduced by Bernstein and Vazirani [Proc. 25th ACM Symposium on Theory of Computation, 1993, pp. 11--20, SIAM J. Comput., 26 (1997), pp. 1277--1339]. On the other hand, if quantum Turing machines are allowed unrestricted amplitudes (i.e., arbitrary complex amplitudes), then the corresponding BQP class has uncountable cardinality and contains sets of all Turing degrees. In contrast, allowing unrestricted amplitudes does not increase the power of computation for error-free quantum polynomial time (EQP). Moreover, with unrestricted amplitudes, BQP is not equal to EQP. The relationship between quantum complexity classes and classical complexity classes is also investigated. 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 ${\rm P}^{\#{\rm P}}$ and PSPACE. A potentially practical issue of designing "machine independent" quantum programs is also addressed. A single ("almost universal") quantum algorithm based on Shor's method for factoring integers is developed which would run correctly on almost all quantum computers, even if the underlying unitary transformations are unknown to the programmer and the device builder.