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

Hidden qubit cluster states

Giacomo Pantaleoni, Ben Q. Baragiola, Nicolas C. Menicucci

Published Jul 30, 2021• 13 citations
arXivHTMLPDF

Abstract

Continuous-variable cluster states (CVCSs) can be supplemented with Gottesman-Kitaev-Preskill (GKP) states to form a hybrid cluster state with the power to execute universal, fault-tolerant quantum computing in a measurement-based fashion. As the resource states that comprise a hybrid cluster state are of a very different nature, a natural question arises: Why do GKP states interface so well with CVCSs? To answer this question, we apply the recently introduced subsystem decomposition of a bosonic mode, which divides a mode into logical and gauge-mode subsystems, to three types of cluster state: CVCSs, GKP cluster states, and hybrid continuous-variable (CV)-GKP cluster states. We find that each of these contains a ``hidden'' qubit cluster state across their logical subsystems, which lies at the heart of their utility for measurement-based quantum computing. To complement the analytical approach, we introduce a simple graphical description of these CV-mode cluster states that depicts precisely how the hidden qubit cluster states are entangled with the gauge modes, and we outline how these results would extend to the case of finitely squeezed states. This work provides important insight that is both conceptually satisfying and helps to address important practical issues like when a simpler resource (such as a Gaussian state) can stand in for a more complex one (like a GKP state), leading to more efficient use of the resources available for CV quantum computing.

DOI
10.1103/physreva.104.012431

Related papers

Subsystem analysis of continuous-variable resource states

Giacomo Pantaleoni, Ben Q. Baragiola, Nicolas C. Menicucci

Continuous-variable (CV) cluster states are a universal resource for fault-tolerant quantum computation when supplemented with the Gottesman-Kitaev-Preskill (GKP) bosonic code. We generalize the recently introduced subsystem decomposition of a bosonic mode [G. Pantaleoni et al., Phys. Rev. Lett. 125, 040501 (2020)], and we use it to analyze CV cluster-state quantum computing with GKP states. Specifically, we decompose squeezed-vacuum states and approximate GKP states to reveal their encoded logical information, and we decompose several gates crucial to CV cluster-state quantum computing. Then, we use the subsystem decomposition to quantify damage to the logical information in approximate GKP states teleported through noisy CV cluster states. Each of these studies uses the subsystem decomposition to circumvent complications arising from the full CV nature of the mode in order to focus on the encoded qubit information.

arXiv:2102.10500•Physical Review A•Jul 30, 2021•20 citations

Equivalent noise properties of scalable continuous-variable cluster states

Blayney W. Walshe, Rafael N. Alexander, Takaya Matsuura +2 more

Optical continuous-variable cluster states (CVCSs) in combination with Gottesman-Kitaev-Preskill (GKP) qubits enable fault-tolerant quantum computation so long as these resources are of high enough quality. Previous studies concluded that a particular CVCS, the quad rail lattice (QRL), exhibits a lower GKP gate-error rate than others do. We show in this work that many other experimentally accessible CVCSs also achieve this level of performance by identifying operational equivalences to the QRL. Under this equivalence, the GKP Clifford gate set for each CVCS maps straightforwardly from that of the QRL, inheriting its noise properties. Furthermore, each cluster state has at its heart a balanced four-splitter---the four-mode extension to a balanced beam splitter. We classify all four-splitters, show they form a single equivalence class under SWAP and parity operators, and give a construction of any four-splitter with linear optics, thus extending the toolbox for theoretical and experimental cluster-state design and analysis.

arXiv:2305.11630•Physical Review A•Oct 6, 2023•6 citations

Complexity phase transition for continuous-variable cluster state

Byeongseon Go, Hyunseok Jeong, Changhun Oh

Continuous-variable (CV) cluster states offer a promising platform for large-scale measurement-based quantum computations (MBQC). However, finite squeezing inevitably introduces Gaussian noise during MBQC. While fault-tolerant MBQC schemes exist in principle, they require the scalable incorporation of non-Gaussian resources, such as GKP states, which remain experimentally challenging. Consequently, a central question at this stage is how finite squeezing fundamentally constrains the intrinsic computational power of CV cluster states themselves. In this work, we address this question by analyzing the classical complexity of measurement-based linear optics (MBLO) implemented with such states, motivated by its near-term feasibility and recent experimental progress. We develop an explicit MBLO framework and examine how the squeezing level governs the complexity of the classical simulation of the resulting output states. Specifically, we identify squeezing-level thresholds that delineate classically tractable and intractable regimes, thereby revealing a squeezing-driven complexity phase transition. These findings advance our understanding of the squeezing resources necessary for meaningful quantum computation in current experimental regimes. Furthermore, they underscore the critical need to either scale the squeezing level or integrate error-correction schemes to achieve reliable, large-scale quantum computation with CV cluster states.

quant-pharXiv:2604.07804•Physical Review Research•Apr 10, 2026•0 citations

Modular Bosonic Subsystem Codes

Giacomo Pantaleoni, Ben Q. Baragiola, Nicolas C. Menicucci

We introduce a framework to decompose a bosonic mode into two virtual subsystems-a logical qubit and a gauge mode. This framework allows the entire toolkit of qubit-based quantum information to be applied in the continuous-variable setting. We give a detailed example based on a modular decomposition of the position basis and apply it in two situations. First, we decompose Gottesman-Kitaev-Preskill grid states and find that the encoded logical state can be damaged due to entanglement with the gauge mode. Second, we identify and disentangle qubit cluster states hidden inside of Gaussian continuous-variable cluster states.

arXiv:1907.08210•Physical Review Letters•Jul 24, 2020•62 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•124 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
Continuous-variable cluster states (CVCSs) can be supplemented with Gottesman-Kitaev-Preskill (GKP) states to form a hybrid cluster state with the power to execute universal, fault-tolerant quantum computing in a measurement-based fashion. As the resource states that comprise a hybrid cluster state are of a very different nature, a natural question arises: Why do GKP states interface so well with CVCSs? To answer this question, we apply the recently introduced subsystem decomposition of a bosonic mode, which divides a mode into logical and gauge-mode subsystems, to three types of cluster state: CVCSs, GKP cluster states, and hybrid continuous-variable (CV)-GKP cluster states. We find that each of these contains a ``hidden'' qubit cluster state across their logical subsystems, which lies at the heart of their utility for measurement-based quantum computing. To complement the analytical approach, we introduce a simple graphical description of these CV-mode cluster states that depicts precisely how the hidden qubit cluster states are entangled with the gauge modes, and we outline how these results would extend to the case of finitely squeezed states. This work provides important insight that is both conceptually satisfying and helps to address important practical issues like when a simpler resource (such as a Gaussian state) can stand in for a more complex one (like a GKP state), leading to more efficient use of the resources available for CV quantum computing.
Continuous-variable (CV) cluster states are a universal resource for fault-tolerant quantum computation when supplemented with the Gottesman-Kitaev-Preskill (GKP) bosonic code. We generalize the recently introduced subsystem decomposition of a bosonic mode [G. Pantaleoni et al., Phys. Rev. Lett. 125, 040501 (2020)], and we use it to analyze CV cluster-state quantum computing with GKP states. Specifically, we decompose squeezed-vacuum states and approximate GKP states to reveal their encoded logical information, and we decompose several gates crucial to CV cluster-state quantum computing. Then, we use the subsystem decomposition to quantify damage to the logical information in approximate GKP states teleported through noisy CV cluster states. Each of these studies uses the subsystem decomposition to circumvent complications arising from the full CV nature of the mode in order to focus on the encoded qubit information.
Optical continuous-variable cluster states (CVCSs) in combination with Gottesman-Kitaev-Preskill (GKP) qubits enable fault-tolerant quantum computation so long as these resources are of high enough quality. Previous studies concluded that a particular CVCS, the quad rail lattice (QRL), exhibits a lower GKP gate-error rate than others do. We show in this work that many other experimentally accessible CVCSs also achieve this level of performance by identifying operational equivalences to the QRL. Under this equivalence, the GKP Clifford gate set for each CVCS maps straightforwardly from that of the QRL, inheriting its noise properties. Furthermore, each cluster state has at its heart a balanced four-splitter---the four-mode extension to a balanced beam splitter. We classify all four-splitters, show they form a single equivalence class under SWAP and parity operators, and give a construction of any four-splitter with linear optics, thus extending the toolbox for theoretical and experimental cluster-state design and analysis.
Continuous-variable (CV) cluster states offer a promising platform for large-scale measurement-based quantum computations (MBQC). However, finite squeezing inevitably introduces Gaussian noise during MBQC. While fault-tolerant MBQC schemes exist in principle, they require the scalable incorporation of non-Gaussian resources, such as GKP states, which remain experimentally challenging. Consequently, a central question at this stage is how finite squeezing fundamentally constrains the intrinsic computational power of CV cluster states themselves. In this work, we address this question by analyzing the classical complexity of measurement-based linear optics (MBLO) implemented with such states, motivated by its near-term feasibility and recent experimental progress. We develop an explicit MBLO framework and examine how the squeezing level governs the complexity of the classical simulation of the resulting output states. Specifically, we identify squeezing-level thresholds that delineate classically tractable and intractable regimes, thereby revealing a squeezing-driven complexity phase transition. These findings advance our understanding of the squeezing resources necessary for meaningful quantum computation in current experimental regimes. Furthermore, they underscore the critical need to either scale the squeezing level or integrate error-correction schemes to achieve reliable, large-scale quantum computation with CV cluster states.
We introduce a framework to decompose a bosonic mode into two virtual subsystems-a logical qubit and a gauge mode. This framework allows the entire toolkit of qubit-based quantum information to be applied in the continuous-variable setting. We give a detailed example based on a modular decomposition of the position basis and apply it in two situations. First, we decompose Gottesman-Kitaev-Preskill grid states and find that the encoded logical state can be damaged due to entanglement with the gauge mode. Second, we identify and disentangle qubit cluster states hidden inside of Gaussian continuous-variable cluster states.
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 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.