



@article {3021,
	title = {Computational self-testing of multi-qubit states and measurements},
	year = {2022},
	month = {1/31/2022},
	abstract = {<p>Self-testing is a fundamental technique within quantum information theory that allows a classical verifier to force (untrusted) quantum devices to prepare certain states and perform certain measurements on them. The standard approach assumes at least two spatially separated devices. Recently, Metger and Vidick [Quantum, 2021] showed that a single EPR pair of a single quantum device can be self-tested under standard computational assumptions. In this work, we generalize their techniques to give the first protocol that self-tests N EPR pairs and measurements in the single-device setting under the same computational assumptions. We show that our protocol can be passed with probability negligibly close to 1 by an honest quantum device using poly(N) resources. Moreover, we show that any quantum device that fails our protocol with probability at most ϵ must be poly(N,ϵ)-close to being honest in the appropriate sense. In particular, a simplified version of our protocol is the first that can efficiently certify an arbitrary number of qubits of a cloud quantum computer, on which we cannot enforce spatial separation, using only classical communication.</p>},
	keywords = {FOS: Physical sciences, Quantum Physics (quant-ph)},
	doi = {10.48550/ARXIV.2201.13430},
	url = {https://arxiv.org/abs/2201.13430},
	author = {Fu, Honghao and Daochen Wang and Zhao, Qi}
}
