15,079 research outputs found
Complex spherical codes with two inner products
A finite set in a complex sphere is called a complex spherical -code
if the number of inner products between two distinct vectors in is equal to
. In this paper, we characterize the tight complex spherical -codes by
doubly regular tournaments, or skew Hadamard matrices. We also give certain
maximal 2-codes relating to skew-symmetric -optimal designs. To prove them,
we show the smallest embedding dimension of a tournament into a complex sphere
by the multiplicity of the smallest or second-smallest eigenvalue of the Seidel
matrix.Comment: 10 pages, to appear in European Journal of Combinatoric
Supplementary difference sets with symmetry for Hadamard matrices
First we give an overview of the known supplementary difference sets (SDS)
(A_i), i=1..4, with parameters (n;k_i;d), where k_i=|A_i| and each A_i is
either symmetric or skew and k_1 + ... + k_4 = n + d. Five new Williamson
matrices over the elementary abelian groups of order 25, 27 and 49 are
constructed. New examples of skew Hadamard matrices of order 4n for n=47,61,127
are presented. The last of these is obtained from a (127,57,76)-difference
family that we have constructed. An old non-published example of G-matrices of
order 37 is also included.Comment: 16 pages, 2 tables. A few minor changes are made. The paper will
appear in Operators and Matrice
Parsing a sequence of qubits
We develop a theoretical framework for frame synchronization, also known as
block synchronization, in the quantum domain which makes it possible to attach
classical and quantum metadata to quantum information over a noisy channel even
when the information source and sink are frame-wise asynchronous. This
eliminates the need of frame synchronization at the hardware level and allows
for parsing qubit sequences during quantum information processing. Our
framework exploits binary constant-weight codes that are self-synchronizing.
Possible applications may include asynchronous quantum communication such as a
self-synchronizing quantum network where one can hop into the channel at any
time, catch the next coming quantum information with a label indicating the
sender, and reply by routing her quantum information with control qubits for
quantum switches all without assuming prior frame synchronization between
users.Comment: 11 pages, 2 figures, 1 table. Final accepted version for publication
in the IEEE Transactions on Information Theor
D-optimal matrices of orders 118, 138, 150, 154 and 174
We construct supplementary difference sets (SDS) with parameters
, , , and
. These SDSs give D-optimal designs (DO-designs) of
two-circulant type of orders 118,138,150,154 and 174. Until now, no DO-designs
of orders 138,154 and 174 were known. While a DO-design (not of two-circulant
type) of order 150 was constructed previously by Holzmann and Kharaghani, no
such design of two-circulant type was known. The smallest undecided order for
DO-designs is now 198. We use a novel property of the compression map to speed
up some computations.Comment: 14 pages. arXiv admin note: substantial text overlap with
arXiv:1409.596
- …