Greedy randomized search for scalable compilation of quantum circuits

DOI10.1007/978-3-319-93031-2_32OpenAlexW2805793034MaRDI QIDQ1626768

Riccardo Rasconi, Angelo Oddi

Publication date: 21 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-93031-2_32

zbMATH Keywords

optimizationschedulingplanningquantum computingrandom algorithmsgreedy heuristics

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Quantum gates (81P65)

Related Items (5)

A General Branch-and-Cut Framework for Rotating Workforce Scheduling ⋮ Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices ⋮ Analyzing Heuristic-based Randomized Search Strategies for the Quantum Circuit Compilation Problem ⋮ A novel ant colony optimization strategy for the quantum circuit compilation problem ⋮ A framework for quantum-classical cryptographic translation

This page was built for publication: Greedy randomized search for scalable compilation of quantum circuits