Optimized Compilation for Distributed Quantum Computing
Quantum Software Laboratory, Department of Engineering and Architecture, University of Parma（帕尔马大学工程与建筑学院量子软件实验室）；Department of Mathematical, Physical and Computer Sciences, University of Parma（帕尔马大学数学、物理和计算机科学系）；INFN–Sezione di Milano-Bicocca, gruppo collegato di Parma（米兰-比可卡INFN分部帕尔马协作组）
In many practical applications, quantum algorithms require several qubits, significantly more than those available with current noisy intermediate-scale quantum processors. Distributed quantum computing (DQC) is considered a scalable approach to increasing the number of available qubits for computational tasks. In the DQC setting, a quantum compiler must find the best partitioning for the quantum algorithm and then perform smart non-local operations scheduling to optimize the consumption of Einstein-Podolsky-Rosen (EPR) pairs. In this work, the focus is on minimizing the use of EPR pairs when the circuit structure allows for multiple non-local gates to utilize a single TeleGate operation. This is achieved by using a greedy algorithm that explores the circuit and groups together the gates that could share an EPR pair while also changing the order of commutative gates when necessary. With this preliminary pass, the compiled circuits show reduced depth and EPR usage. Since the quality of each EPR pair quickly deteriorates, the number of non-local gates using the same EPR pair should also be bounded. This means that, depending on the features of the target quantum network, the user can achieve different levels of optimization. Here, it is shown that this approach brings benefits even while assuming a low EPR pair lifetime.
Optimized Compilation of Logical Clifford Circuits
Fraunhofer IIS, Fraunhofer Institute for Integrated Circuits IIS（弗劳恩霍夫集成电路研究所）；University of Würzburg（维尔茨堡大学）；Friedrich-Alexander-Universität Erlangen-Nürnberg（埃尔朗根-纽伦堡弗里德里希·阿历克西斯大学）
High-Fidelity Universal Quantum Gate Compilation for Non-semisimple Ising Anyons via Genetic Algorithm-Optimized Solovay-Kitaev Decomposition
School of Physics and Optoelectronics, Xiangtan University（湘潭大学物理与光电工程学院）；School of Physics and Electronic Science, Hunan Institute of Science and Technology（湖南理工学院物理与电子科学学院）；Center for Quantum Science and Technology, Department of Physics, Shanghai University（上海大学物理学部量子科学与技术中心）
Quantum Hamlets: Distributed Compilation of Large Algorithmic Graph States
Manning College of Information and Computer Sciences, University of Massachusetts Amherst（马萨诸塞大学阿默斯特分校曼宁信息科学与工程学院）；Graduate School of Media and Governance, Keio University（庆应义塾大学媒体治理研究生院）；Faculty of Environment and Information Studies, Keio University（庆应义塾大学环境信息学部）
Advancing quantum process tomography through quantum compilation
University of Information Technology（信息技术大学）；Vietnam National University（越南国立大学）；Nara Institute of Science and Technology（奈良先端科学技术大学院大学）；Tohoku University（东北大学）
A Compilation Framework for Quantum Simulation of Non-unitary Dynamics
Institute of Software, Chinese Academy of Sciences（中国科学院软件研究所）；University of Chinese Academy of Sciences（中国科学院大学）；University of Technology Sydney（悉尼科技大学）
SAQC: A SAT-Aware Compilation Framework for QAOA-Based Quantum Optimization
DFKI, Bremen, Germany（德国弗劳恩霍夫协会第一智能系统研究所）；Institute of Computer Science, University of Bremen, Bremen, Germany（不来梅大学计算机科学研究所）；University of Bremen, Bremen, Germany（不来梅大学）
qgym: A Gym for Training and Benchmarking RL-Based Quantum Compilation
The Netherlands Organisation for Applied Scientific Research (TNO)（荷兰应用科学研究组织（TNO））；Bernoulli Institute（伯努利研究所）；Faculty of Science and Engineering（科学与工程学院）；University of Groningen（格罗宁根大学）；Quantum & Computer Engineering（量子与计算机工程系）；QuTech（QuTech（量子技术研究所））；Delft University of Technology（代尔夫特理工大学）
Università degli Studi di Padova（帕多瓦大学）；Istituto Nazionale di Fisica Nucleare, Sezione di Padova（意大利国家核物理研究所帕多瓦分部）；Padua Quantum Technologies Research Center（帕多瓦量子技术中心）
QASMTrans: An End-to-End QASM Compilation Framework with Pulse Generation for Near-Term Quantum Devices
University of Washington（华盛顿大学）；Pacific Northwest National Laboratory（太平洋西北国家实验室）；University of California San Diego（加州大学圣地亚哥分校）；Oak Ridge National Laboratory（橡树岭国家实验室）
Compiler Optimization for Quantum Computing Using Reinforcement Learning
Technical University of Munich（慕尼黑工业大学）；Johannes Kepler University Linz（约翰内斯·开普勒大学林茨分校）；Software Competence Center Hagenberg GmbH (SCCH)（哈根伯格软件能力中心有限公司）
Asymptotically Optimal Circuit Depth for Diagonal Unitary Synthesis and Compilation on Two-Dimensional Grids
School of Computer Science and Engineering, Southeast University（东南大学计算机科学与工程学院）；College of Information Engineering, China Jiliang University（中国计量大学信息工程学院）；Key Laboratory of Computer Network and Information Integration (Southeast University), Ministry of Education（教育部计算机网络与信息集成重点实验室（东南大学））；Nanjing Meteorology Bereau（南京市气象局）
A dataflow programming framework for linear optical distributed quantum computing
Quantinuum；University of Oxford, Department of Computer Science（牛津大学计算机系）；Université Paris-Saclay, CNRS, ENS Paris-Saclay, Inria, Laboratoire Méthodes Formelles（巴黎萨克雷大学、法国国家科学研究中心、巴黎萨克雷高等师范学校、Inria、形式方法实验室）；University of Cambridge, Department of Computer Science and Technology（剑桥大学计算机科学与技术系）；Wolfson college（沃尔夫森学院）；Perimeter Institute for Theoretical Physics（理论物理珀蒂默研究所）
Compiling quantum circuits to realistic hardware architectures using temporal planners
NASA Ames Research Center, Quantum Artificial Intelligence Laboratory（美国国家航空航天局阿姆斯研究中心，量子人工智能实验室）；USRA Research Institute for Advanced Computer Science (RIACS)（美国宇航局高级计算机科学研究所（RIACS））；Stinger Ghaffarian Technologies (SGT Inc.)（Stinger Ghaffarian技术（SGT公司））；NASA Ames Research Center, Planning and Scheduling Group（美国国家航空航天局阿姆斯研究中心，计划与调度组）
