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:1511.00368 · Quantum Information Processing

Entanglement detection via general SIC-POVMs

Ya Xi, Zhu‐Jun Zheng, Chuan-Jie Zhu

Published Sep 10, 2016• 25 citations
arXivHTMLPDF
DOI
10.1007/s11128-016-1435-4

Related papers

Realization of Entanglement-assisted qubit covariant SIC-POVM

Jianying Du

•Jan 1, 2006•0 citations

General SIC measurement-based entanglement detection

Bin Chen, Tao Li, Shao-Ming Fei

arXiv:1406.7820•Quantum Information Processing•Mar 4, 2015•54 citations

Operational Detection of Entanglement via Quantum Designs

Xin Yan, Ye‐Chao Liu, Jiangwei Shang

Abstract From an operational point of view, several new entanglement detection criteria are proposed using quantum designs. These criteria are constructed by considering the correlations defined with quantum designs. Counter‐intuitively, the criteria with more settings are exactly equivalent to the corresponding ones with the minimal number of settings, namely the symmetric informationally complete positive operator‐valued measures (SIC POVMs). Fundamentally, this observation highlights the potentially unique role played by SIC POVMs in quantum information processing. Experimentally, this provides the minimal number of settings that one should choose for detecting entanglement. Furthermore, it is found that nonlinear criteria are not always better than linear ones for the task of entanglement detection.

arXiv:2106.08711•Annalen der Physik•Feb 22, 2022•3 citations

SIC-POVMs and the Knaster's Conjecture

S. B. Samuel, Z. Gedik

Symmetric Informationally Complete Positive Operator-Valued Measures (SIC-POVMs) have been constructed in many dimensions using the Weyl-Heisenberg group. In the quantum information community, it is commonly believed that SCI-POVMs exist in all dimensions; however, the general proof of their existence is still an open problem. The Bloch sphere representation of SIC-POVMs allows for a general geometric description of the set of operators, where they form the vertices of a regular simplex oriented based on a continuous function. We use this perspective of the SIC-POVMs to prove the Knaster's conjecture for the geometry of SIC-POVMs and prove the existence of a continuous family of generalized SIC-POVMs where $(n^2-1)$ of the matrices have the same value of $Tr(ρ^k)$. Furthermore, by using numerical methods, we show that a regular simplex can be constructed such that all its vertices map to the same value of $Tr(ρ^3)$ on the Bloch sphere of $3$ and $4$ dimensional Hilbert spaces. In the $3$-dimensional Hilbert space, we generate $10^4$ generalized SIC-POVMs for randomly chosen $Tr(ρ^3)$ values such that all the elements are equivalent up to unitary transformations.

arXiv:2405.16733•May 27, 2024•0 citations

Notes on general SIC-POVMs

Alexey E. Rastegin

An unavoidable task in quantum information processing is how to obtain data about the state of an individual system by suitable measurements. Informationally complete measurements are relevant in quantum state tomography, quantum cryptography, quantum cloning, and other questions. Symmetric informationally complete measurements (SIC-POVMs) form an especially important class of such measurements. We formulate some novel properties and relations for general SIC-POVMs in a finite-dimensional Hilbert space. For a given density matrix and any general SIC-POVM, the so-called index of coincidence of generated probability distribution is exactly calculated. Using this result, we obtain state-dependent entropic bounds for a single general SIC-POVM. Lower entropic bounds are derived in terms of the Rényi α -entropies for and the Tsallis α -entropies for . A lower bound on the min-entropy of an SIC-POVM is separately examined. For a pair of general SIC-POVMs, entropic uncertainty relations of the Maassen–Uffink type are considered.

arXiv:1307.2334•Physica Scripta•Jun 24, 2014•51 citations

HOW TO DETECT ENTANGLEMENT IN QUANTUM SYSTEMS

Miłosz R. Michalski

Quantum Bio-Informatics•Jan 1, 2010•0 citations
Abstract From an operational point of view, several new entanglement detection criteria are proposed using quantum designs. These criteria are constructed by considering the correlations defined with quantum designs. Counter‐intuitively, the criteria with more settings are exactly equivalent to the corresponding ones with the minimal number of settings, namely the symmetric informationally complete positive operator‐valued measures (SIC POVMs). Fundamentally, this observation highlights the potentially unique role played by SIC POVMs in quantum information processing. Experimentally, this provides the minimal number of settings that one should choose for detecting entanglement. Furthermore, it is found that nonlinear criteria are not always better than linear ones for the task of entanglement detection.
Symmetric Informationally Complete Positive Operator-Valued Measures (SIC-POVMs) have been constructed in many dimensions using the Weyl-Heisenberg group. In the quantum information community, it is commonly believed that SCI-POVMs exist in all dimensions; however, the general proof of their existence is still an open problem. The Bloch sphere representation of SIC-POVMs allows for a general geometric description of the set of operators, where they form the vertices of a regular simplex oriented based on a continuous function. We use this perspective of the SIC-POVMs to prove the Knaster's conjecture for the geometry of SIC-POVMs and prove the existence of a continuous family of generalized SIC-POVMs where (n2−1)(n^2-1)(n2−1) of the matrices have the same value of Tr(ρk)Tr(ρ^k)Tr(ρk). Furthermore, by using numerical methods, we show that a regular simplex can be constructed such that all its vertices map to the same value of Tr(ρ3)Tr(ρ^3)Tr(ρ3) on the Bloch sphere of 333 and 444 dimensional Hilbert spaces. In the 333-dimensional Hilbert space, we generate 10410^4104 generalized SIC-POVMs for randomly chosen Tr(ρ3)Tr(ρ^3)Tr(ρ3) values such that all the elements are equivalent up to unitary transformations.
An unavoidable task in quantum information processing is how to obtain data about the state of an individual system by suitable measurements. Informationally complete measurements are relevant in quantum state tomography, quantum cryptography, quantum cloning, and other questions. Symmetric informationally complete measurements (SIC-POVMs) form an especially important class of such measurements. We formulate some novel properties and relations for general SIC-POVMs in a finite-dimensional Hilbert space. For a given density matrix and any general SIC-POVM, the so-called index of coincidence of generated probability distribution is exactly calculated. Using this result, we obtain state-dependent entropic bounds for a single general SIC-POVM. Lower entropic bounds are derived in terms of the Rényi α -entropies for and the Tsallis α -entropies for . A lower bound on the min-entropy of an SIC-POVM is separately examined. For a pair of general SIC-POVMs, entropic uncertainty relations of the Maassen–Uffink type are considered.