A novel ant colony optimization strategy for the quantum circuit compilation problem
From MaRDI portal
Recommendations
- A novel quantum ant colony optimizing algorithm
- A quantum ant colony algorithm for the multi-task coalition problem
- scientific article; zbMATH DE number 6129228
- A quantum-inspired ant colony algorithm for graph coloring problem
- scientific article; zbMATH DE number 6311365
- Fidelity-based ant colony algorithm with Q-learning of quantum system
- A quantum-inspired ant colony algorithm for Steiner minimum tree problem
- Analyzing heuristic-based randomized search strategies for the quantum circuit compilation problem
- Ant colonies for the quadratic assignment problem
Cites work
- A hybrid heuristic for the \(p\)-median problem
- Ant colony optimization.
- Experimental evaluation of pheromone models in ACOPlan
- Greedy randomized search for scalable compilation of quantum circuits
- scientific article; zbMATH DE number 5899272 (Why is no real title available?)
- scientific article; zbMATH DE number 2201583 (Why is no real title available?)
- Introduction to algorithms
- Quantum computation and quantum information. 10th anniversary edition
- Semi-greedy heuristics: An empirical study
Cited in
(3)
This page was built for publication: A novel ant colony optimization strategy for the quantum circuit compilation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233514)