Search Sciweavers | Sciweavers

1352 search results - page 226 / 271

» Fault-Tolerant Quantum Computation

click to vote

ANTS
2004
Springer

109views Algorithms» more ANTS 2004»

On the Complexity of Computing Units in a Number Field

14 years 1 months ago

Download www.cse.iitk.ac.in

Given an algebraic number ﬁeld K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...

Vikraman Arvind, Piyush P. Kurur

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

STOC
2004
ACM

152views Algorithms» more STOC 2004»

Exponential separation of quantum and classical one-way communication complexity

14 years 8 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 2 months ago

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

Kimikazu Kato, Hiroshi Imai, Keiko Imai

claim paper

Read More »