Related papers: Prefix-free quantum Kolmogorov complexity
We study the spectral properties of two classes of random matrix models: non-Gaussian RMT with quartic and sextic potentials, and RMT with Gaussian noise. We compute and analyze the quantum Krylov complexity and the spectral form factor for…
A translation invariant state $\omega$ on $C^*$-algebra $\clb=\otimes_{k \in \IZ}M^{(k)}$, where $M^{(k)}=M_d(\IC)$ is the $d-$dimensional matrices over field of complex numbers, give rises a stationary quantum Markov chain and associates…
We provide the first analysis of a non-trivial quantization scheme for compressed sensing measurements arising from structured measurements. Specifically, our analysis studies compressed sensing matrices consisting of rows selected at…
The severity of the sign problem in lattice QCD at nonzero baryon density is measured by the average phase of the fermion determinant. Motivated by the equivalence of chiral random matrix theory and QCD to leading order in the epsilon…
Algorithmic information theory studies description complexity and randomness and is now a well known field of theoretical computer science and mathematical logic. There are several textbooks and monographs devoted to this theory where one…
Light-front quantization has important advantages for describing relativistic statistical systems, particularly systems for which boost invariance is essential, such as the fireball created in a heavy ion collisions. In this paper we…
The canonical quantization of the chiral Wess-Zumino-Novikov-Witten (WZNW) monodromy matrices (both the diagonal and the general one) requires additional numerical factors that can be attributed to renormalization. We discuss, for G=SU(n),…
We study discrete time Markov processes with periodic or open boundary conditions and with inhomogeneous rates in the bulk. The Markov matrices are given by the inhomogeneous transfer matrices introduced previously to prove the…
Suppose we have an n-qubit system, and we are given a collection of local density matrices rho_1,...,rho_m, where each rho_i describes a subset C_i of the qubits. We say that the rho_i are ``consistent'' if there exists some global state…
In this, partly pedagogical review, I attempt to give a self-contained overview of the basis of (non-relativistic) QM measurement theory expressed in density matrix formalism. The focus is on applications to the theory of weak measurement,…
We analyze quantum state tomography in scenarios where measurements and states are both constrained. States are assumed to live in a semi-algebraic subset of state space and measurements are supposed to be rank-one POVMs, possibly with…
We argue that the complex numbers are an irreducible object of quantum probability. This can be seen in the measurements of geometric phases that have no classical probabilistic analogue. Having complex phases as primitive ingredient…
Inferring nonlinear features of quantum states is fundamentally important across quantum information science, but remains challenging due to the intrinsic linearity of quantum mechanics. It is widely recognized that quantum memory and…
For an algebraically closed field $K$, we investigate a class of noncommutative $K$-algebras called connected quantized Weyl algebras. Such an algebra has a PBW basis for a set of generators $\{x_1,\dots,x_n\}$ such that each pair satisfies…
We study the problem of quantum-state tomography under the assumption that the state of the system is close to pure. In this context, an efficient measurements that one typically formulates uniquely identify a pure state from within the set…
Just a few years after the inception of quantum mechanics, there has been a research program using the nonclassical values of some quasiprobability distributions to delineate the nonclassical aspects of quantum phenomena. In particular, in…
We consider quantum random walks (QRW) on the integers, a subject that has been considered in the last few years in the framework of quantum computation. We show how the theory of CMV matrices gives a natural tool to study these processes…
Quantum query complexity has several nice properties with respect to composition. First, bounded-error quantum query algorithms can be composed without incurring log factors through error reduction (exactness). Second, through careful…
As quantum devices make steady progress towards intermediate scale and fault-tolerant quantum computing, it is essential to develop rigorous and efficient measurement protocols that account for known sources of noise. Most existing quantum…
Quantum Markov chains (QMCs) are positive maps on a trace-class space describing open quantum dynamics on graphs. Such objects have a statistical resemblance with classical random walks, while at the same time it allows for internal…