Superiority of exact quantum automata for promise problems (Q413305): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum zero-error algorithms cannot be composed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Queries on Permutations with a Promise / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quantum and probabilistic communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and quantum grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encyclopedia of Complexity and Systems Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computation with write-only memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded-error quantum computation with small space bounds / rank
 
Normal rank

Latest revision as of 04:19, 5 July 2024

scientific article
Language Label Description Also known as
English
Superiority of exact quantum automata for promise problems
scientific article

    Statements

    Superiority of exact quantum automata for promise problems (English)
    0 references
    0 references
    0 references
    4 May 2012
    0 references
    0 references
    computational complexity
    0 references
    exact quantum computation
    0 references
    promise problems
    0 references
    succinctness
    0 references
    quantum finite automaton
    0 references
    classical finite automaton
    0 references
    0 references
    0 references