One complexity theorist's view of quantum computing
type: Item
instance of: scholarly article
title: One complexity theorist's view of quantum computing
zbMATH Open document ID: 1026.68056
DOI: 10.1016/S0304-3975(01)00377-2
published in: Theoretical Computer Science
publication date: 2003-05-14T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 1909901
zbMATH Keywords: computational complexity theory
Wikidata QID: Q29544201
author: Lance Fortnow
MaRDI profile type: Publication
cites work: Quantum Computability
cites work: Proof verification and the hardness of approximation problems
cites work: Non-deterministic exponential time has two-prover interactive protocols
cites work: Q4039803
cites work: Logical Reversibility of Computation
cites work: Strengths and Weaknesses of Quantum Computing
cites work: Quantum Complexity Theory
cites work: Q4343414
cites work: An oracle builder's toolkit
cites work: Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
cites work: Q4289278
cites work: Relativized worlds with an infinite hierarchy
cites work: Complexity limitations on quantum computation
cites work: Q4228473
cites work: Q3862379
cites work: Quantum computations: algorithms and error correction
cites work: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
cites work: Algebraic methods for interactive proof systems
cites work: On the degree of Boolean functions as real polynomials
cites work: IP = PSPACE
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
cites work: On the Power of Quantum Computation
cites work: A Fast Monte-Carlo Test for Primality
cites work: Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
cites work: The complexity of computing the permanent
DBLP publication ID: journals/tcs/Fortnow03
description: scientific article; zbMATH DE number 1909901