Designing calibration and expressivity-efficient instruction sets for quantum computing
Prakash Murali, Lingling Lao, Margaret Martonosi, Dan Browne

TL;DR
This paper explores how to balance quantum instruction set richness and calibration overhead, proposing a method to efficiently decompose operations and identify optimal gate types for near-term quantum computers.
Contribution
It introduces NuOp, a numerical optimization-based compilation method, and demonstrates that 4-8 gate types suffice for high expressivity with minimal calibration overhead.
Findings
4-8 gate types achieve near full expressivity
Calibration overhead reduces by two orders of magnitude
Rich instruction sets improve application performance
Abstract
Near-term quantum computing (QC) systems have limited qubit counts, high gate (instruction) error rates, and typically support a minimal instruction set having one type of two-qubit gate (2Q). To reduce program instruction counts and improve application expressivity, vendors have proposed, and shown proof-of-concept demonstrations of richer instruction sets such as XY gates (Rigetti) and fSim gates (Google). These instruction sets comprise of families of 2Q gate types parameterized by continuous qubit rotation angles. However, having such a large number of gate types is problematic because each gate type has to be calibrated periodically, across the full system, to obtain high fidelity implementations. This results in substantial recurring calibration overheads even on current systems which use only a few gate types. Our work aims to navigate this tradeoff between application…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
