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:2112.10311 · Quantum

Measurement-based generation and preservation of cat and grid states within a continuous-variable cluster state

Miller Eaton, Carlos González-Arciniegas, Rafael N. Alexander, Nicolas C. Menicucci, Olivier Pfister

Published Jul 20, 2022• 37 citations
arXivHTMLPDF

Abstract

We present an algorithm to reliably generate various quantum states critical to quantum error correction and universal continuous-variable (CV) quantum computing, such as Schrödinger cat states and Gottesman-Kitaev-Preskill (GKP) grid states, out of Gaussian CV cluster states. Our algorithm is based on the Photon-counting-Assisted Node-Teleportation Method (PhANTM), which uses standard Gaussian information processing on the cluster state with the only addition of local photon-number-resolving measurements. We show that PhANTM can apply polynomial gates and embed cat states within the cluster. This method stabilizes cat states against Gaussian noise and perpetuates non-Gaussianity within the cluster. We show that existing protocols for breeding cat states can be embedded into cluster state processing using PhANTM.

DOI
10.22331/q-2022-07-20-769

Related papers

Generating Gottesman-Kitaev-Preskill Qubits Over Continuous-Variable Cluster States with Photon-Number-Resolving Measurements

Miller Eaton, Carlos González-Arciniegas, Rafael N. Alexander +2 more

We develop a method to embed Schrödinger Cat states in continuous-variable cluster states with high probability using photon-number-resolving detection. Embedded cat states can then be bred into Gottesman-Kitaev-Preskill qubits with Gaussian measurements on the cluster.

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

Fault-Tolerant Continuous-Variable Measurement-based Quantum Computation Architecture

Mikkel V. Larsen, Christopher Chamberland, Kyungjoo Noh +2 more

Continuous-variable measurement-based quantum computation on cluster states has in recent years shown great potential for scalable, universal, and fault-tolerant quantum computation when combined with the Gottesman-Kitaev-Preskill (GKP) code and quantum error correction.However, no complete fault-tolerant architecture exists that includes everything from cluster-state generation with finite squeezing to gate implementations with realistic noise and error correction.In this work, we propose a simple architecture for the preparation of a cluster state in three dimensions in which gates can be efficiently implemented by gate teleportation.To accommodate scalability, we propose architectures that allow both spatial and temporal multiplexing, with the temporally encoded version requiring as little as two squeezed light sources.Because of its three-dimensional structure, the architecture supports topological qubit error correction, while GKP error correction is efficiently realized within the architecture by teleportation.To validate fault tolerance, the architecture is simulated using surface-GKP codes, including noise from GKP states as well as gate noise caused by finite squeezing in the cluster state.We find a fault-tolerant squeezing threshold of 12.7 dB, with room for further improvement.

arXiv:2101.03014•PRX Quantum•Aug 11, 2021•100 citations

A complete continuous-variable quantum computation architecture based on the 2D spatiotemporal cluster state

Peilin Du, Jing Zhang, Tiancai Zhang +2 more

Continuous-variable measurement-based quantum computation, which requires deterministically generated large-scale cluster states, is a promising candidate for practical, scalable, universal, and fault-tolerant quantum computation. In this work, based on our compact and scalable scheme of generating a two-dimensional spatiotemporal cluster state, a complete architecture including cluster state preparation, gate implementations, and error correction, is proposed. First, a scheme for generating two-dimensional large-scale continuous-variable cluster state by multiplexing both the temporal and spatial domains is proposed. Then, the corresponding gate implementations by gate teleportation are discussed and the actual gate noise from the generated cluster state is considered. After that, the quantum error correction can be further achieved by utilizing the square-lattice Gottesman-Kitaev-Preskill (GKP) code. Finally, a fault-tolerant quantum computation can be realized by introducing bias into the square-lattice GKP code (to protect against phase-flip errors) and concatenating a repetition code (to handle the residual bit-flip errors), with a squeezing threshold of 12.3 dB. Our work provides a possible option for a complete fault-tolerant quantum computation architecture in the future.

arXiv:2312.13877•Scientific Reports•May 25, 2025•4 citations

Gottesman-Kitaev-Preskill state preparation by photon catalysis

Miller Eaton, Rajveer Nehra, Olivier Pfister

Continuous-variable quantum-computing (CVQC) is the most scalable implementation of QC to date but requires non-Gaussian resources to allow exponential speedup and quantum correction, using error encoding such as Gottesman-Kitaev-Preskill (GKP) states. However, GKP state generation is still an experimental challenge. We show theoretically that photon catalysis, the interference of coherent states with single-photon states followed by photon-number-resolved detection, is a powerful enabler for non-Gaussian quantum state engineering such as exactly displaced single-photon states and $M$-symmetric superpositions of squeezed vacuum (SSV), including squeezed cat states ($M=2$). By including photon-counting based state breeding, we demonstrate the potential to enlarge SSV states and produce GKP states.

•Mar 5, 2019•5 citations

Squeezing-Enhanced Photon-Number Measurements for GKP State Generation

Paul Renault, Patrick Yard, Raphael Pooser +1 more

We present an architecture for the generation of GKP states in which quadrature squeezing operations are used to control the average photon number statistics of probabilistic photon number measurements on Gaussian resource states. Specifically, we present an architecture employing a teleportation-based squeezing protocol and polynomial-gate applications integrated into a time-multiplexed multi-mode cluster state to generate cat states with high amplitudes, which are consequently used to generate GKP states with high quadrature effective squeezing. Compared to our previous work, in addition to using squeezing as a resource, the present architecture reduces damping and noise by minimizing the number of homodyne measurements required in GKP state generation. We demonstrate the effectiveness of these improvements - including dynamic input-state resetting and an improved breeding algorithm - by achieving a fault-tolerance threshold of 11.5 dB cluster squeezing using the RHG surface code for error correction, without requiring active switching or photon-number resource states.

quant-pharXiv:2511.14737•Nov 19, 2025•0 citations

Non-Gaussian and Gottesman–Kitaev–Preskill state preparation by photon catalysis

Miller Eaton, Rajveer Nehra, Olivier Pfister

Abstract Continuous-variable quantum-computing is the most scalable implementation of QC to date but requires non-Gaussian resources to allow exponential speedup and quantum correction, using error encoding such as Gottesman–Kitaev–Preskill (GKP) states. However, GKP state generation is still an experimental challenge. We show theoretically that photon catalysis, the interference of coherent states with single-photon states followed by photon-number-resolved detection, is a powerful enabler for non-Gaussian quantum state engineering such as exactly displaced single-photon states and M -symmetric superpositions of squeezed vacuum (SSV), including squeezed cat states ( M = 2). By including photon-counting based state breeding, we demonstrate the potential to enlarge SSV states and produce GKP states.

arXiv:1903.01925•New Journal of Physics•Oct 31, 2019•107 citations
We present an algorithm to reliably generate various quantum states critical to quantum error correction and universal continuous-variable (CV) quantum computing, such as Schrödinger cat states and Gottesman-Kitaev-Preskill (GKP) grid states, out of Gaussian CV cluster states. Our algorithm is based on the Photon-counting-Assisted Node-Teleportation Method (PhANTM), which uses standard Gaussian information processing on the cluster state with the only addition of local photon-number-resolving measurements. We show that PhANTM can apply polynomial gates and embed cat states within the cluster. This method stabilizes cat states against Gaussian noise and perpetuates non-Gaussianity within the cluster. We show that existing protocols for breeding cat states can be embedded into cluster state processing using PhANTM.
Continuous-variable measurement-based quantum computation on cluster states has in recent years shown great potential for scalable, universal, and fault-tolerant quantum computation when combined with the Gottesman-Kitaev-Preskill (GKP) code and quantum error correction.However, no complete fault-tolerant architecture exists that includes everything from cluster-state generation with finite squeezing to gate implementations with realistic noise and error correction.In this work, we propose a simple architecture for the preparation of a cluster state in three dimensions in which gates can be efficiently implemented by gate teleportation.To accommodate scalability, we propose architectures that allow both spatial and temporal multiplexing, with the temporally encoded version requiring as little as two squeezed light sources.Because of its three-dimensional structure, the architecture supports topological qubit error correction, while GKP error correction is efficiently realized within the architecture by teleportation.To validate fault tolerance, the architecture is simulated using surface-GKP codes, including noise from GKP states as well as gate noise caused by finite squeezing in the cluster state.We find a fault-tolerant squeezing threshold of 12.7 dB, with room for further improvement.
Continuous-variable measurement-based quantum computation, which requires deterministically generated large-scale cluster states, is a promising candidate for practical, scalable, universal, and fault-tolerant quantum computation. In this work, based on our compact and scalable scheme of generating a two-dimensional spatiotemporal cluster state, a complete architecture including cluster state preparation, gate implementations, and error correction, is proposed. First, a scheme for generating two-dimensional large-scale continuous-variable cluster state by multiplexing both the temporal and spatial domains is proposed. Then, the corresponding gate implementations by gate teleportation are discussed and the actual gate noise from the generated cluster state is considered. After that, the quantum error correction can be further achieved by utilizing the square-lattice Gottesman-Kitaev-Preskill (GKP) code. Finally, a fault-tolerant quantum computation can be realized by introducing bias into the square-lattice GKP code (to protect against phase-flip errors) and concatenating a repetition code (to handle the residual bit-flip errors), with a squeezing threshold of 12.3 dB. Our work provides a possible option for a complete fault-tolerant quantum computation architecture in the future.
Continuous-variable quantum-computing (CVQC) is the most scalable implementation of QC to date but requires non-Gaussian resources to allow exponential speedup and quantum correction, using error encoding such as Gottesman-Kitaev-Preskill (GKP) states. However, GKP state generation is still an experimental challenge. We show theoretically that photon catalysis, the interference of coherent states with single-photon states followed by photon-number-resolved detection, is a powerful enabler for non-Gaussian quantum state engineering such as exactly displaced single-photon states and MMM-symmetric superpositions of squeezed vacuum (SSV), including squeezed cat states (M=2M=2M=2). By including photon-counting based state breeding, we demonstrate the potential to enlarge SSV states and produce GKP states.
We present an architecture for the generation of GKP states in which quadrature squeezing operations are used to control the average photon number statistics of probabilistic photon number measurements on Gaussian resource states. Specifically, we present an architecture employing a teleportation-based squeezing protocol and polynomial-gate applications integrated into a time-multiplexed multi-mode cluster state to generate cat states with high amplitudes, which are consequently used to generate GKP states with high quadrature effective squeezing. Compared to our previous work, in addition to using squeezing as a resource, the present architecture reduces damping and noise by minimizing the number of homodyne measurements required in GKP state generation. We demonstrate the effectiveness of these improvements - including dynamic input-state resetting and an improved breeding algorithm - by achieving a fault-tolerance threshold of 11.5 dB cluster squeezing using the RHG surface code for error correction, without requiring active switching or photon-number resource states.
Abstract Continuous-variable quantum-computing is the most scalable implementation of QC to date but requires non-Gaussian resources to allow exponential speedup and quantum correction, using error encoding such as Gottesman–Kitaev–Preskill (GKP) states. However, GKP state generation is still an experimental challenge. We show theoretically that photon catalysis, the interference of coherent states with single-photon states followed by photon-number-resolved detection, is a powerful enabler for non-Gaussian quantum state engineering such as exactly displaced single-photon states and M -symmetric superpositions of squeezed vacuum (SSV), including squeezed cat states ( M = 2). By including photon-counting based state breeding, we demonstrate the potential to enlarge SSV states and produce GKP states.