Two-Qubit Circuit Depth and the Monodromy Polytope
Two-Qubit Circuit Depth and the Monodromy Polytope
For a native gate set which includes all single-qubit gates, we apply results from symplectic geometry to analyze the spaces of two-qubit programs accessible within a fixed number of gates. These techniques yield an explicit description of this subspace as a convex polytope, presented by a family of linear inequalities …