3,661 research outputs found
Efficient Classical Simulation of Optical Quantum Circuits
We identify a broad class of physical processes in an optical quantum circuit
that can be efficiently simulated on a classical computer: this class includes
unitary transformations, amplification, noise, and measurements. This
simulatability result places powerful constraints on the capability to realize
exponential quantum speedups as well as on inducing an optical nonlinear
transformation via linear optics, photodetection-based measurement and
classical feedforward of measurement results, optimal cloning, and a wide range
of other processes.Comment: 4 pages, published versio
Green's Relations in Finite Transformation Semigroups
We consider the complexity of Green's relations when the semigroup is given
by transformations on a finite set. Green's relations can be defined by
reachability in the (right/left/two-sided) Cayley graph. The equivalence
classes then correspond to the strongly connected components. It is not
difficult to show that, in the worst case, the number of equivalence classes is
in the same order of magnitude as the number of elements. Another important
parameter is the maximal length of a chain of components. Our main contribution
is an exponential lower bound for this parameter. There is a simple
construction for an arbitrary set of generators. However, the proof for
constant alphabet is rather involved. Our results also apply to automata and
their syntactic semigroups.Comment: Full version of a paper submitted to CSR 2017 on 2016-12-1
Semigroups with if-then-else and halting programs
The "if–then–else" construction is one of the most elementary programming commands, and its abstract laws have been widely studied, starting with McCarthy. Possibly, the most obvious extension of this is to include the operation of composition of programs, which gives a semigroup of functions (total, partial, or possibly general binary relations) that can be recombined using if–then–else. We show that this particular extension admits no finite complete axiomatization and instead focus on the case where composition of functions with predicates is also allowed (and we argue there is good reason to take this approach). In the case of total functions — modeling halting programs — we give a complete axiomatization for the theory in terms of a finite system of equations. We obtain a similar result when an operation of equality test and/or fixed point test is included
Syntactic Complexity of R- and J-Trivial Regular Languages
The syntactic complexity of a regular language is the cardinality of its
syntactic semigroup. The syntactic complexity of a subclass of the class of
regular languages is the maximal syntactic complexity of languages in that
class, taken as a function of the state complexity n of these languages. We
study the syntactic complexity of R- and J-trivial regular languages, and prove
that n! and floor of [e(n-1)!] are tight upper bounds for these languages,
respectively. We also prove that 2^{n-1} is the tight upper bound on the state
complexity of reversal of J-trivial regular languages.Comment: 17 pages, 5 figures, 1 tabl
- …