Complexity of self-consistent entanglement certification
Abstract
In recent work Phys. Rev. X 16, 031057 (2026), we proposed a self-consistent approach to entanglement certification based on generalized noncontextuality. It requires no prior characterization of the measurement devices and, given access to all local measurements, can certify every entangled state in a Bell circuit. Here, we study the complexity of this protocol in a finite experiment. At fixed local dimension d, we show that the optimal number of distinct local effects needed to reach a trace-distance \textit{entanglement resolution} γ is Θd(γ−(d−1)). This scaling is necessary even when the measurements are tailored to the target state. Independent Haar-random projective measurements instead require Θd(γ−(d−1)log(1/γ)) effects. Finally, we show that, once the exact operational identities are known, Θd(γ−2log(1/δ)) copies of the target state are necessary and sufficient for certification with error probability at most δ. Determining the optimal sample complexity when those identities must instead be inferred from the same finite target-state data remains open.
Related
- From Single-Chain Dynamics to Structure Formation: Dynamic Self-Consistent Field Theory and Molecular Dynamics of (Co)polymer Melts across Entanglement Regimes
- Finite-size Entanglement Certification via Third-Order Local Randomized Measurements
- Entanglement certification of attosecond light fields with photoelectron interferometry
- Certification of high-dimensional entanglement in continuous-variable systems
- Certification Time for Weak-Force-Mediated Entanglement between Levitated Particles
BibTeX
@misc{zhang2026complexity,
title = {{Complexity of self-consistent entanglement certification}},
author = {Yujie Zhang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.08757},
eprint = {2610.08757},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.08757},
}
RIS
TY - UNPB
TI - Complexity of self-consistent entanglement certification
AU - Yujie Zhang
PY - 2026
DA - 2026/10/06
PB - arXiv
DO - 10.48550/arxiv.2610.08757
UR - https://arxiv.org/abs/2610.08757
AB - In recent work Phys. Rev. X 16, 031057 (2026), we proposed a self-consistent approach to entanglement certification based on generalized noncontextuality. It requires no prior characterization of the measurement devices and, given access to all local measurements, can certify every entangled state in a Bell circuit. Here, we study the complexity of this protocol in a finite experiment. At fixed local dimension d, we show that the optimal number of distinct local effects needed to reach a trace-distance \textit{entanglement resolution} γ is Θ_d(γ^−(d−1)). This scaling is necessary even when the measurements are tailored to the target state. Independent Haar-random projective measurements instead require Θ_d(γ^−(d−1)log(1/γ)) effects. Finally, we show that, once the exact operational identities are known, Θ_d(γ^−2log(1/δ)) copies of the target state are necessary and sufficient for certification with error probability at most δ. Determining the optimal sample complexity when those identities must instead be inferred from the same finite target-state data remains open.
ER -