A novel ant colony optimization strategy for the quantum circuit compilation problem

DOI10.1007/978-3-030-72904-2_1zbMath1474.68322OpenAlexW3147014759MaRDI QIDQ2233514

Riccardo Rasconi, Marco Baioletti, Angelo Oddi

Publication date: 18 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-72904-2_1

zbMATH Keywords

schedulingplanningant colony optimizationquantum circuit compilation

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Quantum gates (81P65)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Experimental evaluation of pheromone models in ACOPlan
• Greedy randomized search for scalable compilation of quantum circuits
• Semi-greedy heuristics: An empirical study
• A hybrid heuristic for the \(p\)-median problem
• Quantum Computation and Quantum Information

This page was built for publication: A novel ant colony optimization strategy for the quantum circuit compilation problem