25 citations · 64 across the 11 of their papers we have counts for
12 papers
On group theory for quantum gates and quantum coherence
Michel Planat, Philippe Jorrand
Finite group extensions offer a natural language to quantum computing. In a nutshell, one roughly describes the action of a quantum computer as consisting of two finite groups of g…
Classically-Controlled Quantum Computation
Simon Perdrix, Philippe Jorrand
Quantum computations usually take place under the control of the classical world. We introduce a Classically-controlled Quantum Turing Machine (CQTM) which is a Turing Machine (TM)…
A Process Algebraic Approach to Concurrent and Distributed Quantum Computation: Operational Semantics
Marie Lalire, Philippe Jorrand
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they commun…
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…
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…
Measurement-Based Quantum Turing Machines and Questions of Universalities
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…