Related papers: State complexity of multiple catenation
Regular expressions are often ambiguous. We present a novel method based on Brzozowski's derivatives to aid the user in diagnosing ambiguous regular expressions. We introduce a derivative-based finite state transducer to generate parse…
Two measures of sensitivity to eavesdropping for alphabets of quantum states were recently introduced by Fuchs and Sasaki in quant-ph/0302092. These are the accessible fidelity and quantumness. In this paper we prove an important property…
We present a general theory for the construction of witnesses that detect genuine multipartite entanglement in graph states. First, we present explicit witnesses for all graph states of up to six qubits which are better than all criteria so…
The concept of \emph{complexity} has become pivotal in multiple disciplines, including quantum information, where it serves as an alternative metric for gauging the chaotic evolution of a quantum state. This paper focuses on \emph{Krylov…
We propose a method to characterize and quantify multipartite entanglement for pure states. The method hinges upon the study of the probability density function of bipartite entanglement and is tested on an ensemble of qubits in a variety…
Ohya and Volovich have been proposed a new quantum computation model with chaos amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper we study the complexity of the SAT algorithm by counting the…
We study the optimal entanglement witness with respect to multiqubits W-states. We show such entanglement witnesses can be used to distinguish genuine entangled states, different biseparable states and fully separable states.
Following the lines of the recent paper of J.-P. Gazeau and F. H. Szafraniec [J. Phys. A: Math. Theor. 44, 495201 (2011)], we construct here three types of coherent states, related to the Hermite polynomials in a complex variable which are…
In the paper where he first defined Communication Complexity, Yao asks: \emph{Is computing $CC(f)$ (the 2-way communication complexity of a given function $f$) NP-complete?} The problem of deciding whether $CC(f) \le k$, when given the…
State complexity of quantum finite automata is one of the interesting topics in studying the power of quantum finite automata. It is therefore of importance to develop general methods how to show state succinctness results for quantum…
We establish diverse relationships between the algorithmic (Kolmogorov) complexity of the prefixes of any binary expansion and $\beta$-expansions. These relationships allow to develop intuitions on the complexity behavior of…
In this paper we develop a mathematical framework for the characterisation of separability and entanglement of formation (EoF) of general bipartite states. These characterisations are of the variational kind, meaning that separability and…
We construct a probabilistic finite automaton (PFA) with 7 states and an input alphabet of 5 symbols for which the PFA Emptiness Problem is undecidable. The only input for the decision problem is the starting distribution. For the proof, we…
We provide a new class of entanglement witnesses for $d \ot d$ systems (two qudits). Our construction generalizes the one proposed recently by Jafarizadeh et al. for $d=3$ and $d=4$ on the basis of semidefinite linear programming. Moreover,…
Reduplication, a central instance of prosodic morphology, is particularly challenging for state-of-the-art computational morphology, since it involves copying of some part of a phonological string. In this paper I advocate a finite-state…
A deterministic finite automaton (DFA) separates two strings $w$ and $x$ if it accepts $w$ and rejects $x$. The minimum number of states required for a DFA to separate $w$ and $x$ is denoted by $sep(w,x)$. The present paper shows that the…
We provide necessary and sufficient conditions for separability of mixed states. As a result we obtain a simple criterion of separability for $2\times2$ and $2\times3$ systems. Here, the positivity of the partial transposition of a state is…
Motivated by the Peres-Horodecki criterion and the realignment criterion we develop a more powerful method to identify entangled states for any bipartite system through a universal construction of the witness operator. The method also gives…
The first step when forming the polynomial hierarchies of languages is to consider languages of the form KaL where K and L are over a finite alphabet A and from a given variety V of languages, a being a letter from A. All such KaL's…
The quotient complexity, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is the maximal quotient complexity of the language resulting…