Low-depth random Clifford-circuit code[1]
Description
An encoder for an \([[n,k]]\) quantum error correcting code, is an \(n\)-qubit unitary transformation that takes a \(k\)-qubit state as input (with \(k\leq n\), and the remaining \(n-k\) qubits initialized to \(|0\rangle^{\otimes n-k}\) ) to give a corresponding state in the codespace as the output. An n-qubit quantum circuit with random 2-qubit Clifford gates can act as an encoder into a code with distance \(d\) with high probability, with a size (i.e. number of gates in the circuit) at most \(O(n^2 log n)\)). Noting that two gates acting on disjoint qubits could in fact be executed simultaneously, this is equivalent to the depth (number of time steps in the circuit) being at most \(O(log^3 n)\).
Protection
Creates a random \([[n,k,d]]\) stabilizer code that detects errors on \(d-1\) qubits, and corrects errors on \(\left\lfloor (d-1)/2 \right\rfloor\) qubits.
Parent
References
Page edit log
- Victor V. Albert (2022-01-20) — most recent
- Srilekha Gandhari (2021-12-14)
Zoo code information
Cite as:
“Low-depth random Clifford-circuit code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/nonlocal_lowdepth