Search Sciweavers | Sciweavers

7486 search results - page 70 / 1498

» The Limits of Quantum Computers

click to vote

TAMC
2007
Springer

95views Applied Computing» more TAMC 2007»

Quantum Multiparty Communication Complexity and Circuit Lower Bounds

14 years 2 months ago

Download www.lri.fr

Iordanis Kerenidis

claim paper

Read More »

click to vote

STOC
2004
ACM

152views Algorithms» more STOC 2004»

Exponential separation of quantum and classical one-way communication complexity

14 years 9 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

ISVD
2007
IEEE

77views Theoretical Computer Science» more ISVD 2007»

Error Analysis of a Numerical Calculation about One-qubit Quantum Channel Capacity

14 years 3 months ago

Download www-imai.is.s.u-tokyo.ac.jp

Kimikazu Kato, Hiroshi Imai, Keiko Imai

claim paper

Read More »

click to vote

SPAA
2005
ACM

84views Distributed And Parallel Com...» more SPAA 2005»

Is partial quantum search of a database any easier?

14 years 2 months ago

Download physics.princeton.edu

Lov K. Grover, Jaikumar Radhakrishnan

claim paper

Read More »

click to vote

FOCS
2003
IEEE

122views Theoretical Computer Science» more FOCS 2003»

A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness

14 years 2 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers