期刊
QUANTUM
卷 5, 期 -, 页码 -出版社
VEREIN FORDERUNG OPEN ACCESS PUBLIZIERENS QUANTENWISSENSCHAF
DOI: 10.22331/q-2021-09-16-544
关键词
-
资金
- ETH Zudrich
- ETH Foundation
- IQIM, an NSF Physics Frontiers Center [PHY-1125565]
- Gordon and Betty Moore Foundation [GBMF-12500028]
- National Centres of Competence in Research (NCCRs) QSIT
- SwissMAP
- NSF CAREER Grant [CCF-1553477]
- AFOSR YIP [FA9550-16-1-0495]
- CIFAR Azrieli Global Scholar award
- MURI [FA9550-18-1-0161]
Self-testing is a method used to characterize a quantum system based on its classical input-output correlations, and is crucial in device-independent quantum information processing and quantum complexity theory. This study introduces a protocol where a classical verifier can certify that a computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements with a change of basis, replacing the need for multiple non-communicating parties. This allows the verifier to certify entanglement in a single quantum device under computational assumptions, using techniques to constrain the actions of the quantum device without breaking post-quantum cryptography.
Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior works on self-testing require the assumption that the system's state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device's state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement, a property usually closely associated with two separated subsystems, inside a single quantum device. To achieve this, we build on techniques first introduced by Brakerski et al. (2018) and Mahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据