Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

2018

2018

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

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

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

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

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

Is this relevant?

Highly Cited

2007

Highly Cited

2007

Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n. But… Expand

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?