§2.2, p. 3 — Λ(e^{iφ}) is approximated within √(2/4^k + 2√2/2^k) by O(k) H, T, CNOT gates with two |0⟩ ancillas
ProvedCliffordTApprox.Ancilla.phase_gate_approxapproximationclifford-tgate-synthesisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-circuits
There is an absolute constant such that for every and every real there is a circuit of gates from on three wires (the data qubit, then two ancillas initialized to ) with
This is the paper's main result for the phase gate: precision with gates, i.e. gates for precision .
Formalization Note. The error is the Frobenius norm of the difference of the two linear maps from one qubit to three qubits; it is sensitive to the global phase and charges any amplitude left on the ancillas. The constants and pin the page's and ; is quantified before and . The statement holds for every real , not only , through the reduction .
Preamble
import Mathlib import Definitions.Def_CliffordTApprox_Ancilla_Setting
Formal statement
namespace CliffordTApprox.Ancilla
open QAlgorithms
open QAlgorithms.Papers.Independent.Renew46.P12
/-- §2.2, p. 3: for every `k` and every `φ` there is an `{H, T, CNOT}` circuit on the data wire and
two `|0⟩` ancillas, of size `O(k)` with an absolute constant, whose initialized map is within
Frobenius distance `√(2/4^k + 2√2/2^k)` of `Λ(e^{iφ}) ⊗ |00⟩`. -/
theorem phase_gate_approx :
∃ A : ℝ, 0 < A ∧ ∀ (k : ℕ) (φ : ℝ), ∃ c : Circuit htcxGateSet (1 + 2),
frobNorm (initializedMap c.unitary - idealMap (phaseGate φ) 2) ≤
Real.sqrt (2 / 4 ^ k + 2 * Real.sqrt 2 / 2 ^ k) ∧
(c.size : ℝ) ≤ A * ((k : ℝ) + 1) := by sorry
end CliffordTApprox.Ancilla
Source
Kliuchnikov, Maslov, Mosca, Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits, arXiv:1212.0822v2, pp. 2–3, §2 and §2.2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.