Search Sciweavers | Sciweavers

206 search results - page 22 / 42

» On the Complexity of Quantum ACC

click to vote

ISAAC
2007
Springer

105views Algorithms» more ISAAC 2007»

Unbounded-Error Classical and Quantum Communication Complexity

14 years 2 months ago

Download www.lab2.kuis.kyoto-u.ac.jp

Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...

claim paper

Read More »

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

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

Download www.comp.nus.edu.sg

Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen

claim paper

Read More »

click to vote

CORR
2008
Springer

69views Education» more CORR 2008»

Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity

13 years 8 months ago

Download www.comp.nus.edu.sg

Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan

claim paper

Read More »

click to vote

FFA
2006

79views more FFA 2006»

Why is quantum physics based on complex numbers?

13 years 8 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers