Related papers: State complexity of multiple catenation
In this work we construct an automaton for the commutative closure of a given regular group language. The number of states of the resulting automaton is bounded by the number of states of the original automaton, raised to the power of the…
Phase transitions in many complex combinational problems have been widely studied in the past decade. In this paper, we investigate phase transitions in the knowledge compilation empirically, where DFA, OBDD and d-DNNF are chosen as the…
A recently proposed convolution technique for the calculation of local density of states is described more thouroughly and new results of its application are presented. For separable systems the exposed method allows to construct the ldos…
We study the computational difficulty of computing the ground state degeneracy and the density of states for local Hamiltonians. We show that the difficulty of both problems is exactly captured by a class which we call #BQP, which is the…
We present a proof-of-principle experiment demonstrating measurement of the collectibility, a nonlinear entanglement witness proposed by Rudnicki et al. [Phys. Rev. Lett. 107, 150502 (2011)]. This entanglement witness works for both mixed…
We prove lower bounds for the entanglement of formation and the squashed entanglement for any a bipartite density matrix in terms of the conditional entropy of the bipartite state with respect to either of its partial traces, and prove that…
Measuring text complexity is an essential task in several fields and applications (such as NLP, semantic web, smart education, etc.). The semantic layer of text is more tacit than its syntactic structure and, as a result, calculation of…
We investigate the syntactic complexity of certain types of finitely generated submonoids of a free monoid. In fact, we consider those submonoids which are accepted by circular semi-flower automata (CSFA). Here, we show that the syntactic…
In recent years, the entanglement spectra of quantum states have been identified to be highly valuable for improving our understanding on many problems in quantum physics, such as classification of topological phases, symmetry-breaking…
We compute the degree complexity of a family of birational mappings of the plane with high order singularities.
Characterization of the multipartite mixed state entanglement is still a challenging problem. Since due to the fact that the entanglement for the mixed states, in general, is defined by a convex-roof extension. That is the entanglement…
The complexity of computing the Fourier transform is a longstanding open problem. Very recently, Ailon (2013, 2014, 2015) showed in a collection of papers that, roughly speaking, a speedup of the Fourier transform computation implies…
We show that $\Omega(rd/\epsilon)$ copies of an unknown rank-$r$, dimension-$d$ quantum mixed state are necessary in order to learn a classical description with $1 - \epsilon$ fidelity. This improves upon the tomography lower bounds…
The subword complexity of a word $w$ over a finite alphabet $\mathcal{A}$ is a function that assigns for each positive integer $n$, the number of distinct subwords of length $n$ in $w$. The subword complexity of a word is a good measure of…
We address the problem of non-orthogonal two-state discrimination when multiple copies of the unknown state are available. We give the optimal strategy when only fixed individual measurements are allowed and show that its error probability…
We show that entanglement-assisted transformations of bipartite entangled states can be more efficient than catalysis [D. Jonathan and M. B. Plenio, Phys. Rev. Lett. 83, 3566 (1999)}, i.e., given two incomparable bipartite states not only…
The problem of of how many entangled or, respectively, separable states there are in the set of all quantum states is investigated. We study to what extent the choice of a measure in the space of density matrices describing N--dimensional…
In this paper, we present a general formula for obtaining the reduced density opeator for any biparticle pure entangled state. Using this formula, we derive, in a compact form, the explicit formula of the entanglement for any bipartical…
We demonstrate that any pure bipartite state of two qubits may be decomposed into a superposition of a maximally entangled state and an orthogonal factorizable one. Although there are many such decompositions, the weights of the two…
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…