A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles

DOI10.1063/1.5119235zbMath1431.81044arXiv1907.01258OpenAlexW3100134366WikidataQ126334850 ScholiaQ126334850MaRDI QIDQ5218804

Yimin Ge, Vedran Dunjko

Publication date: 5 March 2020

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Quantum control (81Q93)

Related Items (1)

Using small-scale quantum devices to solve algebraic equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure
• Reversible space equals deterministic space
• A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
• Universal Quantum Simulators
• Faster ground state preparation and high-precision ground energy estimation with fewer qubits
• The Traveling Salesman Problem for Cubic Graphs
• A full derandomization of schöning's k-SAT algorithm

This page was built for publication: A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles