Descriptional Complexity of Finite Automata -- Selected Highlights

The state complexity, respectively, nondeterministic state complexity of a regular language $L$ is the number of states of the minimal deterministic, respectively, of a minimal nondeterministic finite automaton for $L$. Some of the most studied state complexity questions deal with size comparisons of nondeterministic finite automata of differing degree of ambiguity. More generally, if for a regular language we compare the size of description by a finite automaton and by a more powerful language definition mechanism, such as a context-free grammar, we encounter non-recursive trade-offs. Operational state complexity studies the state complexity of the language resulting from a regularity preserving operation as a function of the complexity of the argument languages. Determining the state complexity of combined operations is generally challenging and for general combinations of operations that include intersection and marked concatenation it is uncomputable

Quantum Circuits for General Multiqubit Gates

We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits -- a unitary transformation with 4^n degrees of freedom. For synthesizing the gate sequence, a method based on the so-called cosine-sine matrix decomposition is presented. The result is optimal in the number of elementary one-qubit gates, 4^n, and scales more favorably than the previously reported decompositions requiring 4^n-2^n+1 controlled NOT gates.Comment: 4 pages, 3 figure

Precessional motion of a vortex in a finite-temperature Bose-Einstein condensate

We study the precessing motion of a vortex in a Bose-Einstein condensate of atomic gases. In addition to the former zero-temperature studies, finite temperature systems are treated within the Popov and semiclassical approximations. Precessing vortices are discussed utilizing the rotating frame of reference. The relationship between the sign of the lowest excitation energy and the direction of precession is discussed in detail.Comment: 6 pages, 9 figures. More discussion in Sec.III. Reference is update

Spectrum of bound fermion states on vortices in 3^3He-B

We study subgap spectra of fermions localized within vortex cores in $^3$He-B. We develop an analytical treatment of the low-energy states and consider the characteristic properties of fermion spectra for different types of vortices. Due to the removed spin degeneracy the spectra of all singly quantized vortices consist of two different anomalous branches crossing the Fermi level. For singular $o$ and $u$ vortices the anomalous branches are similar to the standard Caroli-de Gennes -Matricon ones and intersect the Fermi level at zero angular momentum yet with different slopes corresponding to different spin states. On the contrary the spectral branches of nonsingular vortices intersect the Fermi level at finite angular momenta which leads to the appearance of a large number of zero modes, i.e. energy states at the Fermi level. Considering the $v$, $w$ and $uvw$ vortices with superfluid cores we show that the number of zero modes is proportional to the size of the vortex core.Comment: 6 pages, 1 figur

Symmetric Groups and Quotient Complexity of Boolean Operations

The quotient complexity of a regular language L is the number of left quotients of L, which is the same as the state complexity of L. Suppose that L and L' are binary regular languages with quotient complexities m and n, and that the transition semigroups of the minimal deterministic automata accepting L and L' are the symmetric groups S_m and S_n of degrees m and n, respectively. Denote by o any binary boolean operation that is not a constant and not a function of one argument only. For m,n >= 2 with (m,n) not in {(2,2),(3,4),(4,3),(4,4)} we prove that the quotient complexity of LoL' is mn if and only either (a) m is not equal to n or (b) m=n and the bases (ordered pairs of generators) of S_m and S_n are not conjugate. For (m,n)\in {(2,2),(3,4),(4,3),(4,4)} we give examples to show that this need not hold. In proving these results we generalize the notion of uniform minimality to direct products of automata. We also establish a non-trivial connection between complexity of boolean operations and group theory