Complexity of reversible circuits and their quantum implementations (Q2634672): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reversible Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Young subgroups for reversible computers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On figures of merit in reversible and quantum logic designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3886867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Circuit Optimization by Hadamard Gate Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for reversible circuits based on Young subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank

Latest revision as of 11:36, 11 July 2024

scientific article
Language Label Description Also known as
English
Complexity of reversible circuits and their quantum implementations
scientific article

    Statements

    Complexity of reversible circuits and their quantum implementations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 February 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    complexity analysis
    0 references
    reversible functions
    0 references
    reversible circuits
    0 references
    quantum circuits
    0 references
    upper bounds
    0 references
    synthesis
    0 references
    technology mapping
    0 references
    0 references
    0 references