Phase-Gadget and Clifford Compilation Frameworks for Multiqubit Quantum Processors
Oral-In-person · Withdrawn
Abstract
As quantum hardware continues to mature, efficient compilation of quantum circuits tailored to device-native capabilities is increasingly critical. We present two complementary advances that exploit programmable, all-to-all multiqubit entangling operations to significantly reduce circuit depth, and drive-power requirements of quantum circuits.
First, we describe a phase-gadget based compilation framework [1] that decomposes an arbitrary quantum circuit into a three-layer structure: a classical pre-processing layer, a middle layer comprised of Z- and X-phase gadgets (exponentials of Pauli strings), and a classical post-processing layer. By leveraging a native multiqubit gate, UMQ=exp(iΣn,mφn,mZnZm), which is available in trapped-ion and other long-range coupling platforms, we implement each phase-gadget in a constant cost of a single multiqubit gate. Benchmarking across a broad suite of circuits shows depth reductions by an average factor of 15 and average error reductions of 40%, demonstrating the practical advantages of aligning compilation and the native gate set, and highlighting the usefulness of multiqubit gates.
Second, we present an algorithm for constant-cost compilation of arbitrary Clifford operations [2], requiring at most four uses of the same multiqubit gate, a three-fold improvement over prior methods which constitutes the theoretically optimal gate count. This approach incurs no resource overhead relative to two-qubit decompositions and complements phase-gadget compilation by partitioning circuits into manageable blocks.
References:
[1] Jonathan Nemirovsky, Maya Chuchem, Lee Peleg, Yakov Solomons, Amit Ben Kish, Yotam Shapira, Phase gadget compilation of quantum circuits using multiqubit gates, arXiv:2510.16788 (2025).
[2] Jonathan Nemirovsky, Lee Peleg, Amit Ben Kish, Yotam Shapira, Optimal constant-cost implementations of Clifford operations using global interactions, arXiv:2510.20730 (2025).
First, we describe a phase-gadget based compilation framework [1] that decomposes an arbitrary quantum circuit into a three-layer structure: a classical pre-processing layer, a middle layer comprised of Z- and X-phase gadgets (exponentials of Pauli strings), and a classical post-processing layer. By leveraging a native multiqubit gate, UMQ=exp(iΣn,mφn,mZnZm), which is available in trapped-ion and other long-range coupling platforms, we implement each phase-gadget in a constant cost of a single multiqubit gate. Benchmarking across a broad suite of circuits shows depth reductions by an average factor of 15 and average error reductions of 40%, demonstrating the practical advantages of aligning compilation and the native gate set, and highlighting the usefulness of multiqubit gates.
Second, we present an algorithm for constant-cost compilation of arbitrary Clifford operations [2], requiring at most four uses of the same multiqubit gate, a three-fold improvement over prior methods which constitutes the theoretically optimal gate count. This approach incurs no resource overhead relative to two-qubit decompositions and complements phase-gadget compilation by partitioning circuits into manageable blocks.
References:
[1] Jonathan Nemirovsky, Maya Chuchem, Lee Peleg, Yakov Solomons, Amit Ben Kish, Yotam Shapira, Phase gadget compilation of quantum circuits using multiqubit gates, arXiv:2510.16788 (2025).
[2] Jonathan Nemirovsky, Lee Peleg, Amit Ben Kish, Yotam Shapira, Optimal constant-cost implementations of Clifford operations using global interactions, arXiv:2510.20730 (2025).
–
Publication: [1] Jonathan Nemirovsky, Maya Chuchem, Lee Peleg, Yakov Solomons, Amit Ben Kish, Yotam Shapira, Phase gadget compilation of quantum circuits using multiqubit gates, arXiv:2510.16788 (2025).
[2] Jonathan Nemirovsky, Lee Peleg, Amit Ben Kish, Yotam Shapira, Optimal constant-cost implementations of Clifford operations using global interactions, arXiv:2510.20730 (2025).
Presenters
-
Yotam Shapira
- Quantum Art