Sciweavers

18 search results - page 3 / 4
» Using Entanglement in Quantum Multi-prover Interactive Proof...
Sort
View
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
14 years 8 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
QI
2009
Springer
190views Physics» more  QI 2009»
14 years 3 months ago
Characterizing Pure High-Order Entanglements in Lexical Semantic Spaces via Information Geometry
An emerging topic in Quantuam Interaction is the use of lexical semantic spaces, as Hilbert spaces, to capture the meaning of words. There has been some initial evidence that the p...
Yuexian Hou, Dawei Song
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 7 months ago
Quantum interactive proofs with short messages
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier. The ...
Salman Beigi, Peter W. Shor, John Watrous
FOCS
2003
IEEE
14 years 1 months ago
A Lattice Problem in Quantum NP
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
Dorit Aharonov, Oded Regev
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 9 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...