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

Measurement-based quantum computation with qubit and continuous-variable systems

Rafael N. Alexander

Published Sep 21, 2016• 0 citations
OpenAlex

Abstract

Quantum computers offer impressive computational speed-ups over their present-day (classical) counterparts. In the measurement-based model, quantum computation is driven by single-site measurements on a large entangled quantum state known as a cluster state. This thesis explores extensions of the measurement-based model for quantum computation in qubit and continuous-variable systems. Within the qubit setting, we consider the task of characterizing how well a small-scale measurement-based quantum device can perform logic gates. We adapt a pre-existing scheme known as randomized benchmarking into the setting of measurement-based quantum computation on a one-dimensional cluster state. A key feature of randomized benchmarking is that it uses random sequences of gates. We show how the intrinsic randomness of measurement-based quantum computation can be harnessed when implementing them. Within the continuous-variable setting, we consider optical cluster states that can be generated with current technology. We propose a compact method for generating universal cluster states based on optical-parametric-oscillator technology. We consider how finite squeezing effects manifest in computation and show that pre-existing measurement-based protocols are suboptimal. We propose new measurement-based protocols that have better noise properties, compactness, and circuit flexibility. As an application, we introduce a measurement-based method for implementing interferometry. In this model, the finite squeezing noise can be dealt with as a photon-loss process. Building further on this work, we investigate the resource requirements of a measurement-based boson-sampling device, proving simultaneous efficiency in time, space, and squeezing (energy) resources. These results offer new insights into how to build, use, and characterize a measurement-based quantum computer.

Related papers

Randomized benchmarking in measurement-based quantum computing

Rafael N. Alexander, Peter S. Turner, Stephen D. Bartlett

Randomized benchmarking is routinely used as an efficient method for characterizing the performance of sets of elementary logic gates in small quantum devices. In the measurement-based model of quantum computation, logic gates are implemented via single-site measurements on a fixed universal resource state. Here we adapt the randomized benchmarking protocol for a single qubit to a linear cluster state computation, which provides partial, yet efficient characterization of the noise associated with the target gate set. Applying randomized benchmarking to measurement-based quantum computation exhibits an interesting interplay between the inherent randomness associated with logic gates in the measurement-based model and the random gate sequences used in benchmarking. We consider two different approaches: the first makes use of the standard single-qubit Clifford group, while the second uses recently introduced (non-Clifford) measurement-based 2-designs, which harness inherent randomness to implement gate sequences.

arXiv:1605.08053•Physical Review A•Sep 1, 2016•18 citations

Efficient measurement-based quantum computing with continuous-variable systems

Matthias Ohliger, Jens Eisert

We present strictly efficient schemes for scalable measurement-based quantum computing using continuous-variable systems: These schemes are based on suitable non-Gaussian resource states, ones that can be prepared using interactions of light with matter systems or even purely optically. Merely Gaussian measurements such as optical homodyning as well as photon counting measurements are required, on individual sites. These schemes overcome limitations posed by Gaussian cluster states, which are known not to be universal for quantum computations of unbounded length, unless one is willing to scale the degree of squeezing with the total system size. We establish a framework derived from tensor networks and matrix product states with infinite physical dimension and finite auxiliary dimension general enough to provide a framework for such schemes. Since in the discussed schemes the logical encoding is finite dimensional, tools of error correction are applicable. We also identify some further limitations for any continuous-variable computing scheme from which one can argue that no substantially easier ways of continuous-variable measurement-based computing than the presented one can exist.

arXiv:1112.2641•Physical Review A•Jun 21, 2012•39 citations

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

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

Physical Realization of Measurement Based Quantum Computation

Muhammad Kashif, Saif M. Al-Kuwari

Quantum computers, leveraging the principles of quantum mechanics, hold the potential to surpass classical computers in numerous applications, with implications across various domains. Besides the well-known gate model, Measurement-based Quantum Computation (MBQC) is another promising computational approach to achieve universal quantum computation. In MBQC, large ensembles of qubits are prepared in a highly entangled cluster state, forming the basis for executing quantum computations through sequential measurements. Cluster states are realized using both continuous variables (CV) and discrete variables (DV) techniques. In the CV-based methods, Frequency Domain Multiplexing (FDM), Time Domain Multiplexing (TDM), Spatial Domain Multiplexing (SDM), and hybrid schemes are employed. This paper thoroughly discusses and compares these approaches, elucidating their strengths and limitations. Additionally, the generation of photonic cluster states in DV is explored and some recent results are reported. Some recent state-of-the-art advancements in photonic and superconducting qubits entanglement, which can potentially serve as cluster states, are also presented. Finally, we highlight the approach that exhibits the most promising characteristics for achieving efficient cluster state realization in the context of MBQC.

arXiv:2301.03022•IEEE Access•Jan 1, 2023•11 citations

Quantum computing with continuous-variable clusters

Mile Gu, Christian Weedbrook, Nicolas C. Menicucci +2 more

Continuous-variable cluster states offer a potentially promising method of implementing a quantum computer. This paper extends and further refines theoretical foundations and protocols for experimental implementation. We give a cluster-state implementation of the cubic phase gate through photon detection, which, together with homodyne detection, facilitates universal quantum computation. In addition, we characterize the offline squeezed resources required to generate an arbitrary graph state through passive linear optics. Most significantly, we prove that there are universal states for which the offline squeezing per mode does not increase with the size of the cluster. Simple representations of continuous-variable graph states are introduced to analyze graph state transformations under measurement and the existence of universal continuous-variable resource states.

arXiv:0903.3233•Physical Review A•Jun 17, 2009•377 citations
Quantum computers offer impressive computational speed-ups over their present-day (classical) counterparts. In the measurement-based model, quantum computation is driven by single-site measurements on a large entangled quantum state known as a cluster state. This thesis explores extensions of the measurement-based model for quantum computation in qubit and continuous-variable systems. Within the qubit setting, we consider the task of characterizing how well a small-scale measurement-based quantum device can perform logic gates. We adapt a pre-existing scheme known as randomized benchmarking into the setting of measurement-based quantum computation on a one-dimensional cluster state. A key feature of randomized benchmarking is that it uses random sequences of gates. We show how the intrinsic randomness of measurement-based quantum computation can be harnessed when implementing them. Within the continuous-variable setting, we consider optical cluster states that can be generated with current technology. We propose a compact method for generating universal cluster states based on optical-parametric-oscillator technology. We consider how finite squeezing effects manifest in computation and show that pre-existing measurement-based protocols are suboptimal. We propose new measurement-based protocols that have better noise properties, compactness, and circuit flexibility. As an application, we introduce a measurement-based method for implementing interferometry. In this model, the finite squeezing noise can be dealt with as a photon-loss process. Building further on this work, we investigate the resource requirements of a measurement-based boson-sampling device, proving simultaneous efficiency in time, space, and squeezing (energy) resources. These results offer new insights into how to build, use, and characterize a measurement-based quantum computer.
Randomized benchmarking is routinely used as an efficient method for characterizing the performance of sets of elementary logic gates in small quantum devices. In the measurement-based model of quantum computation, logic gates are implemented via single-site measurements on a fixed universal resource state. Here we adapt the randomized benchmarking protocol for a single qubit to a linear cluster state computation, which provides partial, yet efficient characterization of the noise associated with the target gate set. Applying randomized benchmarking to measurement-based quantum computation exhibits an interesting interplay between the inherent randomness associated with logic gates in the measurement-based model and the random gate sequences used in benchmarking. We consider two different approaches: the first makes use of the standard single-qubit Clifford group, while the second uses recently introduced (non-Clifford) measurement-based 2-designs, which harness inherent randomness to implement gate sequences.
We present strictly efficient schemes for scalable measurement-based quantum computing using continuous-variable systems: These schemes are based on suitable non-Gaussian resource states, ones that can be prepared using interactions of light with matter systems or even purely optically. Merely Gaussian measurements such as optical homodyning as well as photon counting measurements are required, on individual sites. These schemes overcome limitations posed by Gaussian cluster states, which are known not to be universal for quantum computations of unbounded length, unless one is willing to scale the degree of squeezing with the total system size. We establish a framework derived from tensor networks and matrix product states with infinite physical dimension and finite auxiliary dimension general enough to provide a framework for such schemes. Since in the discussed schemes the logical encoding is finite dimensional, tools of error correction are applicable. We also identify some further limitations for any continuous-variable computing scheme from which one can argue that no substantially easier ways of continuous-variable measurement-based computing than the presented one can exist.
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.
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.
Quantum computers, leveraging the principles of quantum mechanics, hold the potential to surpass classical computers in numerous applications, with implications across various domains. Besides the well-known gate model, Measurement-based Quantum Computation (MBQC) is another promising computational approach to achieve universal quantum computation. In MBQC, large ensembles of qubits are prepared in a highly entangled cluster state, forming the basis for executing quantum computations through sequential measurements. Cluster states are realized using both continuous variables (CV) and discrete variables (DV) techniques. In the CV-based methods, Frequency Domain Multiplexing (FDM), Time Domain Multiplexing (TDM), Spatial Domain Multiplexing (SDM), and hybrid schemes are employed. This paper thoroughly discusses and compares these approaches, elucidating their strengths and limitations. Additionally, the generation of photonic cluster states in DV is explored and some recent results are reported. Some recent state-of-the-art advancements in photonic and superconducting qubits entanglement, which can potentially serve as cluster states, are also presented. Finally, we highlight the approach that exhibits the most promising characteristics for achieving efficient cluster state realization in the context of MBQC.
Continuous-variable cluster states offer a potentially promising method of implementing a quantum computer. This paper extends and further refines theoretical foundations and protocols for experimental implementation. We give a cluster-state implementation of the cubic phase gate through photon detection, which, together with homodyne detection, facilitates universal quantum computation. In addition, we characterize the offline squeezed resources required to generate an arbitrary graph state through passive linear optics. Most significantly, we prove that there are universal states for which the offline squeezing per mode does not increase with the size of the cluster. Simple representations of continuous-variable graph states are introduced to analyze graph state transformations under measurement and the existence of universal continuous-variable resource states.