Deterministic algorithms for compiling quantum circuits with recurrent patterns (Q2690498): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3174296785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum cryptography based on Bell’s theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean satisfiability in quantum compilation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Circuit Design of a T-count Optimized Integer Multiplier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Quantum Programming in Quipper / rank
 
Normal rank

Latest revision as of 17:48, 31 July 2024

scientific article
Language Label Description Also known as
English
Deterministic algorithms for compiling quantum circuits with recurrent patterns
scientific article

    Statements

    Deterministic algorithms for compiling quantum circuits with recurrent patterns (English)
    0 references
    0 references
    0 references
    0 references
    17 March 2023
    0 references
    0 references
    quantum compilation
    0 references
    recurrent patterns
    0 references
    RyRz circuits
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references