One complexity theorist's view of quantum computing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 559220 (Why is no real title available?)
- scientific article; zbMATH DE number 1030974 (Why is no real title available?)
- A Fast Monte-Carlo Test for Primality
- Algebraic methods for interactive proof systems
- An oracle builder's toolkit
- Complexity limitations on quantum computation
- Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
- Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
- IP = PSPACE
- Logical Reversibility of Computation
- Non-deterministic exponential time has two-prover interactive protocols
- On the Power of Quantum Computation
- On the degree of Boolean functions as real polynomials
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Proof verification and the hardness of approximation problems
- Quantum Complexity Theory
- Quantum Computability
- Quantum computations: algorithms and error correction
- Relativized worlds with an infinite hierarchy
- Strengths and Weaknesses of Quantum Computing
- The complexity of computing the permanent
Cited in
(11)- Models of quantum computation and quantum programming languages
- Quantum computation and quantum information†
- A common algebraic description for probabilistic and quantum computations
- On the solution of trivalent decision problems by quantum state identification
- QUANTUM COMPLEXITY THEORY GOALS AND CHALLENGES
- Universality, invariance, and the foundations of computational complexity in the light of the quantum computer
- Chaitin's omega and an algorithmic phase transition
- Universality and programmability of quantum computers
- Computational universes
- Many worlds, the cluster-state quantum computer, and the problem of the preferred basis
- Computational complexity, step by step
This page was built for publication: One complexity theorist's view of quantum computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870556)
