284 research outputs found
On a connection between the switching separability of a graph and that of its subgraphs
A graph of order is called {switching separable} if its modulo-2 sum
with some complete bipartite graph on the same set of vertices is divided into
two mutually independent subgraphs, each having at least two vertices. We prove
the following: if removing any one or two vertices of a graph always results in
a switching separable subgraph, then the graph itself is switching separable.
On the other hand, for every odd order greater than 4, there is a graph that is
not switching separable, but removing any vertex always results in a switching
separable subgraph. We show a connection with similar facts on the separability
of Boolean functions and reducibility of -ary quasigroups. Keywords:
two-graph, reducibility, separability, graph switching, Seidel switching, graph
connectivity, -ary quasigroupComment: english: 9 pages; russian: 9 page
n-Ary quasigroups of order 4
We characterize the set of all N-ary quasigroups of order 4: every N-ary
quasigroup of order 4 is permutably reducible or semilinear. Permutable
reducibility means that an N-ary quasigroup can be represented as a composition
of K-ary and (N-K+1)-ary quasigroups for some K from 2 to N-1, where the order
of arguments in the representation can differ from the original order. The set
of semilinear N-ary quasigroups has a characterization in terms of Boolean
functions. Keywords: Latin hypercube, n-ary quasigroup, reducibilityComment: 10pp. V2: revise
Asymptotics for the number of n-quasigroups of order 4
The asymptotic form of the number of n-quasigroups of order 4 is . Keywords: n-quasigroups, MDS codes, decomposability,
reducibility.Comment: 15 p., 3 fi
On the structure of non-full-rank perfect codes
The Krotov combining construction of perfect 1-error-correcting binary codes
from 2000 and a theorem of Heden saying that every non-full-rank perfect
1-error-correcting binary code can be constructed by this combining
construction is generalized to the -ary case. Simply, every non-full-rank
perfect code is the union of a well-defined family of -components
, where belongs to an "outer" perfect code , and these
components are at distance three from each other. Components from distinct
codes can thus freely be combined to obtain new perfect codes. The Phelps
general product construction of perfect binary code from 1984 is generalized to
obtain -components, and new lower bounds on the number of perfect
1-error-correcting -ary codes are presented.Comment: 8 page
On the volumes and affine types of trades
A -trade is a pair of disjoint collections of subsets
(blocks) of a -set such that for every , any -subset of
is included in the same number of blocks of and of . It follows
that and this common value is called the volume of . If we
restrict all the blocks to have the same size, we obtain the classical
-trades as a special case of -trades. It is known that the minimum
volume of a nonempty -trade is . Simple -trades (i.e., those
with no repeated blocks) correspond to a Boolean function of degree at most
. From the characterization of Kasami--Tokura of such functions with
small number of ones, it is known that any simple -trade of volume at most
belongs to one of two affine types, called Type\,(A) and Type\,(B)
where Type\,(A) -trades are known to exist. By considering the affine
rank, we prove that -trades of Type\,(B) do not exist. Further, we derive
the spectrum of volumes of simple trades up to , extending the
known result for volumes less than . We also give a
characterization of "small" -trades for . Finally, an algorithm to
produce -trades for specified , is given. The result of the
implementation of the algorithm for , is reported.Comment: 30 pages, final version, to appear in Electron. J. Combi
Smooth optimal control with Floquet theory
This paper describes an approach to construct temporally shaped control
pulses that drive a quantum system towards desired properties. A
parametrization in terms of periodic functions with pre-defined frequencies
permits to realize a smooth, typically simple shape of the pulses; their
optimization can be performed based on a variational analysis with Floquet
theory. As we show with selected specific examples, this approach permits to
control the dynamics of interacting spins, such that gate operations and
entanglement dynamics can be implemented with very high accuracy
Robust optimal quantum gates for Josephson charge qubits
Quantum optimal control theory allows to design accurate quantum gates. We
employ it to design high-fidelity two-bit gates for Josephson charge qubits in
the presence of both leakage and noise. Our protocol considerably increases the
fidelity of the gate and, more important, it is quite robust in the disruptive
presence of 1/f noise. The improvement in the gate performances discussed in
this work (errors of the order of 10^{-3}-10^{-4} in realistic cases) allows to
cross the fault tolerance threshold.Comment: 4 pages, 4 figure
Photon storage in Lambda-type optically dense atomic media. IV. Optimal control using gradient ascent
We use the numerical gradient ascent method from optimal control theory to
extend efficient photon storage in Lambda-type media to previously inaccessible
regimes and to provide simple intuitive explanations for our optimization
techniques. In particular, by using gradient ascent to shape classical control
pulses used to mediate photon storage, we open up the possibility of high
efficiency photon storage in the non-adiabatic limit, in which analytical
solutions to the equations of motion do not exist. This control shaping
technique enables an order-of-magnitude increase in the bandwidth of the
memory. We also demonstrate that the often discussed connection between time
reversal and optimality in photon storage follows naturally from gradient
ascent. Finally, we discuss the optimization of controlled reversible
inhomogeneous broadening.Comment: 16 pages, 7 figures. V2: As published in Phys. Rev. A. Moved most of
the math to appendices or removed altogether. Switched order of Sections II
and III. Shortened abstract. Added reference
- …