Quantum computation and error correction based on continuous variable cluster states

Measurement-based quantum computation with continuous variables, which realizes computation by performing measurement and feedforward of measurement results on a large scale Gaussian cluster state, provides a feasible way to implement quantum computation. Quantum error correction is an essential procedure to protect quantum information in quantum computation and quantum communication. In this review, we briefly introduce the progress of measurement-based quantum computation and quantum error correction with continuous variables based on Gaussian cluster states. We also discuss the challenges in the fault-tolerant measurement-based quantum computation with continuous variables.     

Affleck-Kennedy-Lieb-Tasaki state on a honeycomb lattice is a universal quantum computational resource

Universal quantum computation can be achieved by simply performing single-qubit measurements on a highly entangled resource state, such as cluster states. The family of Affleck-Kennedy-Lieb-Tasaki states has recently been intensively explored and shown to provide restricted computation. Here, we show that the two-dimensional Affleck-Kennedy-Lieb-Tasaki state on a honeycomb lattice is a universal resource for measurement-based quantum computation.     

Experimental realization of Deutsch's algorithm in a one-way quantum computer

We report the first experimental demonstration of an all-optical one-way implementation of Deutsch's quantum algorithm on a four-qubit cluster state. All the possible configurations of a balanced or constant function acting on a two-qubit register are realized within the measurement-based model for quantum computation. The experimental results are in excellent agreement with the theoretical model, therefore demonstrating the successful performance of the algorithm.     

Knill-laflamme-milburn linear optics quantum computation as a measurement-based computation

We show that the Knill Lafllame Milburn method of quantum computation with linear optics gates can be interpreted as a one-way, measurement-based quantum computation of the type introduced by Briegel and Raussendorf. We also show that the permanent state of n n-dimensional systems is a universal state for quantum computation.     

Creation of cluster state of four ions in ion-trap system by individual addressing

The cluster state is a special, highly entangled quantum state that forms the universal resource, on which measurement-based quantum computation can be performed. In this study, a new scheme is presented for creating four-ions cluster state in ion-trap system. This scheme is based on resonant sideband excitation in which the population is transferred to target states by precise control of pulse area. Meanwhile, the scheme is consist of combination of elementary stages belonging to a universal set whereby cluster state has been created in five interaction stages by individually addressed ions with red- or blue-sideband resonance laser pulses. The paper studies the population transfer of the system by numerical solutions of the master equation, considering the effect of decoherence channels due to dissipation in the phonon modes. The presented scheme does not require control of the turn-off ratio and time delay among pulses.     

Measurement-Based Quantum Computation and Undecidable Logic

We establish a connection between measurement-based quantum computation and the field of mathematical logic. We show that the computational power of an important class of quantum states called graph states, representing resources for measurement-based quantum computation, is reflected in the expressive power of (classical) formal logic languages defined on the underlying mathematical graphs. In particular, we show that for all graph state resources which can yield a computational speed-up with respect to classical computation, the underlying graphs—describing the quantum correlations of the states—are associated with undecidable logic theories. Here undecidability is to be interpreted in a sense similar to Gödel’s incompleteness results, meaning that there exist propositions, expressible in the above classical formal logic, which cannot be proven or disproven.     

Novel schemes for measurement-based quantum computation

We establish a framework which allows one to construct novel schemes for measurement-based quantum computation. The technique develops tools from many-body physics-based on finitely correlated or projected entangled pair states-to go beyond the cluster-state based one-way computer. We identify resource states radically different from the cluster state, in that they exhibit nonvanishing correlations, can be prepared using nonmaximally entangling gates, or have very different local entanglement properties. In the computational models, randomness is compensated in a different manner. It is shown that there exist resource states which are locally arbitrarily close to a pure state. We comment on the possibility of tailoring computational models to specific physical systems.     

Demonstration of a controlled-phase gate for continuous-variable one-way quantum computation

We experimentally demonstrate a controlled-phase gate for continuous variables using a cluster-state resource of four optical modes. The two independent input states of the gate are coupled with the cluster in a teleportation-based fashion. As a result, one of the entanglement links present in the initial cluster state appears in the two unmeasured output modes as the corresponding entangling gate acting on the input states. The genuine quantum character of this gate becomes manifest and is verified through the presence of entanglement at the output for a product two-mode coherent input state. By combining our gate with the recently reported module for single-mode Gaussian operations [R. Ukai et al., Phys. Rev. Lett. 106, 240504 (2011)], it is possible to implement any multimode Gaussian operation as a fully measurement-based one-way quantum computation.     

Preparation of multipartite entangled states used for quantum information networks

The preparation of multipartite entangled states is the prerequisite for exploring quantum information networks and quantum computation.In this paper,we review the experimental progress in the preparation of cluster states and multi-color entangled states with continuous variables.The preparation of lager scale multipartite entangled state provide valuable quantum resources to implement more complex quantum informational tasks.     

Universal resources for measurement-based quantum computation

We investigate which entanglement resources allow universal measurement-based quantum computation via single-qubit operations. We find that any entanglement feature exhibited by the 2D cluster state must also be present in any other universal resource. We obtain a powerful criterion to assess the universality of graph states by introducing an entanglement measure which necessarily grows unboundedly with the system size for all universal resource states. Furthermore, we prove that graph states associated with 2D lattices such as the hexagonal and triangular lattice are universal, and obtain the first example of a universal nongraph state.     

Thermal states as universal resources for quantum computation with always-on interactions

Measurement-based quantum computation utilizes an initial entangled resource state and proceeds with subsequent single-qubit measurements. It is implicitly assumed that the interactions between qubits can be switched off so that the dynamics of the measured qubits do not affect the computation. By proposing a model spin Hamiltonian, we demonstrate that measurement-based quantum computation can be achieved on a thermal state with always-on interactions. Moreover, computational errors induced by thermal fluctuations can be corrected and thus the computation can be executed fault tolerantly if the temperature is below a threshold value.     

Generation of GHZ state and cluster state with atomic ensembles via the dipole-blockade mechanism

This paper proposes scalable schemes to generate the Greenberger-Horne-Zeilinger (GHZ) state and the cluster state with atomic ensembles via the dipole blockade mechanism on an atom chip, where the qubit is not carried by a single atom but an atomic ensemble. In the protocols, multiqubit entangled states are determinately prepared. Needlessness for single-photon source further decreases the complexity of the experiment. Based on the present laboratory technique, the schemes may be realized. The achieved results reveal a prospect for large-scale quantum communication and quantum computation.     

Implementing Classical Hadamard Transform Algorithm by Continuous Variable Cluster State

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.     

Gapped two-body Hamiltonian for continuous-variable quantum computation

We introduce a family of Hamiltonian systems for measurement-based quantum computation with continuous variables. The Hamiltonians (i) are quadratic, and therefore two body, (ii) are of short range, (iii) are frustration-free, and (iv) possess a constant energy gap proportional to the squared inverse of the squeezing. Their ground states are the celebrated Gaussian graph states, which are universal resources for quantum computation in the limit of infinite squeezing. These Hamiltonians constitute the basic ingredient for the adiabatic preparation of graph states and thus open new venues for the physical realization of continuous-variable quantum computing beyond the standard optical approaches. We characterize the correlations in these systems at thermal equilibrium. In particular, we prove that the correlations across any multipartition are contained exactly in its boundary, automatically yielding a correlation area law.     

Cluster State Entanglement of Semiconductor Quantum Dots Based on Faraday Rotation

We propose a scheme for a large-scale cluster state preparation of single-charged semiconductor quantum dots utilizing Faraday rotation. Without interaction between quantum dots, the exciton induced Faraday rotation could distribute the spatially separate quantum dots into a quantum network assisted by cavity QED. We obtain the corresponding parameters from the numerical simulation based on the input-output process for the required Faraday rotation and some discussion is made in view of experimental feasibility.     

Blind Quantum Signature with Blind Quantum Computation

Blind quantum computation allows a client without quantum abilities to interact with a quantum server to perform a unconditional secure computing protocol, while protecting client’s privacy. Motivated by confidentiality of blind quantum computation, a blind quantum signature scheme is designed with laconic structure. Different from the traditional signature schemes, the signing and verifying operations are performed through measurement-based quantum computation. Inputs of blind quantum computation are securely controlled with multi-qubit entangled states. The unique signature of the transmitted message is generated by the signer without leaking information in imperfect channels. Whereas, the receiver can verify the validity of the signature using the quantum matching algorithm. The security is guaranteed by entanglement of quantum system for blind quantum computation. It provides a potential practical application for e-commerce in the cloud computing and first-generation quantum computation.     

Experimental demonstration of decoherence-free one-way information transfer

We report the experimental demonstration of a one-way quantum protocol reliably operating in the presence of decoherence. Information is protected by designing an appropriate decoherence-free sub-space for a cluster state resource. We demonstrate our scheme in an all-optical setup, encoding the information into the polarization states of four photons. A measurement-based one-way information-transfer protocol is performed with the photons exposed to severe symmetric phase-damping noise. Remarkable protection of information is accomplished, delivering nearly ideal outcomes.     

How good must single photon sources and detectors be for efficient linear optical quantum computation?

We present a scheme for linear optical quantum computation that is highly robust to imperfect single photon sources and inefficient detectors. In particular we show that if the product of the detector efficiency with the source efficiency is greater than 2/3, then efficient linear optical quantum computation is possible. This high threshold is achieved within the cluster state paradigm for quantum computation.     

Continuous-variable quantum information processing with squeezed states of light

We investigate experiments of continuous-variable quantum information processing based on the teleportation scheme. Quantum teleportation, which is realized by a two-mode squeezed vacuum state and measurement-and-feedforward, is considered as an elementary quantum circuit as well as quantum communication. By modifying ancilla states or measurement-and-feedforwards, we can realize various quantum circuits which suffice for universal quantum computation. In order to realize the teleportation-based computation we improve the level of squeezing, and fidelity of teleportation. With a high-fidelity teleporter we demonstrate some advanced teleportation experiments, i.e., teleportation of a squeezed state and sequential teleportation of a coherent state. Moreover, as an example of the teleportation-based computation, we build a QND interaction gate which is a continuous-variable analog of a CNOT gate. A QND interaction gate is constructed only with ancillary squeezed vacuum states and measurement-and-feedforwards. We also create continuous-variable four mode cluster type entanglement for further application, namely, one-way quantum computation.     

Quantum computing with incoherent resources and quantum jumps

Spontaneous emission and the inelastic scattering of photons are two natural processes usually associated with decoherence and the reduction in the capacity to process quantum information. Here we show that, when suitably detected, these photons are sufficient to build all the fundamental blocks needed to perform quantum computation in the emitting qubits while protecting them from deleterious dissipative effects. We exemplify this by showing how to efficiently prepare graph states for the implementation of measurement-based quantum computation.