How does adiabatic quantum computation fit into quantum automata theory?

DOI10.1016/j.ic.2021.104694OpenAlexW2999562494MaRDI QIDQ5918616

Tomoyuki Yamakami

Publication date: 14 March 2022

Published in: Information and Computation (Search for Journal in Brave)

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

zbMATH Keywords

HamiltonianSchrödinger equationdecision problemquantum finite automataadiabatic quantum computationpromise problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• One-way reversible and quantum finite automata with advice
• Unbounded-error quantum computation with small space bounds
• A new family of nonstochastic languages
• Improved constructions of mixed state quantum automata
• Theory of one-tape linear-time Turing machines
• Quantum automata and quantum grammars
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
• Reversible pushdown automata
• Two-way finite automata with quantum and classical states.
• Behavioral strengths and weaknesses of various models of limited automata
• Relativizations of nonuniform quantum finite automata families
• Polynomial time quantum computation with advice
• Algebraic results on quantum automata
• Local Transition Functions of Quantum Turing Machines
• Quantum computational networks
• Quantum Phase Transitions
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Characterizations of 1-Way Quantum Finite Automata
• Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Complexity Theory
• Quantum State Complexity of Formal Languages
• ANALYSIS OF QUANTUM FUNCTIONS
• State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis
• Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice

This page was built for publication: How does adiabatic quantum computation fit into quantum automata theory?