Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.08073

Bottom-Up Design of Quantum Optical Experiments Using Discrete Generative Models

Isaac L. Huidobro-Meezs, Simón Paiva-Ortega, Rodrigo A. Vargas-Hernández

quant-phSubmitted Sep 8, 2026• Announced Sep 9, 2026• 0 citations
arXivHTMLPDF

Abstract

Designing quantum optical experiments requires searching over discrete circuit topologies and continuous parameters, often with multiple realizations of the same target state. Graph-based methods commonly address this problem by optimizing a dense graph and pruning it toward a single circuit. We introduce \texttt{Grinch}, a bottom-up reward-driven generative framework that learns to sample optical graphs directly from fidelity-based rewards without relying on a pre-existing training dataset. We demonstrate the framework on multipartite entangled states, graph and cluster states, and nonlocal photonic-gate targets, obtaining multiple high-fidelity optical graphs. We identify asymptotic solutions for states that cannot be generated exactly by graphs, as well as nonlocal Toffoli gate constructions requiring two ancillas. Our work presents hardware-constraint objectives, which lead to alternative constructions of CNOT and Toffoli gates when connections between ancilla nodes are restricted. These findings illustrate a reward-driven approach to quantum optical inverse design, exploring alternative circuit topologies while directly incorporating connectivity constraints into the search process.

Comments
18 pages, 8 figures, 4 tables

Related papers

Hybrid reward-driven reinforcement learning for efficient quantum circuit synthesis

Sara Giordano, Kornikar Sen, Miguel Angel Martin-Delgado

A reinforcement learning (RL) framework is introduced for the efficient synthesis of quantum circuits that generate specified target quantum states from a fixed initial state, addressing a central challenge in both the Noisy Intermediate-Scale Quantum (NISQ) era and future fault-tolerant quantum computing. The approach utilizes tabular Q-learning, based on action sequences, within a discretized quantum state space, to effectively manage the exponential growth of the space dimension. The framework introduces a hybrid reward mechanism, combining a static, domain-informed reward that guides the agent toward the target state with customizable dynamic penalties that discourage inefficient circuit structures such as gate congestion and redundant state revisits. This is a circuit-aware reward, in contrast to the current trend of works on this topic, which are primarily fidelity-based. By leveraging sparse matrix representations and state-space discretization, the method enables practical navigation of high-dimensional environments while minimizing computational overhead. Benchmarking on graph-state preparation tasks for up to seven qubits, we demonstrate that the algorithm consistently discovers minimal-depth circuits with optimized gate counts. Moreover, extending the framework to a universal gate set still yields low depth circuits, highlighting the algorithm’s robustness and adaptability. The results confirm that this RL-driven approach, with our completely circuit-aware method, efficiently explores the complex quantum state space and synthesizes near-optimal quantum circuits, providing a resource-efficient foundation for quantum circuit optimization.

arXiv:2507.16641•Quantum Machine Intelligence•Feb 3, 2026•4 citations

A Graph-Based Deep Reinforcement Learning Framework for Quantum Circuit Mapping with Look-Ahead Rewards and Biased Exploration

Yueran Zhao, Kaiqi Li, Ziying Guo +1 more

Current quantum computing hardware imposes strict constraints on two-qubit gate operations, limiting their application to specific qubit pairs. This leads to a structural mismatch between quantum circuits and hardware limitations. Quantum circuit mapping addresses this issue by inserting SWAP gates to enable logical circuit equivalence. In the Noisy Intermediate-Scale Quantum (NISQ) era, minimizing the number of additional gates is crucial to reduce circuit error rates. We propose LARBE (Look-Ahead Rewards and Biased Exploration), a deep reinforcement learning framework utilizing graph neural networks to encode quantum circuits. The look-ahead reward mechanism enables intelligent trade-offs between immediate and future mapping benefits, while the biased exploration incorporates heuristic rules to accelerate training convergence. Benchmarking against the SABRE algorithm demonstrates performance improvements ranging from 5.83% to 17.57% on several common hardware topologies.

•Oct 26, 2025•0 citations

Algorithmic Design of Heralded Linear Optical Circuits for Multipartite Entanglement

Jaehee Kim, Hon Wai Lau, William J. Munro +2 more

Heralded multipartite entanglement is a key resource for various quantum information tasks. However, designing linear optical circuits that generate specific target states is generally challenging due to the complexity of the required optical structures. Here we formulate the design of heralded photonic circuits as an algorithmic graph-search problem. Our framework enables the automated construction and optimization of heralded photonic circuits by substantially reducing the search space using the linear quantum graph (LQG) picture. Our strategy reconstructs circuit structures as graphs in the picture and identifies suitable graphs automatically. As a result, we design efficient schemes for a broad range of useful multipartite resource states, including hypergraph magic states, quantum error correcting codes, general three-qubit states and length-1 caterpillar graph states. Our work establishes an algorithmic framework for the systematic discovery of heralded resource states, laying the foundation for the automated design of increasingly complex multipartite entangled resources.

quant-pharXiv:2609.18002•Sep 17, 2026•0 citations

Algorithmic Graph-Search Design of Heralded Linear Optical Circuits for Multipartite Entanglement: A Reconciled Quantitative Assessment

Rowan Brad Quni-Gudzinas

Heralded multipartite photonic entanglement underpins quantum communication, distributed sensing, and fault-tolerant computation, yet the manual synthesis of linear-optical circuits that generate a prescribed target state remains a combinatorial bottleneck. A recent preprint [1,2] recasts this design task as an algorithmic graph-search problem in the linear quantum graph (LQG) picture, reporting automated discovery of heralded circuits for hypergraph magic states, quantum error-correcting code states, general three-qubit states, and length-1 caterpillar graph states. This paper provides a single reconciled synthesis and quantitative appraisal. We formalize the search-space reduction claimed by the LQG representation with explicit combinatorial counts: for a representative six-mode, three-beam-splitter budget, raw circuit enumeration (3,375 ordered-slot instances) reduces to 455 graph instances, a factor of ≈7.4 (up to ≈44.5 under a reordering-inclusive convention), growing to ≈151 at ten modes and five beam splitters. We derive heralding probabilities for canonical fusion-based constructions: a three-qubit GHZ state via type-II fusion succeeds with probability p²/2 per trial (5×10⁻³ at source probability p = 0.1), and a four-qubit caterpillar projection spans [3.2×10⁻⁷, 7.5×10⁻³] across plausible hardware ranges — showing that hardware parameters, not circuit topology, dominate success probability. We further derive multiplexing arithmetic (a p = 0.01 circuit needs ≈458 attempts for 99% cumulative success; 64-fold multiplexing converts this to 8 rounds of 64 executions (512 total, ≈12% more than the unmultiplexed 458) and loss-limited fidelity bounds F ≈ η^{2q}. We identify falsification criteria and the decisive open problems: graph-isomorphism overhead, ancilla-mode blowup, loss-aware search objectives, and scalability beyond the demonstrated q ≤ 4 target classes. ## 1. Introduction Photons are attractive carriers of quantum information: they decohere negligibly Full text and updates: papers.qnfo.org/papers/algorithmic-graph-search-design-of-heralded-linear-optical-circuits-for-multipar/

•Oct 3, 2026•0 citations

Generative graph neural networks for inverse design of cQED circuits

Valerio Brugnami

Superconducting quantum circuits are among the most promising platforms for quantum computing, but their design remains a complex inverse problem, requiring the identification of circuit architectures and physical parameters capable of reproducing a desired quantum response. Existing approaches mainly rely on iterative optimization, predefined topologies, or previously simulated device families, limiting their flexibility as circuit complexity increases. This thesis presents a generative framework for the inverse design of superconducting quantum circuits. The proposed approach combines a Graph Variational Autoencoder with Transformer-based generative architectures, including GPT-like autoregressive and BERT-like bidirectional mechanisms, to learn a shared latent representation between circuit graphs and their effective Hamiltonians. Starting from a target Hamiltonian, the framework generates both the circuit topology and its continuous physical parameters, while physics-based constraints and latent-space optimization are used to improve the quality of the generated solutions. The results show accurate reconstruction of known circuit families, a high fraction of physically valid generated circuits, and encouraging generalization to previously unseen topologies. These results indicate the potential of modern generative AI techniques for the automated inverse design of superconducting quantum circuits. i

•Oct 29, 2026•0 citations

TopGen: Topology-Aware Bottom-Up Generator for Variational Quantum Circuits

Jinglei Cheng, Hanrui Wang, Zhiding Liang +3 more

Variational Quantum Algorithms (VQA) are promising to demonstrate quantum advantages on near-term devices. Designing ansatz, a variational circuit with parameterized gates, is of paramount importance for VQA as it lays the foundation for parameter optimizations. Due to the large noise on Noisy-Intermediate Scale Quantum (NISQ) machines, considering circuit size and real device noise in the ansatz design process is necessary. Unfortunately, recent works on ansatz design either consider no noise impact or only treat the real device as a black box with no specific noise information. In this work, we propose to open the black box by designing specific ansatz tailored for the qubit topology on target machines. Specifically, we propose a bottom-up approach to generate topology-specific ansatz. Firstly, we generate topology-compatible sub-circuits with desirable properties such as high expressibility and entangling capability. Then, the sub-circuits are combined together to form an initial ansatz. We further propose circuits stitching to solve the sparse connectivity issue between sub-circuits, and dynamic circuit growing to improve the accuracy. The ansatz constructed with this method is highly flexible and thus we can explore a much larger design space than previous state-of-the-art method in which all ansatz candidates are strict subsets of a pre-defined large ansatz. We use a popular VQA algorithm - Quantum Neural Networks (QNN) for Machine Learning (ML) task as the benchmarks. Experiments on 14 ML tasks show that under the same performance, the TopGen-searched ansatz can reduce the circuit depth and the number of CNOT gates by up to 2 * and 4 * respectively. Experiments on three real quantum machines demonstrate on average 17% accuracy improvements over baselines.

arXiv:2210.08190•Oct 15, 2022•23 citations
Designing quantum optical experiments requires searching over discrete circuit topologies and continuous parameters, often with multiple realizations of the same target state. Graph-based methods commonly address this problem by optimizing a dense graph and pruning it toward a single circuit. We introduce \texttt{Grinch}, a bottom-up reward-driven generative framework that learns to sample optical graphs directly from fidelity-based rewards without relying on a pre-existing training dataset. We demonstrate the framework on multipartite entangled states, graph and cluster states, and nonlocal photonic-gate targets, obtaining multiple high-fidelity optical graphs. We identify asymptotic solutions for states that cannot be generated exactly by graphs, as well as nonlocal Toffoli gate constructions requiring two ancillas. Our work presents hardware-constraint objectives, which lead to alternative constructions of CNOT and Toffoli gates when connections between ancilla nodes are restricted. These findings illustrate a reward-driven approach to quantum optical inverse design, exploring alternative circuit topologies while directly incorporating connectivity constraints into the search process.
A reinforcement learning (RL) framework is introduced for the efficient synthesis of quantum circuits that generate specified target quantum states from a fixed initial state, addressing a central challenge in both the Noisy Intermediate-Scale Quantum (NISQ) era and future fault-tolerant quantum computing. The approach utilizes tabular Q-learning, based on action sequences, within a discretized quantum state space, to effectively manage the exponential growth of the space dimension. The framework introduces a hybrid reward mechanism, combining a static, domain-informed reward that guides the agent toward the target state with customizable dynamic penalties that discourage inefficient circuit structures such as gate congestion and redundant state revisits. This is a circuit-aware reward, in contrast to the current trend of works on this topic, which are primarily fidelity-based. By leveraging sparse matrix representations and state-space discretization, the method enables practical navigation of high-dimensional environments while minimizing computational overhead. Benchmarking on graph-state preparation tasks for up to seven qubits, we demonstrate that the algorithm consistently discovers minimal-depth circuits with optimized gate counts. Moreover, extending the framework to a universal gate set still yields low depth circuits, highlighting the algorithm’s robustness and adaptability. The results confirm that this RL-driven approach, with our completely circuit-aware method, efficiently explores the complex quantum state space and synthesizes near-optimal quantum circuits, providing a resource-efficient foundation for quantum circuit optimization.
Current quantum computing hardware imposes strict constraints on two-qubit gate operations, limiting their application to specific qubit pairs. This leads to a structural mismatch between quantum circuits and hardware limitations. Quantum circuit mapping addresses this issue by inserting SWAP gates to enable logical circuit equivalence. In the Noisy Intermediate-Scale Quantum (NISQ) era, minimizing the number of additional gates is crucial to reduce circuit error rates. We propose LARBE (Look-Ahead Rewards and Biased Exploration), a deep reinforcement learning framework utilizing graph neural networks to encode quantum circuits. The look-ahead reward mechanism enables intelligent trade-offs between immediate and future mapping benefits, while the biased exploration incorporates heuristic rules to accelerate training convergence. Benchmarking against the SABRE algorithm demonstrates performance improvements ranging from 5.83% to 17.57% on several common hardware topologies.
Heralded multipartite entanglement is a key resource for various quantum information tasks. However, designing linear optical circuits that generate specific target states is generally challenging due to the complexity of the required optical structures. Here we formulate the design of heralded photonic circuits as an algorithmic graph-search problem. Our framework enables the automated construction and optimization of heralded photonic circuits by substantially reducing the search space using the linear quantum graph (LQG) picture. Our strategy reconstructs circuit structures as graphs in the picture and identifies suitable graphs automatically. As a result, we design efficient schemes for a broad range of useful multipartite resource states, including hypergraph magic states, quantum error correcting codes, general three-qubit states and length-1 caterpillar graph states. Our work establishes an algorithmic framework for the systematic discovery of heralded resource states, laying the foundation for the automated design of increasingly complex multipartite entangled resources.
Heralded multipartite photonic entanglement underpins quantum communication, distributed sensing, and fault-tolerant computation, yet the manual synthesis of linear-optical circuits that generate a prescribed target state remains a combinatorial bottleneck. A recent preprint [1,2] recasts this design task as an algorithmic graph-search problem in the linear quantum graph (LQG) picture, reporting automated discovery of heralded circuits for hypergraph magic states, quantum error-correcting code states, general three-qubit states, and length-1 caterpillar graph states. This paper provides a single reconciled synthesis and quantitative appraisal. We formalize the search-space reduction claimed by the LQG representation with explicit combinatorial counts: for a representative six-mode, three-beam-splitter budget, raw circuit enumeration (3,375 ordered-slot instances) reduces to 455 graph instances, a factor of ≈7.4 (up to ≈44.5 under a reordering-inclusive convention), growing to ≈151 at ten modes and five beam splitters. We derive heralding probabilities for canonical fusion-based constructions: a three-qubit GHZ state via type-II fusion succeeds with probability p²/2 per trial (5×10⁻³ at source probability p = 0.1), and a four-qubit caterpillar projection spans [3.2×10⁻⁷, 7.5×10⁻³] across plausible hardware ranges — showing that hardware parameters, not circuit topology, dominate success probability. We further derive multiplexing arithmetic (a p = 0.01 circuit needs ≈458 attempts for 99% cumulative success; 64-fold multiplexing converts this to 8 rounds of 64 executions (512 total, ≈12% more than the unmultiplexed 458) and loss-limited fidelity bounds F ≈ η^{2q}. We identify falsification criteria and the decisive open problems: graph-isomorphism overhead, ancilla-mode blowup, loss-aware search objectives, and scalability beyond the demonstrated q ≤ 4 target classes. ## 1. Introduction Photons are attractive carriers of quantum information: they decohere negligibly Full text and updates: papers.qnfo.org/papers/algorithmic-graph-search-design-of-heralded-linear-optical-circuits-for-multipar/
Superconducting quantum circuits are among the most promising platforms for quantum computing, but their design remains a complex inverse problem, requiring the identification of circuit architectures and physical parameters capable of reproducing a desired quantum response. Existing approaches mainly rely on iterative optimization, predefined topologies, or previously simulated device families, limiting their flexibility as circuit complexity increases. This thesis presents a generative framework for the inverse design of superconducting quantum circuits. The proposed approach combines a Graph Variational Autoencoder with Transformer-based generative architectures, including GPT-like autoregressive and BERT-like bidirectional mechanisms, to learn a shared latent representation between circuit graphs and their effective Hamiltonians. Starting from a target Hamiltonian, the framework generates both the circuit topology and its continuous physical parameters, while physics-based constraints and latent-space optimization are used to improve the quality of the generated solutions. The results show accurate reconstruction of known circuit families, a high fraction of physically valid generated circuits, and encouraging generalization to previously unseen topologies. These results indicate the potential of modern generative AI techniques for the automated inverse design of superconducting quantum circuits. i
Variational Quantum Algorithms (VQA) are promising to demonstrate quantum advantages on near-term devices. Designing ansatz, a variational circuit with parameterized gates, is of paramount importance for VQA as it lays the foundation for parameter optimizations. Due to the large noise on Noisy-Intermediate Scale Quantum (NISQ) machines, considering circuit size and real device noise in the ansatz design process is necessary. Unfortunately, recent works on ansatz design either consider no noise impact or only treat the real device as a black box with no specific noise information. In this work, we propose to open the black box by designing specific ansatz tailored for the qubit topology on target machines. Specifically, we propose a bottom-up approach to generate topology-specific ansatz. Firstly, we generate topology-compatible sub-circuits with desirable properties such as high expressibility and entangling capability. Then, the sub-circuits are combined together to form an initial ansatz. We further propose circuits stitching to solve the sparse connectivity issue between sub-circuits, and dynamic circuit growing to improve the accuracy. The ansatz constructed with this method is highly flexible and thus we can explore a much larger design space than previous state-of-the-art method in which all ansatz candidates are strict subsets of a pre-defined large ansatz. We use a popular VQA algorithm - Quantum Neural Networks (QNN) for Machine Learning (ML) task as the benchmarks. Experiments on 14 ML tasks show that under the same performance, the TopGen-searched ansatz can reduce the circuit depth and the number of CNOT gates by up to 2 * and 4 * respectively. Experiments on three real quantum machines demonstrate on average 17% accuracy improvements over baselines.