Searching for authors named "Dmitry Gavinsky" – sorted by Relevance.
8 documents found, showing 1 through 8.
-
Strengths and weaknesses of quantum fingerprinting
- …We study the power of quantum fingerprints in the simultaneous message passing (SMP) setting of communication complexity. Yao recently showed how to simulate, with exponential overhead, classical shared-randomness SMP protocols by means of quantum SMP protocols without shared randomness (Q �-protoco…
- Cited by 7 (1 self) – Add To MetaCart
-
Classical Interaction Cannot Replace a Quantum Message
- …We demonstrate a two-player communication problem that can be solved in the oneway quantum model by a 0-error protocol of cost O (log n) but requires exponentially more communication in the classical interactive (bounded error) model. 1…
- Cited by 1 (1 self) – Add To MetaCart
-
A note on shared randomness and shared entanglement in communication
- …We consider several models of 1-round classical and quantum communication, some of these models have not been defined before. We “almost separate ” the models of simultaneous quantum message passing with shared entanglement and the model of simultaneous quantum message passing with shared randomness…
- Cited by 1 (1 self) – Add To MetaCart
-
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 know”), such that conditioned on outputting ‘0 ’ or ‘1’, our guess is correct with high probability. The goal is to maximize the probability o…
- Cited by 8 (3 self) – Add To MetaCart
-
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
- …We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning tasks whose solutions use a boosting technique.…
- Cited by 9 (0 self) – Add To MetaCart
-
Quantum communication cannot simulate a public coin
- …We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large class of efficient classical public-coin protocols can be turned into efficient quantum protocols without public coin. This…
- Cited by 7 (2 self) – Add To MetaCart
-
On Boosting with Polynomially Bounded Distributions
- …We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle's distribution), with minimal performance loss.…
- Cited by 2 (0 self) – Add To MetaCart
-
Entanglement-resistant two-prover interactive proof systems and non-adaptive private information retrieval systems
- …We show that, for any language in NP, there is an entanglement-resistant constant-bit two-prover interactive proof system with a constant completeness vs. soundness gap. The previously proposed classical two-prover constant-bit interactive proof systems are known not to be entanglement-resistant. Th…
- Cited by 2 (1 self) – Add To MetaCart
Showing 1 through 8.
