Sciweavers

21 search results - page 4 / 5
» Channel-optimized quantum error correction
Sort
View
75
Voted
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
14 years 10 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
77
Voted
SETA
2004
Springer
81views Mathematics» more  SETA 2004»
15 years 3 months ago
Univariate and Multivariate Merit Factors
Abstract. Merit factor of a binary sequence is reviewed, and constructions are described that appear to satisfy an asymptotic merit factor of 6.3421 . . . Multivariate merit factor...
Matthew G. Parker
86
Voted
FOCS
2006
IEEE
15 years 4 months ago
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
Michael Ben-Or, Claude Crépeau, Daniel Gott...
101
Voted
SETA
2004
Springer
93views Mathematics» more  SETA 2004»
15 years 3 months ago
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
Lars Eirik Danielsen, Matthew G. Parker
DATE
2009
IEEE
106views Hardware» more  DATE 2009»
15 years 5 months ago
Debugging of Toffoli networks
—Intensive research is performed to find post-CMOS technologies. A very promising direction based on reversible logic are quantum computers. While in the domain of reversible lo...
Robert Wille, Daniel Große, Stefan Frehse, G...