Classical simulability of quantum circuits followed by sparse classical post-processing

Yasuhiro Takahashi, Masayuki Miyamoto, Noboru Kunihiro

We study the classical simulability of a polynomial-size quantum circuit $C_n$ on $n$ qubits followed by sparse classical post-processing (SCP) on $m$ bits, where $m \leq n \leq {\…