Related papers: Two-Qubit Separability Probabilities: A Concise Fo…
We investigate the joint (separable) numerical range of multiple measurements, i.e., the regions of expectation values accessible with (separable) quantum states for given observables. This not only enables efficient entanglement detection,…
A new geometric representation of qubit and qutrit states based on probability simplexes is used to describe the separability and entanglement properties of density matrices of two qubits. The Peres--Horodecki positive partial transpose…
We address the following state comparison problem: is it possible to design an experiment enabling us to unambiguously decide (based on the observed outcome statistics) on the sameness or difference of two unknown state preparations without…
We investigate features of the quasi-joint-probability distribution for finite-state quantum systems, especially the two-state and three-state quantum systems, comparing different types of quasi-joint-probability distributions based on the…
The state of an entangled q-bit pair is specified by 15 numerical parameters that are naturally regarded as the components of two 3-vectors and a $3\times3$-dyadic. There are easy-to-use criteria to check whether a given pair of 3-vectors…
Using new results on the separability properties of bosonic systems, we provide a new complete criterion for separability. This criterion aims at characterizing the set of separable states from the inside by means of a sequence of…
A natural measure in the space of density matrices describing N-dimensional quantum systems is proposed. We study the probability P that a quantum state chosen randomly with respect to the natural measure is not entangled (is separable). We…
We formulate the problem of determining the volume of the set of Gaussian physical states in the framework of information geometry. That is, by considering phase space probability distributions parametrized by the covariances and supplying…
The volume of the quantum mechanical state space over $n$-dimensional real, complex and quaternionic Hilbert-spaces with respect to the canonical Euclidean measure is computed, and explicit formulas are presented for the expected value of…
A new necessary separability criterion that relates the structures of the total density matrix and its reductions is given. The method used is based on the realignment method [K. Chen and L.A. Wu, Quant. Inf. Comput. 3, 193 (2003)]. The new…
Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure…
Integrability is a cornerstone of classical mechanics, where it has a precise meaning. Extending this notion to quantum systems, however, remains subtle and unresolved. In particular, deciding whether a quantum Hamiltonian - viewed simply…
Explicit separable density matrices, for mixed two qubits states, are derived by the use of Hilbert Schmidt decompositions and Peres Horodecki criterion. A strongly separable two qubits mixed state is defined by multiplications of two…
Motivated by the notions of $k$-extendability and complete extendability of the state of a finite level quantum system as described by Doherty et al (Phys. Rev. A, 69:022308), we introduce parallel definitions in the context of Gaussian…
A geometrical picture of separability of 2 x 2 composite quantum systems, showing the region of separable density matrices in the space of hermitian matrices, is given. It rests on the criterion of separability given by Peres, and it is an…
We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive semi-definite Hamiltonians, our method has expected running-time that is almost linear in $(M/(\epsilon_{\rm…
We describe a purely algebraic method for finding the best separable approximation to a mixed state of a composite 2x2 quantum system, consisting of a decomposition of the state into a linear combination of a mixed separable part and a pure…
The question of the generation of random mixed states is discussed, aiming for the computation of probabilistic characteristics of composite finite dimensional quantum systems. Particularly, we consider the generation of the random…
The diameter of the Cayley graph of the Rubik's Cube group is the fewest number of turns needed to solve the Cube from the hardest initial configuration. For the 2$\times$2$\times$2 Cube, the diameter is 11 in the half-turn metric, 14 in…
We introduce a distributed classical simulation algorithm for general quantum circuits, and present numerical results for calculating the output probabilities of universal random circuits. We find that we can simulate more qubits to greater…