A synchronous NPA hierarchy with applications
Travis B. Russell

TL;DR
This paper introduces an adapted NPA hierarchy tailored for synchronous correlation matrices, enabling more efficient certification of certain quantum correlations and applications like SIC-POVMs and MUBs.
Contribution
It presents a novel, more efficient adaptation of the NPA hierarchy specifically for synchronous correlations, reducing certificate size and constraints.
Findings
Efficient certification of synchronous quantum correlations.
Characterizations of synchronous quantum commuting and quantum sets.
Verification of SIC-POVMs and MUBs using fewer certificates.
Abstract
We present an adaptation of the NPA hierarchy to the setting of synchronous correlation matrices. Our adaptation improves upon the original NPA hierarchy by using smaller certificates and fewer constraints, although it can only be applied to certify synchronous correlations. We recover characterizations for the sets of synchronous quantum commuting and synchronous quantum correlations. For applications, we show that the existence of symmetric informationally complete positive operator-valued measures and maximal sets of mutually unbiased bases can be verified or invalidated with only two certificates of our adapted NPA hierarchy.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum and electron transport phenomena · Quantum Computing Algorithms and Architecture
