Results 1  10
of
115,544
Exponential separation of quantum and classical oneway communication complexity
 SIAM J. Comput
"... Abstract. We give the first exponential separation between quantum and boundederror randomized oneway communication complexity. Specifically, we define the Hidden Matching Problem HMn: Alice gets as input a string x ∈ {0, 1} n and Bob gets a perfect matching M on the n coordinates. Bob’s goal is t ..."
Abstract

Cited by 48 (4 self)
 Add to MetaCart
Abstract. We give the first exponential separation between quantum and boundederror randomized oneway communication complexity. Specifically, we define the Hidden Matching Problem HMn: Alice gets as input a string x ∈ {0, 1} n and Bob gets a perfect matching M on the n coordinates. Bob’s goal
Exponential separation of quantum and classical oneway communication complexity for a boolean function
, 2006
"... We give an exponential separation between oneway quantum and classical communication complexity for a Boolean function. Earlier such a separation was known only for a relation. A very similar result was obtained earlier but independently by Kerenidis and Raz [KR06]. Our version of the result gives ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We give an exponential separation between oneway quantum and classical communication complexity for a Boolean function. Earlier such a separation was known only for a relation. A very similar result was obtained earlier but independently by Kerenidis and Raz [KR06]. Our version of the result gives
Electronic Colloquium on Computational Complexity, Report No. 86 (2006) Exponential Separation of Quantum and Classical OneWay Communication Complexity for a Boolean Function
"... We give an exponential separation between oneway quantum and classical communication complexity for a Boolean function. Earlier such a separation was known only for a relation. A very similar result was obtained earlier but independently by Kerenidis and Raz [KR06]. Our version of the result gives ..."
Abstract
 Add to MetaCart
We give an exponential separation between oneway quantum and classical communication complexity for a Boolean function. Earlier such a separation was known only for a relation. A very similar result was obtained earlier but independently by Kerenidis and Raz [KR06]. Our version of the result gives
Exponential separations for oneway quantum communication complexity, with applications to cryptography
 IN PROCEEDINGS OF 39TH ACM STOC
, 2007
"... We give an exponential separation between oneway quantum and classical communication protocols for a partial Boolean function (a variant of the Boolean Hidden Matching Problem of BarYossef et al.) Earlier such an exponential separation was known only for a relational problem. The communication pr ..."
Abstract

Cited by 58 (16 self)
 Add to MetaCart
We give an exponential separation between oneway quantum and classical communication protocols for a partial Boolean function (a variant of the Boolean Hidden Matching Problem of BarYossef et al.) Earlier such an exponential separation was known only for a relational problem. The communication
Quantum oneway communication can be exponentially stronger than classical communication
 In STOC
, 2011
"... In STOC 1999, Raz presented a (partial) function for which there is a quantum protocol communicating only O(log n) qubits, but for which any classical (randomized, boundederror) protocol requires poly(n) bits of communication. That quantum protocol requires two rounds of communication. Ever since R ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
Raz’s paper it was open whether the same exponential separation can be achieved with a quantum protocol that uses only one round of communication. Here we settle this question in the affirmative. 1
The oneway communication complexity . . .
, 2009
"... This paper studies the oneway communication complexity of the subgroup membership problem, a classical problem closely related to basic questions in quantum computing. Here Alice receives, as input, a subgroup H of a finite group G; Bob receives an element x ∈ G. Alice is permitted to send a single ..."
Abstract
 Add to MetaCart
This paper studies the oneway communication complexity of the subgroup membership problem, a classical problem closely related to basic questions in quantum computing. Here Alice receives, as input, a subgroup H of a finite group G; Bob receives an element x ∈ G. Alice is permitted to send a
Quantum Gravity
, 2004
"... We describe the basic assumptions and key results of loop quantum gravity, which is a background independent approach to quantum gravity. The emphasis is on the basic physical principles and how one deduces predictions from them, at a level suitable for physicists in other areas such as string theor ..."
Abstract

Cited by 566 (11 self)
 Add to MetaCart
We describe the basic assumptions and key results of loop quantum gravity, which is a background independent approach to quantum gravity. The emphasis is on the basic physical principles and how one deduces predictions from them, at a level suitable for physicists in other areas such as string
Teleporting an Unknown Quantum State via Dual Classical and EPR Channels
, 1993
"... An unknown quantum state jOEi can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical EPR correlations. To do so the sender, "Alice," and the receiver, "Bob," must prearrange the sharing of an EPRcorrelated pair of particles. ..."
Abstract

Cited by 648 (22 self)
 Add to MetaCart
An unknown quantum state jOEi can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical EPR correlations. To do so the sender, "Alice," and the receiver, "Bob," must prearrange the sharing of an EPRcorrelated pair of particles
A oneway quantum computer
 Phys. Rev. Lett
"... We describe a faulttolerant oneway quantum computer on cluster states in three dimensions. The presented scheme uses methods of topological error correction resulting from a link between cluster states and surface codes. The error threshold is 1.4 % for local depolarizing error and 0.11 % for each ..."
Abstract

Cited by 184 (1 self)
 Add to MetaCart
We describe a faulttolerant oneway quantum computer on cluster states in three dimensions. The presented scheme uses methods of topological error correction resulting from a link between cluster states and surface codes. The error threshold is 1.4 % for local depolarizing error and 0
Results 1  10
of
115,544