Note on a universal quantum Turing machine

DOI10.1016/J.PHYSLETA.2008.05.069zbMath1221.81042OpenAlexW2093429216MaRDI QIDQ717053

Satoshi Iriyama, Takayuki Miyadera, Masanori Ohya

Publication date: 27 September 2011

Published in: Physics Letters. A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physleta.2008.05.069

zbMATH Keywords

Riemann zeta functionquantum algorithmuniversal Turing machinequantum Turing machine

Mathematics Subject Classification ID

Quantum computation (81P68) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

Computational complexity and applications of quantum algorithm ⋮ New quantum algorithm solving the NP complete problem

Cites Work

• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum Complexity Theory
• Remarks on universal quantum computer

This page was built for publication: Note on a universal quantum Turing machine