The paper introduces QuantumEvo, an evolutionary framework that employs a large language model (LLM) to generate heuristics for ordering variables in binary decision diagrams (BDDs) used in reversible quantum circuit synthesis. By searching over heuristic families and directly manipulating BDD variable orderings, QuantumEvo produces the HGA-QE heuristic, which modifies the sifting step of a genetic algorithm to better align with quantum circuit cost (QCC). Across benchmark sets, HGA-QE achieves a 70.9% tie-or-win rate against the best per-function baseline and strictly outperforms it on 13.5% of functions, demonstrating competitive QCC performance and a clear advantage on benchmarks from different data sources.
By Yoonju Sim, Federico Berto, Chuanbo Hua, Jinkyoo Park, Changhyun Kwon
arXiv:2608.28188v1 Announce Type: new
Abstract: Circuit Representation Learning (CRL) offers a powerful paradigm to guide and optimize core Electronic Design Automation (EDA) tasks, but its practical...
By Jingyi Zhou, Zhengyuan Shi, Jiaying Zhu, Ziyang Zheng, Qiang Xu
arXiv:2503.24111v4 Announce Type: replace-cross
Abstract: Graph Neural Networks (QGNNs) offer a promising approach to combining quantum computing with graph-structured data processing. While classica...
By Arthur M. Faria, Ignacio F. Gra\~na, Savvas Varsamopoulos
arXiv:2512. 09586v2 Announce Type: replace-cross Abstract: Quantum circuit design is a key bottleneck for practical quantum machine learning on complex, real-world data.
By Prashant Kumar Choudhary, Nouhaila Innan, Muhammad Shafique, Rajeev Singh
arXiv:2606. 26873v1 Announce Type: cross Abstract: Graphs provide a natural language for relational data in chemistry, biology and optimisation.
By Snehal Raj, Brian Coyle, L\'eo Monbroussou, Andr\'e J. Ferreira-Martins, Renato M. S. Farias, Elham Kashefi
AlphaClifford is a model‑based reinforcement learning framework that uses Monte Carlo Tree Search to synthesize Clifford circuits from the H, S, and CNOT gate set. By modeling the state space with the algebraic properties of the symplectic group, it consistently reduces total and two‑qubit gate counts compared to existing heuristics. The approach also extends to hardware‑constrained transpilation and serves as a post‑synthesis optimizer in a full Clifford+T pipeline.
By Daniele Lizzio Bosco, Jacopo Cossio, Carla Piazza, Giuseppe Serra
arXiv:2602. 16018v2 Announce Type: replace-cross Abstract: Graph neural networks (GNNs) are a powerful framework for learning representations from graph-structured data, but their direct implementation on near-term quantum hardware remains challenging due to circuit depth, multi-qubit interactions, and qubit scalability constraints.
By Armin Ahmadkhaniha, Jake Doliskani
arXiv:2609.36752v1 Announce Type: new
Abstract: Circuit design is a complex and iterative process that requires expertise in electronic engineering. It involves selecting components while meeting per...
By Pasindu Dodampegama, Praveen Wijesinghe, Naveen Basnayake, Keshawa Jayasundara, Tharindu Bandaragoda
As quantum computing progresses from proof-of-principle demonstrations toward practical utility, a significant impediment is the need to augment algorithmic feasibility with system-level optimization across heterogeneous hardware and software stacks. Quantum resource estimation (QRE) plays a central role in this transition, yet existing approaches remain largely compilation-heavy or domain-knowledge-guided symbolic annotations, and tightly coupled to long-term fault-tolerant assumptions, limiting their topical applicability.
arXiv:2608. 12936v1 Announce Type: cross Abstract: As quantum computing progresses from proof-of-principle demonstrations toward practical utility, a significant impediment is the need to augment algorithmic feasibility with system-level optimization across heterogeneous hardware and software stacks.
By Harshkumar Oza, Aritra Sarkar, Syed Naqi Abbas, Rahul Bhowmick, Aryan Prakash, Prateek P Kulkarni, Krishna Kumar Sabapathy
arXiv:2509. 21886v3 Announce Type: replace Abstract: Learning to compute, the ability to model the functional behavior of a circuit graph, is a fundamental challenge for graph representation learning.
By Ziyang Zheng, Jiaying Zhu, Jingyi Zhou, Qiang Xu
arXiv:2605. 27410v2 Announce Type: replace-cross Abstract: Variational Quantum Algorithms (VQAs) are a leading approach to exploiting near-term quantum hardware, leveraging parameterized quantum circuits and classical optimization to achieve advantage.
By Tung Dao, Son N. Tran, Huynh Thi Thanh Binh