THE PHYSICAL CHURCH-TURING THESIS AND THE PRINCIPLES OF QUANTUM THEORY

DOI10.1142/S0129054112500153zbMath1279.68096arXiv1102.1612OpenAlexW2962804872MaRDI QIDQ4902897

Gilles Dowek, Pablo Arrighi

Publication date: 18 January 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.1612

zbMATH Keywords

cellular automataquantum computing

Mathematics Subject Classification ID

Quantum computation (81P68) Cellular automata (computational aspects) (68Q80) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (5)

The stochastic thermodynamics of computation ⋮ What is the Church-Turing Thesis? ⋮ Semantics of quantum programming languages: Classical control, quantum control ⋮ An overview of quantum cellular automata ⋮ Unnamed Item

Cites Work

• Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
• Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
• More really is different
• Embedding infinitely parallel computation in Newtonian kinematics
• Locality and information transfer in quantum operations
• Experimental computation of real numbers by Newtonian machines
• Quantum theory: concepts and methods
• Non-Turing computations via Malament--Hogarth space-times
• Unnamed Item

This page was built for publication: THE PHYSICAL CHURCH-TURING THESIS AND THE PRINCIPLES OF QUANTUM THEORY