Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research introduces Grinch, a generative framework that designs quantum optical circuits directly from fidelity rewards without needing prior training data. By optimizing discrete topologies and continuous parameters simultaneously, the method efficiently generates high-fidelity graphs for complex entangled states while respecting hardware connectivity constraints. The approach offers a novel inverse design tool for photonic quantum computing, enabling the discovery of alternative gate constructions that standard graph-pruning methods might miss.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

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

arXiv2 min read

arXiv:2609.08073v1 Announce Type: new 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.

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.

arXiv:2609.08073 [quant-ph]

(or arXiv:2609.08073v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.08073 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

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.

Full text under the publisher's open licence · 246 words

Related coverage