Quantum bounds and device-independent security with rank-one qubit measurements

Device-independent (DI) quantum protocols exploit Bell inequality violations to ensure security or certify quantum properties without making assumptions about the internal workings of the devices. In this work, we study the role of rank-one qubit positive operator-valued measures (POVMs) in DI scenarios. This class includes all qubit extremal POVMs, i.e., those measurements that cannot be realized by randomly choosing among others, as well as part of non-extremal POVMs, which have recently been shown to be useful for security applications in sequential quantum protocols. We demonstrate that any rank-one POVM can generate correlations in bipartite scenarios that saturate a Tsirelson inequality, i.e., a quantum bound on linear combinations of outcome statistics, when the two parties share an arbitrary entangled two-qubit state and some other self-tested measurements are performed. For extremal POVMs, such saturation allows for an explicit calculation of the guessing probability and the worst-case conditional von Neumann entropy. From the Tsirelson inequality, we establish a randomness certification method that facilitates numerical simulations and noise analysis. To test its feasibility, we performed a proof-of-concept experiment employing a three-outcome POVM on tilted entangled states under experimental non-idealities. We further explore the case of non-extremal POVMs, providing insights into their role in DI protocols.

Publication Details

Journal
ArXiv.org
Published
2025-03-17
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum bounds and device-independent security with rank-one qubit measurements

ArXiv.org
Quantum Information and Cryptography
article

Quantum bounds and device-independent security with rank-one qubit measurements

article en

Abstract

Device-independent (DI) quantum protocols exploit Bell inequality violations to ensure security or certify quantum properties without making assumptions about the internal workings of the devices. In this work, we study the role of rank-one qubit positive operator-valued measures (POVMs) in DI scenarios. This class includes all qubit extremal POVMs, i.e., those measurements that cannot be realized by randomly choosing among others, as well as part of non-extremal POVMs, which have recently been shown to be useful for security applications in sequential quantum protocols. We demonstrate that any rank-one POVM can generate correlations in bipartite scenarios that saturate a Tsirelson inequality, i.e., a quantum bound on linear combinations of outcome statistics, when the two parties share an arbitrary entangled two-qubit state and some other self-tested measurements are performed. For extremal POVMs, such saturation allows for an explicit calculation of the guessing probability and the worst-case conditional von Neumann entropy. From the Tsirelson inequality, we establish a randomness certification method that facilitates numerical simulations and noise analysis. To test its feasibility, we performed a proof-of-concept experiment employing a three-outcome POVM on tilted entangled states under experimental non-idealities. We further explore the case of non-extremal POVMs, providing insights into their role in DI protocols.

ArXiv.org
Openalex Percentile: Top 73%
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Quantum bounds and device-independent security with rank-one qubit measurements · ArXiv.org (2025) | TGRS Research Map | TGRS