Note on a universal quantum Turing machine. (English) Zbl 1221.81042
Summary: In this Letter, we construct a novel model of universal quantum Turing machine (QTM) by means of a property of Riemann zeta function, which is free from the specific time for an input data and efficiently simulates each step of a given QTM.
MSC:
| 81P68 | Quantum computation |
| 68Q12 | Quantum algorithms and complexity in the theory of computing |
| 68Q05 | Models of computation (Turing machines, etc.) (MSC2010) |
| 11M26 | Nonreal zeros of \(\zeta (s)\) and \(L(s, \chi)\); Riemann and other hypotheses |
References:
| [1] | Deutsch, D., Proc. R. Soc. London A, 400, 97 (1985) · Zbl 0900.81019 |
| [2] | Bernstein, E.; Vazirani, U., SIAM J. Comput., 26, 1411 (1997) · Zbl 0895.68042 |
| [3] | Shi, Y., Phys. Lett. A, 293, 277 (2002) · Zbl 1058.81009 |
| [4] | M. Ohya, I.V. Volovich, Quantum Computers, Teleportations and Cryptography, Springer-Verlag, 2008, in press; M. Ohya, I.V. Volovich, Quantum Computers, Teleportations and Cryptography, Springer-Verlag, 2008, in press |
| [5] | Miyadera, T.; Ohya, M., Open Syst. Inf. Dyn., 12, 3, 261 (2006) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
