Robert R. Tucci
We present a new algorithm for reducing an arbitrary unitary matrix into a sequence of elementary operations (operations such as controlled-nots and qubit rotations). Such a sequence of operations can be used to manipulate an array of quantum bits (i.e., a quantum computer). We report on a C++ program called "Qubiter" that implements our algorithm. Qubiter source code is publicly available.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We present a new algorithm for reducing an arbitrary unitary matrix U into a sequence of elementary operations (operations such as controlled-nots and qubit rotations). Such a sequence of operations can be used to manipulate an array of quantum bits (i.e., a quantum computer). Our algorithm applies recursively a mathematical technique called the CS Decomposition to build a binary tree of matrices whose product, in some order, equals the original matrix U. We show that the Fast Fourier Transform (FFT) algorithm is a special case of our algorithm. We report on a C++ program called "Qubiter" that…
Performing SU($d$) operations and rudimentary algorithms in a superconducting transmon qudit for $d=3$ and $d=4$
本文在超导 transmon 中实现了最多 4 能级的 qudit，构建并实验验证了 d=3 和 d=4 的 SU(d) 操作、基准测试协议及原型量子算法，为 qudit 量子处理器的操控与应用发展奠定基础。
Over the last decade, Quantum Computing hardware has rapidly developed and become a very intriguing, promising, and active research field among scientists worldwide. To achieve the desired quantum functionalities, quantum algorithms require translation from a high-level description to a machine-specific physical operation sequence. In contrast to classical compilers, state-of-the-art quantum compilers are in their infancy. We believe there is a research need for a quantum compiler that can deal with generic unitary operators and generate basic unitary operations according to quantum machines' …
We present a multi-level quantum-classical intermediate representation (IR) that enables an optimizing, retargetable, ahead-of-time compiler for available quantum programming languages. To demonstrate our architecture, we leverage our proposed IR to enable a compiler for version 3 of the OpenQASM quantum language specification. We support the entire gate-based OpenQASM 3 language and provide custom extensions for common quantum programming patterns and improved syntax. Our work builds upon the Multi-level Intermediate Representation (MLIR) framework and leverages its unique progressive lowerin…
Compiler design for hardware specific decomposition optimizations, tailored to diamond NV centers
针对金刚石NV中心缺乏专用编译器的问题，本文提出集成经典与量子指令、支持直接碳控制等特定操作的编译器，经测试可减少噪声影响、提升执行保真度。
When scheduling quantum operations, a shorter overall execution time of the resulting schedule yields a better throughput and higher fidelity output. In this paper, we demonstrate that quantum operation scheduling can be interpreted as a special type of job-shop problem. On this basis, we provide its formulation as Constraint Programming while taking into account commutation between quantum operations. We show that this formulation improves the overall execution time of the resulting schedules in practice through experiments with a real quantum compiler and quantum circuits from two common ben…
When working with algorithms on quantum devices, quantum memory becomes a crucial bottleneck due to low qubit count in NISQ-era devices. In this context, the concept of `divide and compute', wherein a quantum circuit is broken into several subcircuits and executed separately, while stitching the results of the circuits via classical post-processing, becomes a viable option, especially in NISQ-era devices. This paper introduces \textbf{Qurzon}, a proposed novel quantum compiler that incorporates the marriage of techniques of divide and compute with the state-of-the-art algorithms of optimal qub…
This paper introduces QuanFou v1.1, QuanGlue v1.1, QuanOracle v1.1, QuanShi v1.1, four Java applications available for free. (Source code included in the distribution.) Each application compiles a different kind of input quantum evolution operator. The applications output a quantum circuit that equals the input evolution operator.
The quantum simulation kernel is an important subroutine appearing as a very long gate sequence in many quantum programs. In this paper, we propose Paulihedral, a block-wise compiler framework that can deeply optimize this subroutine by exploiting high-level program structure and optimization opportunities. Paulihedral first employs a new Pauli intermediate representation that can maintain the high-level semantics and constraints in quantum simulation kernels. This naturally enables new large-scale optimizations that are hard to implement at the low gate-level. In particular, we propose two te…
A promising architecture for scaling up quantum computers based on trapped ions are so called Quantum Charged-Coupled Devices (QCCD). These consist of multiple ion traps, each designed for solving specific tasks, that are connected by transport links. In this paper we present the backend compiler phases needed for running quantum circuits on a QCCD architecture, while providing strategies to solve the optimization problems that occur when generating assembly instructions. We implement and test these strategies for the QVLS-Q1 chip architecture.
QTurbo: A Robust and Efficient Compiler for Analog Quantum Simulation
本文提出模拟量子模拟编译器QTurbo，通过生成精确且抗噪声的脉冲调度，显著提升编译效率并优化硬件执行时间，在准确性和可靠性上超越现有最先进方法。
"Qubit routing" refers to the task of modifying quantum circuits so that they satisfy the connectivity constraints of a target quantum computer. This involves inserting SWAP gates into the circuit so that the logical gates only ever occur between adjacent physical qubits. The goal is to minimise the circuit depth added by the SWAP gates. In this paper, we propose a qubit routing procedure that uses a modified version of the deep Q-learning paradigm. The system is able to outperform the qubit routing procedures from two of the most advanced quantum compilers currently available, on both random …
A High Performance Compiler for Very Large Scale Surface Code Computations
首个面向超大规模表面码计算的高性能编译器，基于晶格手术将任意量子电路转换为表面码操作，支持定制布局、量子基准测试和资源估算，可快速处理数百万门，并在数秒内编译8000万条逻辑指令。
We present t$|$ket$\rangle$, a quantum software development platform produced by Cambridge Quantum Computing Ltd. The heart of t$|$ket$\rangle$ is a language-agnostic optimising compiler designed to generate code for a variety of NISQ devices, which has several features designed to minimise the influence of device error. The compiler has been extensively benchmarked and outperforms most competitors in terms of circuit optimisation and qubit routing.
Before executing a quantum algorithm, one must first decompose the algorithm into machine-level instructions compatible with the architecture of the quantum computer, a process known as quantum compiling. There are many different quantum circuit decompositions for the same algorithm but it is desirable to compile leaner circuits. A fundamentally important cost metric is the $T$ count -- the number of $T$ gates in a circuit. For the single qubit case, optimal compiling is essentially a solved problem. However, multi-qubit compiling is a harder problem with optimal algorithms requiring classical…
Parallelizing Program Execution on Distributed Quantum Systems via Compiler/Hardware Co-Design
针对分布式量子系统，本文提出编译器/硬件协同设计方法，通过支持并行指令执行的可配置硬件与智能重排指令的编译器，实现量子算法执行加速，最大平均加速比16.5倍、单基准56.2倍。
Graphical quantum Clifford-encoder compilers from the ZX calculus
本文提出一种基于ZX演算的量子编译算法，将Clifford编码器映射为唯一规范图形表示，并证明其规范性与高效可归约性，为通过图论分析设计新型稳定子量子码提供新途径。
OnePerc: A Randomness-aware Compiler for Photonic Quantum Computing
针对光量子计算中融合操作概率特性导致的随机性挑战，提出一种结合离线与在线优化pass及中间表示的随机性感知编译框架，显著提升了程序执行的可扩展性与效率。
Prevailing proposals for the first generation of quantum computers make use of 2-level systems, or qubits, as the fundamental unit of quantum information. However, recent innovations in quantum error correction and magic state distillation protocols demonstrate that there are advantages of using d-level quantum systems, known as \emph{qudits}, over the qubit analogues. When designing a quantum architecture, it is crucial to consider protocols for compilation, the optimal conversion of high-level instructions used by programmers into low-level instructions interpreted by the machine. In this wo…
A Resource Allocating Compiler for Lattice Surgery
本文提出一种将量子电路编译为格手术操作序列的资源分配编译器，以表面码补丁管理内存并估算时空体积，支持递归扩展至更大规模编译。
Quantum Compiler Design for Qubit Mapping and Routing: A Cross-Architectural Survey of Superconducting, Trapped-Ion, and Neutral Atom Systems
本综述系统分类了超导、离子阱和中性原子平台上的量子比特映射与路由方法，分析硬件感知编译器的优化目标，并总结挑战与未来研究方向。
Chipmunq: A Fault-Tolerant Compiler for Chiplet Quantum Architectures
Chipmunq 是首个面向模块化架构的硬件感知编译器，通过保留逻辑量子比特完整性，显著提升容错电路的编译效率与电路深度，减少门操作数量并降低逻辑错误率。
A quantum computer consists of a set of quantum bits upon which operations called gates are applied to perform computations. In order to perform quantum algorithms, physicists would like to design arbitrary gates to apply to quantum bits. However, the physical limitations of the quantum computing device restrict the set of gates that physicists are able to apply. Thus, they must compose a sequence of gates from the permitted gate set, which approximates the gate they wish to apply - a process called quantum compiling. Austin Fowler proposes a method that finds optimal gate sequences in exponen…
On the Need for Extensible Quantum Compilers with Verification
本文提出应由DOE资助建设开源、可扩展且带验证的量子编译平台，以支持容错层资源优化及跨层协同设计。
Variational optical phase learning on a continuous-variable quantum compiler
针对连续变量（CV）量子编译研究较少的问题，本文提出并实验实现了一种CV量子编译器，利用双模压缩光学习高斯幺正操作，通过目标与控制相位幺正学习参数化线性相位幺正，实现相位估计精度提升5.4倍、求解时间加速3.6倍。
The software package \emph{Qcompiler} (CPC, 184 (2013) 853) provides a general quantum compilation framework, which maps any given unitary operation into a quantum circuit consisting of a sequential set of elementary quantum gates. In this paper, we present an extended software \emph{OptQC}, which finds permutation matrices $P$ and $Q$ for a given unitary matrix $U$ such that the number of gates in the quantum circuit of $U = Q^TP^TU'PQ$ is significantly reduced, where $U'$ is equivalent to $U$ up to a permutation and the quantum circuit implementation of each matrix component is considered se…
We introduce parity quantum optimization with the aim of solving optimization problems consisting of arbitrary $k$-body interactions and side conditions using planar quantum chip architectures. The method introduces a decomposition of the problem graph with arbitrary $k$-body terms using generalized closed cycles of a hypergraph. Side conditions of the optimization problem in form of hard constraints can be included as open cycles containing the terms involved in the side conditions. The generalized parity mapping thus circumvents the need to translate optimization problems to a quadratic unco…
This paper introduces QuanTree v1.1 and QuanLin v1.1, two Java applications available for free. (Source code included in the distribution.) Each application compiles a different type of input quantum evolution operator. The applications output a quantum circuit that is approximately equal to the input evolution operator. QuanTree compiles an input evolution operator whose Hamiltonian is proportional to the incidence matrix of a balanced, binary tree graph. QuanLin compiles an input evolution operator whose Hamiltonian is proportional to the incidence matrix of a line (open string) graph. Both …
Quantum error correction is vital for implementing universal quantum computing. A key component is the encoding circuit that maps a product state of physical qubits into the encoded multipartite entangled logical state. Known methods are typically not 'optimal' either in terms of the circuit depth (and therefore the error burden) or the specifics of the target platform, i.e. the native gates and topology of a system. This work introduces a variational compiler for efficiently finding the encoding circuit of general quantum error correcting codes with given quantum hardware. Focusing on the noi…
Quantum Compiler Design for Fault-Tolerant Quantum Computing
本文综述容错量子计算中量子编译器设计的全栈方法，涵盖逻辑级编译、物理级实现及解码器集成，并指出跨层优化等开放挑战。
Q-DICE: Quantum Distributed Interconnect Compiler and Emulator
提出Q-DICE，一种硬件感知的分布式量子电路仿真环境，通过QPU切片与拼接、非局域链路噪声建模和边界感知电路映射算法，实现分布式量子算法的准确基准测试，实验验证保真度偏差仅4%。
The quantum volume test is a full-system benchmark for quantum computers that is sensitive to qubit number, fidelity, connectivity, and other quantities believed to be important in building useful devices. The test was designed to produce a single-number measure of a quantum computer's general capability, but a complete understanding of its limitations and operational meaning is still missing. We explore the quantum volume test to better understand its design aspects, sensitivity to errors, passing criteria, and what passing implies about a quantum computer. We elucidate some transient behavio…
Coqa: Blazing Fast Compiler Optimizations for QAOA
针对现有量子编译器缺乏QAOA线路专用优化方法的问题，提出Coqa方案，结合LNN拓扑与哈密顿量权重启发式映射减少SWAP门，相较通用编译器实现门数降30%、编译提速39倍。
Kernpiler: Compiler Optimization for Quantum Hamiltonian Simulation with Partial Trotterization
针对现有量子哈密顿量模拟编译技术门数过高难以适配当前量子硬件的问题，提出搭载部分Trotter化及配套优化的Kernpiler编译器，相较现有最优方法最高可将门数与电路深度降低10倍。
It is imperative to compile quantum circuits for Noisy Intermediate-Scale Quantum (NISQ) devices because of the limited connectivity of physical qubits and the high error rates of gate operations. One of the most critical steps in quantum circuit compilation is qubit routing, an NP-Hard problem that involves placing and moving logical qubits to minimize compilation overhead. In this study, we propose ISing mAchine Assisted Quantum compiler (ISAAQ) to perform qubit routing with Ising machines, which can efficiently solve Quadratic Unconstrained Binary Optimization (QUBO) problems. ISAAQ accurat…
QuantEM: The quantum error management compiler
QuantEM 是一个模块化可扩展编译器，通过自动化集成量子错误检测编码到任意量子电路，降低开发者负担并支持快速编码探索与跨架构一致应用。
This paper presents Giallar, a fully-automated verification toolkit for quantum compilers. Giallar requires no manual specifications, invariants, or proofs, and can automatically verify that a compiler pass preserves the semantics of quantum circuits. To deal with unbounded loops in quantum compilers, Giallar abstracts three loop templates, whose loop invariants can be automatically inferred. To efficiently check the equivalence of arbitrary input and output circuits that have complicated matrix semantics representation, Giallar introduces a symbolic representation for quantum circuits and a s…
Optimizing Quantum Compilation via High-Level Quantum Instructions
针对底层电路中心量子编程限制编译器优化的问题，本研究提出利用含量子专用指令的高级编程结构，实现近似门替换、辅助量子位正确反计算等优化，使多控NOT门V链分解的CNOT门最多减少50%，为高效量子计算铺路。
The dynamics of a quantum system can be simulated using a quantum computer by breaking down the unitary into a quantum circuit of one and two qubit gates. The most established methods are the Trotter-Suzuki decompositions, for which rigorous bounds on the circuit size depend on the number of terms $L$ in the system Hamiltonian and the size of the largest term in the Hamiltonian $Λ$. Consequently, Trotter-Suzuki is only practical for sparse Hamiltonians. Trotter-Suzuki is a deterministic compiler but it was recently shown that randomised compiling offers lower overheads. Here we present and ana…
The MQT Compiler Collection: A Blueprint for a Future-Proof Quantum-Classical Compilation Framework
本文提出MQT编译器集合，基于MLIR构建量子-经典编译框架，支持复杂优化，解决传统量子优先方法的不足。
TrapSIMD: SIMD-Aware Compiler Optimization for 2D Trapped-Ion Quantum Machines
本文提出SIMD感知编译器框架FluxTrap，通过统一SIMD指令与架构图抽象协调离子传输与门执行，在NISQ基准下显著提升执行速度与保真度，并支持容错工作负载扩展。
We present an approach for a deep-learning compiler of quantum circuits, designed to reduce the output noise of circuits run on a specific device. We train a convolutional neural network on experimental data from a quantum device to learn a hardware-specific noise model. A compiler then uses the trained network as a noise predictor and inserts sequences of gates in circuits so as to minimize expected noise. We tested this approach on the IBM 5-qubit devices and observed a reduction in output noise of 12.3% (95% CI [11.5%, 13.0%]) compared to the circuits obtained by the Qiskit compiler. Moreov…
Simulation of the dynamics of quantum materials is emerging as a promising scientific application for noisy intermediate-scale quantum (NISQ) computers. Due to their high gate-error rates and short decoherence times, however, NISQ computers can only produce high-fidelity results for those quantum circuits smaller than some given circuit size. Dynamic simulations, therefore, pose a challenge as current algorithms produce circuits that grow in size with each subsequent time-step of the simulation. This underscores the crucial role of quantum circuit compilers to produce executable quantum circui…
Quilc is an open-source, optimizing compiler for gate-based quantum programs written in Quil or QASM, two popular quantum programming languages. The compiler was designed with attention toward NISQ-era quantum computers, specifically recognizing that each quantum gate has a non-negligible and often irrecoverable cost toward a program's successful execution. Quilc's primary goal is to make authoring quantum software a simpler exercise by making architectural details less burdensome to the author. Using Quilc allows one to write programs faster while usually not compromising---and indeed sometim…
Observing the Quantum Compiler through Automatic Experiment Tracking for Qiskit
本研究提出受MLflow启发的Qiskit自动日志记录框架，扩展QProv模型并结合MLflow Tracking Server，提升量子编译器可观测性，支持其工作流的可复现评估。
Near-Optimal Fidelity in Quantum Circuits through Incorporating Efficient Real-time Error Based Heuristics in Compiler Mappings
本文研究量子电路编译中的NP完全量子比特映射问题，提出结合实时错误反馈与设备连接信息的启发式方法CAES，在随机基准上相比基线平均提升1.62倍和1.934倍，成功率比最先进方法平均提升1.7倍。
Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation
提出多乘积交换关系（MCR）作为新的无辅助量子电路变换规则，并实现MCR编译器，在基准测试中进一步减少T门数量。
Investigating Retargetability Claims for Quantum Compilers
本文评估了量子编译器的可重定向性，发现Tket的可重定向性最高，Qiskit次之，ProjectQ相对较差。
Efficient compilation of quantum algorithms is vital in the era of Noisy Intermediate-Scale Quantum (NISQ) devices. While multiple open-source quantum compilation and circuit optimization frameworks are available, e.g. IBM Qiskit, CQC Tket, Google Cirq, Rigetti Quilc, PyZX, their relative performance is not always clear to a quantum programmer. The growth of complexity and diversity of quantum circuit compilation algorithms creates a demand for a dedicated tool for cross-benchmarking and profiling of inner workflow of the quantum compilation stack. We present an open-source software package, A…
Time-dependent Hamiltonian simulation (TDHS) is a critical task in quantum computing. Existing algorithms are generally biased with a small algorithmic error $\varepsilon$, and the gate complexity scales as $O(\text{poly}(1/\varepsilon))$ for product formula-based methods and could be improved to be polylogarithmic with complicated circuit constructions. Here, we develop an unbiased random compiler for TDHS by combining Dyson expansion, an unbiased continuous sampling method for quantum evolution, and leading order rotations, and it is free from algorithmic errors. Our method has the single- a…
ASDF: A Compiler for Qwerty, a Basis-Oriented Quantum Programming Language
本文介绍ASDF，一个基于MLIR的Qwerty语言编译器，通过高级量子IR从基底转换综合电路，生成OpenQASM 3或QIR，其容错资源成本与现有电路级编译器相当。
Multilevel Circuit Optimization in Quantum Compilers: A Case Study
本研究提出量子编译器中的多级电路优化方法，通过逐级门集合降阶、简化与分解，以哈密顿量模拟电路为案例实现了CX门数量的二次方级减少，提供了电路优化的新思路。
A compiler for universal photonic quantum computers
本文提出一种将QASM电路转换为测量图（m-graph）并利用ZX-Calculus优化的编译器流水线，可直接映射到光学单向量子计算机硬件指令，并在实验光子平台上验证。研究解决了光子通用量子计算中电路到硬件执行的转换问题，主要贡献是建立了从电路到测量图的自动编译与优化框架。
Compilation strategies for quantum network programs using Qoala
本文提出基于 Qoala 扩展的量子网络程序编译策略，通过影响节点上量子程序的调度与执行，仿真显示可将执行时间最多降低 29.53%、成功概率最多提高 25.12%。
Hardware-aware Compilation for Chip-to-Chip Coupler-Connected Modular Quantum Systems
针对芯片间耦合器连接的模块化量子系统，本文提出 CCMap 协同设计框架，利用校准数据和噪声感知成本进行电路划分与全局映射，显著提升保真度并降低编译成本。
Retromorphic Testing of Quantum Compiler Passes
该研究针对量子编译器 passes 提出了基于 Retromorphic 测试和 Hadamard 测试原理的自动化验证方法，在 RetroQ 框架中实现后，成功重现并发现了量子编译器 passes 的多个缺陷，凸显了专用测试方法对提升量子软件栈可靠性的重要性。
Quantum computing promises remarkable approaches for processing information, but new tools are needed to compile program representations into the physical instructions required by a quantum computer. Here we present a novel adaptation of the multi-level intermediate representation (MLIR) integrated into a quantum compiler that may be used for checking program execution. We first present how MLIR enables quantum circuit transformations for efficient execution on quantum computing devices and then give an example of compiler transformations based on so-called mirror circuits. We demonstrate that…
A quantum compiler is a software program for decomposing ("compiling") an arbitrary unitary matrix into a sequence of elementary operations (SEO). The author of this paper is also the author of a quantum compiler called Qubiter. Qubiter uses a matrix decomposition called the Cosine-Sine Decomposition (CSD) that is well known in the field of Computational Linear Algebra. One way of measuring the efficiency of a quantum compiler is to measure the number of CNOTs it uses to express an unstructured unitary matrix (a unitary matrix with no special symmetries). We will henceforth refer to this numbe…
We present CertiQ, a verification framework for writing and verifying compiler passes of Qiskit, the most widely-used quantum compiler. To our knowledge, CertiQ is the first effort enabling the verification of real-world quantum compiler passes in a mostly-automated manner. Compiler passes written in the CertiQ interface with annotations can be used to generate verification conditions, as well as the executable code that can be integrated into Qiskit. CertiQ introduces the quantum circuit calculus to enable the efficient checking of equivalence of quantum circuits by encoding such a checking p…
QuTuner: Feature- and Learning-Guided Optimization Pass Tuning for Quantum Compilers
研究针对量子编译器优化阶段调整问题，提出QuTuner框架。通过构建数据集，从静态特征和优化感知嵌入两方面刻画电路，训练模型检索和排序候选阶段序列，经轻量级细化，有效提升了优化效果。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。