94 citations · 726 across the 40 of their papers we have counts for
6 papers · 1 filter
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…
Syndrome decoding by quantum approximate optimization
Ching-Yi Lai, Kao-Yueh Kuo, Bo-Jyun Liao
The syndrome decoding problem is known to be NP-complete. The goal of the decoder is to find an error of low weight that corresponds to a given syndrome obtained from a parity-chec…
Semidefinite programming bounds for binary codes from a split Terwilliger algebra
Pin-Chieh Tseng, Ching-Yi Lai, Wei-Hsuan Yu
We study the upper bounds for , the maximum size of codewords with length and Hamming distance at least . Schrijver studied the Terwilliger algebra of the Hamming sc…
Comparison of 2D topological codes and their decoding performances
Kao-Yueh Kuo, Ching-Yi Lai
Topological quantum codes are favored because they allow qubit layouts that are suitable for practical implementation. An -qubit topological code can be decoded by minimum-weigh…