On quantum realisation of Boolean functions by the fingerprinting technique (Q3225895): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum branching programs and space-bounded nonuniform quantum complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of probabilistic and quantum branching program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Constructions of Quantum Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and quantum grammars / rank
 
Normal rank

Revision as of 00:17, 5 July 2024

scientific article
Language Label Description Also known as
English
On quantum realisation of Boolean functions by the fingerprinting technique
scientific article

    Statements

    Identifiers

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