Orchestrating Measurement-Based Quantum Computation over Photonic Quantum Processors

被引:1
作者
Li, Yingheng [1 ]
Pawar, Aditya [1 ]
Azari, Mohadeseh [1 ]
Guo, Yanan [1 ]
Zhang, Youtao [1 ]
Yang, Jun [1 ]
Seshadreesan, Kaushik Parasuram [1 ]
Tang, Xulong [1 ]
机构
[1] Univ Pittsburgh, Pittsburgh, PA 15260 USA
来源
2023 60TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, DAC | 2023年
关键词
Quantum Computer; Compiler;
D O I
10.1109/DAC56929.2023.10247944
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Quantum computing has rapidly evolved in recent years and has established its supremacy in many application domains. While matter-based qubit platforms such as superconducting qubits have received the most attention so far, there is a rising interest in photonic qubits lately, which show advantages in parallelism, speed, and scalability. Photonic qubits are best served by the paradigm of measurement-based quantum computation (MBQC). To deliver the promise of measurement-based photonic quantum computing (MBPQC), the photon cluster state depth and photon utilization are two of the most important metrics. However, little attention has been paid to optimizing the depth and utilization when mapping quantum circuits to the photon clusters. In this paper, we propose a compiler framework that achieves automatic and dynamic depth and utilization optimizations. Our approach consists of an MBPQC mapping mechanism that maps optimized measurement patterns on a cluster state and a cluster state pruning strategy that removes all possible redundancies without impacting the circuit functions. Experimental results on five quantum benchmark with three different qubit numbers indicate our approach achieves an average of 63.4% cluster depth reduction and 22.8% photon utilization improvements.
引用
收藏
页数:6
相关论文
共 18 条
[11]   ScaffCC: Scalable compilation and analysis of quantum programs [J].
JavadiAbhari, Ali ;
Patil, Shruti ;
Kudrow, Daniel ;
Heckey, Jeff ;
Lvov, Alexey ;
Chong, Frederic T. ;
Martonosi, Margaret .
PARALLEL COMPUTING, 2015, 45 :2-17
[12]   Not All SWAPs Have the Same Cost: A Case for Optimization-Aware Qubit Routing [J].
Liu, Ji ;
Li, Peiyi ;
Zhou, Huiyang .
2022 IEEE INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTER ARCHITECTURE (HPCA 2022), 2022, :709-725
[13]  
Nielsen M.A., 2002, Quantum computation and quantum information, DOI DOI 10.1038/46503
[14]   A Fast and Scalable Qubit-Mapping Method for Noisy Intermediate-Scale Quantum Computers [J].
Park, Sunghye ;
Kim, Daeyeon ;
Kweon, Minhyuk ;
Sim, Jae-Yoon ;
Kang, Seokhyeong .
PROCEEDINGS OF THE 59TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, DAC 2022, 2022, :13-18
[15]   Measurement-based quantum computation on cluster states [J].
Raussendorf, R ;
Browne, DE ;
Briegel, HJ .
PHYSICAL REVIEW A, 2003, 68 (02) :32
[16]   A one-way quantum computer [J].
Raussendorf, R ;
Briegel, HJ .
PHYSICAL REVIEW LETTERS, 2001, 86 (22) :5188-5191
[17]  
Shor PW, 1997, SIAM J COMPUT, V26, P1484, DOI [10.1137/S0097539795293172, 10.1137/S0036144598347011]
[18]   Photonic quantum information processing: A concise review [J].
Slussarenko, Sergei ;
Pryde, Geoff J. .
APPLIED PHYSICS REVIEWS, 2019, 6 (04)