Instant Computing - A New Computation Paradigm
| dc.creator | Thomann, Hans-Rudolf | |
| dc.date | 2006-10-19 | |
| dc.date | 2008-01-12 | |
| dc.date.accessioned | 2026-07-07T08:53:43Z | |
| dc.date.available | 2026-07-07T08:53:43Z | |
| dc.description | Voltage peaks on a conventional computer's power lines allow for the well-known dangerous DPA attacks. We show that measurement of a quantum computer's transient state during a computational step reveals information about a complete computation of arbitrary length, which can be extracted by repeated probing, if the computer is suitably programmed. Instant computing, as we name this mode of operation, recognizes for any total or partial recursive function arguments lying in the domain of definition and yields their function value with arbitrary small error probability in probabilistic linear time. This implies recognition of (not necessarily recursively enumerable) complements of recursively enumerable sets and the solution of the halting problem. Future quantum computers are shown to be likely to allow for instant computing, and some consequences are pointed out. | |
| dc.description | Final version, 34 pages. Theorem 3 generalized and strengthened. Review results implemented. Typos corrected | |
| dc.identifier | https://arxiv.org/abs/cs/0610114 | |
| dc.identifier | http://arxiv.org/abs/cs/0610114 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/145721 | |
| dc.subject | Computational Complexity | |
| dc.subject | Cryptography and Security | |
| dc.subject | Quantum Physics | |
| dc.subject | F.1.1; F.1.2; F.1.3; F.1.4 | |
| dc.title | Instant Computing - A New Computation Paradigm | |
| dc.type | text |