Quantum resonance for solving NP-complete problems by simulations

DOI10.1007/3-540-49208-9_13MaRDI QIDQ4939147zbMATH OpenFDO

Authors Michail Zak

Publication date 17 May 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-49208-9_13

zbMATH Keywords

quantum analog computingquantum resonance

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Quantum resonance for simulating combinatorial problems
• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• Quantum annealing of hard problems
• Quantum analog computing
• Quantum computation and NP-complete problems

Cited in

(5)

• Quantum analog computing
• Resonant transition-based quantum computation
• Analog quantum computing (AQC) and the need for time-symmetric physics
• Quantum computing
• Quantum resonance for simulating combinatorial problems

This page was built for publication: Quantum resonance for solving NP-complete problems by simulations

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