Quantum computing is finding promising applications in optimization, machine learning and physics, leading to the development of various models for representing quantum information. Because these representations are often studied in different contexts (many-body physics, machine learning, formal verification, simulation), little is known about fundamental trade-offs between their succinctness and the runtime of operations to update them. We therefore analytically investigate three widely-used quantum state representations: matrix product states (MPS), decision diagrams (DDs), and restricted Boltzmann machines (RBMs). We map the relative succinctness of these data structures and provide the complexity for relevant query and manipulation operations. Further, to chart the balance between succinctness and operation efficiency, we extend the concept of rapidity with support for the non-canonical data structures studied in this work, showing in particular that MPS is at least as rapid as some DDs.
By providing a knowledge compilation map for quantum state representations, this paper contributes to the understanding of the inherent time and space efficiency trade-offs in this area.
Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations
Carnegie Mellon University（卡内基梅隆大学）；Oak Ridge National Laboratory（橡树岭国家实验室）；Georgia Tech Research Institute（佐治亚理工学院研究院）；Massachusetts Institute of Technology（麻省理工学院）
MERA: A Mid-Circuit-Measurement Error-Aware Compilation Framework for Quantum Circuits
The Chinese University of Hong Kong（香港中文大学）；The Hong Kong University of Science and Technology (Guangzhou)（香港科技大学（广州））；University of Central Florida（中佛罗里达大学）；State Key Laboratory of Quantum Information Technologies and Materials (CUHK)（量子信息技术与材料国家重点实验室）
Risk-aware neural pulse compilation of continuously parameterized single-qubit gates with optimal-control benchmarking and NMR hardware validation
Koç University（科奇大学）；TÜBİTAK Research Institute for Fundamental Sciences (TBAE)（土耳其科学技术研究委员会基础科学研究院（TBAE））；Middle East Technical University（中东理工大学）；Shenzhen SpinQ Technology Co., Ltd.（深圳本源量子技术有限公司）
Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation
Graduate School of Information Science and Technology, The University of Tokyo（东京大学大学院信息理工学系研究科）；Center for Quantum Computing, RIKEN（理化学研究所量子计算中心）；Faculty of Information Science and Electrical Engineering, Kyushu University（九州大学情报理工学府）；International Center for Elementary Particle Physics, The University of Tokyo（东京大学国际基本粒子物理中心）
MQSS-Selector: RL-Guided Pass Selection for an MLIR Compilation Pipeline
Leibniz Supercomputing Centre (LRZ)（莱布尼茨超级计算中心）；Technical University of Munich (TUM)（慕尼黑工业大学）；Munich Quantum Valley (MQV)（慕尼黑量子谷）；Argonne National Laboratory (ANL)（阿贡国家实验室）
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（美国国家航空航天局阿姆斯研究中心，计划与调度组）
