Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

BQP

Known as: BQP-Complete 
In computational complexity theory, BQP (bounded error quantum polynomial time) is the class of decision problems solvable by a quantum computer in… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
  • R. Raz, A. Tal
  • Electron. Colloquium Comput. Complex.
  • 2018
  • Corpus ID: 49338641
We present a distribution D over inputs in {−1,1}2N, such that: (1) There exists a quantum algorithm that makes one (quantum… Expand
Is this relevant?
2017
2017
We define the functionality of delegated pseudo-secret random qubit generator (PSRQG), where a classical client can instruct the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2016
Highly Cited
2016
Using the measurement-based quantum computation model, we construct interactive proofs with non-communicating quantum provers and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
Recent work has shown that quantum computers can compute scattering probabilities in massive quantum field theories, with a run… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2013
2013
We study three variants of multi-prover quantum Merlin-Arthur proof systems. We first show that the class of problems that can be… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence… Expand
  • figure 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 2.5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
  • S. Aaronson
  • Proceedings of the Royal Society A: Mathematical…
  • 2007
  • Corpus ID: 1481507
Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n. But… Expand
  • figure 1
Is this relevant?
1998
1998
In analogy with NP, a language L is in the class NQP if the strings in L are exactly those accepted by a polynomial-time quantum… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
In this paper, we examine various complexity issues relative to an oracle for a generic set in order to determine which are the… Expand
Is this relevant?