Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1805.04583 · Journal of Mathematical Physics

Entanglement breaking rank and the existence of SIC POVMs

Satish K. Pandey, Vern I. Paulsen, Jitendra Prakash, Mizanur Rahaman

Published Apr 1, 2020• 15 citations
arXivHTMLPDF

Abstract

We introduce and study the entanglement breaking rank of an entanglement breaking channel. We show that the entanglement breaking rank of the channel Z:Md→Md defined by Z(X)=1d+1(X+Tr(X)Id) is d2 if and only if there exists a symmetric informationally complete positive operator-valued measure in dimension d.
DOI
10.1063/1.5045184

Related papers

Construction of all general symmetric informationally complete measurements

Amir Kalev, Gilad Gour

We construct the set of all general (i.e. not necessarily rank 1) symmetric informationally complete (SIC) positive operator valued measures (POVMs). In particular, we show that any orthonormal basis of a real vector space of dimension d^2-1 corresponds to some general SIC POVM and vice versa. Our constructed set of all general SIC-POVMs contains weak SIC-POVMs for which each POVM element can be made arbitrarily close to a multiple times the identity. On the other hand, it remains open if for all finite dimensions our constructed family contains a rank 1 SIC-POVM.

arXiv:1305.6545•May 28, 2013•18 citations

Tsirelson's problems and entanglement breaking rank

Jitendra Prakash

There are two main themes of this thesis. In the first part, we study the various sets of correlations arising in the study of non-local games and Tsirelson's problems. In the second part we introduce the notion of entanglement breaking rank and study its connection with the SIC POVM existence problem. \n \nTsirelson's problems have been open for quite some time and continue to be an active area of research. These problems seek to identify relationships between different sets of quantum correlations arising from different quantum models and their relaxations. One of the goals of this thesis is to show that the set of correlations arising from the tensor product model is not topologically closed, and hence is distinct from the set of correlations arising from the commuting tensor model. \n \nWe begin our investigation in Chapter 3 by working through an example of a non-local game with three inputs and binary outputs. While this toy example does not help in showing the distinction between the aforementioned sets of correlations, it still provides valuable insights and motivation for a more abstract approach which we take up in the next chapter and which turns out to be fruitful. \n \nIn Chapter 4, we observe that given a graph we can associate functions (of a real variable) corresponding to different correlation sets. We study the properties of these functions. We show that for the complete graph on five vertices, the assumption that the correlation set obtained through tensor model is closed forces its corresponding function to be piecewise linear on an interval, while the function corresponding to the commuting model is not. This shows that the quantum correlation set is not closed hence solving one of Tsirelson's problem and also improves the results of Slofstra by reducing the number of experiments and outcomes to five and two, respectively. \n \nFinally, for the second part of the thesis, we introduce the notion of entanglement breaking rank of an entanglement breaking channel. While technically this notion is not new, this point of view helps us in showing that the entanglement breaking rank of a particular channel on $\\mathbb{M}_d$ being $d^2$ is equivalent to the existence of a SIC POVM in dimension $d$. This opens up another approach to tackle this existence problem.

•Aug 13, 2018•0 citations

Construction of all general symmetric informationally complete measurements

Gilad Gour, Amir Kalev

We construct the set of all general (i.e. not necessarily rank 1) symmetric informationally complete (SIC) positive operator valued measures (POVMs). In particular, we show that any orthonormal basis of a real vector space of dimension corresponds to some general SIC POVM and vice versa. Our constructed set of all general SIC POVMs contains weak SIC POVMs for which each POVM element can be made arbitrarily close to a multiple times the identity. On the other hand, it remains open if for all finite dimensions our constructed family contains a rank 1 SIC POVM.

Journal of Physics A Mathematical and Theoretical•Aug 4, 2014•104 citations

General symmetric informationally complete measurements exist in all dimensions

Gilad Gour

We construct the set of all general (i.e. not necessarily rank 1) symmetric informationally complete (SIC) positive operator valued measures (POVMs). In particular, we show that any orthonormal basis of a real vector space of dimension d^2-1 corresponds to some general SIC POVM and vice versa. Our constructed set of all general SIC-POVMs contains weak SIC-POVMs for which each POVM element can be made arbitrarily close to a multiple times the identity. On the other hand, it remains open if for all finite dimensions our constructed family contains a rank 1 SIC-POVM.

•May 28, 2013•2 citations

Two new constructions of approximately symmetric informationally complete positive operator-valued measures

Wang Gang, Min-Yao Niu, Fang‐Wei Fu

A symmetric informationally complete positive operator-valued measure (SIC-POVM) is a POVM in [Formula: see text] consisting of [Formula: see text] positive operators of rank one such that all of whose Hermite inner products are equal. SIC-POVMs are important in quantum information theory, which have many applications in quantum state tomography, quantum cryptography and basic research in quantum mechanics. However, it is very difficult to construct SIC-POVMs. Therefore, many scholars have focused on approximately symmetric informationally complete positive operator-valued measures (ASIC-POVMs) for which the Hermite inner products are close to equal. In this paper, two new constructions of ASIC-POVMs are provided by using character sums and some special functions over finite fields.

International Journal of Quantum Information•Apr 1, 2019•1 citation

Entanglement Breaking Channels

Michał Horodecki, Peter W. Shor, Mary Beth Ruskai

This paper studies the class of stochastic maps, or channels, for which (I⊗Φ)(Γ) is always separable (even for entangled Γ). Such maps are called entanglement breaking, and can always be written in the form Φ(ρ)=∑ k R k Tr F k ρ where each R k is a density matrix and F k >0. If, in addition, Φ is trace-preserving, the {F k } must form a positive operator valued measure (POVM). Some special classes of these maps are considered and other characterizations given. Since the set of entanglement-breaking trace-preserving maps is convex, it can be characterized by its extreme points. The only extreme points of the set of completely positive trace preserving maps which are also entanglement breaking are those known as classical-quantum or CQ. However, for d≥3, the set of entanglement breaking maps has additional extreme points which are not extreme CQ maps.

arXiv:quant-ph/0302031•Reviews in Mathematical Physics•Aug 1, 2003•602 citations
We construct the set of all general (i.e. not necessarily rank 1) symmetric informationally complete (SIC) positive operator valued measures (POVMs). In particular, we show that any orthonormal basis of a real vector space of dimension d^2-1 corresponds to some general SIC POVM and vice versa. Our constructed set of all general SIC-POVMs contains weak SIC-POVMs for which each POVM element can be made arbitrarily close to a multiple times the identity. On the other hand, it remains open if for all finite dimensions our constructed family contains a rank 1 SIC-POVM.
There are two main themes of this thesis. In the first part, we study the various sets of correlations arising in the study of non-local games and Tsirelson's problems. In the second part we introduce the notion of entanglement breaking rank and study its connection with the SIC POVM existence problem. \n \nTsirelson's problems have been open for quite some time and continue to be an active area of research. These problems seek to identify relationships between different sets of quantum correlations arising from different quantum models and their relaxations. One of the goals of this thesis is to show that the set of correlations arising from the tensor product model is not topologically closed, and hence is distinct from the set of correlations arising from the commuting tensor model. \n \nWe begin our investigation in Chapter 3 by working through an example of a non-local game with three inputs and binary outputs. While this toy example does not help in showing the distinction between the aforementioned sets of correlations, it still provides valuable insights and motivation for a more abstract approach which we take up in the next chapter and which turns out to be fruitful. \n \nIn Chapter 4, we observe that given a graph we can associate functions (of a real variable) corresponding to different correlation sets. We study the properties of these functions. We show that for the complete graph on five vertices, the assumption that the correlation set obtained through tensor model is closed forces its corresponding function to be piecewise linear on an interval, while the function corresponding to the commuting model is not. This shows that the quantum correlation set is not closed hence solving one of Tsirelson's problem and also improves the results of Slofstra by reducing the number of experiments and outcomes to five and two, respectively. \n \nFinally, for the second part of the thesis, we introduce the notion of entanglement breaking rank of an entanglement breaking channel. While technically this notion is not new, this point of view helps us in showing that the entanglement breaking rank of a particular channel on mathbbMd\\mathbb{M}_dmathbbMd​ being d2d^2d2 is equivalent to the existence of a SIC POVM in dimension ddd. This opens up another approach to tackle this existence problem.
We construct the set of all general (i.e. not necessarily rank 1) symmetric informationally complete (SIC) positive operator valued measures (POVMs). In particular, we show that any orthonormal basis of a real vector space of dimension corresponds to some general SIC POVM and vice versa. Our constructed set of all general SIC POVMs contains weak SIC POVMs for which each POVM element can be made arbitrarily close to a multiple times the identity. On the other hand, it remains open if for all finite dimensions our constructed family contains a rank 1 SIC POVM.
We construct the set of all general (i.e. not necessarily rank 1) symmetric informationally complete (SIC) positive operator valued measures (POVMs). In particular, we show that any orthonormal basis of a real vector space of dimension d^2-1 corresponds to some general SIC POVM and vice versa. Our constructed set of all general SIC-POVMs contains weak SIC-POVMs for which each POVM element can be made arbitrarily close to a multiple times the identity. On the other hand, it remains open if for all finite dimensions our constructed family contains a rank 1 SIC-POVM.
A symmetric informationally complete positive operator-valued measure (SIC-POVM) is a POVM in [Formula: see text] consisting of [Formula: see text] positive operators of rank one such that all of whose Hermite inner products are equal. SIC-POVMs are important in quantum information theory, which have many applications in quantum state tomography, quantum cryptography and basic research in quantum mechanics. However, it is very difficult to construct SIC-POVMs. Therefore, many scholars have focused on approximately symmetric informationally complete positive operator-valued measures (ASIC-POVMs) for which the Hermite inner products are close to equal. In this paper, two new constructions of ASIC-POVMs are provided by using character sums and some special functions over finite fields.
This paper studies the class of stochastic maps, or channels, for which (I⊗Φ)(Γ) is always separable (even for entangled Γ). Such maps are called entanglement breaking, and can always be written in the form Φ(ρ)=∑ k R k Tr F k ρ where each R k is a density matrix and F k >0. If, in addition, Φ is trace-preserving, the {F k } must form a positive operator valued measure (POVM). Some special classes of these maps are considered and other characterizations given. Since the set of entanglement-breaking trace-preserving maps is convex, it can be characterized by its extreme points. The only extreme points of the set of completely positive trace preserving maps which are also entanglement breaking are those known as classical-quantum or CQ. However, for d≥3, the set of entanglement breaking maps has additional extreme points which are not extreme CQ maps.