Hypercomputation with quantum adiabatic processes

DOI10.1016/j.tcs.2003.12.006zbMath1072.68040OpenAlexW2088160568MaRDI QIDQ1434370

Tien D. Kieu

Publication date: 4 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.12.006

zbMATH Keywords

Hilbert's tenth problemHypercomputationTuring halting problemQuantum adiabatic computation

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Quantum computation (81P68)

Related Items

An explicit solution to Post's problem over the reals ⋮ The case for hypercomputation ⋮ Zeno machines and hypercomputation ⋮ Computational Complexity in Non-Turing Models of Computation ⋮ A Survey on Analog Models of Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum computational networks
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum Complexity Theory
• A reformulation of Hilbert's tenth problem through quantum mechanics
• The Diagonal Method and Hypercomputation