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:2603.18303 · Physical Review A

Multi-Outcome Circuit Optimization for Enhanced Non-Gaussian State Generation

S. Ismailzadeh, B. Abedi Ravan

quant-phphysics.comp-phSubmitted Mar 18, 2026• Announced Mar 20, 2026• 0 citations
arXivHTMLPDF

Abstract

Photonic quantum computing has gained significant interest in recent years due to its potential for scaling to large numbers of qubits. A critical requirement for fault-tolerant quantum computation is the reliable generation of non-Gaussian quantum states, typically achieved using Gaussian operations and photon-number-resolving detectors. However, the probabilistic nature of quantum measurement typically results in low success rates for state preparation. Conventionally, these circuits are optimized to herald a single specific target outcome, thereby disregarding the potential utility of alternative measurement patterns generated by the same physical setup. In this work, we propose and demonstrate a multi-outcome optimization strategy that increases the overall acceptance probability by allowing a single circuit to produce useful quantum states across several measurement patterns. To evaluate this approach, we apply the framework to the generation of Gottesman-Kitaev-Preskill core states, Schrodinger cat states, binomial codes, and cubic phase states using both two-mode and three-mode Gaussian circuits. We demonstrate that the success probability can be enhanced through two distinct mechanisms: first, by simultaneously targeting a diverse set of useful resource states, and second, by aggregating degenerate outcomes to maximize the production rate of a single target state.

Related papers

Seeding Gaussian boson samplers with single photons for enhanced state generation

Valerio Crescimanna, Aaron Z. Goldberg, Khabat Heshami

Non-Gaussian quantum states are crucial to fault-tolerant quantum computation with continuous-variable systems. Usually, generation of such states involves trade-offs between success probability and quality of the resultant state. For example, injecting squeezed light into a multimode interferometer and postselecting on certain patterns of photon-number outputs in all but one mode, a fundamentally probabilistic task, can herald the creation of cat states, Gottesman-Kitaev-Preskill (GKP) states, and more. We consider the addition of a non-Gaussian resource state, particularly single photons, to this configuration and show how it improves the qualities and generation probabilities of desired states. With only two modes, adding a single-photon source improves GKP-state fidelity from 0.68 to 0.95 and adding a second then increases the success probability eightfold; for cat states with a fixed target fidelity, the probability of success can be improved by factors of up to four by adding single-photon sources. These demonstrate the usefulness of additional commonplace non-Gaussian resources for generating desirable states of light.

arXiv:2311.03432•Physical Review A•Feb 23, 2024•10 citations

Adaptive non-Gaussian quantum state engineering

Valerio Crescimanna, Shang Yu, Khabat Heshami +1 more

Non-Gaussian quantum states of bosons are a key resource in quantum information science with applications ranging from quantum metrology to fault-tolerant quantum computation. Generation of photonic non-Gaussian resource states, such as Schrödinger's cat and Gottesman-Kitaev-Preskill states, is challenging. In this work, we go beyond existing passive architectures and explore a broad set of adaptive schemes. Our numerical results demonstrate a consistent improvement in the probability of success and fidelity of generating these non-Gaussian quantum states with equivalent resources. We also explore the effect of loss as the primary limiting factor and observe that adaptive schemes lead to more desirable outcomes in terms of overall probability of success and loss tolerance. Our work offers a versatile framework for non-Gaussian resource state generation with the potential to guide future experimental implementations.

arXiv:2502.14967•Physical Review A•Nov 6, 2025•5 citations

Beyond Stellar Rank: Control Parameters for Scalable Optical Non-Gaussian State Generation

Fumiya Hanamura, Kan Takase, H. Nagayoshi +6 more

Advanced quantum technologies rely on non-Gaussian states of light, essential for universal quantum computation, fault-tolerant error correction, and quantum sensing. Their practical realization, however, faces hurdles: Simulating large multimode generators is computationally demanding, and benchmarks such as the do not capture how effectively photon detections yield useful non-Gaussianity. We address these challenges by introducing the ( s 0 , δ 0 ) , a continuous and operational measure that goes beyond stellar rank. Leveraging these parameters, we develop a universal optimization method that reduces photon-number requirements and greatly enhances success probabilities while preserving state quality. Applied to the Gottesman-Kitaev-Preskill state generation, for example, our method cuts the required photon detections by a factor of 3 and raises the preparation probability by nearly 10 8 . Demonstrations across cat states, cubic phase states, Gottesman-Kitaev-Preskill states, and even random states confirm broad gains in experimental feasibility. Our results provide a unifying principle for resource-efficient non-Gaussian state generation, charting a practical route toward scalable optical quantum technologies and fault-tolerant quantum computation.

arXiv:2509.06255•Physical Review X•Apr 9, 2026•2 citations

Non-Gaussian quantum state engineering with postselected von Neumann measurements

Xiaoxi Yao, Yusuf Turek

Abstract The practical value of non-Gaussian states for quantum computation, metrology, and networking is currently limited by the intrinsically low success rates of conventional generation methods like photon addition and subtraction. We introduce a scalable protocol that overcomes this bottleneck using postselected von Neumann measurements beyond the weak-coupling regime. Applied to standard Gaussian inputs, our method efficiently generates a suite of critical resources—including large-amplitude Schrödinger cat states, Gottesman–Kitaev–Preskill-like states, and two-mode entangled states—with considerably higher success probabilities. Quantitative analysis of Wigner negativity and entanglement confirms their high quality. This work establishes postselected von Neumann measurement as a general and scalable principle for quantum resource generation, moving beyond a fundamental limitation in quantum state engineering.

arXiv:2509.24188•Quantum Science and Technology•Apr 2, 2026•1 citation

Rapid Gaussian Boson Sampling Circuit Screening for GKP States Creation via a Two-Stage Machine Learning Surrogate

Mohammad Amin Khanpour, Hossein Davoodi Yeganeh

Gottesman-Kitaev-Preskill (GKP) states are essential non-Gaussian resources for fault-tolerant photonic quantum computing, enabling logical qubit encoding with intrinsic robustness against errors. Several approaches to GKP state preparation have been explored, including measurement-based protocols in circuit QED and trapped-ion systems, cat-state breeding, and photon-subtraction schemes. However, these methods are either restricted to specific platforms or require deep non-Gaussian resource chains with exponentially low success probabilities. Gaussian Boson Sampling (GBS) offers a compelling all-photonic alternative by generating non-Gaussian states through measurement-induced nonlinearity, without the need for matter-based ancilla or active feedforward. Nevertheless, its practical implementation is limited by the exponential computational cost of evaluating matrix hafnians-#P-complete functions that govern photon-number probabilities. To address this challenge, we introduce a two-stage Histogram Gradient Boosting surrogate pipeline that predicts, without any hafnian computation, the optimal heralding pattern, circuit fidelity, and post-selection probability for candidate GBS circuits, while reserving exact quantum simulation exclusively for surrogate-selected candidates. Trained on circuit configurations across 3-5 optical modes, the surrogate achieves 90.0% GKP-detection accuracy on a held-out set, representing a 23.7 percentage-point improvement over the baseline, with a fidelity mean absolute error of 0.032 and a log-scale post-selection probability $R^2 = 0.837$, reducing the total simulation burden by approximately 90%.

quant-pharXiv:2606.05992•Jun 5, 2026•0 citations

Riemannian optimization of photonic quantum circuits in phase and Fock space

Yuan Yao, Filippo M. Miatto, Nicolás Quesada

We propose a framework to design and optimize generic photonic quantum circuits composed of Gaussian objects (pure and mixed Gaussian states, Gaussian unitaries, Gaussian channels, Gaussian measurements) as well as non-Gaussian effects such as photon-number-resolving measurements. In this framework, we parametrize a phase space representation of Gaussian objects using elements of the symplectic group (or the unitary or orthogonal group in special cases), and then we transform it into the Fock representation using a single linear recurrence relation that computes the Fock amplitudes of any Gaussian object recursively. We also compute the gradient of the Fock amplitudes with respect to phase space parameters by differentiating through the recurrence relation. We can then use Riemannian optimization on the symplectic group to optimize M M -mode Gaussian objects, avoiding the need to commit to particular realizations in terms of fundamental gates. This allows us to “mod out” all the different gate-level implementations of the same circuit, which now can be chosen after the optimization has completed. This can be especially useful when looking to answer general questions, such as bounding the value of a property over a class of states or transformations, or when one would like to worry about hardware constraints separately from the circuit optimization step. Finally, we make our framework extendable to non-Gaussian objects that can be written as linear combinations of Gaussian ones, by explicitly computing the change in global phase when states undergo Gaussian transformations. We implemented all of these methods in the freely available open-source library MrMustard, which we use in three examples to optimize the 216-mode interferometer in Borealis, and 2- and 3-modes circuits (with Fock measurements) to produce cat states and cubic phase states.

arXiv:2209.06069•SciPost Physics•Sep 18, 2024•20 citations
Photonic quantum computing has gained significant interest in recent years due to its potential for scaling to large numbers of qubits. A critical requirement for fault-tolerant quantum computation is the reliable generation of non-Gaussian quantum states, typically achieved using Gaussian operations and photon-number-resolving detectors. However, the probabilistic nature of quantum measurement typically results in low success rates for state preparation. Conventionally, these circuits are optimized to herald a single specific target outcome, thereby disregarding the potential utility of alternative measurement patterns generated by the same physical setup. In this work, we propose and demonstrate a multi-outcome optimization strategy that increases the overall acceptance probability by allowing a single circuit to produce useful quantum states across several measurement patterns. To evaluate this approach, we apply the framework to the generation of Gottesman-Kitaev-Preskill core states, Schrodinger cat states, binomial codes, and cubic phase states using both two-mode and three-mode Gaussian circuits. We demonstrate that the success probability can be enhanced through two distinct mechanisms: first, by simultaneously targeting a diverse set of useful resource states, and second, by aggregating degenerate outcomes to maximize the production rate of a single target state.
Non-Gaussian quantum states are crucial to fault-tolerant quantum computation with continuous-variable systems. Usually, generation of such states involves trade-offs between success probability and quality of the resultant state. For example, injecting squeezed light into a multimode interferometer and postselecting on certain patterns of photon-number outputs in all but one mode, a fundamentally probabilistic task, can herald the creation of cat states, Gottesman-Kitaev-Preskill (GKP) states, and more. We consider the addition of a non-Gaussian resource state, particularly single photons, to this configuration and show how it improves the qualities and generation probabilities of desired states. With only two modes, adding a single-photon source improves GKP-state fidelity from 0.68 to 0.95 and adding a second then increases the success probability eightfold; for cat states with a fixed target fidelity, the probability of success can be improved by factors of up to four by adding single-photon sources. These demonstrate the usefulness of additional commonplace non-Gaussian resources for generating desirable states of light.
Non-Gaussian quantum states of bosons are a key resource in quantum information science with applications ranging from quantum metrology to fault-tolerant quantum computation. Generation of photonic non-Gaussian resource states, such as Schrödinger's cat and Gottesman-Kitaev-Preskill states, is challenging. In this work, we go beyond existing passive architectures and explore a broad set of adaptive schemes. Our numerical results demonstrate a consistent improvement in the probability of success and fidelity of generating these non-Gaussian quantum states with equivalent resources. We also explore the effect of loss as the primary limiting factor and observe that adaptive schemes lead to more desirable outcomes in terms of overall probability of success and loss tolerance. Our work offers a versatile framework for non-Gaussian resource state generation with the potential to guide future experimental implementations.
Advanced quantum technologies rely on non-Gaussian states of light, essential for universal quantum computation, fault-tolerant error correction, and quantum sensing. Their practical realization, however, faces hurdles: Simulating large multimode generators is computationally demanding, and benchmarks such as the do not capture how effectively photon detections yield useful non-Gaussianity. We address these challenges by introducing the ( s 0 , δ 0 ) , a continuous and operational measure that goes beyond stellar rank. Leveraging these parameters, we develop a universal optimization method that reduces photon-number requirements and greatly enhances success probabilities while preserving state quality. Applied to the Gottesman-Kitaev-Preskill state generation, for example, our method cuts the required photon detections by a factor of 3 and raises the preparation probability by nearly 10 8 . Demonstrations across cat states, cubic phase states, Gottesman-Kitaev-Preskill states, and even random states confirm broad gains in experimental feasibility. Our results provide a unifying principle for resource-efficient non-Gaussian state generation, charting a practical route toward scalable optical quantum technologies and fault-tolerant quantum computation.
Abstract The practical value of non-Gaussian states for quantum computation, metrology, and networking is currently limited by the intrinsically low success rates of conventional generation methods like photon addition and subtraction. We introduce a scalable protocol that overcomes this bottleneck using postselected von Neumann measurements beyond the weak-coupling regime. Applied to standard Gaussian inputs, our method efficiently generates a suite of critical resources—including large-amplitude Schrödinger cat states, Gottesman–Kitaev–Preskill-like states, and two-mode entangled states—with considerably higher success probabilities. Quantitative analysis of Wigner negativity and entanglement confirms their high quality. This work establishes postselected von Neumann measurement as a general and scalable principle for quantum resource generation, moving beyond a fundamental limitation in quantum state engineering.
Gottesman-Kitaev-Preskill (GKP) states are essential non-Gaussian resources for fault-tolerant photonic quantum computing, enabling logical qubit encoding with intrinsic robustness against errors. Several approaches to GKP state preparation have been explored, including measurement-based protocols in circuit QED and trapped-ion systems, cat-state breeding, and photon-subtraction schemes. However, these methods are either restricted to specific platforms or require deep non-Gaussian resource chains with exponentially low success probabilities. Gaussian Boson Sampling (GBS) offers a compelling all-photonic alternative by generating non-Gaussian states through measurement-induced nonlinearity, without the need for matter-based ancilla or active feedforward. Nevertheless, its practical implementation is limited by the exponential computational cost of evaluating matrix hafnians-#P-complete functions that govern photon-number probabilities. To address this challenge, we introduce a two-stage Histogram Gradient Boosting surrogate pipeline that predicts, without any hafnian computation, the optimal heralding pattern, circuit fidelity, and post-selection probability for candidate GBS circuits, while reserving exact quantum simulation exclusively for surrogate-selected candidates. Trained on circuit configurations across 3-5 optical modes, the surrogate achieves 90.0% GKP-detection accuracy on a held-out set, representing a 23.7 percentage-point improvement over the baseline, with a fidelity mean absolute error of 0.032 and a log-scale post-selection probability R2=0.837R^2 = 0.837R2=0.837, reducing the total simulation burden by approximately 90%.
We propose a framework to design and optimize generic photonic quantum circuits composed of Gaussian objects (pure and mixed Gaussian states, Gaussian unitaries, Gaussian channels, Gaussian measurements) as well as non-Gaussian effects such as photon-number-resolving measurements. In this framework, we parametrize a phase space representation of Gaussian objects using elements of the symplectic group (or the unitary or orthogonal group in special cases), and then we transform it into the Fock representation using a single linear recurrence relation that computes the Fock amplitudes of any Gaussian object recursively. We also compute the gradient of the Fock amplitudes with respect to phase space parameters by differentiating through the recurrence relation. We can then use Riemannian optimization on the symplectic group to optimize M M -mode Gaussian objects, avoiding the need to commit to particular realizations in terms of fundamental gates. This allows us to “mod out” all the different gate-level implementations of the same circuit, which now can be chosen after the optimization has completed. This can be especially useful when looking to answer general questions, such as bounding the value of a property over a class of states or transformations, or when one would like to worry about hardware constraints separately from the circuit optimization step. Finally, we make our framework extendable to non-Gaussian objects that can be written as linear combinations of Gaussian ones, by explicitly computing the change in global phase when states undergo Gaussian transformations. We implemented all of these methods in the freely available open-source library MrMustard, which we use in three examples to optimize the 216-mode interferometer in Borealis, and 2- and 3-modes circuits (with Fock measurements) to produce cat states and cubic phase states.