133 citations · 304 across the 9 of their papers we have counts for
Showing 2004Show 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-ph2004
Unifying Quantum Computation with Projective Measurements only and One-Way Quantum Computation
Philippe Jorrand, Simon Perdrix
Quantum measurement is universal for quantum computation. Two models for performing measurement-based quantum computation exist: the one-way quantum computer was introduced by Brie…