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.
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.
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.
We discuss the potential and limitations of Gaussian cluster states for measurement-based quantum computing. Using a framework of Gaussian-projected entangled pair states, we show that no matter what Gaussian local measurements are performed on systems distributed on a general graph, transport and processing of quantum information are not possible beyond a certain influence region, except for exponentially suppressed corrections. We also demonstrate that even under arbitrary non-Gaussian local measurements, slabs of Gaussian cluster states of a finite width cannot carry logical quantum information, even if sophisticated encodings of qubits in continuous-variable systems are allowed for. This is proven by suitably contracting tensor networks representing infinite-dimensional quantum systems. The result can be seen as sharpening the requirements for quantum error correction and fault tolerance for Gaussian cluster states and points toward the necessity of non-Gaussian resource states for measurement-based quantum computing. The results can equally be viewed as referring to Gaussian quantum repeater networks.
Quantum computation presents incomparable advantages over classical computer in solving some complex problems. To realize large-scale quantum computation, it is required to establish a hardware platform that is universal, scalable and fault tolerant. Continuous-variable optical system, which has unique advantages, is a feasible way to realize large-scale quantum computation and has attracted much attention in recent years. Measurement-based continuous-variable quantum computation realizes the computation by performing the measurement and feedforward of measurement results in large-scale Gaussian cluster states, and it provides an efficient method to realize quantum computation. Quantum error correction is an important part in quantum computation and quantum communication to protect quantum information. This review briefly introduces the basic principles and research advances in one-way quantum computation based on cluster states, quantum computation based on optical Schrödinger cat states and quantum error correction with continuous variables, and discusses the problems and challenges that the continuous-variable quantum computation is facing.
We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear optics, and homodyne detection. For universal quantum computation, a nonlinear element is required. This can be satisfied by adding to the toolbox any single-mode non-Gaussian measurement, while the initial cluster state itself remains Gaussian. Homodyne detection alone suffices to perform an arbitrary multimode Gaussian transformation via the cluster state. We also propose an experiment to demonstrate cluster-based error reduction when implementing Gaussian operations.
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.
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.