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} $\gamma$ is $\Theta_d(\gamma^{-(d-1)})$. This scaling is necessary even when the measurements are tailored to the target state. Independent Haar-random projective measurements instead require $\Theta_d(\gamma^{-(d-1)}\log(1/\gamma))$ effects. Finally, we show that, once the exact operational identities are known, $\Theta_d(\gamma^{-2}\log(1/\delta))$ copies of the target state are necessary and sufficient for certification with error probability at most $\delta$. Determining the optimal sample complexity when those identities must instead be inferred from the same finite target-state data remains open.

arXiv:2610.08757 [quant-ph]

(or arXiv:2610.08757v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2610.08757 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.