Fixed-Depth Two-Qubit Circuits and the Monodromy Polytope

Abstract

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 themselves accessible via a finite calculation. We completely describe this family of inequalities in a variety of familiar example cases, and as a consequence we highlight a certain member of the "XY-family" for which this subspace is particularly large, i.e., for which many two-qubit programs admit expression as low-depth circuits.

Updated after initial publication to fix increasing/decreasing conventions and an incorrect Figure 6

References in corpus (6)

• Validating quantum computers using randomized model circuits
• Synthesis of Quantum Logic Circuits
• Fidelity of quantum operations
• Parametrically Activated Entangling Gates Using Transmon Qubits
• Optimizing for an arbitrary perfect entangler: I. Functionals
• Efficient algorithms for tensor scaling, quantum marginals and moment polytopes

Cited by in corpus (12)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Implementation of the XY interaction family with calibration of a single pulse
• Quantum Instruction Set Design for Performance
• Designing calibration and expressivity-efficient instruction sets for quantum computing
• Optimal synthesis into fixed XX interactions
• Quantum Logic Gate Synthesis as a Markov Decision Process
• Fast parametric two-qubit gate for highly detuned fixed-frequency superconducting qubits using a double-transmon coupler
• Compiling Arbitrary Single-Qubit Gates Via the Phase-Shifts of Microwave Pulses
• Co-Designed Architectures for Modular Superconducting Quantum Computers
• Simulating nonlinear optical processes on a superconducting quantum device
• Initial-State Dependent Optimization of Controlled Gate Operations with Quantum Computer
• Parallel Driving for Fast Quantum Computing Under Speed Limits