Every element of is unitary
ProvedMITMSynthesis.depthOneSet_subset_unitarycircuit-synthesismeet-in-the-middlequantum-circuits
Let be a set of gates and . Every element of , the set of unitaries of depth-one -qubit circuits over , is a unitary matrix:
The paper introduces as "the set of all unitaries corresponding to depth one n-qubit circuits"; this statement records that a gate on some qubits tensored with the identity, and a product of such, is unitary. It is used whenever a circuit is undone by .
Differences from the source: none.
Preamble
import Mathlib import Definitions.Def_MITMSynthesis_Gate import Definitions.Def_MITMSynthesis_depthOneSet import Definitions.Def_MITMSynthesis_S
Formal statement
namespace MITMSynthesis
/-- **Every element of `V_{n,G}` is unitary.** Amy–Maslov–Mosca–Roetteler, arXiv:1206.0758v3,
§2, p. 4: `V_{n,G}` is "the set of all unitaries corresponding to depth one n-qubit circuits over
the instruction set G". Each gate of `G` is unitary, its placement on qubits (tensored with the
identity) is unitary, and a layer is a product of such placements. -/
theorem depthOneSet_subset_unitary (n : ℕ) (G : Set Gate) :
depthOneSet n G ⊆ (Matrix.unitaryGroup (Q n) ℂ : Set (Matrix (Q n) (Q n) ℂ)) := by sorry
end MITMSynthesis
Source
Amy, Maslov, Mosca, Roetteler, A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits, arXiv:1206.0758v3, §2, p. 4 (V_{n,G}, "the set of all unitaries corresponding to depth one n-qubit circuits over the instruction set G")