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:2506.07859 · Physical Review Research

Deep reinforcement learning for near-deterministic preparation of cubic-phase gates and direct preparation of quartic-phase gates in photonic quantum computing

Amanuel Anteneh, F. Brunel, Carlos González-Arciniegas, Olivier Pfister

Published Feb 10, 2026• 3 citations
arXivHTMLPDF

Abstract

Cubic-phase states are a sufficient gate resource for universal quantum computing over continuous variables. We present results from numerical experiments in which deep neural networks are trained via reinforcement learning to control a quantum optical circuit for generating cubic-phase states by leveraging quantum interference in phase space, with an unprecedented average success rate of 96 % . The only non-Gaussian resource required is photon-number-resolving measurements. We also show that the exact same resources enable the direct generation of a quartic-phase gate, with no need for a cubic gate decomposition.

DOI
10.1103/wkfp-tf74

Related papers

Machine learning for efficient generation of universal photonic quantum computing resources

Amanuel Anteneh, F. Brunel, Olivier Pfister

We present numerical results from simulations using deep reinforcement learning to control a measurement-based quantum processor—a time-multiplexed optical circuit sampled by photon-number-resolving detection—and find it generates squeezed cat states quasi-deterministically, with an average success rate of 98%, far outperforming all other proposals. Since squeezed cat states are deterministic precursors to the Gottesman–Kitaev–Preskill (GKP) bosonic error code, this is a key result for enabling fault tolerant photonic quantum computing. Informed by these simulations, we also discovered a one-step quantum circuit of constant parameters that can generate GKP states with high probability, though not deterministically.

arXiv:2310.03130•Optica Quantum•Jun 28, 2024•8 citations

Production of photonic universal quantum gates enhanced by machine learning

Krishna Kumar Sabapathy, Haoyu Qi, Josh Izaac +1 more

We introduce photonic architectures for universal quantum computation. The first step is to produce a resource state which is a superposition of the first four Fock states with a probability greater than or equal to ${10}^{\ensuremath{-}2}$, an increase by a factor of ${10}^{4}$ over standard sequential photon-subtraction techniques. The resource state is produced with near-perfect fidelity from a quantum gadget that uses displaced squeezed vacuum states, interferometers, and photon-number-resolving detectors. The parameters of this gadget are trained using machine learning algorithms for variational circuits. We discuss in detail various aspects of the non-Gaussian state preparation resulting from the numerical experiments. We then propose a notion of resource farms where these gadgets are stacked in parallel, to increase the success probability further. We find a trade-off between the success probability of the farm, the error tolerance, and the number of gadgets. Using the resource states in conventional gate teleportation techniques, we can then implement weak tunable cubic phase gates. The numerical tools that have been developed could potentially be useful for other applications in photonics as well.

arXiv:1809.04680•Physical Review A•Jul 17, 2019•66 citations

Machine learning for efficient generation of universal hybrid quantum computing resources

Olivier Pfister, Amanuel Anteneh

We present numerical simulations of deep reinforcement learning on a measurement-based quantum processor--a time-multiplexed optical circuit sampled by photon-number-resolving detection--and find it generates squeezed cat states with an average success rate of 98%, far outperforming all other similar proposals. Since squeezed cat states are deterministic precursors to the Gottesman-Kitaev-Preskill bosonic error code, this is a key result for enabling fault tolerant photonic quantum computing.

Quantum Computing, Communication, and Simulation•Mar 13, 2024•0 citations

On the Challenges of Quantum Circuit Encoding Using Deep and Reinforcement Learning

Patrick Selig, Niall Murphy, David Redmond +1 more

Quantum computers may solve some computing tasks more efficiently than classical computers, but to do so requires the design of appropriate quantum circuits. However, it is hard to design even simple quantum programs. Recent results have shown that deep learning augmented search has the potential to discover good circuits for a problem, but it is not yet sufficiently understood how well deep learning is able to model such a complex domain: the search space and output space grow exponentially. This work explores the ability of neural networks to encode quantum circuits for tasks that require knowledge about the unitary representation of the circuit. To this end, we trained neural networks to directly learn to predict the unitary of a circuit and applied reinforcement learning to train neural networks to solve circuit based quantum state preparation. This work finds that encoding quantum circuits is quite difficult especially with regards to the amount of entanglement applied in both application domains. The use of intermediate states and structure in quantum circuits combined with a reasonable inductive bias, where applicable, can alleviate these problems to some extent. The use of intermediate states also greatly improves the results of Deep Reinforcement Learning for quantum state preparation. Based on these results, we discuss the next set of challenges to address if we are to design neural network-based approaches for the automatic generation of quantum circuits. Add sentence on how it improves things in the end.

IEEE Access•Jan 1, 2025•0 citations

Machine learning for efficient generation of universal hybrid quantum computing resources

Amanuel Anteneh, Olivier Pfister

We present numerical simulations of deep reinforcement learning on a measurement-based quantum processor—a time-multiplexed optical circuit sampled by photon-number-resolving detection—and find it generates squeezed cat states with an average success rate of 98%, outperforming all other similar proposals.

Conference on Lasers and Electro-Optics•Jan 1, 2024•0 citations

Deep Reinforcement Learning for quantum state preparation with noisy gates in the NISQ-era

Narvaez Hernandez, Roberto

Quantum computers promise significant computational advantages over classical computers for specific tasks. However, one of the challenges in the noisy intermediate-scale quantum (NISQ) era is the efficient compilation of quantum states and gates, which is crucial for the implementation of quantum algorithms. Given the high dimensionality of quantum systems, this compilation task is non-trivial. Reinforcement learning (RL) is a machine learning subfield focused on developing algorithms for decision-making in dynamic environments. An agent learns by interacting with its environment, how to act to optimize its performance on a certain task. Recently, the integration of deep learning has given rise to deep reinforcement learning (DRL), where deep neural networks approximate functions like value or policy, allowing agents to tackle high-dimensional and complex tasks with greater efficiency and success. Recently, deep reinforcement learning (DRL) has been proposed as a method to automate quantum compiling. In this thesis, we explore the application of RL for quantum state and unitary matrix synthesis, focusing on the use of two reinforcement learning algorithms Deep Q-Networks (DQN) and Proximal Policy Optimization (PPO). Our results indicate that DRL shows promise in generalizing the task of quantum unitary synthesis and quantum state preparation. However, the current state-of-the-art is still limited to working in the no-volume law entangled part of the Hilbert space.

•Sep 9, 2024•0 citations
Cubic-phase states are a sufficient gate resource for universal quantum computing over continuous variables. We present results from numerical experiments in which deep neural networks are trained via reinforcement learning to control a quantum optical circuit for generating cubic-phase states by leveraging quantum interference in phase space, with an unprecedented average success rate of 96 % . The only non-Gaussian resource required is photon-number-resolving measurements. We also show that the exact same resources enable the direct generation of a quartic-phase gate, with no need for a cubic gate decomposition.
We present numerical results from simulations using deep reinforcement learning to control a measurement-based quantum processor—a time-multiplexed optical circuit sampled by photon-number-resolving detection—and find it generates squeezed cat states quasi-deterministically, with an average success rate of 98%, far outperforming all other proposals. Since squeezed cat states are deterministic precursors to the Gottesman–Kitaev–Preskill (GKP) bosonic error code, this is a key result for enabling fault tolerant photonic quantum computing. Informed by these simulations, we also discovered a one-step quantum circuit of constant parameters that can generate GKP states with high probability, though not deterministically.
We introduce photonic architectures for universal quantum computation. The first step is to produce a resource state which is a superposition of the first four Fock states with a probability greater than or equal to ${10}^{\ensuremath{-}2}$, an increase by a factor of 104{10}^{4}104 over standard sequential photon-subtraction techniques. The resource state is produced with near-perfect fidelity from a quantum gadget that uses displaced squeezed vacuum states, interferometers, and photon-number-resolving detectors. The parameters of this gadget are trained using machine learning algorithms for variational circuits. We discuss in detail various aspects of the non-Gaussian state preparation resulting from the numerical experiments. We then propose a notion of resource farms where these gadgets are stacked in parallel, to increase the success probability further. We find a trade-off between the success probability of the farm, the error tolerance, and the number of gadgets. Using the resource states in conventional gate teleportation techniques, we can then implement weak tunable cubic phase gates. The numerical tools that have been developed could potentially be useful for other applications in photonics as well.
Quantum computers may solve some computing tasks more efficiently than classical computers, but to do so requires the design of appropriate quantum circuits. However, it is hard to design even simple quantum programs. Recent results have shown that deep learning augmented search has the potential to discover good circuits for a problem, but it is not yet sufficiently understood how well deep learning is able to model such a complex domain: the search space and output space grow exponentially. This work explores the ability of neural networks to encode quantum circuits for tasks that require knowledge about the unitary representation of the circuit. To this end, we trained neural networks to directly learn to predict the unitary of a circuit and applied reinforcement learning to train neural networks to solve circuit based quantum state preparation. This work finds that encoding quantum circuits is quite difficult especially with regards to the amount of entanglement applied in both application domains. The use of intermediate states and structure in quantum circuits combined with a reasonable inductive bias, where applicable, can alleviate these problems to some extent. The use of intermediate states also greatly improves the results of Deep Reinforcement Learning for quantum state preparation. Based on these results, we discuss the next set of challenges to address if we are to design neural network-based approaches for the automatic generation of quantum circuits. Add sentence on how it improves things in the end.
Quantum computers promise significant computational advantages over classical computers for specific tasks. However, one of the challenges in the noisy intermediate-scale quantum (NISQ) era is the efficient compilation of quantum states and gates, which is crucial for the implementation of quantum algorithms. Given the high dimensionality of quantum systems, this compilation task is non-trivial. Reinforcement learning (RL) is a machine learning subfield focused on developing algorithms for decision-making in dynamic environments. An agent learns by interacting with its environment, how to act to optimize its performance on a certain task. Recently, the integration of deep learning has given rise to deep reinforcement learning (DRL), where deep neural networks approximate functions like value or policy, allowing agents to tackle high-dimensional and complex tasks with greater efficiency and success. Recently, deep reinforcement learning (DRL) has been proposed as a method to automate quantum compiling. In this thesis, we explore the application of RL for quantum state and unitary matrix synthesis, focusing on the use of two reinforcement learning algorithms Deep Q-Networks (DQN) and Proximal Policy Optimization (PPO). Our results indicate that DRL shows promise in generalizing the task of quantum unitary synthesis and quantum state preparation. However, the current state-of-the-art is still limited to working in the no-volume law entangled part of the Hilbert space.