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

Physical Review A

Qumode fusion for continuous-variable cluster states

Jun Xin

Published Aug 8, 2023• 1 citation
Publisher

Abstract

The quantum fusion technique enables the bonding of two cluster states together, and therefore provides a promising method to grow large-scale cluster states. Quantum fusion was first proposed in a discrete-variable regime. In terms of the resource usage, quantum fusion can be divided into two categories, which are type-I and type-II fusions. Type-I fusion consumes one qubit in the fusion procedure, while type-II consumes two qubits. However, for continuous-variable (CV) analogs, concrete schemes for realizing quantum fusions of cluster states with arbitrary topologies have not been shown yet. In this paper, we present the CV analog of quantum fusion schemes. We show that CV type-I fusion can be realized by an ancilla and two quantum nondemolition interactions, and CV type-II fusion can be realized by an entanglement swapping scheme. With finite squeezing considered, we analyze the extra errors added by the fusion procedures in CV cluster-state quantum computation. Our schemes are universal and can be generalized to fuse cluster states with arbitrary topologies.

DOI
10.1103/physreva.108.022406

Related papers

Generalized type-II fusion of cluster states

Noam Rimock, Khen Cohen, Yaron Oz

Measurement based quantum computation is a quantum computing paradigm that employs single-qubit measurements performed on an entangled resource state in the form of a cluster state. A basic ingredient in the construction of the resource state is the type-II fusion procedure, which probabilistically merges two separate photonic cluster states by a quantum measurement. We generalize the type-II fusion procedure by generalizing the measurement setup, and classify the resulting final states, which also include cluster states up to single-qubit rotations. We prove that the probability for the success of the generalized type-II fusion is bounded by fifty percent, and classify all the possibilities to saturate the bound. We analyze the enhancement of the fusion success probability above the fifty percent bound, by the reduction of the entanglement entropy of the resulting state. We prove that the only states that can be obtained with a hundred percent probability of success, are product states.

arXiv:2406.15666•Physical Review A•Dec 5, 2025•2 citations

Cluster States from Gaussian States: Essential Diagnostic Tools for Continuous-Variable One-Way Quantum Computing

Carlos González-Arciniegas, P. Nussenzveig, M. Martinelli +1 more

Continuous-variable (CV) cluster states are a universal quantum computing platform that has experimentally outscaled qubit platforms by orders of magnitude.Room-temperature implementation of CV cluster states has been achieved with quantum optics by using multimode squeezed Gaussian states.It has also been proven that fault tolerance thresholds for CV quantum computing can be reached at realistic squeezing levels.In this paper, we show that standard approaches to design and characterize CV cluster states can miss entanglement present in the system.Such hidden entanglement may be used to increase the power of a quantum computer but it can also, if undetected, hinder the successful implementation of a quantum algorithm.By a detailed analysis of the structure of Gaussian states, we derive an algorithm that reveals hidden entanglement in an arbitrary Gaussian state and optimizes its use for one-way quantum computing.

arXiv:1912.06463•PRX Quantum•Sep 13, 2021•11 citations

Are all Gaussian states also cluster states? Detecting hidden continuous-variable entanglement

Carlos González-Arciniegas, P. Nussenzveig, M. Martinelli +1 more

Continuous-variable (CV) cluster states are a universal quantum computing platform that has experimentally out-scaled qubit platforms by orders of magnitude. The implementation of CV cluster states uses multimode squeezed Gaussian states and fault tolerance thresholds for CV quantum computing have been predicted for realistic squeezing. An outstanding question has been whether any Gaussian state can be expressed as a cluster state. We show here that Gaussian states can present hidden entanglement, which is not captured by the corresponding cluster state graph and therefore invalidates this graph. Hidden entanglement vanishes in the infinite squeezing limit, which should therefore be used with extreme caution. We derive a general procedure to detect hidden entanglement in an arbitrary Gaussian state and validate it as a CV cluster state. These results are relevant to all experimental implementations of CV cluster states to date.

•Dec 13, 2019•0 citations

Hidden qubit cluster states

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

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.

arXiv:2103.11556•Physical Review A•Jul 30, 2021•12 citations

Continuous-variable quantum computing in the quantum optical frequency comb

Olivier Pfister

Abstract This topical review introduces the theoretical and experimental advances in continuous-variable (CV)—i.e. qumode-based in lieu of qubit-based—large-scale, fault-tolerant quantum computing and quantum simulation. An introduction to the physics and mathematics of multipartite entangled CV cluster states is given, and their connection to experimental concepts is delineated. Paths toward fault tolerance are also presented. It is the hope of the author that this review attract more contributors to the field and promote its extension to the promising technology of integrated quantum photonics.

arXiv:1907.09832•Journal of Physics B Atomic Molecular and Optical Physics•Oct 29, 2019•124 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•476 citations
The quantum fusion technique enables the bonding of two cluster states together, and therefore provides a promising method to grow large-scale cluster states. Quantum fusion was first proposed in a discrete-variable regime. In terms of the resource usage, quantum fusion can be divided into two categories, which are type-I and type-II fusions. Type-I fusion consumes one qubit in the fusion procedure, while type-II consumes two qubits. However, for continuous-variable (CV) analogs, concrete schemes for realizing quantum fusions of cluster states with arbitrary topologies have not been shown yet. In this paper, we present the CV analog of quantum fusion schemes. We show that CV type-I fusion can be realized by an ancilla and two quantum nondemolition interactions, and CV type-II fusion can be realized by an entanglement swapping scheme. With finite squeezing considered, we analyze the extra errors added by the fusion procedures in CV cluster-state quantum computation. Our schemes are universal and can be generalized to fuse cluster states with arbitrary topologies.
Measurement based quantum computation is a quantum computing paradigm that employs single-qubit measurements performed on an entangled resource state in the form of a cluster state. A basic ingredient in the construction of the resource state is the type-II fusion procedure, which probabilistically merges two separate photonic cluster states by a quantum measurement. We generalize the type-II fusion procedure by generalizing the measurement setup, and classify the resulting final states, which also include cluster states up to single-qubit rotations. We prove that the probability for the success of the generalized type-II fusion is bounded by fifty percent, and classify all the possibilities to saturate the bound. We analyze the enhancement of the fusion success probability above the fifty percent bound, by the reduction of the entanglement entropy of the resulting state. We prove that the only states that can be obtained with a hundred percent probability of success, are product states.
Continuous-variable (CV) cluster states are a universal quantum computing platform that has experimentally outscaled qubit platforms by orders of magnitude.Room-temperature implementation of CV cluster states has been achieved with quantum optics by using multimode squeezed Gaussian states.It has also been proven that fault tolerance thresholds for CV quantum computing can be reached at realistic squeezing levels.In this paper, we show that standard approaches to design and characterize CV cluster states can miss entanglement present in the system.Such hidden entanglement may be used to increase the power of a quantum computer but it can also, if undetected, hinder the successful implementation of a quantum algorithm.By a detailed analysis of the structure of Gaussian states, we derive an algorithm that reveals hidden entanglement in an arbitrary Gaussian state and optimizes its use for one-way quantum computing.
Continuous-variable (CV) cluster states are a universal quantum computing platform that has experimentally out-scaled qubit platforms by orders of magnitude. The implementation of CV cluster states uses multimode squeezed Gaussian states and fault tolerance thresholds for CV quantum computing have been predicted for realistic squeezing. An outstanding question has been whether any Gaussian state can be expressed as a cluster state. We show here that Gaussian states can present hidden entanglement, which is not captured by the corresponding cluster state graph and therefore invalidates this graph. Hidden entanglement vanishes in the infinite squeezing limit, which should therefore be used with extreme caution. We derive a general procedure to detect hidden entanglement in an arbitrary Gaussian state and validate it as a CV cluster state. These results are relevant to all experimental implementations of CV cluster states to date.
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.
Abstract This topical review introduces the theoretical and experimental advances in continuous-variable (CV)—i.e. qumode-based in lieu of qubit-based—large-scale, fault-tolerant quantum computing and quantum simulation. An introduction to the physics and mathematics of multipartite entangled CV cluster states is given, and their connection to experimental concepts is delineated. Paths toward fault tolerance are also presented. It is the hope of the author that this review attract more contributors to the field and promote its extension to the promising technology of integrated quantum photonics.
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.