Analyzing Heuristic-based Randomized Search Strategies for the Quantum Circuit Compilation Problem

DOI10.3233/FI-2020-1942zbMath1498.68293OpenAlexW3091481203MaRDI QIDQ5140145

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

optimizationschedulingplanningquantum computingrandom algorithmsgreedy heuristics

Mathematics Subject Classification ID

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

Related Items (1)

SWAP test for an arbitrary number of quantum states

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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: Analyzing Heuristic-based Randomized Search Strategies for the Quantum Circuit Compilation Problem