In this paper we present a VQA for solving the TSP problem that requires only O(n log n) qubits and an Ansatz whose topology evolves via Simulated Annealing.
-
Updated
Oct 29, 2025 - Python
In this paper we present a VQA for solving the TSP problem that requires only O(n log n) qubits and an Ansatz whose topology evolves via Simulated Annealing.
Master Thesis: Evolutionary search algorithm for hybrid classical-quantum GAN for image generation.
Add a description, image, and links to the ansatz-search topic page so that developers can more easily learn about it.
To associate your repository with the ansatz-search topic, visit your repo's landing page and select "manage topics."