.png){kind=icon}
返回
Dynamic Quantum Circuit Compilation
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2025.3643826.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The practical applications of quantum computing are currently limited by the small number of available qubits. Recent advances in quantum hardware have introduced mid-circuit measurements and resets, enabling the reuse of measured qubits and thus reducing the qubit requirements for executing quantum algorithms. In this work, we present a systematic study of dynamic quantum circuit compilation, a process that transforms static quantum circuits into their dynamic equivalents with fewer qubits through qubit reuse. We establish the first graph-based framework for optimizing qubit-reuse compilation. In particular, we characterize the task of finding the optimal compilation strategy for maximizing qubit reuse using binary integer programming and provide efficient heuristic algorithms for devising general compilation strategies. We conduct a thorough analysis of quantum circuits with practical relevance and offer their optimal qubit-reuse compilation strategies. We also perform a comparative analysis against state-of-the-art approaches, demonstrating the superior performance of our methods in both structured and random quantum circuits. Our framework lays a rigorous foundation for understanding dynamic quantum circuit compilation via qubit reuse, holding significant promise for the practical implementation of large-scale quantum algorithms on quantum computers with limited resources.
Keyword:
Quantum circuit compilation
dynamic circuit
compiler optimization
code sequence optimization
qubit reuse
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
引用论文
Quantum computational advantage via 60-qubit 24-cycle random circuit sampling通过60量子位24周期随机电路采样实现量子计算优势.png)
SCIENCE BULLETIN
OAAI
SCIENCE BULLETINIF21.1
OAAI分享收藏Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search基于子图同构和过滤深度受限搜索的量子比特映射OAAI
OAAI分享收藏分享收藏
查看更多内容