Search Sciweavers | Sciweavers

508 search results - page 56 / 102

» Quantum Computers

click to vote

STOC
2004
ACM

152views Algorithms» more STOC 2004»

Exponential separation of quantum and classical one-way communication complexity

14 years 11 months ago

Download webee.technion.ac.il

Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...

Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis

claim paper

Read More »

click to vote

FOCS
2005
IEEE

79views Theoretical Computer Science» more FOCS 2005»

Quantum Information and the PCP Theorem

14 years 4 months ago

Download www.wisdom.weizmann.ac.il

Ran Raz

claim paper

Read More »

click to vote

FCT
2001
Springer

75views Applied Computing» more FCT 2001»

Quantum Algorithms

14 years 3 months ago

Download www.cs.berkeley.edu

Umesh V. Vazirani

claim paper

Read More »

click to vote

FOCS
1999
IEEE

80views Theoretical Computer Science» more FOCS 1999»

Optimal Lower Bounds for Quantum Automata and Random Access Codes

14 years 3 months ago

Download www.math.uwaterloo.ca

Ashwin Nayak

claim paper

Read More »

click to vote

FOCS
2004
IEEE

126views Theoretical Computer Science» more FOCS 2004»

Quantum Weak Coin-Flipping with Bias of 0.192

14 years 2 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers