Compare Papers
Paper 1
Blind information reconciliation with polar codes for quantum key distribution
E. O. Kiktenko, A. O. Malyshev, A. K. Fedorov
- Year
- 2020
- Journal
- arXiv preprint
- DOI
- arXiv:2008.12299
- arXiv
- 2008.12299
We suggest a new protocol for the information reconciliation stage of quantum key distribution based on polar codes. The suggested approach is based on the blind technique, which is proved to be useful for low-density parity-check (LDPC) codes. We show that the suggested protocol outperforms the blind reconciliation with LDPC codes, especially when there are high fluctuations in quantum bit error rate (QBER).
Open paperPaper 2
The quantum smooth label cover problem is undecidable
Eric Culf, Kieran Mastel, Connor Paddock, Taro Spirig
- Year
- 2025
- Journal
- arXiv preprint
- DOI
- arXiv:2510.03477
- arXiv
- 2510.03477
We show that the quantum smooth label cover problem is undecidable and RE-hard. This sharply contrasts the quantum unique label cover problem, which can be decided efficiently by a result of Kempe, Regev, and Toner (FOCS'08). On the other hand, our result aligns with the RE-hardness of the quantum label cover problem, which follows from the celebrated MIP* = RE result of Ji, Natarajan, Vidick, Wright, and Yuen (ACM'21). Additionally, we show that the quantum oracularized smooth label cover problem is RE-hard. Our second result fits with the alternative quantum unique games conjecture recently proposed by Mousavi and Spirig (ITCS'25) on the RE-hardness of the quantum oracularized unique label cover problem. Our proof techniques include a quantum version of Feige's reduction from 3SAT to 3SAT5 (STOC'96) for BCSMIP*-protocols, which may be of independent interest.
Open paper