NASA NTRS · 20060040721
Quantum Resonance for Solving NP-Complete Problems by Simulations
Abstract
In this paper, the mathematical formalism of quantum resonance combined with tensor product decomposability of unitary evolutions is mapped onto a class of NP-complete combinatorial problems.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Zak, M.. 1998-02-17. Quantum Resonance for Solving NP-Complete Problems by Simulations. https://ntrs.nasa.gov/citations/20060040721
Cite the original work for its findings. Save a collection to share your selection of sources.