Measurement-Based Quantum Turing Machines and their Universality
Simon Perdrix, Philippe Jorrand

TL;DR
This paper introduces Measurement-based Quantum Turing Machines, formalizing measurement-driven quantum computation and highlighting the role of classical control, to explore universality and resource bounds in quantum computing.
Contribution
It presents a formal model for measurement-based quantum computation, emphasizing classical control and establishing bounds on resources for universality.
Findings
Measurement-based quantum computation is universal.
Classical control is essential in measurement-based schemes.
A formal model bounds the minimal resources for quantum universality.
Abstract
Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In order to formalize these other forms of computation, while pointing out the role and the necessity of classical control in measurement-based computation, and for establishing a new upper bound of the minimal resources needed to quantum universality, a formal model is introduced by means of Measurement-based Quantum Turing Machines.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
