2016/05/30 by Matthew McKague, McKague, Matthew
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.1605.09435
openalex publication_date 2016/05/30 · openalex created_date 2022/09/30 · openalex updated_date 2026/07/28
To date all self-tests for high dimensional systems are confined to\nmany-qubit states. This is due to two restrictions in the literature: the\nstandard techniques for proving self-testing results apply only to qubits, and\nthere are few suitable non-local games that are known to require high\ndimensional non-qubit states to achieve their optimal quantum value. In this\npaper we address these two problems. Specifically, we generalize the usual\nself-testing framework to qdits and then apply it to a generalization of the\nmagic square game, giving a self-test for two maximally entangled pairs of\nqdits. This self-test has two parties, perfect completeness for honest\nquantum players, and requires only a constant number of measurement settings,\nregardless of the dimension d.\n