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

Towards universal quantum computation in continuous-variable systems

Darran F. Milne

In this thesis we explore the possibility of creating continuousvariable \nquantum systems that are capable of supporting universal \nquantum computation. We begin by examining the measurement-based \nmodel, which employs sequences of measurements on highly entangled \nresource states, known as a cluster states. We suggest a method for \nthe construction of Gaussian cluster states based on ensembles of atoms \nand quantum non-demolition interactions. We then go on to expand \nour model to allow for the inclusion of light modes as part of the cluster. \nThis yields a new class of states, the composite cluster states. \nThis leads us to propose a new architecture for the measurement-based \nmodel that uses these composite clusters to increase resource e ciency \nand reduce computational errors. \nThe second part of this thesis concerns topological quantum computation. \nIn states exhibiting topological degrees of freedom, quantum \ninformation can be stored as a non-local property of the physical system \nand manipulated by braiding quasiparticles known as anyons. Here \nwe show how these ideas can be extended to continuous variables. We \nestablish a continuous variable analogue of the Kitaev toric code, show \nthat excitations correspond to continuous versions of Abelian anyons \nand investigate their behaviour under the condition of nite squeezing \nof the resource state. \nFinally, we expand our continuous variable topological model to \ninclude non-abelian excitations by constructing superpositions of CV \ntoric code anyons. We derive the fusion and braiding behaviour of \nthese non-abelian excitations and nd that they correspond to a CV \nanalog of Ising anyons. Using these resources, we go on to suggest \na computational scheme that encodes qubits within the fusion spaces \nof the CV Ising anyons and derive one- and two-qubit quantum gates \noperations that are implemented in a topological manner.

•Nov 30, 2012•1 citation

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•10 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•15 citations

Ultracompact generation of continuous-variable cluster states

Nicolas C. Menicucci, Steven T. Flammia, Hussain Zaidi +1 more

We propose an experimental scheme that has the potential for large-scale realization of continuous-variable (CV) cluster states for universal quantum computation. We do this by mapping CV cluster-state graphs onto two-mode squeezing graphs, which can be engineered into a single optical parametric oscillator (OPO). The desired CV cluster state is produced directly from a joint squeezing operation on the vacuum, using a multifrequency pump beam. This method has potential for ultracompact experimental implementation. As an illustration, we detail an experimental proposal for creating a four-mode square CV cluster state with a single OPO.

arXiv:quant-ph/0703096•Physical Review A•Jul 12, 2007•104 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

Implementing Classical Hadamard Transform Algorithm by Continuous Variable Cluster State

Yu Wang, Qi Su

Measurement-based one-way quantum computation, which uses cluster states as resources, provides an efficient model to perform computation. However, few of the continuous variable (CV) quantum algorithms and classical algorithms based on one-way quantum computation were proposed. In this work, we propose a method to implement the classical Hadamard transform algorithm utilizing the CV cluster state. Compared with classical computation, only half operations are required when it is operated in the one-way CV quantum computer. As an example, we present a concrete scheme of four-mode classical Hadamard transform algorithm with a four-partite CV cluster state. This method connects the quantum computer and the classical algorithms, which shows the feasibility of running classical algorithms in a quantum computer efficiently.

Chinese Physics Letters•Jul 1, 2017•1 citation
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.
In this thesis we explore the possibility of creating continuousvariable \nquantum systems that are capable of supporting universal \nquantum computation. We begin by examining the measurement-based \nmodel, which employs sequences of measurements on highly entangled \nresource states, known as a cluster states. We suggest a method for \nthe construction of Gaussian cluster states based on ensembles of atoms \nand quantum non-demolition interactions. We then go on to expand \nour model to allow for the inclusion of light modes as part of the cluster. \nThis yields a new class of states, the composite cluster states. \nThis leads us to propose a new architecture for the measurement-based \nmodel that uses these composite clusters to increase resource e ciency \nand reduce computational errors. \nThe second part of this thesis concerns topological quantum computation. \nIn states exhibiting topological degrees of freedom, quantum \ninformation can be stored as a non-local property of the physical system \nand manipulated by braiding quasiparticles known as anyons. Here \nwe show how these ideas can be extended to continuous variables. We \nestablish a continuous variable analogue of the Kitaev toric code, show \nthat excitations correspond to continuous versions of Abelian anyons \nand investigate their behaviour under the condition of nite squeezing \nof the resource state. \nFinally, we expand our continuous variable topological model to \ninclude non-abelian excitations by constructing superpositions of CV \ntoric code anyons. We derive the fusion and braiding behaviour of \nthese non-abelian excitations and nd that they correspond to a CV \nanalog of Ising anyons. Using these resources, we go on to suggest \na computational scheme that encodes qubits within the fusion spaces \nof the CV Ising anyons and derive one- and two-qubit quantum gates \noperations that are implemented in a topological manner.
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.
We propose an experimental scheme that has the potential for large-scale realization of continuous-variable (CV) cluster states for universal quantum computation. We do this by mapping CV cluster-state graphs onto two-mode squeezing graphs, which can be engineered into a single optical parametric oscillator (OPO). The desired CV cluster state is produced directly from a joint squeezing operation on the vacuum, using a multifrequency pump beam. This method has potential for ultracompact experimental implementation. As an illustration, we detail an experimental proposal for creating a four-mode square CV cluster state with a single OPO.
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.
Measurement-based one-way quantum computation, which uses cluster states as resources, provides an efficient model to perform computation. However, few of the continuous variable (CV) quantum algorithms and classical algorithms based on one-way quantum computation were proposed. In this work, we propose a method to implement the classical Hadamard transform algorithm utilizing the CV cluster state. Compared with classical computation, only half operations are required when it is operated in the one-way CV quantum computer. As an example, we present a concrete scheme of four-mode classical Hadamard transform algorithm with a four-partite CV cluster state. This method connects the quantum computer and the classical algorithms, which shows the feasibility of running classical algorithms in a quantum computer efficiently.