Measurement-based quantum computation on cluster states

Raussendorf, Robert; Browne, Dan E.; Briegel, Hans J.

doi:10.1103/physreva.68.022312

Cited by 1,380 publications

(1,334 citation statements)

References 14 publications

Supporting

Mentioning

1,325

Contrasting

Unclassified

Order By: Relevance

“…This will certainly be fostered by recent developments of highly efficient single-photon detection methods as well as "on demand" single-photon sources. Given large and high-fidelity cluster states as well as low photon loss and significantly improved detectors, promising future applications of oneway quantum computers include important tasks such as the quantum Fourier transform 28,29 which is at the heart of Shor's factorizing algorithm.…”

mentioning

confidence: 99%

High-speed linear optics quantum computing using active feed-forward

Prevedel

Walther

Tiefenbacher

et al. 2007

Nature

355

304

View full text Add to dashboard Cite

As information carriers in quantum computing 1 , photonic qubits have the advantage of undergoing negligible decoherence. However, the absence of any significant photonphoton interaction is problematic for the realization of non-trivial two-qubit gates. One solution is to introduce an effective nonlinearity by measurements resulting in probabilistic gate operations 2,3 . In one-way quantum computation 4-8 , the random quantum measurement error can be overcome by applying a feed-forward technique, such that the future measurement basis depends on earlier measurement results. This technique is crucial for achieving deterministic quantum computation once a cluster state (the highly entangled multiparticle state on which one-way quantum computation is based) is prepared. Here we realize a concatenated scheme of measurement and active feed-forward in a one-way quantum computing experiment. We demonstrate that, for a perfect cluster state and no photon loss, our quantum computation scheme would operate with good fidelity and that our feed-forward components function with very high speed and low error for detected photons. With present technology, the individual computational step (in our case the individual feed-forward cycle) can be operated in less than 150 ns using electro-optical modulators. This is an important result for the

show abstract

mentioning

confidence: 99%

High-speed linear optics quantum computing using active feed-forward

Prevedel

Walther

Tiefenbacher

et al. 2007

Nature

355

304

View full text Add to dashboard Cite

show abstract

“…This was first shown by Gottesman and Chuang [30] who used two-qubit measurements and given Bell pairs. The one-way computer was then invented by Raussendorf and Briegel [11,32] which used only single-qubit measurements with a particular multi-party entangled state called the cluster state.…”

Section: Measurement-based Computingmentioning

confidence: 99%

The Search for Structure in Quantum Computation

Panangaden

2011

Foundations of Software Science and Computational Structures

View full text Add to dashboard Cite

show abstract

“…While measurement operations were long seen as a necessary but disruptive part of quantum computing, in algorithms such as teleportation they act as an essential part of the computation. This gave rise to models where the computation is steered by pre-established generic entanglement combined with measurements, such as the one-way quantum computer (Raussendorf et al, 2003). Because measurements are inherently probabilistic, correction operations are required that are conditionally applied depending on previous measurement outcomes, thus rendering the computation deterministic.…”

Section: Syntaxmentioning

confidence: 99%

“…Measurement angles may also be conditioned by signals, written t [M α i ] s , with (−1) s α + tπ being the actual measurement angle. The four basic instructions together with signal conditioning suffice to make the model universal (Raussendorf et al, 2003;Danos et al, 2007).…”

Section: Syntaxmentioning

confidence: 99%

Distributed Quantum Programming

D’Hondt

Vandriessche

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper we explore the structure and applicability of the Distributed Measurement Calculus (DMC), an assembly language for distributed measurement-based quantum computations. We describe the formal language's syntax and semantics, both operational and denotational, and state several properties that are crucial to the practical usability of our language, such as equivalence of our semantics, as well as compositionality and context-freeness of DMC programs. We show how to put these properties to use by constructing a composite program that implements distributed controlled operations, in the knowledge that the semantics of this program does not change under the various composition operations. Our formal model is the basis of a quantum virtual machine construction for distributed quantum computations, which we elaborate upon in the latter part of this work. This virtual machine embodies the formal semantics of DMC such that programming execution no longer needs to be analysed by hand. Far from a literal translation, it requires a substantial concretisation of the formal model at the level of data structures, naming conventions and abstraction mechanisms. At the same time we provide automatisation techniques for program specification where possible to obtain an expressive and user-friendly programming environment.

show abstract

Measurement-based quantum computation on cluster states

Cited by 1,380 publications

References 14 publications

High-speed linear optics quantum computing using active feed-forward

High-speed linear optics quantum computing using active feed-forward

The Search for Structure in Quantum Computation

Distributed Quantum Programming

Contact Info

Product

Resources

About