Quantum circuits with mixed states
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A framework for fast quantum mechanical algorithms
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
Quantum Fourier sampling simplified
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Dense quantum coding and a lower bound for 1-way quantum automata
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
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
Quantum computers that can be simulated classically in polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Interaction in quantum communication and the complexity of set disjointness
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A new protocol and lower bounds for quantum coin flipping
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum lower bound for the collision problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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
On communication over an entanglement-assisted quantum channel
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computational complexity of uniform quantum circuit families and quantum Turing machines
Theoretical Computer Science
Minds and Machines
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
Three problems in computer science
Journal of the ACM (JACM)
Computing with quanta-impacts of quantum theory on computation
Theoretical Computer Science - Natural computing
Quantum communication and complexity
Theoretical Computer Science - Natural computing
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
Fourier transforms and quantum computation
Theoretical aspects of computer science
A Foundation of Programming a Multi-tape Quantum Turing Machine
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Exact Results for Accepting Probabilities of Quantum Automata
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Quantum Search on Structured Problems
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Quantum Entanglement and the Communication Complexity of the Inner Product Function
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
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
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Quantum Algorithms for Intersection and Proximity Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
STACS '01 Proceedings of the 18th 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
A Quantum Goldreich-Levin Theorem with Cryptographic Applications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Deterministic Application of Grover's Quantum Search Algorithm
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Analysis of Quantum Functions (Preliminary Version)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Halting of Quantum Turing Machines
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
The Quantum Computing Challenge
Informatics - 10 Years Back. 10 Years Ahead.
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
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Introduction to Recent Quantum Algorithms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
One complexity theorist's view of quantum computing
Theoretical Computer Science - Algorithms,automata, complexity and games
Exact results for accepting probabilities of quantum automata
Theoretical Computer Science - Mathematical foundations of computer science
Mathematical models of quantum computation
New Generation Computing
Exponential algorithmic speedup by a quantum walk
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Information and Computation
A Better Lower Bound for Quantum Algorithms Searching an Ordered List
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On Quantum and Classical Space-Bounded Processes with Algebraic Transition Amplitudes
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
Using HDLs for describing quantum circuits: a framework for efficient quantum algorithm simulation
Proceedings of the 1st conference on Computing frontiers
A new protocol and lower bounds for quantum coin flipping
Journal of Computer and System Sciences - STOC 2001
Automata theory based on quantum logic: some characterizations
Information and Computation
Polynomial time quantum computation with advice
Information Processing Letters
Hypercomputation with quantum adiabatic processes
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
The query complexity of order-finding
Information and Computation
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
Quantum Information Processing
A probabilistic model of computing with words
Journal of Computer and System Sciences
Classical and Quantum Complexity of the Sturm--Liouville Eigenvalue Problem
Quantum Information Processing
Quantum branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
On Halting Process of Quantum Turing Machine
Open Systems & Information Dynamics
Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
Improved Bounds on Quantum Learning Algorithms
Quantum Information Processing
Limits on the ability of quantum states to convey classical messages
Journal of the ACM (JACM)
Implementing quantum genetic algorithms: a solution based on Grover's algorithm
Proceedings of the 3rd conference on Computing frontiers
A polynomial quantum algorithm for approximating the Jones polynomial
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Quantum lower bounds for the Goldreich-Levin problem
Information Processing Letters
The Quantum Setting with Randomized Queries for Continuous Problems
Quantum Information Processing
Some formal tools for analyzing quantum automata
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Zeno machines and hypercomputation
Theoretical Computer Science
Determination of equivalence between quantum sequential machines
Theoretical Computer Science
Quantum programming languages: survey and bibliography
Mathematical Structures in Computer Science
Classically controlled quantum computation
Mathematical Structures in Computer Science
Error-bounded probabilistic computations between MA and AM
Journal of Computer and System Sciences
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
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Quantum protocols for untrusted computations
Journal of Discrete Algorithms
The Sturm-Liouville Eigenvalue Problem and NP-Complete Problems in the Quantum Setting with Queries
Quantum Information Processing
Improved algorithms for quantum identification of Boolean oracles
Theoretical Computer Science
Entropy and algorithmic complexity in quantum information theory
Natural Computing: an international journal
Automata theory based on quantum logic: Reversibilities and pushdown automata
Theoretical Computer Science
Quantum Algorithms for Learning and Testing Juntas
Quantum Information Processing
On the complexity of the multivariate Sturm--Liouville eigenvalue problem
Journal of Complexity
Approximation and robustness of fuzzy finite automata
International Journal of Approximate Reasoning
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
Quantum computing: beyond the limits of conventional computation
International Journal of Parallel, Emergent and Distributed Systems - Emergent Computation
Evolving blackbox quantum algorithms using genetic programming
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Determining the equivalence for one-way quantum finite automata
Theoretical Computer Science
Universality and programmability of quantum computers
Theoretical Computer Science
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Various Aspects of Finite Quantum Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Theoretical Computer Science
A new connection between quantum circuits, graphs and the Ising partition function
Quantum Information Processing
Some algebraic properties of measure-once two-way quantum finite automata
Quantum Information Processing
Quantum Information Processing
Quantum algorithms using the curvelet transform
Proceedings of the forty-first annual ACM symposium on Theory of computing
Note: A note on quantum sequential machines
Theoretical Computer Science
On a measurement-free quantum lambda calculus with classical control
Mathematical Structures in Computer Science
Hierarchy and equivalence of multi-letter quantum finite automata
Theoretical Computer Science
Approximation of fuzzy context-free grammars
Information Sciences: an International Journal
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
Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency
Fuzzy Sets and Systems
Theory of one-tape linear-time Turing machines
Theoretical Computer Science
Quantum implicit computational complexity
Theoretical Computer Science
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
Classically-controlled Quantum Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
Quantum lower bounds for the Goldreich--Levin problem
Information Processing Letters
Detecting code alteration by creating a temporary memory bottleneck
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Quantum circuit oracles for Abstract Machine computations
Theoretical Computer Science
Quantum search on bounded-error inputs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Probabilities to accept languages by quantum finite automata
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
BQP and the polynomial hierarchy
Proceedings of the forty-second ACM symposium on Theory of computing
The geometry of quantum learning
Quantum Information Processing
Quantum algorithms for highly non-linear Boolean functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Measurement-based and universal blind quantum computation
SFM'10 Proceedings of the Formal methods for quantitative aspects of programming languages, and 10th international conference on School on formal methods for the design of computer, communication and software systems
Postselection finite quantum automata
UC'10 Proceedings of the 9th international conference on Unconventional computation
An improved lower bound on query complexity for quantum PAC learning
Information Processing Letters
Nonadaptive quantum query complexity
Information Processing Letters
Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition
Electronic Notes in Theoretical Computer Science (ENTCS)
The polynomial degree of recursive Fourier sampling
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding
SIAM Journal on Computing
Unbounded-error quantum computation with small space bounds
Information and Computation
The search for structure in quantum computation
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
The computational complexity of linear optics
Proceedings of the forty-third annual ACM symposium on Theory of computing
Unbounded-error quantum query complexity
Theoretical Computer Science
Upper bounds on the noise threshold for fault-tolerant quantum computing
Quantum Information & Computation
Characterization of universal two-qubit hamiltonian
Quantum Information & Computation
Counting, fanout and the complexity of quantum ACC
Quantum Information & Computation
Languages recognized by nondeterministic quantum finite automata
Quantum Information & Computation
Limits on entropic uncertainty relations for 3 and more MUBs
Quantum Information & Computation
Quantum Information & Computation
Quantum lower bound for recursive Fourier sampling
Quantum Information & Computation
Adptive quantum computation, constant depth quantum circuits and arthur-merlin games
Quantum Information & Computation
An upper bound on the threshold quantum decoherence rate
Quantum Information & Computation
Quantum computing and polynomial equations over the finite field Z2
Quantum Information & Computation
Quantum Information & Computation
Quantum advantage without entanglement
Quantum Information & Computation
Hidden symmetry detection on a quantum computer
Quantum Information & Computation
How a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem
Quantum Information & Computation
Efficient quantum circuits for approximating the Jones polynomial
Quantum Information & Computation
Quantum algorithms for shifted subset problems
Quantum Information & Computation
Encoded universality from a single physical interaction
Quantum Information & Computation
On perfect completeness for QMA
Quantum Information & Computation
Digital quantum simulation with Rydberg atoms
Quantum Information Processing
How many query superpositions are needed to learn?
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
On beating the hybrid argument
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Quantum hardcore functions by complexity-theoretical quantum list decoding
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Improved algorithms for quantum identification of boolean oracles
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
UC'05 Proceedings of the 4th international conference on Unconventional Computation
The complexity of black-box ring problems
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Reflections for quantum query algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Superiority of exact quantum automata for promise problems
Information Processing Letters
Quantum weakly nondeterministic communication complexity
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Knot theory, jones polynomial and quantum computing
MFCS'05 Proceedings of the 30th 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
Journal of Computer and System Sciences
A logic for quantum circuits and protocols
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
The quantum query complexity of learning multilinear polynomials
Information Processing Letters
Quantum counterfeit coin problems
Theoretical Computer Science
Reconstructing strings from substrings with quantum queries
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Automata theory based on complete residuated lattice-valued logic: Turing machines
Fuzzy Sets and Systems
QMA variants with polynomially many provers
Quantum Information & Computation
Quantum entanglement and the communication complexity of the inner product function
Theoretical Computer Science
Quantum weakly nondeterministic communication complexity
Theoretical Computer Science
Most Tensor Problems Are NP-Hard
Journal of the ACM (JACM)
Efficient algorithms for universal quantum simulation
RC'13 Proceedings of the 5th international conference on Reversible Computation
On using probabilistic Turing machines to model participants in cryptographic protocols
Theoretical Computer Science
Exponential quantum speed-ups are generic
Quantum Information & Computation
Proving the Power of Postselection
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
Histogram-based segmentation of quantum images
Theoretical Computer Science
Hi-index | 0.02 |
In this paper 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 (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97--117]. This construction is substantially more complicated than the corresponding construction for classical Turing machines (TMs); in fact, even simple primitives such as looping, branching, and composition are not straightforward in the context of quantum Turing machines. We establish how these familiar primitives can be implemented and introduce some new, purely quantum mechanical primitives, such as changing the computational basis and carrying out an arbitrary unitary transformation of polynomially bounded dimension.We also consider the precision to which the transition amplitudes of a quantum Turing machine need to be specified. We prove that $O(\log T)$ bits of precision suffice to support a $T$ step computation. This justifies the claim that the quantum Turing machine model should be regarded as a discrete model of computation and not an analog one. We give the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church--Turing thesis. We show the existence of a problem, relative to an oracle, that can be solved in polynomial time on a quantum Turing machine, but requires superpolynomial time on a bounded-error probabilistic Turing machine, and thus not in the class $\BPP$. The class $\BQP$ of languages that are efficiently decidable (with small error-probability) on a quantum Turing machine satisfies $\BPP \subseteq \BQP \subseteq \Ptime^{\SP}$. Therefore, there is no possibility of giving a mathematical proof that quantum Turing machines are more powerful than classical probabilistic Turing machines (in the unrelativized setting) unless there is a major breakthrough in complexity theory.