Linear-Time Encodable Quantum Codes near the CSS GV Bound
Rachel Yun Zhang
Abstract
We construct quantum CSS codes with rate-distance tradeoff approaching the CSS GV bound, which can be encoded by a quantum circuit of logarithmic depth and a linear number of gates. Our construction is heavily inspired by a work of Brehm and Resch and can be viewed as a quantum analogue of classical repeat multiple accumulate codes. The encoder has a particularly simple structure, consisting of a single constant depth outer quantum circuit followed by several classical accumulation and inverse-accumulation layers.
Create a lesson
Related papers
Experimental quantification of quantum coherence for a set of quantum states
Tianle Zheng, Liangsheng Li, Wenting Zhou et al.
Fermionic Gaussian Scrooge Ensembles in Deep Thermalization
Ning Sun, Pengfei Zhang
Rapid mixing of quantum spin chains at any finite temperature
Leeseok Kim
Vector chiral order and dynamical quantum phase transitions in an Ising chain with dimerized anisotropic Gamma interaction
Yu-Hong Yan, Shi-Qiao Wu, Kun-Liang Zhang
Robustness hierarchy of bipartite quantum correlations under noisy dynamics
Shakib Daryanoosh
Classical Hardness of Learning Functions of Hamiltonians
Sota Hashimoto, Akinori Kawachi