quantum algorithms:
constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
What has come to be known as measurement based quantum computation is a scheme for quantum computation in which quantum gates are implemented by partial quantum measurement on entangle states (Bell states).
Due to wavefunction collapse upon quantum measurement, such processes are not reversible on the total quantum state space — conversely, each such measurement-based gate operation “uses up the entanglement-resource” in order to implement (reversible) quantum gates on a computational subspace. Therefore one also speaks of “one-way quantum computation” [Raussendorf &Briegel (2001)].
The original articles:
Daniel Gottesman, Isaac L. Chuang, Quantum Teleportation is a Universal Computational Primitive, Nature 402 (1999) 390-393 [doi:10.1038/46503, arXiv:quant-ph/9908010]
Emanuel Knill, Raymond Laflamme, Gerard J. Milburn, A scheme for efficient quantum computation with linear optics, Nature 409 (2001) 46–52 [doi:10.1038/35051009]
Robert Raussendorf, Hans J. Briegel, A One-Way Quantum Computer, Phys. Rev. Lett. 86 (2001) 5188 [doi:10.1103/PhysRevLett.86.5188]
Michael Nielsen, Quantum computation by measurement and quantum memory, Physics Letters A 308 (2003) 96–100 [doi:10.1016/S0375-9601(02)01803-0]
Debbie W. Leung, Quantum computation by measurements, International Journal of Quantum Information 02 01 (2004) 33-43 [arXiv:quant-ph/0310189, doi:10.1142/S0219749904000055]
Review:
Towards formalizing measurement-based quantum protocols:
Using (motivating) the ZX-calculus for formalizing measurement-based quantum protocols
Last revised on March 7, 2023 at 14:13:08. See the history of this page for a list of all contributions to it.