Turning gate
synthesis errors into incoherent errors
(pp0488-0494)
Matthew B. Hastings
doi:
https://doi.org/10.26421/QIC17.5-6-7
Abstracts:
Using error correcting codes and fault tolerant techniques, it is
possible, at least in theory, to produce logical qubits with
significantly lower error rates than the underlying physical qubits.
Suppose, however, that the gates that act on these logical qubits are
only approximation of the desired gate. This can arise, for example, in
synthesizing a single qubit unitary from a set of Clifford and T gates;
for a generic such unitary, any finite sequence of gates only
approximates the desired target. In this case, errors in the gate can
add coherently so that, roughly, the error epsilon in the unitary of
each gate must scale as epsilon < 1/N, where N is the number of
gates. If, however, one has the option of synthesizing one of several
unitaries near the desired target, and if an average of these options is
closer to the target, we give some elementary bounds showing cases in
which the errors can be made to add incoherently by averaging over
random choices, so that, roughly, one needs epsilon < 1/ √ N. We
remark on one particular application to distilling magic states where
this effect happens automatically in the usual circuits.
Key words: synthesis
errors, circuits, magic states |