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:2407.00736

Help | Advanced Search

Quantum Physics

arXiv:2407.00736 (quant-ph)
[Submitted on 30 Jun 2024 (v1) , last revised 14 Oct 2025 (this version, v2)]

Title: Quantum Circuit Synthesis and Compilation Optimization: Overview and Prospects

Title: 量子电路综合与编译优化:概述与前景

Authors:Ge Yan, Wenjie Wu, Yuheng Chen, Kaisen Pan, Xudong Lu, Zixiang Zhou, Yuhan Wang, Ruocheng Wang, Junchi Yan
Abstract: Quantum computing is a promising paradigm that may overcome the current computational power bottlenecks. The increasing maturity of quantum processors provides more possibilities for the development and implementation of quantum algorithms. As the crucial stages for quantum algorithm implementation, the logic circuit design and quantum compiling have also received significant attention, which covers key technologies, e.g., quantum logic circuit synthesis (also widely known as quantum architecture search) and optimization, as well as qubit mapping and routing. Recent studies suggest that the scale and precision of related algorithms are steadily increasing, especially with the integration of artificial intelligence methods. In this survey, we systematically review and summarize a vast body of literature, exploring the feasibility of an integrated design and optimization scheme that spans from the algorithmic level to quantum hardware, combining the steps of logic circuit design and compilation optimization. Leveraging the exceptional cognitive and learning capabilities of AI algorithms, it becomes more possible to reduce manual design costs, enhance the precision and efficiency of execution, and facilitate the implementation and validation of the superiority of quantum algorithms on hardware.
Abstract: 量子计算是一种有前途的范式,可能克服当前计算能力的瓶颈。 量子处理器的日益成熟为量子算法的发展和实现提供了更多可能性。 作为量子算法实现的关键阶段,逻辑电路设计和量子编译也受到了广泛关注,涵盖了关键技术,例如量子逻辑电路综合(也广为人知的量子架构搜索)和优化,以及量子比特映射和路由。 最近的研究表明,相关算法的规模和精度正在稳步增加,特别是人工智能方法的整合。 在本综述中,我们系统地回顾和总结了大量文献,探讨了从算法层面到量子硬件的集成设计和优化方案的可行性,结合了逻辑电路设计和编译优化的步骤。 利用人工智能算法卓越的认知和学习能力,更有可能降低人工设计成本,提高执行的精度和效率,并促进量子算法在硬件上优势的实现和验证。
Subjects: Quantum Physics (quant-ph) ; Emerging Technologies (cs.ET); Machine Learning (cs.LG)
Cite as: arXiv:2407.00736 [quant-ph]
  (or arXiv:2407.00736v2 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2407.00736
arXiv-issued DOI via DataCite

Submission history

From: Ge Yan [view email]
[v1] Sun, 30 Jun 2024 15:50:10 UTC (1,507 KB)
[v2] Tue, 14 Oct 2025 02:11:59 UTC (940 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2024-07
Change to browse by:
cs
cs.ET
cs.LG

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号