Related papers: Prefix-free quantum Kolmogorov complexity
We provide a classification of compact quantum groups, which can be obtained by the Woronowicz construction, when the arrays used in the twisted determinant condition are extensions of functions on permutations. General properties of such…
In this paper, we introduce Kasparov's bivariant K-theory that is equivariant under symmetries of a C*-tensor category. It is motivated by some dualities in quantum group equivariant KK-theory, and the classification theory of inclusions of…
We provide a test for the specification of a structural model without identifying assumptions. We show the equivalence of several natural formulations of correct specification, which we take as our null hypothesis. From a natural empirical…
We present a generalization of the problem of pattern recognition to arbitrary probabilistic models. This version deals with the problem of recognizing an individual pattern among a family of different species or classes of objects which…
The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…
These notes are intended as an introduction to noncommutative (quantum) filtering theory. An introduction to quantum probability theory is given, focusing on the spectral theorem and the conditional expectation as the least squares…
We introduce kernel density machines (KDM), an agnostic kernel-based framework for learning the Radon-Nikodym derivative (density) between probability measures under minimal assumptions. KDM applies to general measurable spaces and avoids…
We propose a closed-form spectral framework for relative log-density estimation in linearly parameterized probabilistic models, including unnormalized and conditional models. This is achieved by representing the Kullback-Leibler (KL)…
We describe a method for lossless quantum compression if the output of the information source is not known. We compute the best possible compression rate, minimizing the expected base length of the output quantum bit string (the base length…
The problem of quantum state classification asks how accurately one can identify an unknown quantum state that is promised to be drawn from a known set of pure states. In this work, we introduce the notion of $k$-learnability, which…
We a present and analyze rpCholesky-QR, a randomized preconditioned Cholesky-QR algorithm for computing the thin QR factorization of real mxn matrices with rank n. rpCholesky-QR has a low orthogonalization error, a residual on the order of…
We address continuous weak linear quantum measurement and argue that it is best understood in terms of statistics of the outcomes of the linear detectors measuring a quantum system, for example, a qubit. We mostly concentrate on a setup…
Understanding the structure of quantum correlations in a many-body system is key to its computational treatment. For fermionic systems, correlations can be defined as deviations from Slater determinant states. The link between fermionic…
The quantum gravity has great difficulties with application of the probability notion. In given article this problem is analyzed according to algorithmic viewpoint. According to A.N. Kolmogorov, the probability notion can be connected with…
We introduce $k$-local quasi-quantum states: a superset of the regular quantum states, defined by relaxing the positivity constraint. We show that a $k$-local quasi-quantum state on $n$ qubits can be 1-1 mapped to a distribution of…
The paper contains a detailed computation about the algebra of canonical commutation relation, the representation of the Weyl unitaries, the quasi-free states and their von Neumann entropy. The Markov triplet is defined by constant entropy…
We discuss an extended easy quantum group formalism, with the Schur-Weyl theoretic Kronecker symbols being as general as possible, and allowed to take values in $\{-1,0,1\}$, and more generally in $\mathbb T\cup\{0\}$. Our study includes an…
We present the first detailed simulation of a measurement based quantum computation based on Gottesman-Kitaev-Preskill (GKP) qubits within a quad-rail lattice (QRL) cluster state involving over 100 GKP modes. This was enabled by the…
Kolmogorov complexity and algorithmic probability are defined only up to an additive resp. multiplicative constant, since their actual values depend on the choice of the universal reference computer. In this paper, we analyze a natural…
This paper studies when a sequence of probability measures on a metric space admit subsequential weak limits. A sufficient condition called sequential tightness is formulated, which relaxes some assumptions for asymptotic tightness used in…