activity
20162026
most citedLong-Distance Continuous-Variable Quantum Key Distribution over 202.81 km of Fiber

443 citations · 1.5k across the 23 of their papers we have counts for

collaborators
Showing 2017Show all

6 papers · 1 filter

quant-ph2017★ 23 cited

A quantum primality test with order finding

Alvaro Donis-Vela, Juan Carlos Garcia-Escartin

Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat's…

quant-ph2017★ 74 cited

High speed error correction for continuous-variable quantum key distribution with multi-edge type LDPC code

Xiangyu Wang, Yi-Chen Zhang, Song Yu +1

Error correction is a significant step in postprocessing of continuous-variable quantum key distribution system, which is used to make two distant legitimate parties share identica…

quant-ph2017★ 198 cited

Continuous-variable QKD over 50km commercial fiber

Yi-Chen Zhang, Zhengyu Li, Ziyang Chen +18

The continuous-variable version of quantum key distribution (QKD) offers the advantages (over discrete-variable systems) of higher secret key rates in metropolitan areas as well as…

quant-ph2017★ 60 cited

Finite-size analysis of continuous-variable measurement-device-independent quantum key distribution

Xueying Zhang, Yi-Chen Zhang, Yijia Zhao +3

We study the impact of the finite-size effect on the continuous-variable measurement-device-independent quantum key distribution (CV-MDI QKD) protocol, mainly considering the finit…

quant-ph2017★ 23 cited

Efficient rate-adaptive reconciliation for continuous-variable quantum key distribution

Xiangyu Wang, Yi-Chen Zhang, Zhengyu Li +3

Information reconciliation protocol has a significant effect on the secret key rate and maximal transmission distance of continuous-variable quantum key distribution (CV-QKD) syste…

quant-ph2017★ 16 cited

Computing quopit Clifford circuit amplitudes by the sum-over-paths technique

Dax Enshan Koh, Mark D. Penney, Robert W. Spekkens

By the Gottesman-Knill Theorem, the outcome probabilities of Clifford circuits can be computed efficiently. We present an alternative proof of this result for quopit Clifford circu…