Related papers: Prefix-free quantum Kolmogorov complexity
Conditional random field (CRF) is an important probabilistic machine learning model for labeling sequential data, which is widely utilized in natural language processing, bioinformatics and computer vision. However, training the CRF model…
$Q$-systems are recursion relations satisfied by the characters of the restrictions of special finite-dimensional modules of quantum affine algebras. They can also be viewed as mutations in certain cluster algebras, which have a natural…
Motivated by the quantum algorithm in \cite{MN05} for testing commutativity of black-box groups, we study the following problem: Given a black-box finite ring $R=\angle{r_1,...,r_k}$ where $\{r_1,r_2,...,r_k\}$ is an additive generating set…
High-throughput approximations of quantum mechanics calculations and combinatorial experiments have been traditionally used to reduce the search space of possible molecules, drugs and materials. However, the interplay of structural and…
We review the basic algebraic properties of the quantum monodromy matrix M in the canonically quantized chiral SU(n)_k Wess-Zumino-Novikov-Witten model with a quantum group symmetry.
Quantum metrology typically demands the preparation of exotic quantum probe states, such as entangled or squeezed states, to surpass classical limits. However, the need for carefully calibrated system parameters and finely optimized quantum…
The tensor flattenings appear naturally in quantum information when one produces a density matrix by partially tracing the degrees of freedom of a pure quantum state. In this paper, we study the joint $^*$-distribution of the flattenings of…
We present different characterizations of the notion of irreducibility for Quantum Markov Semigroups (QMSs) and investigate its relationship with other relevant features of the dynamics, such as primitivity, positivity improvement and…
We propose a framework to study models of computation of indeterministic data, represented by abstract "distributions". In these distributions, probabilities are replaced by "amplitudes" drawn from a fixed semi-ring $S$, of which the…
The mathematics of classical probability theory was subsumed into classical measure theory by Kolmogorov in 1933. Quantum theory as nonclassical probability theory was incorporated into the beginnings of noncommutative measure theory by von…
This paper explores a novel definition of Schnorr randomness for noncomputable measures. We say $x$ is uniformly Schnorr $\mu$-random if $t(\mu,x)<\infty$ for all lower semicomputable functions $t(\mu,x)$ such that $\mu\mapsto\int…
It is well-established that quantum probability does not follow classical Kolmogorov probability calculus. Various approaches have been developed to loosen the axioms, of which the use of signed measures is the most successful (e.g. the…
We introduce and study action of quantum groups on skew polynomial rings and related rings of quotients. This leads to a ``q-deformation'' of the Gel'fand-Kirillov conjecture which we partially prove. We propose a construction of…
Nies and Scholz introduced the notion of a state to describe an infinite sequence of qubits and defined quantum-Martin-Lof randomness for states, analogously to the well known concept of Martin-L\"of randomness for elements of Cantor space…
The quantum Cram\'er-Rao (QCR) bound sets the ultimate local precision limit for unbiased multiparameter estimation. Yet, unlike in the single-parameter case, its saturability is not generally guaranteed and is often assessed through…
In classical stochastic theory, the joint probability distributions of a stochastic process obey by definition the Kolmogorov consistency conditions. Interpreting such a process as a sequence of physical measurements with probabilistic…
QCD at finite quark-/baryon-number density, which describes nuclear matter, has a sign problem which prevents direct application of standard simulation methods based on importance sampling. When such finite density is implemented by the…
The Quantum Modularity Conjecture of Zagier predicts the existence of a formal power series with arithmetically interesting coefficients that appears in the asymptotics of the Kashaev invariant at each root of unity. Our goal is to…
A nonnegative matrix A is said to be primitive if there exists a positive integer m such that entries in A^m are positive and smallest such m is called the exponent of A: Primitive matrices are useful in the study of finite Markov chains…
We introduce a quasilocal version of holographic complexity adapted to `terminal states' such as spacelike singularities. We use a modification of the action-complexity ansatz, restricted to the past domain of dependence of the terminal…