Machine learning by adiabatic evolutionary quantum systems (preliminary report)

DOI10.1007/978-3-032-15641-9_16MaRDI QIDQ7348935zbMATH OpenFDO

Authors Tomoyuki Yamakami

Publication date 15 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-15641-9_16

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites work

• A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
• Adiabatic quantum computation is equivalent to standard quantum computation
• How does adiabatic quantum computation fit into quantum automata theory?
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice
• Quantum algorithms revisited
• Quantum Complexity Theory
• Quantum computational networks
• Quantum Existence Testing and Its Application for Finding Extreme Values in Unsorted Databases
• Quantum theory, the Church–Turing principle and the universal quantum computer
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines

This page was built for publication: Machine learning by adiabatic evolutionary quantum systems (preliminary report)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7348935)