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

• URL: http://arxiv.org/abs/2603.18303v1
• Date: Wed, 18 Mar 2026 21:40:34 GMT
• Title: Multi-Outcome Circuit Optimization for Enhanced Non-Gaussian State Generation
• Abstract summary: A critical requirement for fault-tolerant quantum computation is the reliable generation of non-Gaussian quantum states.<n>We propose and demonstrate a multi-outcome optimization strategy that increases the overall acceptance probability.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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

• Preparation of Large Fock States in Resonators with High Probability [0.0]
  We propose a protocol that combines quantum nondemolition photon-number encoding with quantum amplitude amplification.<n>With a register of up to eight qubits, near-deterministic preparation of Fock states with hundreds of excitations is possible.
  arXiv  Detail & Related papers  (2026-08-20T14:59:55Z)
• Heralding probability optimization for nonclassical light generated by photon counting measurements on multimode Gaussian states [0.0]
  We show that for conditional quantum state preparation schemes the heralding probability can be formulated as a finding solution to a system of equations.<n>Our approach can seamlessly incorporate bounds on the available single-moderature squeezing.<n>We focus on Gaussian states with vanishing coherent displacements, hence the conditionally generated states have well defined quadn number parity.
  arXiv  Detail & Related papers  (2026-04-28T17:55:27Z)
• Preparing low-variance states using a distributed quantum algorithm [2.1587559138197667]
  We present a distributed quantum algorithm inspired by iterative phase estimation to prepare low-variance states.<n>Our method uses a single auxiliary qubit per quantum device, which controls its dynamics, and a postselection strategy for a joint quantum measurement.<n>This allows us to demonstrate that our distributed algorithm reduces the energy variance faster compared to single-device implementations.
  arXiv  Detail & Related papers  (2025-01-22T18:55:51Z)
• Quantum Generative Diffusion Model: A Fully Quantum-Mechanical Model for Generating Quantum State Ensemble [40.06696963935616]
  We introduce Quantum Generative Diffusion Model (QGDM) as their simple and elegant quantum counterpart. QGDM exhibits faster convergence than Quantum Generative Adversarial Network (QGAN) It can achieve 53.02% higher fidelity in mixed-state generation than QGAN.
  arXiv  Detail & Related papers  (2024-01-13T10:56:34Z)
• Seeding Gaussian boson samplers with single photons for enhanced state generation [0.0]
  Non-Gaussian quantum states are crucial to fault-tolerant quantum computation with continuous-variable systems. 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.
  arXiv  Detail & Related papers  (2023-11-06T19:00:00Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Quantum Dueling: an Efficient Solution for Combinatorial Optimization [3.7398607565670536]
  We present a new algorithm for generic optimization, which we term quantum dueling. Quantum dueling innovates by integrating an additional qubit register, effectively creating a dueling'' scenario where two sets of solutions compete. Our work demonstrates that increasing the number of qubits allows the development of previously unthought-of algorithms, paving the way for advancement of efficient quantum algorithm design.
  arXiv  Detail & Related papers  (2023-02-20T18:33:55Z)
• Noiseless linear amplification in quantum target detection using Gaussian states [0.0]
  Quantum target detection aims to utilise quantum technologies to achieve performances in target detection not possible through purely classical means. This paper considers the employment of a noiseless linear amplifier at the detection stage of a quantum illumination-based quantum target detection protocol.
  arXiv  Detail & Related papers  (2022-01-07T14:50:42Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.