Nondeterministic testing of Sequential Quantum Logic propositions on a quantum computer
| dc.creator | Leifer, M. S. | |
| dc.date | 2005-09-28 | |
| dc.date.accessioned | 2026-07-07T06:19:44Z | |
| dc.date.available | 2026-07-07T06:19:44Z | |
| dc.description | In the past few years it has been shown that universal quantum computation can be obtained by projective measurements alone, with no need for unitary gates. This suggests that the underlying logic of quantum computing may be an algebra of sequences of quantum measurements rather than an algebra of products of unitary operators. Such a Sequential Quantum Logic (SQL) was developed in the late 70's and has more recently been applied to the consistent histories framework of quantum mechanics as a possible route to the theory of quantum gravity. In this letter, I give a method for deciding the truth of a proposition in SQL with nonzero probability of success on a quantum computer. | |
| dc.description | 4 pages | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0509193 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0509193 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/95129 | |
| dc.subject | Quantum Physics | |
| dc.title | Nondeterministic testing of Sequential Quantum Logic propositions on a quantum computer | |
| dc.type | text |