Related papers: Two-Qubit Separability Probabilities: A Concise Fo…
Given a bipartite quantum system represented by a tensor product of two Hilbert spaces, we give an elementary argument showing that if either component space is infinite-dimensional, then the set of nonseparable density operators is…
The quantum separability problem consists in deciding whether a bipartite density matrix is entangled or separable. In this work, we propose a machine learning pipeline for finding approximate solutions for this NP-hard problem in…
Analyzing the properties of entanglement in many-particle spin-1/2 systems is generally difficult because the system's Hilbert space grows exponentially with the number of constituent particles, $N$. Fortunately, it is still possible to…
The states of the qubit, the basic unit of quantum information, are $2 \times 2$ positive semi-definite Hermitian matrices with trace 1. We contribute to the program to axiomatize quantum mechanics by characterizing these states in terms of…
We propose an information-theoretic framework for analog signal separation. Specifically, we consider the problem of recovering two analog signals, modeled as general random vectors, from the noiseless sum of linear measurements of the…
A sufficient condition for a quantum state of a system of spin-1/2 particles (spin-1/2s) to admit a local hidden variable (LHV) description i.e. to be classical is the separability of the density matrix characterizing its state, but not all…
Two qubits is the simplest system where the notions of separable and entangled states and entanglement witnesses first appear. We give a three dimensional geometric description of these notions. This description however carries no…
Set-membership estimation is usually formulated in the context of set-valued calculus and no probabilistic calculations are necessary. In this paper, we show that set-membership estimation can be equivalently formulated in the probabilistic…
The density-of-states method (Phys.Rev.Lett. 109 (2012) 111601) features an exponential error suppression and is not restricted to theories with positive probabilistic weight. It is applied to the SU(2) gauge theory at finite densities of…
In the study of Hilbert schemes, the integer partition $\lambda$ helps researchers identify some geometric and combinatorial properties of the scheme in question. To aid researchers in extracting such information from a Hilbert polynomial,…
Zaremba's Conjecture concerns the formation of continued fractions with partial quotients restricted to a given alphabet. In order to answer the numerous questions that arrive from this conjecture, it is best to consider a semi-group, often…
Nielsen [quant-ph/0108020] showed that universal quantum computation is possible given quantum memory and the ability to perform projective measurements on up to 4-qubits. We describe an improved method that requires only 2-qubit…
Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any…
We explore the possibility of performing super dense coding with non-maximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to…
It is shown that any separable state on Hilbert space ${\cal H}={\cal H}_1\otimes{\cal H}_2$, can be written as a convex combination of N pure product states with $N\leq (dim{\cal H})^2$. Then a new separability criterion for mixed states…
Efficiently detecting entanglement based on measurable quantities is a basic problem for quantum information processing. Recently, the measurable quantities called partial-transpose (PT)-moments have been proposed to detect and characterize…
We study the query complexity analogue of the class TFNP of total search problems. We give a way to convert partial functions to total search problems under certain settings; we also give a way to convert search problems back into partial…
We formulate a discrete two-state stochastic process with elementary rules that give rise to Born statistics and reproduce the probabilities from the Schr\"odinger equation under an associated Hamiltonian matrix, which we identify. We…
We probabilistically analyze the performance of the arithmetic coding algorithm under a probability model for binary data in which a message is received by a coder from a source emitting independent equally distributed bits, with 1…
In this work, we attempt to refine the classic asymptotic formulae to describe the probability distribution of likelihood-ratio statistical tests. The idea is to split the probability distribution function into two parts. One part is…