Designing Calibration and Expressivity-Efficient Instruction Sets for Quantum Computing
Lingling Lao, Prakash Murali, Margaret Martonosi, Dan E. Browne
摘要
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. That is, it allows a large set of different physical operations to be realized on the qubits, based on the input 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 expressivity and calibration overhead, and identify what instructions vendors should implement to get the best expressivity with acceptable calibration time.
Studying this tradeoff is challenging because of the diversity in QC application requirements, the need to optimize applications for widely different hardware gate types and noise variations across gate types. Therefore, our work develops NuOp, a flexible compilation pass based on numerical optimization, to efficiently decompose application operations into arbitrary hardware gate types. Using NuOp and four important quantum applications, we study the instruction set proposals of Rigetti and Google, with realistic noise simulations and a calibration model. Our experiments show that implementing 4-8 types of 2Q gates is sufficient to attain nearly the same expressivity as a full continuous gate family, while reducing the calibration overhead by two orders of magnitude. With several vendors proposing rich gate families as means to higher fidelity, our work has potential to provide valuable instruction set design guidance for near-term QC systems.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper12
- QuantumNAS: Noise-Adaptive Search for Robust Quantum CircuitsHanrui Wang, Yongshan Ding, Jiaqi Gu, Yujun Lin 等HPCA 2022 · 被引用 199 次
- 2QAN: a quantum compiler for 2-local qubit hamiltonian simulation algorithmsLingling Lao, Dan E. BrowneISCA 2022 · 被引用 37 次
- Let Each Quantum Bit Choose Its Basis GatesSophia Fuhui Lin, Sara Sussman, Casey Duckering, Pranav S. Mundada 等MICRO 2022 · 被引用 13 次
- Co-Designed Architectures for Modular Superconducting Quantum ComputersEvan McKinney, Mingkang Xia, Chao Zhou, Pinlei Lu 等HPCA 2023 · 被引用 12 次
- One Gate Scheme to Rule Them All: Introducing a Complex Yet Reduced Instruction Set for Quantum ComputingJianxin Chen, Dawei Ding, Weiyuan Gong, Cupjin Huang 等ASPLOS 2024 · 被引用 10 次
它引用的顶会 Paper1
相关 Paper
- The Imitation Game: Leveraging CopyCats for Robust Native Gate Selection in NISQ ProgramsPoulami Das, Eric Kessler, Yunong ShiHPCA 2023 · 被引用 15 次
- Reconfigurable Quantum Instruction Set Computers for High Performance Attainable on HardwareZhaohui Yang, Dawei Ding, Qi Ye, Cupjin Huang 等ASPLOS 2026
- Unifying Qubit Routing Across Diverse Quantum ISAs via Canonical RepresentationZhaohui Yang, Kai Zhang, Xinyang Tian, Xiangyu Ren 等ISCA 2026 · 被引用 1 次
- Optimized Quantum Compilation for Near-Term Algorithms with OpenPulsePranav Gokhale, Ali Javadi-Abhari, Nathan Earnest, Yunong Shi 等MICRO 2020 · 被引用 87 次
- QuCLEAR: Clifford Extraction and Absorption for Quantum Circuit OptimizationJi Liu, Alvin Gonzales, Benchen Huang, Zain Hamid Saleem 等HPCA 2025 · 被引用 3 次
