Phantom Codes: Hardness, Rate Optimal qLDPC Constructions, and Distance Limits

Rui Mao, Weixiao Sun, Shengyu Zhang

An $[[n,k,d]]$ stabilizer code is phantom if every in-block logical CNOT gate can be realized by a permutation of its physical qubits. This eliminates the large and complicated phy…