One-way quantum computer explained

The one-way or measurement-based quantum computer (MBQC) is a method of quantum computing that first prepares an entangled resource state, usually a cluster state or graph state, then performs single qubit measurements on it. It is "one-way" because the resource state is destroyed by the measurements.

The outcome of each individual measurement is random, but they are related in such a way that the computation always succeeds. In general, the choices of basis for later measurements need to depend on the results of earlier measurements, and hence the measurements cannot all be performed at the same time.

The hardware implementation of MBQC mainly relies on photonic devices,^[1] due to the difficulty of entangling photons without measurements, and the relative simplicity of creating and measuring them. However, MBQC is also possible with matter-based qubits.^[2] The process of entanglement and measurement can be described with the help of graph tools and group theory, in particular by the elements from the stabilizer group.

Definition

The purpose of quantum computing focuses on building an information theory with the features of quantum mechanics: instead of encoding a binary unit of information (bit), which can be switched to 1 or 0, a quantum binary unit of information (qubit) can simultaneously turn to be 0 and 1 at the same time, thanks to the phenomenon called superposition.^{[3] [4] [5]} Another key feature for quantum computing relies on the entanglement between the qubits.^{[6] [7] [8]}

In the quantum logic gate model, a set of qubits, called register, is prepared at the beginning of the computation, then a set of logic operations over the qubits, carried by unitary operators, is implemented.^{[9] [10]} A quantum circuit is formed by a register of qubits on which unitary transformations are applied over the qubits. In the measurement-based quantum computation, instead of implementing a logic operation via unitary transformations, the same operation is executed by entangling a number

k of input qubits with a cluster of a ancillary qubits, forming an overall source state of a + k = n qubits, and then measuring a number m of them.^{[11] [12]} The remaining k = n - a output qubits will be affected by the measurements because of the entanglement with the measured qubits. The one-way computer has been proved to be a universal quantum computer, which means it can reproduce any unitary operation over an arbitrary number of qubits.^{[13] [14] [15]}

General procedure

The standard process of measurement-based quantum computing consists of three steps:^{[16] [17]} entangle the qubits, measure the ancillae (auxiliary qubits) and correct the outputs. In the first step, the qubits are entangled in order to prepare the source state. In the second step, the ancillae are measured, affecting the state of the output qubits. However, the measurement outputs are non-deterministic result, due to undetermined nature of quantum mechanics: in order to carry on the computation in a deterministic way, some correction operators, called byproducts, are introduced.

Preparing the source state

At the beginning of the computation, the qubits can be distinguished into two categories: the input and the ancillary qubits. The inputs represent the qubits set in a generic

| \psi \rangle = \alpha | 0 \rangle + \beta | 1 \rangle state, on which some unitary transformations are to be acted. In order to prepare the source state, all the ancillary qubits must be prepared in the | + \rangle state:^[18] | + \rangle = \tfrac{| 0 \rangle + | 1 \rangle}{\sqrt{ 2 }},

where

| 0 \rangle and | 1 \rangle are the quantum encoding for the classical 0 and 1 bits:| 0 \rangle = \begin{pmatrix} 1 \ 0 \end{pmatrix}; | 1 \rangle = \begin{pmatrix} 0 \ 1 \end{pmatrix} .A register with n qubits will be therefore set as | + \rangle ^{⊗} . Thereafter, the entanglement between two qubits can be performed by applying a CZ gate operation.^[19] The matrix representation of such two-qubits operator is given byCZ = \begin{bmatrix} 1 & 0 & 0 & 0 \ 0 & 1 & 0 & 0 \ 0 & 0 & 1 & 0 \ 0 & 0 & 0 & -1 \end{bmatrix}. The action of a CZ gate over two qubits can be described by the following system:\begin{cases} CZ | 0+ \rangle = | 0+ \rangle \\ CZ | 0- \rangle = | 0- \rangle \\ CZ | 1+ \rangle = | 1- \rangle \\ CZ | 1- \rangle = | 1+ \rangle \end{cases} When applying a CZ gate over two ancillae in the | + \rangle state, the overall state CZ| ++ \rangle = (| 0+ \rangle + | 1- \rangle)/(\sqrt{ 2) }turns to be an entangled pair of qubits. When entangling two ancillae, no importance is given about which is the control qubit and which one the target, as far as the outcome turns to be the same. Similarly, as the CZ gates are represented in a diagonal form, they all commute each other, and no importance is given about which qubits to entangle first. Photons are the most common source to prepare entangled physical qubits.^{[20] [21] [22]}

Measuring the qubits

The process of measurement over a single-particle state can be described by projecting the state on the eigenvector of an observable. Consider an observable

O with two possible eigenvectors, say | o _{1} \rangle and | o _{2} \rangle , and suppose to deal with a multi-particle quantum system | \Psi \rangle . Measuring the i -th qubit by the O observable means to project the | \Psi \rangle state over the eigenvectors of O :| \Psi' \rangle = |o _{i} \rangle \langle o _{i} | \Psi \rangle .The actual state of the i -th qubit is now |o _{i} \rangle , which can turn to be | o _{1} \rangle or | o _{2} \rangle , depending on the outcome from the measurement (which is probabilistic in quantum mechanics). The measurement projection can be performed over the eigenstates of the M(\theta) = \cos(\theta)X + \sin(\theta)Y observable:M(\theta) = \cos(\theta) \begin{bmatrix} 0 & 1 \ 1 & 0 \end{bmatrix} + \sin(\theta) \begin{bmatrix} 0 & - i \ i & 0 \end{bmatrix} = \begin{bmatrix} 0 & e ^{-i} \ e ^{i} & 0 \end{bmatrix} ,where X and Y belong to the Pauli matrices. The eigenvectors of M(\theta) are |\theta _{\pm} \rangle = | 0 \rangle \pm e ^{i} | 1 \rangle . Measuring a qubit on the X -Y plane, i.e. by the M(\theta) observable, means to project it over |\theta _{+} \rangle or |\theta _{-} \rangle . In the one-way quantum computing, once a qubit has been measured, there is no way to recycle it in the flow of computation. Therefore, instead of using the |o _{i} \rangle \langle o _{i} | notation, it is common to find \langle o _{i} | to indicate a projective measurement over the i -th qubit.

Correcting the output

After all the measurements have been performed, the system has been reduced to a smaller number of qubits, which form the output state of the system. Due to the probabilistic outcome of measurements, the system is not set in a deterministic way: after a measurement on the

X -Y plane, the output may change whether the outcome had been | \theta _{+} \rangle or | \theta _{-} \rangle . In order to perform a deterministic computation, some corrections must be introduced. The correction operators, or byproduct operators, are applied to the output qubits after all the measurements have been performed.^[23] The byproduct operators which can be implemented are X and Z .^[24] Depending on the outcome of the measurement, a byproduct operator can be applied or not to the output state: a X correction over the j -th qubit, depending on the outcome of the measurement performed over the i -th qubit via the M(\theta) observable, can be described as X ^{s _{i}} _{j} , where s _{i} is set to be 0 if the outcome of measurement was | \theta _{+} \rangle , otherwise is 1 if it was | \theta _{-} \rangle . In the first case, no correction will occur, in the latter one a X operator will be implemented on the j -th qubit. Eventually, even though the outcome of a measurement is not deterministic in quantum mechanics, the results from measurements can be used in order to perform corrections, and carry on a deterministic computation.

CME pattern

The operations of entanglement, measurement and correction can be performed in order to implement unitary gates. Such operations can be performed time by time for any logic gate in the circuit, or rather in a pattern which allocates all the entanglement operations at the beginning, the measurements in the middle and the corrections at the end of the circuit. Such pattern of computation is referred to as CME standard pattern. In the CME formalism, the operation of entanglement between the

i and j qubits is referred to as E _{ij} . The measurement on the i qubit, in the X -Y plane, with respect to a \theta angle, is defined as M ^{\theta} _{i} . At last, the X byproduct over a i qubit, with respect to the measurement over a j qubit, is described as X ^{s _{j}} _{i} , where s _{j} is set to 0 if the outcome is the | \theta _{+} \rangle state, 1 when the outcome is | \theta _{-} \rangle . The same notation holds for the Z byproducts.

When performing a computation following the CME pattern, it may happen that two measurements

M ^{\theta _{1}} _{i} and M ^{\theta _{2}} _{j} on the X -Y plane depend one on the outcome from the other. For example, the sign in front of the angle of measurement on the j -th qubit can be flipped with respect to the measurement over the i -th qubit: in such case, the notation will be written as [M ^{\theta _{2}} _{j} ] ^{s _{i}} M ^{\theta _{1}} _{i} , and therefore the two operations of measurement do commute each other no more. If s _{i} is set to 0 , no flip on the \theta _{2} sign will occur, otherwise (when s _{i=1} ) the \theta _{2} angle will be flipped to - \theta _{2} . The notation [M ^{\theta _{2}} _{j} ] ^{s _{i}} can therefore be rewritten as M ^{( - ) ^{s _{i}} \theta _{2}} _{j} .

An example: Euler rotations

As an illustrative example, consider the Euler rotation in the

XZX basis: such operation, in the gate model of quantum computation, is described as^[25] e ^{i} R _{X(\phi)} R _{Z(\theta)R} _{X(λ)} ,where \phi, \theta, λ are the angles for the rotation, while \gamma defines a global phase which is irrelevant for the computation. To perform such operation in the one-way computing frame, it is possible to implement the following CME pattern:^[26] Z ^{s _{1+s} _{3}} _{5} X ^{s _{2+s} _{4}} _{5} [M ^{- \phi} _{4} ] ^{s _{1+s} _{3}} [M ^{- \theta} _{3} ] ^{s _{2}} [M ^{-λ} _{2} ] ^{s _{1}} M ^{0} _{1} E _{4,5} E _{3,4} E _{2,3} E _{1,2} ,where the input state | \psi \rangle = \alpha | 0 \rangle + \beta | 1 \rangle is the qubit 1 , all the other qubits are auxiliary ancillae and therefore have to be prepared in the | + \rangle state. In the first step, the input state |\psi \rangle must be entangled with the second qubits; in turn, the second qubit must be entangled with the third one and so on. The entangling operations E _{ij} between the qubits can be performed by the CZ gates.

In the second place, the first and the second qubits must be measured by the

M(\theta) observable, which means they must be projected onto the eigenstates | \theta \rangle of such observable. When the \theta is zero, the | \theta _{\pm} \rangle states reduce to |\pm \rangle ones, i.e. the eigenvectors for the X Pauli operator. The first measurement M ^{0} _{1} is performed on the qubit 1 with a \theta =0 angle, which means it has to be projected onto the \langle \pm | states. The second measurement [M ^{-λ} _{2} ] ^{s _{1}} is performed with respect to the -λ angle, i.e. the second qubit has to be projected on the \langle 0 | \pm e ^{i} \langle 1 | state. However, if the outcome from the previous measurement has been \langle - | , the sign of the λ angle has to be flipped, and the second qubit will be projected to the \langle 0 | + e ^{-i} \langle 1 | state; if the outcome from the first measurement has been \langle + | , no flip needs to be performed. The same operations have to be repeated for the third [M ^{\theta} _{3} ] ^{s _{2}} and the fourth [M ^{\phi} _{4} ] ^{s _{1+s} _{3}} measurements, according to the respective angles and sign flips. The sign over the \phi angle is set to be ( - ) ^{s _{1+s} _{3}} . Eventually the fifth qubit (the only one not to be measured) figures out to be the output state.

At last, the corrections

Z ^{s _{1+s} _{3}} _{5} X ^{s _{2+s} _{4}} _{5} over the output state have to be performed via the byproduct operators. For instance, if the measurements over the second and the fourth qubits turned to be \langle \phi _{+} | and \langle λ _{+} | , no correction will be conducted by the X _{5} operator, as s _{2=s} _{4=0} . The same result holds for a \langle \phi _{-} | \langle λ _{-} | outcome, as s _{2=s} _{4=1} and thus the squared Pauli operator X ^{2} returns the identity.

As seen in such example, in the measurement-based computation model, the physical input qubit (the first one) and output qubit (the third one) may differ each other.

Equivalence between quantum circuit model and MBQC

The one-way quantum computer allows the implementation of a circuit of unitary transformations through the operations of entanglement and measurement. At the same time, any quantum circuit can be in turn converted into a CME pattern: a technique to translate quantum circuits into a MBQC pattern of measurements has been formulated by V. Danos et al.^[27]

Such conversion can be carried on by using a universal set of logic gates composed by the

CZ and the J(\theta) operators: therefore, any circuit can be decomposed into a set of CZ and the J(\theta) gates. The J(\theta) single-qubit operator is defined as follows:J(\theta) = (1)/(\sqrt 2) \begin{pmatrix} 1 & e ^{i} \ 1 & - e ^{i\theta} \end{pmatrix} .The J(\theta) can be converted into a CME pattern as follows, with qubit 1 being the input and qubit 2 being the output:J(\theta) = X ^{s _{1}} _{2} M ^{- \theta} _{1} E _{1,2} which means, to implement a J(\theta) operator, the input qubits | \psi \rangle must be entangled with an ancilla qubit | + \rangle , therefore the input must be measured on the X -Y plane, thereafter the output qubit is corrected by the X _{2} byproduct. Once every J(\theta) gate has been decomposed into the CME pattern, the operations in the overall computation will consist of E _{ij} entanglements, M ^{- \theta _{i}} _{i} measurements and X _{j} corrections. In order to lead the whole flow of computation to a CME pattern, some rules are provided.

Standardization

In order to move all the

E _{ij} entanglements at the beginning of the process, some rules of commutation must be pointed out:E _{ij} Z ^{s} _{i} = Z ^{s} _{i} E _{ij} E _{ij} X ^{s} _{i} = X ^{s} _{i} Z ^{s} _{j} E _{ij} E _{ij} A _{k} = A _{k} E _{ij} .The entanglement operator E _{ij} commutes with the Z Pauli operators and with any other operator A _{k} acting on a qubit k ≠ i,j , but not with the X Pauli operators acting on the i -th or j -th qubits.

Pauli simplification

The measurement operations

M ^{\theta} _{i} commute with the corrections in the following manner:M ^{\theta} _{i} X ^{s} _{i} = [M ^{\theta]} _{i} ^{s} M ^{\theta} _{i} Z ^{t} _{i} = S ^{t} _{i} M ^{\theta} _{i} ,

where

[M ^{\theta]} _{i} ^{( - ) ^{s\theta}} ^{i} . Such operation means that, when shifting the X corrections at the end of the pattern, some dependencies between the measurements may occur. The S ^{t} _{i} operator is called signal shifting, whose action will be explained in the next paragraph. For particular \theta angles, some simplifications, called Pauli simplifications, can be introduced:M ^{0} _{i} X ^{s} _{i} = M ^{0} _{i} M ^{\pi/ 2} _{i} X ^{s} _{i} = M ^{\pi/ 2} _{i} Z ^{s} _{i} .

Signal shifting

The action of the signal shifting operator

S ^{t} _{i} can be explained through its rules of commutation:X ^{s} _{i} S ^{t} _{i} = S ^{t} _{i} X ^{s[(s _{i+t)/s} _{i]}} _{i} Z ^{s} _{i} S ^{t} _{i} = S ^{t} _{i} Z ^{s[(s _{i+t)/s} _{i]}} _{i} .

The

s[(t + s _{i)/s} _{i]} operation has to be explained: suppose to have a sequence of signals s , consisting of s _{1} + s _{2} + ... + s _{i} + ... , the operation s[(t + s _{i)/s} _{i]} means to substitute s _{i} with s _{i+t} in the sequence s , which becomes s _{1} + s _{2} + ... + s _{i} + t + ... . If no s _{i} appears in the s sequence, no substitution will occur. To perform a correct CME pattern, every signal shifting operator S ^{t} _{i} must be translated at the end of the pattern.

Stabilizer formalism

When preparing the source state of entangled qubits, a graph representation can be given by the stabilizer group. The stabilizer group

l{S} _{n} is an abelian subgroup from the Pauli group l{P} _{n} , which one can be described by its generators \{\pm 1 , \pm i\} x \{I,X,Y,Z\} ^{⊗} .^{[28] [29]} A stabilizer state is a n -qubit state | \Psi \rangle which is a unique eigenstate for the generators S _{i} of the l{S} _{n} stabilizer group:S _{i} | \Psi \rangle = | \Psi \rangle. Of course, S _{i} \in l{S} _{n} \forall i .

It is therefore possible to define a

n qubit graph state | G \rangle as a quantum state associated with a graph, i.e. a set G = (V,E) whose vertices V correspond to the qubits, while the edges E represent the entanglements between the qubits themselves. The vertices can be labelled by a i index, while the edges, linking the i -th vertex to the j -th one, by two-indices labels, such as (i,j) .^[30] In the stabilizer formalism, such graph structure can be encoded by the K _{i} generators of l{S} _{n} , defined as^{[31] [32]} K _{i} = X _{i} \prod _{j} Z _{j} ,where {j \in (i,j)} stands for all the j qubits neighboring with the i -th one, i.e. the j vertices linked by a (i,j) edge with the i vertex. Each K _{i} generator commute with all the others. A graph composed by n vertices can be described by n generators from the stabilizer group:\langle K _{1,} K _{2,} ..., K _{n\rangle} .

While the number of

X _{i} is fixed for each K _{i} generator, the number of Z _{j} may differ, with respect to the connections implemented by the edges in the graph.

The Clifford group

See also: Clifford gates.

The Clifford group

l{C} _{n} is composed by elements which leave invariant the elements from the Pauli's group l{P} _{n} :^[33] l{C} _{n} = \{ U \in SU( 2 ^{n)} | U S U ^{\dagger} \in l{P} _{n,} S \in l{P} _{n} \} .The Clifford group requires three generators, which can be chosen as the Hadamard gate H and the phase rotation S for the single-qubit gates, and another two-qubits gate from the CNOT (controlled NOT gate) or the CZ (controlled phase gate):H = (1)/(\sqrt 2) \begin{bmatrix} 1 & 1 \ 1 & -1 \end{bmatrix}, S = \begin{bmatrix} 1 & 0 \ 0 & i \end{bmatrix}, CNOT = \begin{bmatrix} 1 & 0 & 0 & 0 \ 0 & 1 & 0 & 0 \ 0 & 0 & 0 & 1 \ 0 & 0 & 1 & 0 \end{bmatrix} .

Consider a state

| G \rangle which is stabilized by a set of stabilizers S _{i} . Acting via an element U from the Clifford group on such state, the following equalities hold:^[34] U|G\rangle = U S _{i} |G\rangle = U S _{i} U ^{\dagger} U |G\rangle = S' _{i} U |G\rangle .

Therefore, the

U operations map the |G\rangle state to U |G\rangle and its S _{i} stabilizers to U S _{i} U ^{\dagger} . Such operation may give rise to different representations for the K _{i} generators of the stabilizer group.

The Gottesman–Knill theorem states that, given a set of logic gates from the Clifford group, followed by

Z measurements, such computation can be efficiently simulated on a classical computer in the strong sense, i.e. a computation which elaborates in a polynomial-time the probability P(x) for a given output x from the circuit.^{[35] [36] [37]}

Hardware and applications

Topological cluster state quantum computer

Measurement-based computation on a periodic 3D lattice cluster state can be used to implement topological quantum error correction.^[38] Topological cluster state computation is closely related to Kitaev's toric code, as the 3D topological cluster state can be constructed and measured over time by a repeated sequence of gates on a 2D array.^[39]

Implementations

One-way quantum computation has been demonstrated by running the 2 qubit Grover's algorithm on a 2x2 cluster state of photons.^{[40] [41]} A linear optics quantum computer based on one-way computation has been proposed.^[42]

Cluster states have also been created in optical lattices,^[43] but were not used for computation as the atom qubits were too close together to measure individually.

AKLT state as a resource

\tfrac{ 3 }{ 2 } ) AKLT state on a 2D honeycomb lattice can be used as a resource for MBQC.^{[44] [45]} More recently it has been shown that a spin-mixture AKLT state can be used as a resource.^[46]

See also

• Quantum gate teleportation
• Continuous-variable quantum information
• Quantum algorithm
• Quantum logic gate
• Linear optical quantum computing
• Quantum optics
• Quantum error correction
• Quantum Turing machine
• Adiabatic quantum computation

References

General

• D. Gross . J. Eisert . N. Schuch . D. Perez-Garcia . Measurement-based quantum computation beyond the one-way model. Physical Review A. 2007. 76 . 5 . 052315 . 0706.3401. 10.1103/PhysRevA.76.052315. 2007PhRvA..76e2315G . 53409763 . Non-cluster resource states
• A. Trisetyarso . R. Van Meter . amp . Circuit Design for A Measurement-Based Quantum Carry-Lookahead Adder. . 2010. 8 . 5. 843–867 . 0903.0748. 10.1142/S0219749910006496. 2587811 . Measurement-based quantum computation, quantum carry-lookahead adder

Notes and References

1. Fowler . Austin G. . Goyal . Kovid . 2009-02-25 . Topological cluster state quantum computing . Quantum Information & Computation . 9 . 9&10 . 721–738 . 10.26421/QIC9.9-10-1 . 0805.3202 . 6652655 .
2. Raussendorf . R . Harrington . J . Goyal . K . 2007-06-29 . Topological fault-tolerance in cluster state quantum computation . New Journal of Physics . 9 . 6 . 199 . 10.1088/1367-2630/9/6/199 . quant-ph/0703143 . 2007NJPh....9..199R . 13811487 . 1367-2630.
3. S. S. Li . G. L. Long . F. S. Bai . S. L. Feng . H. Z. Zheng . Quantum computing . Proceedings of the National Academy of Sciences . 2001 . 98 . 21 . 11847–11848 . 10.1073/pnas.191373698. 11562459 . 59812 . 2001PNAS...9811847L . free .
4. Book: E. Grumbling . M. Horowitz . Quantum computing: progress and prospects. . 2019 . National Academies of Sciences, Engineering, and Medicine. . 2 . 10.17226/25196 . 978-0-309-47969-1. 125635007 .
5. T. Sleator . H. Weinfurter . Realizable Universal Quantum Logic Gates . Physical Review Letters . 1995 . 74 . 20 . 4087–4090 . 10.1103/PhysRevLett.74.4087. 10058409 . 1995PhRvL..74.4087S .
6. T. Hey . Quantum computing: An introduction . Computing & Control Engineering Journal . 1999 . 10 . 3 . 105–112 . 10.1049/cce:19990303.
7. Book: P. Shor . Quantum Computing . 1998 . Documenta Mathematica . 468 .
8. G.K. Brennen . C.M. Caves . P.S. Jessen . I.H. Deutsch . Quantum Logic Gates in Optical Lattices . Physical Review Letters . 1999 . 82 . 5 . 1060–1063 . 10.1103/PhysRevLett.82.1060. quant-ph/9806021 . 1999PhRvL..82.1060B . 15297433 .
9. A. Barenco . C.H. Bennett . R. Cleve . D.P. DiVincenzo . N. Margolus . P. Shor . T. Sleator . J. Smolin . H. Weinfurter . Elementary gates for quantum computation . Physical Review A . 1995 . 74 . 20 . 3457–3467 . quant-ph/9503016 . 10.1103/PhysRevA.52.3457. 9912645 . 1995PhRvA..52.3457B . 8764584 .
10. S. Lloyd . Almost Any Quantum Logic Gate is Universal . Physical Review Letters . 1995 . 75 . 2 . 346–349 . 10.1103/PhysRevLett.75.346. 10059671 . 1995PhRvL..75..346L .
11. J. Joo . C.W. Lee . S. Kono . J. Kim . Logical measurement-based quantum computation in circuit-QED . Scientific Reports . 2019 . 9 . 1 . 16592 . 1808.07638 . 10.1038/s41598-019-52866-3. 31719588 . 6851091 . 2019NatSR...916592J . 119440765 .
12. M.S. Tame . R. Prevedel . M. Paternostro . P. Bohi . M.S. Kim . A. Zeilinger . Experimental realization of Deutsch's algorithm in a one-way quantum computer. . Physical Review Letters . 2007 . 98 . 14 . 140501 . quant-ph/0611186 . 10.1103/PhysRevLett.98.140501. 17501253 . 2007PhRvL..98n0501T . 21518741 .
13. R. Raussendorf . D. E. Browne . H. J. Briegel . amp . Measurement-based quantum computation with cluster states . Physical Review A. 2003. 68 . 2 . 022312 . quant-ph/0301052. 10.1103/PhysRevA.68.022312. 2003PhRvA..68b2312R . 6197709 .
14. P. Walther . K. J. Resch . T. Rudolph . E. Schenck . H. Weinfurter . V. Vedral . M. Aspelmeyer . A. Zeilinger . Experimental one-way quantum computing. . Nature . 2005 . 434 . 7030 . 169–176 . quant-ph/0503126 . 10.1038/nature03347. 15758991 . 2005Natur.434..169W . 119329998 .
15. R. Raussendorf . H. J. Briegel . amp . A One-Way Quantum Computer . 2006 . . 86 . 5188–91 . 10.1103/PhysRevLett.86.5188 . 11384453 . 22 . 2001PhRvL..86.5188R. quant-ph/0510135 .
16. V. Danos . E. Kashefi . P. Panangaden . The measurement calculus . Journal of the ACM . 2007 . 54 . 2 . 8 . 0704.1263 . 10.1145/1219092.1219096. 5851623 .
17. E. Pius . Automatic Parallelisation of Quantum Circuits Using the Measurement Based Quantum Computing Model . 2010 .
18. A. Mantri . T.F. Demarie . J.F. Fitzsimons . Universality of quantum computation with cluster states and (X, Y)-plane measurements . Scientific Reports . 2017 . 7 . 1 . 42861 . 1607.00758 . 10.1038/srep42861. 28216652 . 5316959 . 2017NatSR...742861M .
19. S. Anders . H.J. Briegel . Fast simulation of stabilizer circuits using a graph state representation . Physical Review A . 2006 . 73 . 2 . 022334 . quant-ph/0504117 . 10.1103/PhysRevA.73.022334. 2006PhRvA..73b2334A . 12763101 .
20. T. Nutz . A. Milne . P. Shadbolt . T. Rudolph . Proposal for demonstration of long-range cluster state entanglement in the presence of photon loss . APL Photonics . 2017 . 2 . 6 . 066103 . 10.1063/1.4983822. 1702.01958 . 2017APLP....2f6103N . 125732242 .
21. M. Gimeno-Segovia . P. Shadbolt . D.E. Browne . T. Rudolph . From Three-Photon Greenberger-Horne-Zeilinger States to Ballistic Universal Quantum Computation . Physical Review Letters . 2015 . 115 . 2 . 020502 . 10.1103/PhysRevLett.115.020502. 26207455 . 1410.3720 . 2015PhRvL.115b0502G . 45848374 .
22. J.R. Scott . K.C. Balram . Timing Constraints Imposed by Classical Digital Control Systems on Photonic Implementations of Measurement-Based Quantum Computing . IEEE Transactions on Quantum Engineering . 2022 . 3 . 1–20 . 2109.04792 . 10.1109/TQE.2022.3175587. 237485449 .
23. R. Jozsa . An introduction to measurement based quantum computation . NATO Science Series, III: Computer and Systems Sciences. Quantum Information Processing-From Theory to Experiment . 2006 . 199 . quant-ph/0508124.
24. R. Raussendorf . H. J. Briegel . Computational model underlying the one-way quantum computer . 2002 . quant-ph/0108067.
25. Web site: OneQubitEulerDecomposer . Qiskit . 29 June 2022.
26. Web site: MBQC Quick Start Guide . Paddle Quantum . 29 June 2022.
27. Web site: Measurement-Based Quantum Computation Module . Paddle Quantum . 1 July 2022.
28. Book: K. Fujii . Quantum Computation with Topological Codes: from qubit to topological fault-tolerance . 2015 . Springer . 28 . 1504.01444 . 978-981-287-996-7.
29. D. Gottesman . The Heisenberg Representation of Quantum Computers . 1998 . quant-ph/9807006. 1998quant.ph..7006G .
30. M. Hein . W. Dur . J. Eisert . R. Raussendorf . M. Van den Nest . H. Jurgen Briegel . Entanglement in Graph States and its Applications . 2006 . quant-ph/0602096.
31. R. Raussendorf . J. Harrington . K. Goyal . A fault-tolerant one-way quantum computer. . Annals of Physics . 2006 . 321 . 9 . 2242–2270 . 10.1016/j.aop.2006.01.012 . quant-ph/0510135. 2006AnPhy.321.2242R . 14422769 .
32. M. Rossi . M. Huber . D. Bruß . C. Macchiavello . Quantum Hypergraph States . New Journal of Physics . 2013 . 15 . 11 . 113022 . 1211.5554 . 10.1088/1367-2630/15/11/113022. 2013NJPh...15k3022R . 40507835 .
33. M.E. Cuffaro . On the Significance of the Gottesman–Knill Theorem . The British Journal for the Philosophy of Science . 2013 . 68 . 1 . 91–121 . 1310.0938 . 10.1093/bjps/axv016.
34. Book: K. Fujii . Quantum Computation with Topological Codes: from qubit to topological fault-tolerance. . 2015 . Springer . 30 . 1504.01444 . 978-981-287-996-7.
35. Book: K. Fujii . Quantum Computation with Topological Codes: from qubit to topological fault-tolerance. . 2015 . Springer . 34 . 1504.01444 . 978-981-287-996-7.
36. Book: M.A. Nielsen . I.L. Chuang . Quantum Computation and Quantum Information . 2000 . Cambridge University Press . 978-1-107-00217-3 . 464.
37. M. Van den Nest . Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond . Quantum Information & Computation . 2008 . 10 . 3 . 0811.0898.
38. Robert Raussendorf . Jim Harrington . Kovid Goyal . Topological fault-tolerance in cluster state quantum computation . New Journal of Physics . 9 . 6 . 199 . 2007 . quant-ph/0703143 . 2007NJPh....9..199R . 10.1088/1367-2630/9/6/199 . 13811487 .
39. Robert Raussendorf . Jim Harrington . Fault-tolerant quantum computation with high threshold in two dimensions . Physical Review Letters. 98 . 19 . 190504 . 2007 . quant-ph/0610082. 10.1103/physrevlett.98.190504 . 17677613. 2007PhRvL..98s0504R . 39504821 .
40. P. Walther, K. J. Resch, T. Rudolph, E. Schenck, H. Weinfurter, V. Vedral, M. Aspelmeyer and A. Zeilinger. Experimental one-way quantum computing. Nature. 2005. 434. 169–76 . 10.1038/nature03347 . 15758991 . 7030 . quant-ph/0503126 . 2005Natur.434..169W . 119329998.
41. Robert Prevedel . Philip Walther . Felix Tiefenbacher . Pascal Böhi . Rainer Kaltenbaek . Thomas Jennewein . Thomas Jennewein . Anton Zeilinger . High-speed linear optics quantum computing using active feed-forward. Nature. 2007. 445 . 65–69 . 10.1038/nature05346 . 17203057 . 7123. quant-ph/0701017 . 2007Natur.445...65P . 4416906 .
42. Daniel E. Browne . Terry Rudolph . Resource-efficient linear optical quantum computation. Physical Review Letters. 2005. 95 . 010501 . quant-ph/0405157. 10.1103/PhysRevLett.95.010501 . 16090595 . 1 . 2005PhRvL..95a0501B. 27224760 .
43. Olaf Mandel . Markus Greiner . Artur Widera . Tim Rom . Theodor W. Hänsch . Immanuel Bloch . Controlled collisions for multi-particle entanglement of optically trapped atoms. Nature. 2003. 425 . 937–40. 10.1038/nature02008 . 14586463 . 6961. quant-ph/0308080 . 2003Natur.425..937M . 4408587 .
44. Tzu-Chieh Wei . Ian Affleck . Robert Raussendorf . amp . Two-dimensional Affleck-Kennedy-Lieb-Tasaki state on the honeycomb lattice is a universal resource for quantum computation. Physical Review A. 2012. 86. 32328 . 032328 . 1009.2840. 10.1103/PhysRevA.86.032328 . 2012PhRvA..86c2328W. 118128175 .
45. Akimasa Miyake . Quantum computational capability of a 2D valence bond solid phase . Annals of Physics. 2011. 236. 7. 1656–1671. 1009.3491 . 10.1016/j.aop.2011.03.006. 2011AnPhy.326.1656M. 119243954 .
46. Spin mixture AKLT states for universal quantum computation. Physical Review A. 90. 4. 042333. 1310.5100. Tzu-Chieh Wei . Poya Haghnegahdar . Robert Raussendorf . 2014PhRvA..90d2333W. 10.1103/PhysRevA.90.042333. 2014. 118460519.