Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > quant-ph > arXiv:2509.20663

Help | Advanced Search

Quantum Physics

arXiv:2509.20663 (quant-ph)
[Submitted on 25 Sep 2025 ]

Title: A Review on Quantum Circuit Optimization using ZX-Calculus

Title: 基于ZX-演算的量子电路优化综述

Authors:Tobias Fischbach, Pierre Talbot, Pascal Bourvry
Abstract: Quantum computing promises significant speed-ups for certain algorithms but the practical use of current noisy intermediate-scale quantum (NISQ) era computers remains limited by resources constraints (e.g., noise, qubits, gates, and circuit depth). Quantum circuit optimization is a key mitigation strategy. In this context, ZX-calculus has emerged as an alternative framework that allows for semantics-preserving quantum circuit optimization. We review ZX-based optimization of quantum circuits, categorizing them by optimization techniques, target metrics and intended quantum computing architecture. In addition, we outline critical challenges and future research directions, such as multi-objective optimization, scalable algorithms, and enhanced circuit extraction methods. This survey is valuable for researchers in both combinatorial optimization and quantum computing. For researchers in combinatorial optimization, we provide the background to understand a new challenging combinatorial problem: ZX-based quantum circuit optimization. For researchers in quantum computing, we classify and explain existing circuit optimization techniques.
Abstract: 量子计算对于某些算法有望实现显著的速度提升,但当前噪声中等规模量子(NISQ)时代计算机的实际应用仍受限于资源约束(例如,噪声、量子位、门和电路深度)。量子电路优化是一种关键的缓解策略。在此背景下,ZX演算作为一种替代框架出现,允许进行语义保持的量子电路优化。我们回顾了基于ZX的量子电路优化,根据优化技术、目标指标和预期的量子计算架构对其进行分类。此外,我们概述了关键挑战和未来研究方向,如多目标优化、可扩展算法和增强的电路提取方法。这项综述对组合优化和量子计算领域的研究人员都有价值。对于组合优化领域的研究人员,我们提供了理解一个新的具有挑战性的组合问题:基于ZX的量子电路优化的背景。对于量子计算领域的研究人员,我们对现有的电路优化技术进行了分类和解释。
Subjects: Quantum Physics (quant-ph) ; Emerging Technologies (cs.ET)
Cite as: arXiv:2509.20663 [quant-ph]
  (or arXiv:2509.20663v1 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2509.20663
arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Tobias Michael Fischbach [view email]
[v1] Thu, 25 Sep 2025 01:48:07 UTC (47 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2025-09
Change to browse by:
cs
cs.ET

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号