Related papers: State complexity of union and intersection combine…
We present a new characteristic of a regular ideal language called reset complexity. We find some bounds on the reset complexity in terms of the state complexity of a given language. We also compare the reset complexity and the state…
A short review of the main properties of coherent and squeezed states is given in introductory form. The efforts are addressed to clarify concepts and notions, including some passages of the history of science, with the aim of facilitating…
We establish some of the properties of the states interpolating between number and coherent states denoted by $| n >_{\lambda}$; among them are the reproducing of these states by the action of an operator-valued function on $| n>$ (the…
Given a bipartite quantum state (in arbitrary dimension) and a decomposition of it as a superposition of two others, we find bounds on the entanglement of the superposition state in terms of the entanglement of the states being superposed.…
The asynchronous systems $f$ are the models of the asynchronous circuits from digital electrical engineering. They are multi-valued functions that associate to each input $u:\mathbf{R}\to \{0,1\}^{m}$ a set of states $x\in f(u),$ where…
Most slowly synchronizing automata over binary alphabets are circular, i.e., containing a letter permuting the states in a single cycle, and their set of synchronizing words has maximal state complexity, which also implies complete…
The boson-pair coherent state developed in Part (I) is generalized to the case in which the state is a mixture of even-boson and odd-boson number states. A general framework is shown and its three concrete examples are discussed. Main idea…
In this work, we present a comprehensive and systematic study of the statistical complexity, originally introduced by L\'opez-Ruiz, Mancini, and Calbet [Phys. Lett. A 209, 321-326 (1995)], across a broad range of compact star models. We…
We provide a formula for computing the overlap between two Generalized Coherent States of any rank one simple Lie algebra. Then, we apply our formula to spin coherent states (i.e. $\mathfrak{su}(2)$ algebra), pseudo-spin coherent states…
We study the state complexity of binary operations on regular languages over different alphabets. It is known that if $L'_m$ and $L_n$ are languages of state complexities $m$ and $n$, respectively, and restricted to the same alphabet, the…
Understanding the complexity of quantum states and circuits is a central challenge in quantum information science, with broad implications in many-body physics, high-energy physics and quantum learning theory. A common way to model the…
We propose a scalable procedure to generate entangled superpositions of motional coherent states and electronic states in N trapped ions. Beyond their fundamental importance, these states may be of interest for quantum information…
Simultaneous decompositions of a pair of states into pure ones are examined. There are privileged decompositions which are distinguished from all the other ones.
We exhaustively investigate possible combinations of a boolean operation together with a catenation. In many cases we prove and improve some conjectures by Brzozowski. For each family of operation, we endeavour to provide a common witness…
Light massive string states can appear at D-brane intersections with small angles. We compute tri-linear Yukawa couplings of such open-string states to massless ones and to one another. Due to ambiguities in the normalisation of the vertex…
We study the permutation complexity of finite-state stationary stochastic processes based on a duality between values and orderings between values. First, we establish a duality between the set of all words of a fixed length and the set of…
We study two recent conjectures for holographic complexity: the complexity=action conjecture and the complexity=volume conjecture. In particular, we examine the structure of the UV divergences appearing in these quantities, and show that…
Recently, observations of compact stars have provided new data of high accuracy which put strong constraints on the high-density behaviour of the equation of state of strongly interacting matter otherwise not accessible in terrestrial…
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presented. Since state complexity is a property of a language, it is…
In this paper we consider block languages, namely sets of words having the same length, and study the deterministic and nondeterministic state complexity of several operations on these languages. Being a subclass of finite languages, the…