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:2312.13877 · Scientific Reports

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

Peilin Du, Jing Zhang, Tiancai Zhang, Rongguo Yang, Jiangrui Gao

Published May 25, 2025• 7 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1038/s41598-025-02899-8

Related papers

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•124 citations

High-threshold fault-tolerant quantum computation with the Gottesman-Kitaev-Preskill qubit under noise in an optical setup

Kosuke Fukui

To implement fault-tolerant quantum computation (FTQC) with continuous variables, continuous variables need to be digitized using an appropriate code such as the Gottesman-Kitaev-Preskill (GKP) qubit. The scheme introduced in [Fukui et al. Phys. Rev. X 8, 021054 (2018)] has reduced the threshold of the squeezing level required for continuous-variable FTQC to less than 10 dB, assuming noise derived from the GKP qubit itself. In this paper, we propose a scheme to improve noise tolerance during the construction of a large-scale cluster state used for FTQC with the GKP qubits. In our scheme, a small-scale cluster state is prepared by employing maximum-likelihood estimation, the entanglement generation via the Bell measurement, and probabilistic reliable measurement. Then, a large-scale cluster state is constructed from the small-scale cluster states via the reliable encoded Bell measurement. In the numerical calculations, we assume errors derived from the two-mode gate and loss in the homodyne measurement in addition to noise from the GKP qubit itself. The results show that the thresholds of a squeezing level are around 8.1, 9.6, and 12.4 dB for loss in the homodyne measurement 0, 5, and 10%, respectively. Hence, this paper provides a way toward continuous-variable FTQC with a feasible squeezing level.

arXiv:1906.09767•Physical Review A•May 22, 2023•57 citations

Streamlined quantum computing with macronode cluster states

Blayney W. Walshe, Rafael N. Alexander, Nicolas C. Menicucci +1 more

Continuous-variable cluster states allow for fault-tolerant measurement-based quantum computing when used in tandem with the Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode. For quad-rail-lattice macronode cluster states, whose construction is defined by a fixed, low-depth beam splitter network, we show that a Clifford gate and GKP error correction can be simultaneously implemented in a single teleportation step. We give explicit recipes to realize the Clifford generating set, and we calculate the logical gate-error rates given finite squeezing in the cluster-state and GKP resources. We find that logical error rates of ${10}^{\ensuremath{-}2}$--${10}^{\ensuremath{-}3}$, compatible with the thresholds of topological codes, can be achieved with squeezing of 11.9--13.7 dB. The protocol presented eliminates noise present in prior schemes and puts the required squeezing for fault tolerance in the range of current state-of-the-art optical experiments. Finally, we show how to produce distillable GKP magic states directly within the cluster state.

arXiv:2109.04668•Physical Review A•Dec 16, 2021•22 citations

Architecture and noise analysis of continuous-variable quantum gates using two-dimensional cluster states

Mikkel V. Larsen, Jonas Schou Neergaard-Nielsen, Ulrik L. Andersen

Due to its unique scalability potential, continuous-variable quantum optics is a promising platform for large-scale quantum computing. In particular, very large cluster states with a two-dimensional topology that are suitable for universal quantum computing and quantum simulation can be readily generated in a deterministic manner, and routes towards fault tolerance via bosonic quantum error correction are known. In this article we propose a complete measurement-based quantum computing architecture for the implementation of a universal set of gates on the recently generated two-dimensional cluster states [M. V. Larsen et al., Science 366, 369 (2019); W. Asavanant et al., Science 366, 373 (2019)]. We analyze the performance of the various quantum gates that are executed in these cluster states as well as in other two-dimensional cluster states (the bilayer-square lattice and quad-rail lattice cluster states [R. N. Alexander et al., Phys. Rev. A 94, 032327 (2016); N. C. Menicucci, Phys. Rev. A 83, 062314 (2011)]) by estimating and minimizing the associated stochastic noise addition as well as the resulting gate error probability. We compare the four different states and find that, although they all allow for universal computation, the quad-rail lattice cluster state performs better than the other three states, which all exhibit similar performance.

arXiv:2005.13513•Physical Review A•Oct 19, 2020•33 citations

A Flexible GKP-State-Embedded Fault-Tolerant Quantum Computation Configuration Based on a Three-Dimensional Cluster State

Peilin Du, Jing Zhang, Tiancai Zhang +3 more

The integration of diverse quantum resources and the exploitation of more degrees of freedom provide key operational flexibility for universal fault-tolerant quantum computation. In this work, we propose a flexible Gottesman-Kitaev-Preskill-state-embedded fault-tolerant quantum computation architecture based on a three-dimensional cluster state constructed in polarization, frequency, and orbital angular momentum domains. Specifically, we design optical entanglement generators to produce three diverse entangled pairs, and subsequently construct a three-dimensional cluster state via a beam-splitter network with several time delays. Furthermore, we present a partially squeezed surface-GKP code to achieve fault-tolerant quantum computation and ultimately find the optimal choice of implementing the squeezing gate to give the best fault-tolerant performance (the fault-tolerant squeezing threshold is 11.5 dB). Our scheme is flexible, scalable, and experimentally feasible, providing versatile options for future optical fault-tolerant quantum computation architecture.

quant-pharXiv:2603.18778•Mar 20, 2026•0 citations

Generation of time-domain-multiplexed two-dimensional cluster state

Warit Asavanant, Yu Shiozawa, Shota Yokoyama +8 more

Entanglement is the key resource for measurement-based quantum computing. It is stored in quantum states known as cluster states, which are prepared offline and enable quantum computing by means of purely local measurements. Universal quantum computing requires cluster states that are both large and possess (at least) a two-dimensional topology. Continuous-variable cluster states-based on bosonic modes rather than qubits-have previously been generated on a scale exceeding one million modes, but only in one dimension. Here, we report generation of a large-scale two-dimensional continuous-variable cluster state. Its structure consists of a 5- by 1240-site square lattice that was tailored to our highly scalable time-multiplexed experimental platform. It is compatible with Bosonic error-correcting codes that, with higher squeezing, enable fault-tolerant quantum computation.

arXiv:1903.03918•Science•Oct 17, 2019•499 citations
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 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.
To implement fault-tolerant quantum computation (FTQC) with continuous variables, continuous variables need to be digitized using an appropriate code such as the Gottesman-Kitaev-Preskill (GKP) qubit. The scheme introduced in [Fukui et al. Phys. Rev. X 8, 021054 (2018)] has reduced the threshold of the squeezing level required for continuous-variable FTQC to less than 10 dB, assuming noise derived from the GKP qubit itself. In this paper, we propose a scheme to improve noise tolerance during the construction of a large-scale cluster state used for FTQC with the GKP qubits. In our scheme, a small-scale cluster state is prepared by employing maximum-likelihood estimation, the entanglement generation via the Bell measurement, and probabilistic reliable measurement. Then, a large-scale cluster state is constructed from the small-scale cluster states via the reliable encoded Bell measurement. In the numerical calculations, we assume errors derived from the two-mode gate and loss in the homodyne measurement in addition to noise from the GKP qubit itself. The results show that the thresholds of a squeezing level are around 8.1, 9.6, and 12.4 dB for loss in the homodyne measurement 0, 5, and 10%, respectively. Hence, this paper provides a way toward continuous-variable FTQC with a feasible squeezing level.
Continuous-variable cluster states allow for fault-tolerant measurement-based quantum computing when used in tandem with the Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode. For quad-rail-lattice macronode cluster states, whose construction is defined by a fixed, low-depth beam splitter network, we show that a Clifford gate and GKP error correction can be simultaneously implemented in a single teleportation step. We give explicit recipes to realize the Clifford generating set, and we calculate the logical gate-error rates given finite squeezing in the cluster-state and GKP resources. We find that logical error rates of ${10}^{\ensuremath{-}2}$--${10}^{\ensuremath{-}3}$, compatible with the thresholds of topological codes, can be achieved with squeezing of 11.9--13.7 dB. The protocol presented eliminates noise present in prior schemes and puts the required squeezing for fault tolerance in the range of current state-of-the-art optical experiments. Finally, we show how to produce distillable GKP magic states directly within the cluster state.
Due to its unique scalability potential, continuous-variable quantum optics is a promising platform for large-scale quantum computing. In particular, very large cluster states with a two-dimensional topology that are suitable for universal quantum computing and quantum simulation can be readily generated in a deterministic manner, and routes towards fault tolerance via bosonic quantum error correction are known. In this article we propose a complete measurement-based quantum computing architecture for the implementation of a universal set of gates on the recently generated two-dimensional cluster states [M. V. Larsen et al., Science 366, 369 (2019); W. Asavanant et al., Science 366, 373 (2019)]. We analyze the performance of the various quantum gates that are executed in these cluster states as well as in other two-dimensional cluster states (the bilayer-square lattice and quad-rail lattice cluster states [R. N. Alexander et al., Phys. Rev. A 94, 032327 (2016); N. C. Menicucci, Phys. Rev. A 83, 062314 (2011)]) by estimating and minimizing the associated stochastic noise addition as well as the resulting gate error probability. We compare the four different states and find that, although they all allow for universal computation, the quad-rail lattice cluster state performs better than the other three states, which all exhibit similar performance.
The integration of diverse quantum resources and the exploitation of more degrees of freedom provide key operational flexibility for universal fault-tolerant quantum computation. In this work, we propose a flexible Gottesman-Kitaev-Preskill-state-embedded fault-tolerant quantum computation architecture based on a three-dimensional cluster state constructed in polarization, frequency, and orbital angular momentum domains. Specifically, we design optical entanglement generators to produce three diverse entangled pairs, and subsequently construct a three-dimensional cluster state via a beam-splitter network with several time delays. Furthermore, we present a partially squeezed surface-GKP code to achieve fault-tolerant quantum computation and ultimately find the optimal choice of implementing the squeezing gate to give the best fault-tolerant performance (the fault-tolerant squeezing threshold is 11.5 dB). Our scheme is flexible, scalable, and experimentally feasible, providing versatile options for future optical fault-tolerant quantum computation architecture.
Entanglement is the key resource for measurement-based quantum computing. It is stored in quantum states known as cluster states, which are prepared offline and enable quantum computing by means of purely local measurements. Universal quantum computing requires cluster states that are both large and possess (at least) a two-dimensional topology. Continuous-variable cluster states-based on bosonic modes rather than qubits-have previously been generated on a scale exceeding one million modes, but only in one dimension. Here, we report generation of a large-scale two-dimensional continuous-variable cluster state. Its structure consists of a 5- by 1240-site square lattice that was tailored to our highly scalable time-multiplexed experimental platform. It is compatible with Bosonic error-correcting codes that, with higher squeezing, enable fault-tolerant quantum computation.