Related papers: State complexity of multiple catenation
We examine the complexity of inference in Bayesian networks specified by logical languages. We consider representations that range from fragments of propositional logic to function-free first-order logic with equality; in doing so we cover…
The state complexity of a regular language is the number of states in a minimal deterministic finite automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The…
A word $w$ is called a reaching word of a subset $S$ of states in a deterministic finite automaton (DFA) if $S$ is the image of $Q$ under the action of $w$. A DFA is called completely reachable if every non-empty subset of the state set has…
In this paper we give a definition for the Kolmogorov complexity of a pure quantum state. In classical information theory the algorithmic complexity of a string is a measure of the information needed by a universal machine to reproduce the…
We define the algorithmic complexity of a quantum state relative to a given precision parameter, and give upper bounds for various examples of states. We also establish a connection between the entanglement of a quantum state and its…
A word is called carefully synchronising for a partial deterministic finite semi-automaton if it maps all states to the same state. Equivalently, it is a composition of partial transformations equal to a constant total transformation. There…
We resolve an open question by determining matching (asymptotic) upper and lower bounds on the state complexity of the operation that sends a language L to (c(L*))*, where c() denotes complement.
It is well known that different preparations of a mixed state cannot be distinguished by a measurement of that state. Yet we show that some other experiments let us make this distinction despite a very general belief that this would not be…
Given a regular language L over an ordered alphabet $\Sigma$, the set of lexicographically smallest (resp., largest) words of each length is itself regular. Moreover, there exists an unambiguous finite-state transducer that, on a given word…
We give an introduction to Gaussian states and operations. A discussion of the entanglement properties of bipartite Gaussian states in terms of its covariance matrix follows. It is explained how entanglement can be witnessed using feasible…
Recently, an infinite hierarchy of languages accepted by stateless deterministic pushdown automata has been established based on the number of pushdown symbols. However, the witness language for the n-th level of the hierarchy is over an…
The complexity of a quantum state may be closely related to the usefulness of the state for quantum computation. We discuss this link using the tree size of a multiqubit state, a complexity measure that has two noticeable (and, so far,…
We present entanglement witnesses for detecting genuine multi-qubit entanglement. Our constructions are robust against noise and require only two local measurement settings, independent of the number of qubits. Thus they allow to verify…
An algorithm to calculate the density of states, based on the well-known Wang-Landau method, is introduced. Independent random walks are performed in different restricted ranges of energy, and the resultant density of states is modified by…
We consider the state complexity of basic operations on tree languages recognized by deterministic unranked tree automata. For the operations of union and intersection the upper and lower bounds of both weakly and strongly deterministic…
We investigate the accepting state complexity of deterministic finite automata for regular languages obtained by applying one of the following operations to languages accepted by permutation automata: union, quotient, complement,…
General wisdom tells us that if two quantum states are ``macroscopically distinguishable'' then their superposition should be hard to observe. We make this intuition precise and general by quantifying the difficulty to observe the quantum…
Atoms of a (regular) language $L$ were introduced by Brzozowski and Tamm in 2011 as intersections of complemented and uncomplemented quotients of $L$. They derived tight upper bounds on the complexity of atoms in 2013. In 2014, Brzozowski…
Fully entangled fraction is a definition for bipartite states, which is tightly related to bipartite maximally entangled states, and has clear experimental and theoretical significance. In this work, we generalize it to multipartite case,…
Recently the problem of Unambiguous State Discrimination (USD) of mixed quantum states has attracted much attention. So far, bounds on the optimum success probability have been derived [1]. For two mixed states they are given in terms of…