Analyzing heuristic-based randomized search strategies for the quantum circuit compilation problem

DOI10.3233/FI-2020-1942MaRDI QIDQ5140145zbMATH OpenOpenAlexFDO

Authors Angelo Oddi, Riccardo Rasconi

Publication date 14 December 2020

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2020-1942

zbMATH Keywords

greedy heuristicsoptimizationplanningquantum computingrandom algorithmsscheduling

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Quantum gates (81P65) Quantum computation (81P68)

Recommendations

• Greedy randomized search for scalable compilation of quantum circuits
• Improving quantum computation by optimized qubit routing
• A novel ant colony optimization strategy for the quantum circuit compilation problem
• Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures
• Exact global reordering for nearest neighbor quantum circuits using \({\mathrm {A}}^{*}\)

Cites work

• A hybrid heuristic for the \(p\)-median problem
• Greedy randomized search for scalable compilation of quantum circuits
• scientific article; zbMATH DE number 2038893 (Why is no real title available?)
• scientific article; zbMATH DE number 2038901 (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
• Temporal planning using subgoal partitioning and resolution in SGPlan

Cited in

(12)

• Greedy randomized search for scalable compilation of quantum circuits
• \textit{OptQC} v1.3: an (updated) optimized parallel quantum compiler
• The complexity of quantum circuit mapping with fixed parameters
• Quantum circuit design for objective function maximization in gate-model quantum computers
• A novel ant colony optimization strategy for the quantum circuit compilation problem
• Qubits' mapping and routing for NISQ on variability of quantum gates
• Deterministic algorithms for compiling quantum circuits with recurrent patterns
• Boolean satisfiability in quantum compilation
• An Efficient Method for Quantum Circuit Placement Problem on a 2-D Grid
• Evaluating the Flexibility of A* for Mapping Quantum Circuits
• SWAP test for an arbitrary number of quantum states
• Quantum circuit compilation for nearest-neighbor architecture based on reinforcement learning

This page was built for publication: Analyzing heuristic-based randomized search strategies 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 Q5140145)