Quantumness, generalized spherical 2-design, and symmetric informationally complete POVM

2007 ◽  
Vol 7 (8) ◽  
pp. 730-737
Author(s):  
I.H. Kim

Fuchs and Sasaki defined the quantumness of a set of quantum states in \cite{Quantumness}, which is related to the fidelity loss in transmission of the quantum states through a classical channel. In \cite{Fuchs}, Fuchs showed that in $d$-dimensional Hilbert space, minimum quantumness is $\frac{2}{d+1}$, and this can be achieved by all rays in the space. He left an open problem, asking whether fewer than $d^2$ states can achieve this bound. Recently, in a different context, Scott introduced a concept of generalized $t$-design in \cite{GenSphet}, which is a natural generalization of spherical $t$-design. In this paper, we show that the lower bound on the quantumness can be achieved if and only if the states form a generalized 2-design. As a corollary, we show that this bound can be only achieved if the number of states are larger or equal to $d^2$, answering the open problem. Furthermore, we also show that the minimal set of such ensemble is Symmetric Informationally Complete POVM(SIC-POVM). This leads to an equivalence relation between SIC-POVM and minimal set of ensemble achieving minimal quantumness.

Author(s):  
Hans Havlicek ◽  
Karl Svozil

Abstract Criteria for the completion of an incomplete basis of, or context in, a four-dimensional Hilbert space by (in)decomposable vectors are given. This, in particular, has consequences for the task of ``completing'' one or more bases or contexts of a (hyper)graph: find a complete faithful orthogonal representation (aka coordinatization) of a hypergraph when only a coordinatization of the intertwining observables is known. In general indecomposability and thus physical entanglement and the encoding of relational properties by quantum states ``prevails'' and occurs more often than separability associated with well defined individual, separable states.


2011 ◽  
Vol 09 (04) ◽  
pp. 1101-1112
Author(s):  
YINXIANG LONG ◽  
DAOWEN QIU ◽  
DONGYANG LONG

In this paper, we obtain an efficient separability criterion for bipartite quantum pure state systems, which is based on the two-order minors of the coefficient matrix corresponding to quantum state. Then, we generalize this criterion to multipartite arbitrarily dimensional pure states. Our criterion is directly built upon coefficient matrices, but not density matrices or observables, so it has the advantage of being computed easily. Indeed, to judge separability for an arbitrary n-partite pure state in a d-dimensional Hilbert space, it only needs at most O(d) times operations of multiplication and comparison. Our criterion can be extended to mixed states. Compared with Yu's criteria, our methods are faster, and can be applied to any quantum state.


2004 ◽  
Vol 4 (3) ◽  
pp. 207-221
Author(s):  
F. Hulpke ◽  
D. Bruss ◽  
M. Levenstein ◽  
A. Sanpera

We apply the generalised concept of witness operators to arbitrary convex sets, and review the criteria for the optimisation of these general witnesses. We then define an embedding of state vectors and operators into a higher-dimensional Hilbert space. This embedding leads to a connection between any Schmidt number witness in the original Hilbert space and a witness for Schmidt number two (i.e. the most general entanglement witness) in the appropriate enlarged Hilbert space. Using this relation we arrive at a conceptually simple method for the construction of Schmidt number witnesses in bipartite systems.


2018 ◽  
Vol 28 (3) ◽  
pp. 365-387
Author(s):  
S. CANNON ◽  
D. A. LEVIN ◽  
A. STAUFFER

We give the first polynomial upper bound on the mixing time of the edge-flip Markov chain for unbiased dyadic tilings, resolving an open problem originally posed by Janson, Randall and Spencer in 2002 [14]. A dyadic tiling of size n is a tiling of the unit square by n non-overlapping dyadic rectangles, each of area 1/n, where a dyadic rectangle is any rectangle that can be written in the form [a2−s, (a + 1)2−s] × [b2−t, (b + 1)2−t] for a, b, s, t ∈ ℤ⩾ 0. The edge-flip Markov chain selects a random edge of the tiling and replaces it with its perpendicular bisector if doing so yields a valid dyadic tiling. Specifically, we show that the relaxation time of the edge-flip Markov chain for dyadic tilings is at most O(n4.09), which implies that the mixing time is at most O(n5.09). We complement this by showing that the relaxation time is at least Ω(n1.38), improving upon the previously best lower bound of Ω(n log n) coming from the diameter of the chain.


2014 ◽  
Vol 64 (1) ◽  
Author(s):  
Krzysztof Kaniowski

AbstractLet P 0 and P 1 be projections in a Hilbert space H. We shall construct a class of optimal measurements for the problem of discrimination between quantum states $$\rho _i = \tfrac{1} {{\dim P_i }}P_i$$, with prior probabilities π 0 and π 1. The probabilities of failure for such measurements will also be derived.


2009 ◽  
Vol 80 (1) ◽  
pp. 83-90 ◽  
Author(s):  
SHUDONG LIU ◽  
XIAOCHUN FANG

AbstractIn this paper, we construct the unique (up to isomorphism) extension algebra, denoted by E∞, of the Cuntz algebra 𝒪∞ by the C*-algebra of compact operators on a separable infinite-dimensional Hilbert space. We prove that two unital monomorphisms from E∞ to a unital purely infinite simple C*-algebra are approximately unitarily equivalent if and only if they induce the same homomorphisms in K-theory.


Sign in / Sign up

Export Citation Format

Share Document