Compare Papers
Paper 1
Parallel repetition with a threshold in quantum interactive proofs
Abel Molina
- Year
- 2020
- Journal
- arXiv preprint
- DOI
- arXiv:2008.07445
- arXiv
- 2008.07445
In this note, we show that $O(\log (1/ε))$ rounds of parallel repetition with a threshold suffice to reduce completeness and soundness error to $ε$ for single-prover quantum interactive proof systems. This improves on a previous $O(\log (1/ε) \log \log (1/ε))$ bound from Hornby (2018), while also simplifying its proof. A key element in our proof is a concentration bound from Impagliazzo and Kabanets (2010).
Open paperPaper 2
Measurement-device-independent quantum key distribution over 200 km
Yan-Lin Tang, Hua-Lei Yin, Si-Jing Chen, Yang Liu, Wei-Jun Zhang, Xiao Jiang, Lu Zhang, Jian Wang, Li-Xing You, Jian-Yu Guan, Dong-Xu Yang, Zhen Wang, Hao Liang, Zhen Zhang, Nan Zhou, Xiongfeng Ma, Teng-Yun Chen, Qiang Zhang, Jian-Wei Pan
- Year
- 2014
- Journal
- arXiv preprint
- DOI
- arXiv:1407.8012
- arXiv
- 1407.8012
Measurement-device-independent quantum key distribution (MDIQKD) protocol is immune to all attacks on detection and guarantees the information-theoretical security even with imperfect single photon detectors. Recently, several proof-of-principle demonstrations of MDIQKD have been achieved. Those experiments, although novel, are implemented through limited distance with a key rate less than 0.1 bps. Here, by developing a 75 MHz clock rate fully-automatic and highly-stable system, and superconducting nanowire single photon detectors with detection efficiencies more than 40%, we extend the secure transmission distance of MDIQKD to 200 km and achieve a secure key rate of three orders of magnitude higher. These results pave the way towards a quantum network with measurement-device-independent security.
Open paper