Continuous-variable Cluster States Research Articles

Ultra-large-scale continuous-variable cluster states multiplexed in the time domain

Quantum computers promise ultrafast performance of certain tasks. Experimentally appealing, measurement-based quantum computation (MBQC) requires an entangled resource called a cluster state, with long computations requiring large cluster states. Previously, the largest cluster state consisted of 8 photonic qubits or light modes, while the largest multipartite entangled state of any sort involved 14 trapped ions. These implementations involve quantum entities separated in space, and in general, each experimental apparatus is used only once. Here, we circumvent this inherent inefficiency by multiplexing light modes in the time domain. We deterministically generate and fully characterise a continuous-variable cluster state containing more than 10,000 entangled modes. This is, by 3 orders of magnitude, the largest entangled state ever created to date. The entangled modes are individually addressable wavepackets of light in two beams. Furthermore, we present an efficient scheme for MBQC on this cluster state based on sequential applications of quantum teleportation.

Quantum secret sharing with continuous-variable cluster states

We extend the formalism of cluster state quantum secret sharing, as presented in Markham and Sanders [Phys. Rev. A 78, 042309 (2008)] and Keet et al. [Phy. Rev. A 82, 062315 (2010)], to the continuous-variable regime. We show that both classical and quantum information can be shared by distributing continuous-variable cluster states through either public or private channels. We find that the adversary structure is completely denied from the secret if the cluster state is infinitely squeezed, but some secret information would be leaked if a realistic finitely squeezed state is employed. We suggest benchmarks to evaluate the security in the finitely squeezed cases. For the sharing of classical secrets, we borrow techniques from the continuous-variable quantum key distribution to compute the secret sharing rate. For the sharing of quantum states, we estimate the amount of entanglement distilled for teleportation from each cluster state.

Compact Gaussian quantum computation by multi-pixel homodyne detection

We study the possibility of producing and detecting continuous variable cluster states in an extremely compact optical setup. This method is based on a multi-pixel homodyne detection system recently demonstrated experimentally, which includes classical data post-processing. It allows the incorporation of the linear optics network, usually employed in standard experiments for the production of cluster states, in the stage of the measurement. After giving an example of cluster state generation by this method, we further study how this procedure can be generalized to perform Gaussian quantum computation.

Creation of four-mode weighted cluster states with atomic ensembles in high-Q ring cavities

Two schemes for the preparation of weighted continuous variable cluster states with four atomic ensembles are proposed. In the first scheme, the four separated atomic ensembles inside a two-mode ring cavity are driven by pulse laser fields. The basic idea of the scheme is to transfer the ensemble bosonic modes into suitable linear combinations that can be prepared in a pure cluster state by a sequential application of the laser pulses with the aid of the cavity dissipation. In the second one, we take two separate two-mode cavities, each containing two atomic ensembles. The distant cavities are coupled by dissipation in a cascade way. It has been found that the mixed cluster state can be produced. These schemes may contribute towards implementing continuous variable quantum computation, quantum communication and networking based on atomic ensembles.

Multipartite polariton entanglement in semiconductor microcavities

We study the entanglement of multiple polariton modes, which results in continuous variable cluster states suitable for quantum computation. Schemes are based on parametric scattering between spin-polarized lower and upper polariton branches in planar microcavities or spin-polarized orbital angular momentum states in mesa structures. Such systems are modeled by numerical solution of truncated density matrices and compared to the solution of the Heisenberg equations for the set of field correlators up to third order. Four-body entanglement is evidenced by violation of the van Loock-Furusawa quadripartite inequalities. We show that the entanglement is able to withstand a realistic strength of pure dephasing present in typical systems.

Temporal-mode continuous-variable cluster states using linear optics

I present an extensible experimental design for optical continuous-variable cluster states of arbitrary size using four offline (vacuum) squeezers and six beamsplitters. This method has all the advantages of a temporal-mode encoding [Phys. Rev. Lett. 104, 250503], including finite requirements for coherence and stability even as the computation length increases indefinitely, with none of the difficulty of inline squeezing. The extensibility stems from a construction based on Gaussian projected entangled pair states (GPEPS). The potential for use of this design within a fully fault tolerant model is discussed.

Graphical calculus for Gaussian pure states

We provide a unified graphical calculus for all Gaussian pure states, including graph transformation rules for all local and semi-local Gaussian unitary operations, as well as local quadrature measurements. We then use this graphical calculus to analyze continuous-variable (CV) cluster states, the essential resource for one-way quantum computing with CV systems. Current graphical approaches to CV cluster states are only valid in the unphysical limit of infinite squeezing, and the associated graph transformation rules only apply when the initial and final states are of this form. Our formalism applies to all Gaussian pure states and subsumes these rules in a natural way. In addition, the term "CV graph state" currently has several inequivalent definitions in use. Using this formalism we provide a single unifying definition that encompasses all of them. We provide many examples of how the formalism may be used in the context of CV cluster states: defining the "closest" CV cluster state to a given Gaussian pure state and quantifying the error in the approximation due to finite squeezing; analyzing the optimality of certain methods of generating CV cluster states; drawing connections between this new graphical formalism and bosonic Hamiltonians with Gaussian ground states, including those useful for CV one-way quantum computing; and deriving a graphical measure of bipartite entanglement for certain classes of CV cluster states. We mention other possible applications of this formalism and conclude with a brief note on fault tolerance in CV one-way quantum computing.

Bipartite entanglement in continuous variable cluster states

A study of the entanglement properties of Gaussian cluster states, proposed as a universal resource for continuous variable (CV) quantum computing is presented in this paper. The central aim is to compare mathematically idealized cluster states defined using quadrature eigenstates, which have infinite squeezing and cannot exist in nature, with Gaussian approximations that are experimentally accessible. Adopting widely used definitions, we first review the key concepts, by analysing a process of teleportation along a CV quantum wire in the language of matrix product states. Next we consider the bipartite entanglement properties of the wire, providing analytic results. We proceed to grid cluster states, which are universal for the qubit case. To extend our analysis of the bipartite entanglement, we adopt the entropic-entanglement width, a specialized entanglement measure introduced recently by Van den Nest et al (2006 Phys. Rev. Lett.97 150504), adapting their definition to the CV context. Finally, we consider the effects of photonic loss, extending our arguments to mixed states. Cumulatively our results point to key differences in the properties of idealized and Gaussian cluster states. Even modest loss rates are found to strongly limit the amount of entanglement. We discuss the implications for the potential of CV analogues for measurement-based quantum computation.

Demonstration of cluster-state shaping and quantum erasure for continuous variables

We demonstrate experimentally how to remove an arbitrary node from a continuous-variable cluster state and how to shorten any quantum wires of such a state. These two basic operations, performed in an unconditional fashion, are a manifestation of quantum erasure and can be employed to obtain various graph states from an initial cluster state. Starting with a sufficiently large cluster, the resulting graph states can then be used for universal quantum information processing. In the experiment, all variations of this cluster-shaping are demonstrated on a four-mode linear cluster state through homodyne measurements and feedforward.

Arbitrarily Large Continuous-Variable Cluster States from a Single Quantum Nondemolition Gate

We present a compact experimental design for producing an arbitrarily large optical continuous-variable cluster state using just one single-mode vacuum squeezer and one quantum nondemolition gate. Generating the cluster state and computing with it happen simultaneously: more entangled modes become available as previous modes are measured, thereby making finite the requirements for coherence and stability even as the computation length increases indefinitely.

Quantum computing with continuous-variable clusters

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.

The optical frequency comb as a one-way quantum computer

In the one-way model of quantum computing, quantum algorithms are implemented using only measurements on an entangled initial state. Much of the hard work is done upfront when creating this universal resource, known as a cluster state, on which the measurements are made. Here we detail a new proposal for a scalable method of creating cluster states using only a single multimode optical parametric oscillator (OPO). The method generates a continuous-variable cluster state that is universal for quantum computation and encoded in the quadratures of the optical frequency comb of the OPO. This work expands on the presentation in Menicucci, Flammia and Pfister (2008 Phys. Rev. Lett. 101, 130501).

Quantum logical gates with linear quadripartite cluster states of continuous variables

The concrete schemes to realize three types of basic quantum logical gates using linear quadripartite cluster states of optical continuous variables are proposed. The influences of noises and finite squeezing on the computation precision are analyzed in terms of the fidelity of propagated quantum information through the continuous variable cluster states. The proposed schemes provide direct references for the design of experimental systems implementing quantum computation with the cluster entanglement of amplitude and phase quadratures of light.

Weighing matrices and optical quantum computing

Quantum computation in the one-way model requires the preparation of certain resource states known as cluster states. We describe how the construction of continuous-variable cluster states for optical quantum computing relate to the existence of certain families of matrices. The relevant matrices are known as weighing matrices, with a few additional constraints. We prove some results regarding the structure of these matrices, and their associated graphs.

One-Way Quantum Computing in the Optical Frequency Comb

One-way quantum computing allows any quantum algorithm to be implemented easily using just measurements. The difficult part is creating the universal resource, a cluster state, on which the measurements are made. We propose a scalable method that uses a single, multimode optical parametric oscillator (OPO). The method is very efficient and generates a continuous-variable cluster state, universal for quantum computation, with quantum information encoded in the quadratures of the optical frequency comb of the OPO.

Experimental generation of four-mode continuous-variable cluster states

Continuous-variable Gaussian cluster states are a potential resource for universal quantum computation. They can be efficiently and unconditionally built from sources of squeezed light using beam splitters. Here we report on the generation of three different kinds of continuous-variable four-mode cluster states. In our realization, the resulting cluster-type correlations are such that no corrections other than simple phase-space displacements would be needed when quantum information propagates through these states. At the same time, the inevitable imperfections from the finitely squeezed resource states and from additional thermal noise are minimized, as no antisqueezing components are left in the cluster states.

Entangling the optical frequency comb: Simultaneous generation of multiple 2 × 2 and 2 × 3 continuous-variable cluster states in a single optical parametric oscillator

We report on our research effort to generate large-scale multipartite optical-mode entanglement using as few physical resources as possible. We have previously shown that cluster- and GHZ-type N-partite continuous-variable entanglement can be obtained in an optical resonator that contains a suitably designed second-order nonlinear optical medium, pumped by at most O(N^2) fields. In this paper, we show that the frequency comb of such a resonator can be entangled into an arbitrary number of independent 2x2 and 2x3 continuous-variable cluster states by a single optical parametric oscillator pumped by just a few optical modes.

Ultracompact generation of continuous-variable cluster states

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.

Examples of Gaussian cluster computation

We give simple examples that illustrate the principles of one-way quantum computation using Gaussian continuous-variable cluster states. In these examples, we only consider single-mode evolutions, realizable via linear clusters. In particular, we focus on Gaussian single-mode transformations performed through the cluster state. Our examples highlight the differences between cluster-based schemes and protocols in which special quantum states are prepared off-line and then used as a resource for the on-line computation.

Universal Quantum Computation with Continuous-Variable Cluster States

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.