Self-testing in a constrained prepare-measure scenario sans assuming quantum dimension
Ritesh K. Singh, Souradeep Sasmal, S. Nautiyal, A. K. Pan

TL;DR
This paper introduces a device-independent self-testing protocol in a prepare-measure scenario using parity-oblivious multiplexing, demonstrating optimal quantum success probabilities without assuming quantum system dimension, enabling scalable DI certification.
Contribution
It presents the first dimension-independent DI self-testing protocol in a prepare-measure scenario based on POM tasks, with explicit unitaries for mapping unknown states to known systems.
Findings
Quantum success probability exceeds classical bounds.
Establishment of DI self-testing without dimension assumptions.
Construction of unitaries for finite-dimensional Hilbert spaces.
Abstract
We present a device-independent (DI) self-testing protocol in a constrained prepare-measure scenario, based on the bit parity-oblivious multiplexing (POM) task. In this scenario, a parity-oblivious constraint is imposed on the preparations, allowing us to define a classical bound derived from a preparation noncontextual ontological model. We derive the optimal quantum success probability in the POM task devoid of assuming the dimension of the quantum system, an essential step towards DI self-testing, which has hitherto not been demonstrated in prepare-measure scenario. We demonstrate that the optimal quantum value exceeds preparation noncontextual bound and, as a result, this establishes DI self-testing of the preparations and the measurement devices. Furthermore, by explicitly constructing the required unitaries, we show that the optimal preparations and measurements in an unknown…
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 Mechanics and Applications · Quantum Computing Algorithms and Architecture
