Analyzing Heuristic-based Randomized Search Strategies for the Quantum Circuit Compilation Problem (Q5140145): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Semi-greedy heuristics: An empirical study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computation and Quantum Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized search for scalable compilation of quantum circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449304 / rank
 
Normal rank

Revision as of 04:25, 24 July 2024

scientific article; zbMATH DE number 7285110
Language Label Description Also known as
English
Analyzing Heuristic-based Randomized Search Strategies for the Quantum Circuit Compilation Problem
scientific article; zbMATH DE number 7285110

    Statements

    Analyzing Heuristic-based Randomized Search Strategies for the Quantum Circuit Compilation Problem (English)
    0 references
    0 references
    0 references
    14 December 2020
    0 references
    quantum computing
    0 references
    optimization
    0 references
    scheduling
    0 references
    planning
    0 references
    greedy heuristics
    0 references
    random algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references