E. Bernstein and U. Vazirani, Quantum Complexity Theory, SIAM Journal on Computing, vol.26, issue.5, pp.1411-1478, 1997.
DOI : 10.1137/S0097539796300921

A. Broadbent, J. Fitzsimons, and E. Kashefi, Universal Blind Quantum Computation, 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 2009.
DOI : 10.1109/FOCS.2009.36

A. Broadbent and E. Kashefi, Parallelizing quantum circuits, Theoretical Computer Science, vol.410, issue.26, pp.2489-2510, 2009.
DOI : 10.1016/j.tcs.2008.12.046

E. Daniel, E. Browne, M. Kashefi, S. Mhalla, and . Perdrix, Generalized flow and determinism in measurement-based quantum computation, New Journal of Physics (NJP), vol.9, issue.8, 2007.

E. Daniel, E. Browne, S. Kashefi, and . Perdrix, Computational depth complexity of measurement-based quantum computation, Theory of Quantum Computation, Communication, and Cryptography (TQC'10), pp.35-46, 2011.

V. Danos and E. Kashefi, Determinism in the one-way model, Physical Review A, vol.74, issue.5, 2006.
DOI : 10.1103/PhysRevA.74.052310

V. Danos, E. Kashefi, and P. Panangaden, The measurement calculus, Journal of the ACM, vol.54, issue.2, 2007.
DOI : 10.1145/1219092.1219096
URL : https://hal.archives-ouvertes.fr/hal-00155304

V. Danos, E. Kashefi, P. Panangaden, and S. Perdrix, Extended Measurement Calculus, 2010.
DOI : 10.1017/CBO9781139193313.008
URL : https://hal.archives-ouvertes.fr/hal-00999645

N. Delfosse, P. A. Guerin, J. Bian, and R. Raussendorf, Wigner Function Negativity and Contextuality in Quantum Computation on Rebits, Physical Review X, vol.5, issue.2, p.21003, 2015.
DOI : 10.1103/PhysRevX.5.021003

N. Hamrit and S. Perdrix, Reversibility in Extended Measurement-Based Quantum Computation, pp.129-138
DOI : 10.1007/978-3-319-20860-2_8
URL : https://hal.archives-ouvertes.fr/hal-01132861

M. Hein, J. Eisert, and H. J. Briegel, Multiparty entanglement in graph states, Physical Review A, vol.69, issue.6, p.62311, 2004.
DOI : 10.1103/PhysRevA.69.062311

M. Mckague, Interactive proofs for BQP via self-tested graph states, Theory of Computing, pp.1-42, 2016.

M. Mhalla and S. Perdrix, Finding Optimal Flows Efficiently, the 35th International Colloquium on Automata, Languages and Programming (ICALP), pp.857-868, 2008.
DOI : 10.1007/978-3-540-70575-8_70

M. Mhalla and S. Perdrix, Graph States, Pivot Minor, and Universality of (X, Z)-Measurements, International Journal of Unconventional Computing, vol.9, issue.12, pp.153-171, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00934104

M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information, 2000.

R. Prevedel, P. Walther, F. Tiefenbacher, P. Bohi, R. Kaltenbaek et al., High-speed linear optics quantum computing using active feed-forward, Nature, vol.69, issue.7123, pp.44565-69, 2007.
DOI : 10.1038/nature05346

R. Raussendorf, Contextuality in measurement-based quantum computation, Physical Review A, vol.88, issue.2, p.22322, 2013.
DOI : 10.1103/PhysRevA.88.022322

R. Raussendorf and H. J. Briegel, A One-Way Quantum Computer, Physical Review Letters, vol.86, issue.22, pp.5188-5191, 2001.
DOI : 10.1103/PhysRevLett.86.5188

R. Raussendorf, D. E. Browne, and H. J. Briegel, Measurement-based quantum computation on cluster states, Physical Review A, vol.68, issue.2, p.22312, 2003.
DOI : 10.1103/PhysRevA.68.022312

R. Raussendorf, J. Harrington, and K. Goyal, A fault-tolerant one-way quantum computer, Annals of Physics, vol.321, issue.9, pp.2242-2270, 2006.
DOI : 10.1016/j.aop.2006.01.012

P. Walther, K. J. Resch, T. Rudolph, E. Schenck, H. Weinfurter et al., Experimental one-way quantum computing, Nature, vol.80, issue.7030, pp.434169-176, 2005.
DOI : 10.1103/PhysRevLett.75.4337

=. {y-}-then-u and ?. Odd, Let's now begin to rewrite the block (P4) to (P9) Using (P4), (P5) and (P7), we can say that X ? ? u ? u ? Odd(p(u) Also, P9) can be simplified toP4), (P6) and (P9) enable us to show that Y ? ? u ? u ? Odd[p(u)] and (P5), (P6) and (P8) that Z ? ? u ? u ? p(u) is correct. Conversely, we can go back as easily to property (P4) to (P9) from X ? ? u ? u ? Odd