94 citations · 726 across the 40 of their papers we have counts for
43 papers
Loss-Tolerant Measurement-Device-Independent QKD over Untrusted Repeaters via High-Dimensional Time-Bin Multiplexing
Yu-Chun Yin, Ching-Yi Lai, Alexei Ashikhmin
We propose a loss-tolerant measurement-device-independent quantum key distribution (MDI-QKD) protocol using time-bin-multiplexed single photons entangled with local qubits stored i…
Efficient learning of -doped stabilizer states with single-copy measurements
Nai-Hui Chia, Ching-Yi Lai, Han-Hsuan Lin
One of the primary objectives in the field of quantum state learning is to develop algorithms that are time-efficient for learning states generated from quantum circuits. Earlier i…
On Belief Propagation Decoding of Quantum Codes with Quaternary Reliability Statistics
Ching-Feng Kung, Kao-Yueh Kuo, Ching-Yi Lai
In this paper, we investigate the use of quaternary reliability statistics for ordered statistics decoding (OSD) of quantum codes. OSD can be used to improve the performance of bel…
On the size of maximal binary codes with 2, 3, and 4 distances
Alexander Barg, Alexey Glazyrin, Wei-Jiun Kao +3
We address the maximum size of binary codes and binary constant weight codes with few distances. Previous works established a number of bounds for these quantities as well as the e…
Parallel syndrome extraction with shared flag qubits for Calderbank-Shor-Steane codes of distance three
Pei-Hao Liou, Ching-Yi Lai
To perform achieve fault-tolerant quantum computation, one can use flagged syndrome extraction with fewer ancilla qubits. However, it suffers from long circuit depth if one stabili…
Semidefinite programming bounds for few-distance sets in the Hamming and Johnson spaces
Alexander Barg, Ching-Yi Lai, Pin-Chieh Tseng +1
We study the maximum cardinality problem of a set of few distances in the Hamming and Johnson spaces. We formulate semidefinite programs for this problem and extend the 2011 works…