Optimal synthesis into fixed XX interactions
We describe an optimal procedure, as well as its efficient software implementation, for exact and approximate synthesis of 4x4 unitaries into any discrete set of XX–type gates (a family that describes all 2-qubit controlled gates). This gateset is well-motivated on contemporary hardware where fractionally-entangling gates are often faster/higher-fidelity than fully-entangling gates. Our method arises from analysis and manipulation of certain polyhedral subsets of the space of canonical gates. Using this, we analyze which small sets of XX–type interactions cause the greatest improvement in expected fidelity under experimentally-motivated error models. For the exact circuit synthesis of Haar-randomly selected two-qubit operations, we find an improvement in estimated infidelity by ≈31.4% when including CX^1/2 and CX^1/3 alongside the standard gate CX, near to the optimal limit of ≈36.9% obtained by including all fractional CX^α, α ∈ [0, 1]. This motivates the calibration of a (slightly) over-complete gateset for quantum computers to reduce circuit costs, while maintaining efficient compilation.
abstract (planqc2022-paper10.pdf) | 491KiB |
Thu 15 SepDisplayed time zone: Belgrade, Bratislava, Budapest, Ljubljana, Prague change
16:00 - 17:30 | |||
16:00 25mTalk | Optimal synthesis into fixed XX interactions PLanQC File Attached | ||
16:25 25mTalk | Encoding High-level Quantum Programs as SZX-diagrams PLanQC Agustín Borgna Université de Lorraine, CNRS, Inria, LORIA F 54000 Nancy, France and Université Paris-Saclay, CNRS, Laboratoire Méthodes Formelles, 91405, Orsay, France, Rafael Romero Universidad de Buenos Aires, Universidad de la República File Attached | ||
16:50 25mTalk | Adventures in Qutrit Compilation PLanQC File Attached | ||
17:15 15mDay closing | Conclusion and Group Photo PLanQC |