Interference as a computational resource: a tutorial

DOI10.1007/s11047-017-9654-xzbMath1528.68133OpenAlexW2769852198MaRDI QIDQ6084215

Mika Hirvensalo

Publication date: 30 November 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-017-9654-x

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Improved constructions for succinct affine automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum computing.
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
• Various Aspects of Finite Quantum Automata
• Rapid solution of problems by quantum computation
• Computational Complexity of Probabilistic Turing Machines
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum Computability
• Skepticism of quantum computing
• Probabilistic automata

This page was built for publication: Interference as a computational resource: a tutorial