Sciweavers

11 search results - page 1 / 3
» Quantum Error Correction Via Codes Over GF(4)
Sort
View
TIT
1998
58views more  TIT 1998»
13 years 4 months ago
Quantum Error Correction Via Codes Over GF(4)
A. Robert Calderbank, Eric M. Rains, Peter W. Shor...
SETA
2004
Springer
93views Mathematics» more  SETA 2004»
13 years 10 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
SPAA
2003
ACM
13 years 10 months ago
The effect of communication costs in solid-state quantum computing architectures
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Freder...
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
13 years 9 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
SETA
2004
Springer
81views Mathematics» more  SETA 2004»
13 years 10 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