Trapdoored Clifford Operators and Applications
The authors introduce trapdoored Clifford operators that are computationally indistinguishable from uniform random ones but allow for much faster sampling and implementation under the ring learning parity with noise assumption. This overcomes the near-quadratic complexity barrier for uniformly random n-qubit Cliffords, enabling efficient simulation and quantum applications.