25 citations · 38 across the 3 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2004★ 11 cited
Complexity of Graph State Preparation
Mehdi Mhalla, Simon Perdrix
The graph state formalism is a useful abstraction of entanglement. It is used in some multipartite purification schemes and it adequately represents universal resources for measure…
quant-ph2004★ 25 cited
Measurement-Based Quantum Turing Machines and their Universality
Simon Perdrix, Philippe Jorrand
Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial st…
quant-ph2003★ 2 cited
Non-Probabilistic Termination of Measurement-based Quantum Computation
Philippe Jorrand, Simon Perdrix
Nielsen [quant-ph/0108020] introduced a model of quantum computation by measurement-based simulation of unitary computations. In this model, a consequence of the non-determinism of…