Background
Suppose one wishes to communicate information using a noisy channel $N$ instead of an ideal channel $I$. The general framework to communicate reliably is
- Take $n$ copies of $N$.
- For some encoder $E_n$ and decoder $D_n$, we can send messages at a rate $R_n$ using $D_n\circ N^{\otimes n}\circ E_n$ with error $\varepsilon_n$.
- If it holds that $\lim_{n\rightarrow\infty}\varepsilon_n = 0$ and $\lim_{n\rightarrow\infty}R_n = R$, then we say we can communicate at the rate $R$ using the noisy channel.
On the other hand, the case of quantum circuits is quite different. Suppose we have an ideal unitary $U$ and a noisy circuit $\tilde{U}$ that tries to achieve this unitary. The usual error correction setting is quite different. The broad ideas there are
- Encode the each qubit of the input state to the circuit into a larger space e.g. 1 logical qubit into 9 physical qubits.
- Use fault-tolerant gates - i.e. the gate error should be correctable using the ideas in Step 1 after each gate's action.
Question
Why are these two error-correction tasks analyzed in fundamentally different ways? In particular, QEC for circuits never looks at taking one-shot results for a single copy of the circuit and making asymptotic results for many i.i.d copies of that circuit - but why?