Such a circuit is described by a series of intermittant random local projective Pauli measurements with random unitary time-evolution operators. The simplest Cliord group in multiqubit quantum computation is generated by a restricted set of unitary Cliord gates - the Hadamard, /4-phase and controlled-X gates. Gottesmann in his investigation of quantum error-correcting codes.
Clifford group quantum error correction code#
The critical thing here is that there’s 2 copies of the state that we’re averaging over. Error-correcting code arising from a monitored random circuit. The term Cliord group was introduced in 1998 by D. For the special case of the Clifford group on a single qubit, let S be the set of 1-qubit Clifford gates. There's a proof in section A.1 of this paper. This is more like you would do in an actual experiment.Īs for what makes the Clifford group a 2-design, I guess you just have to sit down and do the maths. If the function you want is a polynomial of degree t or less in terms of the coefficients of the input state, it is sufficient to average over a set of gates that comprise a t-design.Īnother way of thinking about this is, instead of a degree t polynomial, you can talk about calculating a linear function of t copies of the input state.
However, averaging over all possible unitaries is a pain, and is unnecessary if the function you want to compute is simple enough. Often, you want to compute the average of some function over all possible pure input states, which is equivalent to fixing the input state and averaging over all possible unitaries. The $t$ in $t$-design is essentially a measure of how good a job the set of gates does in terms of randomising a state (the larger t, the more random, with properly random requiring the infinite limit).
0 kommentar(er)
