# BQP

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

- Electronic Colloquium on Computational Complexity
- 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

- Quantum Information & Computation
- 2017

Tomoyuki Morimae âˆ— and Harumichi Nishimura â€ Department of Computer Science, Gunma University, 1-5-1 Tenjincho Kiryushi Gunmaâ€¦Â (More)

Is this relevant?

2017

2017

- 2017

1National Institute of Standards and Technology, Gaithersburg, MD, USA 2Joint Center for Quantum Information and Computer Scienceâ€¦Â (More)

Is this relevant?

2016

2016

- Theory of Computing
- 2016

Using the measurement-based quantum computation model, we construct interactive proofs with non-communicating quantum provers andâ€¦Â (More)

Is this relevant?

2014

2014

- ITCS
- 2014

We explore the space "just above" <b>BQP</b> by defining a complexity class <b>naCQP</b> (non-adaptive Collapse-free Quantumâ€¦Â (More)

Is this relevant?

2011

2011

- 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)

Is this relevant?

2010

2010

- ArXiv
- 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

- STOC
- 2009

The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidenceâ€¦Â (More)

Is this relevant?

2006

2006

- ArXiv
- 2006

Following the work by Kitaev, Freedman and Wang [1], Aharonov, Jones and Landau [3] recently gave an explicit and efficientâ€¦Â (More)

Is this relevant?

2006

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)

Is this relevant?