Self-testing measurements in networks from star shaped to tree shaped based on genuine network nonlocality

Network self-testing enables the unique identification of unknown measurements in a network using only observed measurement statistics. In this work, we first establish the self-testing statements for measurements in a three-branch star-shaped network (3BSN) scenario based on genuine network nonlocality. In this network, the central node performs a single joint measurement, while each branch node implements three binary-outcome projective measurements. We propose a set of statistical constraints for one pair of measurements (the first and second) at each branch node, and, by exploiting the maximal violation of the Mermin inequality for another pair (the second and third), we demonstrate the self-testing of the measurements in this 3BSN scenario. Subsequently, by performing a joint measurement on branch nodes from two discussed 3BSNs, we construct a three-layer two-forked tree-shaped network. We then establish the self-testing protocol of the joint measurement in this newly formed network scenario. In conjunction with the self-testing statements for each individual 3BSN scenario, this establishment enables the self-testing of all measurements in the tree-shaped network scenario. Our self-testing approach does not rely on any network Bell inequalities, thus providing a different perspective for device-independent quantum information processing tasks in networks.

Institutions

Publication Details

Journal
Physical review. A/Physical review, A
Published
2025-11-07
DOI
https://doi.org/10.1103/v1jp-167d
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

Self-testing measurements in networks from star shaped to tree shaped based on genuine network nonlocality

Physical review. A/Physical review, A
Quantum Information and Cryptography
article

Self-testing measurements in networks from star shaped to tree shaped based on genuine network nonlocality

article en

Abstract

Network self-testing enables the unique identification of unknown measurements in a network using only observed measurement statistics. In this work, we first establish the self-testing statements for measurements in a three-branch star-shaped network (3BSN) scenario based on genuine network nonlocality. In this network, the central node performs a single joint measurement, while each branch node implements three binary-outcome projective measurements. We propose a set of statistical constraints for one pair of measurements (the first and second) at each branch node, and, by exploiting the maximal violation of the Mermin inequality for another pair (the second and third), we demonstrate the self-testing of the measurements in this 3BSN scenario. Subsequently, by performing a joint measurement on branch nodes from two discussed 3BSNs, we construct a three-layer two-forked tree-shaped network. We then establish the self-testing protocol of the joint measurement in this newly formed network scenario. In conjunction with the self-testing statements for each individual 3BSN scenario, this establishment enables the self-testing of all measurements in the tree-shaped network scenario. Our self-testing approach does not rely on any network Bell inequalities, thus providing a different perspective for device-independent quantum information processing tasks in networks.

Physical review. A/Physical review, AVol. 112(5)
Beijing University of Posts and Telecommunications (CN), Beihang University (CN)
Openalex Percentile: Top 23%
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.