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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We present a distribution D over inputs in {±1} , such that: 1. There exists a quantum algorithm that makes one (quantum) query… (More)
Is this relevant?
2017
2017
Tomoyuki Morimae ∗ and Harumichi Nishimura † Department of Computer Science, Gunma University, 1-5-1 Tenjincho Kiryushi Gunma… (More)
  • figure 1
Is this relevant?
2017
2017
1National Institute of Standards and Technology, Gaithersburg, MD, USA 2Joint Center for Quantum Information and Computer Science… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2016
2016
Using the measurement-based quantum computation model, we construct interactive proofs with non-communicating quantum provers and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
We explore the space "just above" <b>BQP</b> by defining a complexity class <b>naCQP</b> (non-adaptive Collapse-free Quantum… (More)
  • table 1
Is this relevant?
2011
2011
  • Yang Li
  • Electronic Colloquium on Computational Complexity
  • 2011
We initiate the study of the relationship between two complexity classes, BQP (BoundedError Quantum Polynomial-Time) and PPAD… (More)
  • figure 1
Is this relevant?
2010
2010
It is a longstanding open problem to devise an oracle relativ to which BQP does not lie in the Polynomial-Time Hierarchy (PH). We… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence… (More)
  • figure 1
Is this relevant?
2006
2006
Following the work by Kitaev, Freedman and Wang [1], Aharonov, Jones and Landau [3] recently gave an explicit and efficient… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Let A be a real symmetric matrix of size N such that the number of non-zero entries in each row is polylogarithmic in N and the… (More)
  • figure 1
Is this relevant?