2008International Journal of Modern Physics BRequires access

CLUSTER STATE QUANTUM COMPUTATION AND THE REPEAT-UNTIL-SUCCESS SCHEME

L. C. Kwek

Open publisher page 1 citations

Abstract

Cluster state computation or the one way quantum computation (1WQC) relies on an initially highly entangled state (called a cluster state) and an appropriate sequence of single qubit measurements along different directions, together with feed-forward based on the measurement results, to realize a quantum computation process. The final result of the computation is obtained by measuring the last remaining qubits in the computational basis. In this short tutorial on cluster state quantum computation, we will also describe the basic ideas of a cluster state and proceed to describe how a single qubit operation can be done on a cluster state. Recently, we proposed a repeat-until-success (RUS) scheme that could effectively be used to realize one-way quantum computer on a hybrid system of photons and atoms. We will briefly describe this RUS scheme and show how it can be used to entangled two distant stationary qubits.

About this research paper

What this paper is about

Cluster state computation or the one way quantum computation (1WQC) relies on an initially highly entangled state (called a cluster state) and an appropriate sequence of single qubit measurements along different directions, together with feed-forward based on the measurement results, to realize a quantum computation process. The final result of the computation is obtained by measuring the last remaining qubits in the computational basis. In this short tutorial on cluster state quantum computation, we will also describe the basic ideas of a cluster state and proceed to describe how a single qubit operation can be done on a cluster state. Recently, we proposed a repeat-until-success (RUS) scheme that could effectively be used to realize one-way quantum computer on a hybrid system of photons and atoms. We will briefly describe this RUS scheme and show how it can be used to entangled two distant stationary qubits.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Cluster state computation or the one way quantum computation (1WQC) relies on an initially highly entangled state (called a cluster state) and an appropriate sequence of single qubit measurements along different directions, together with feed-forward based on the measurement results, to realize a quantum computation process. The final result of the computation is obtained by measuring the last remaining qubits in the computational basis. In this short tutorial on cluster state quantum computation, we will also describe the basic ideas of a cluster state and proceed to describe how a single qubit operation can be done on a cluster state. Recently, we proposed a repeat-until-success (RUS) scheme that could effectively be used to realize one-way quantum computer on a hybrid system of photons and atoms. We will briefly describe this RUS scheme and show how it can be used to entangled two distant stationary qubits.

Key concepts: Cluster state, Qubit, Quantum computer, One-way quantum computer, Computation, Computer science, Cluster (spacecraft), State (computer science)

Related papers

Back to paper searchBrowse research topicsOriginal source
CLUSTER STATE QUANTUM COMPUTATION AND THE REPEAT-UNTIL-SUCCESS SCHEME — Research Paper | ScholarLens