首页/论文/2404.03280

arXiv 2404.032802024-04-04quant-phcs.DM

更快且更短的 Hamiltonian 模拟电路综合

Faster and shorter synthesis of Hamiltonian simulation circuits

Timothée Goubault de Brugière, Simon Martiel

备注：: 23 pages including figures and bibliography

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

摘要英文摘要相关论文

AI总结：

针对 Pauli 旋转量子电路综合，本文提出可优化纠缠门数量或深度、并可调节旋转顺序约束的贪心启发式方法，在 Hamiltonian 模拟基准上实现最高 4 倍深度压缩，还可优化通用电路。

摘要：

我们设计了专门用于综合实现一组指定 Pauli 旋转的量子电路的贪心启发式方法。这些启发式方法旨在最小化纠缠门数量或纠缠门深度，并且可以调整为保持或放宽旋转顺序。我们给出的基准测试结果表明，与当前用于综合 Hamiltonian 模拟电路的最先进启发式方法相比，深度最多可降低至原来的四分之一。我们还表明，这些启发式方法可通过分解和重新综合来优化通用量子电路。

英文摘要：

We devise greedy heuristics tailored for synthesizing quantum circuits that implement a specified set of Pauli rotations. Our heuristics are designed to minimize either the count of entangling gates or the depth of entangling gates, and they can be adjusted to either maintain or loosen the ordering of rotations. We present benchmark results demonstrating a depth reduction of up to a factor of 4 compared to the current state-of-the-art heuristics for synthesizing Hamiltonian simulation circuits. We also show that these heuristics can be used to optimize generic quantum circuits by decomposing and resynthesizing them.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

摘要英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Shorter gate sequences for quantum computing by mixing unitaries

Fault-tolerant quantum computers compose elements of a discrete gate set in order to approximate a target unitary. The problem of minimising the number of gates is known as gate-synthesis. The approximation error is a form of coherent noise, which can be significantly more damaging than comparable incoherent noise. We show how mixing over different gate sequences can convert this coherent noise into an incoherent form. As measured by diamond distance, the post-mixing noise is quadratically smaller than before mixing, with no additional resource cost. Equivalently, we can use a shorter gate seq…

2017-04-05quant-ph

QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space

We present QFAST, a quantum synthesis tool designed to produce short circuits and to scale well in practice. Our contributions are: 1) a novel representation of circuits able to encode placement and topology; 2) a hierarchical approach with an iterative refinement formulation that combines "coarse-grained" fast optimization during circuit structure search with a good, but slower, optimization stage only in the final circuit instantiation stage. When compared against state-of-the-art techniques, although not optimal, QFAST can generate much shorter circuits for "time dependent evolution" algori…

2020-03-26quant-ph

Faster Quantum Number Factoring via Circuit Synthesis

A major obstacle to implementing Shor's quantum number-factoring algorithm is the large size of modular-exponentiation circuits. We reduce this bottleneck by customizing reversible circuits for modular multiplication to individual runs of Shor's algorithm. Our circuit-synthesis procedure exploits spectral properties of multiplication operators and constructs optimized circuits from the traces of the execution of an appropriate GCD algorithm. Empirically, gate counts are reduced by 4-5 times, and circuit latency is reduced by larger factors.

2013-01-15cs.DScs.ETquant-ph

QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis

The current phase of quantum computing is in the Noisy Intermediate-Scale Quantum (NISQ) era. On NISQ devices, two-qubit gates such as CNOTs are much noisier than single-qubit gates, so it is essential to minimize their count. Quantum circuit synthesis is a process of decomposing an arbitrary unitary into a sequence of quantum gates, and can be used as an optimization tool to produce shorter circuits to improve overall circuit fidelity. However, the time-to-solution of synthesis grows exponentially with the number of qubits. As a result, synthesis is intractable for circuits on a large qubit s…

2022-03-23quant-ph

Techniques for the Synthesis of Reversible Toffoli Networks

This paper presents novel techniques for the synthesis of reversible networks of Toffoli gates, as well as improvements to previous methods. Gate count and technology oriented cost metrics are used. Our synthesis techniques are independent of the cost metrics. Two new iterative synthesis procedure employing Reed-Muller spectra are introduced and shown to complement earlier synthesis approaches. The template simplification suggested in earlier work is enhanced through introduction of a faster and more efficient template application algorithm, updated (shorter) classification of the templates, a…

2006-07-24quant-ph

QFAST: Conflating Search and Numerical Optimization for Scalable Quantum Circuit Synthesis

We present a quantum synthesis algorithm designed to produce short circuits and to scale well in practice. The main contribution is a novel representation of circuits able to encode placement and topology using generic "gates", which allows the QFAST algorithm to replace expensive searches over circuit structures with few steps of numerical optimization. When compared against optimal depth, search based state-of-the-art techniques, QFAST produces comparable results: 1.19x longer circuits up to four qubits, with an increase in compilation speed of 3.6x. In addition, QFAST scales up to seven qub…

2021-03-12quant-ph

更多相关论文收起更多论文

Efficient Synthesis of Linear Reversible Circuits

In this paper we consider circuit synthesis for n-wire linear reversible circuits using the C-NOT gate library. These circuits are an important class of reversible circuits with applications to quantum computation. Previous algorithms, based on Gaussian elimination and LU-decomposition, yield circuits with O(n^2) gates in the worst-case. However, an information theoretic bound suggests that it may be possible to reduce this to as few as O(n^2/log n) gates. We present an algorithm that is optimal up to a multiplicative constant, as well as Theta(log n) times faster than previous methods. While …

2003-02-03quant-ph

用于量子电路合成的囚禁离子多模式全局驱动

Multi-Mode Global Driving of Trapped Ions for Quantum Circuit Synthesis

研究提出多模式全局驱动结合单量子比特旋转的方法，为囚禁离子生成通用Ising型相互作用和n体相互作用，使量子电路合成运行时间显著缩短，并在编码Quantum Fourier Transform时实现二次方级的效率提升。

2025-06-04physics.atom-phquant-ph

适用于多量子比特门合成的SU(N)上的迭代线性二次调节器

Iterative linear quadratic regulator on SU(N) for multi-qubit gate synthesis

University of Bremen（不来梅大学）；Bremen University of Applied Science（不来梅应用科学大学）；German Research Center for Artificial Intelligence (DFKI)（德国人工智能研究中心）；Chalmers University of Technology（查尔姆斯理工大学）

本研究将迭代线性二次调节器（iLQR）的李群公式适配到SU(N)并应用于多量子比特门合成，经对比验证其在不同场景下的收敛性能优势与特性。

2026-08-05quant-ph

利用对称性诱导的块稀疏性加速矩阵乘积态制备

Faster matrix product state preparation by exploiting symmetry-induced block-sparsity

提出通过行和列置换将块稀疏矩阵转化为块对角形式，结合改进的酉合成方法，实现块稀疏矩阵乘积态的容错制备，数值基准显示Toffoli成本降低10-30倍。

2026-05-27quant-ph

超越强化学习：快速且可扩展的量子电路合成

Beyond Reinforcement Learning: Fast and Scalable Quantum Circuit Synthesis

University of Bonn（波恩大学）

本文提出一种基于监督学习和随机束搜索的量子电路合成方法，通过近似最小描述长度实现快速且高效的量子门序列生成，提升了复杂电路的成功率和合成效率。

2026-02-18cs.LGquant-ph

Optimal Control-Based Efficient Synthesis of Building Blocks of Quantum Algorithms Seen in Perspective from Network Complexity towards Time Complexity

In this paper, we demonstrate that optimal control algorithms can be used to speed up the implementation of modules of quantum algorithms or quantum simulations in networks of coupled qubits. The gain is most prominent in realistic cases, where the qubits are not all mutually coupled. Thus the shortest times obtained depend on the coupling topology as well as on the characteristicratio of the time scales for local controls {\em vs} non-local ({\em i.e.} coupling) evolutions in the specific experimental setting. Relating these minimal times to the number of qubits gives the tightest known upper…

2005-02-16quant-ph

使用 SAT 求解器对 Clifford 电路进行深度最优综合

Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers

本文利用纠缠输入与稳定子形式体系将 Clifford 综合归约为多项式规模 SAT 问题，证明其属于 NP，并提出深度最优编码，借助 SAT 求解器显著降低随机 Clifford 与 Grover 的 Clifford+T 电路深度。

2023-06-02cs.ETquant-ph

基于强化学习的 Pauli 网络电路综合

Pauli Network Circuit Synthesis with Reinforcement Learning

IBM Quantum, IBM T.J. Watson Research Center（IBM量子、IBM T.J.沃森研究中心）；University of Wisconsin-Madison（威斯康星大学麦迪逊分校）；IBM Quantum, IBM France Lab（IBM量子、IBM法国实验室）

提出基于强化学习的 Pauli 网络量子电路重新综合方法，通过紧凑子块表示与学习启发式逐步综合，在 Benchpress 等测试中显著减少双量子比特门数量和电路深度。

2025-03-18cs.AIquant-ph

利用强化学习实现实用且高效的量子电路综合与转译

Practical and efficient quantum circuit synthesis and transpiling with Reinforcement Learning

IBM Quantum（IBM量子计算部门）；IBM T.J. Watson Research Center（IBM T.J.沃森研究中心）

本文提出将强化学习集成到量子电路转译中，实现近最优综合与高效路由，显著提升性能并兼容实际设备约束。

2025-02-26cs.AIquant-ph

LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach

While showing great promise, circuit synthesis techniques that combine numerical optimization with search over circuit structures face scalability challenges due to a large number of parameters, exponential search spaces, and complex objective functions. The LEAP algorithm improves scaling across these dimensions using iterative circuit synthesis, incremental re-optimization, dimensionality reduction, and improved numerical optimization. LEAP draws on the design of the optimal synthesis algorithm QSearch by extending it with an incremental approach to determine constant prefix solutions for a …

2021-12-17cs.ETquant-ph