Complexity limitations on quantum computation
type: Item
instance of: scholarly article
title: Complexity limitations on quantum computation
zbMATH Open document ID: 0947.68050
published in: Journal of Computer and System Sciences
publication date: 2000-01-17T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 1389785
zbMATH Keywords: complexity of quantum computation
author: Lance Fortnow
author: John D. Rogers
MaRDI profile type: Publication
cites work: Quantum Computability
cites work: Strengths and Weaknesses of Quantum Computing
cites work: Q4359455
cites work: Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
cites work: Quantum Complexity Theory
cites work: Gap-definable counting classes
cites work: An oracle builder's toolkit
cites work: Q4525727
cites work: Computational Complexity of Probabilistic Turing Machines
cites work: Q4228473
cites work: Complexity Measures for Public-Key Cryptosystems
cites work: Q3862379
cites work: Q5750403
cites work: Graph isomorphism is low for PP
cites work: On the degree of Boolean functions as real polynomials
cites work: Q5573961
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: RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS
cites work: Q4258586
description: scientific article; zbMATH DE number 1389785