QUANTUM QUERY COMPLEXITY OF CONSTANT-SIZED SUBGRAPH CONTAINMENT (Q2909539): 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 / arXiv ID
 
Property / arXiv ID: 1109.4165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid solution of problems by quantum computation / rank
 
Normal rank
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: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by quantum arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: From quantum cellular automata to quantum lattice gases / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the absence of homogeneous scalar unitary cellular automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum simulations of classical random walks and undirected graph connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Walk Algorithm for Element Distinctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds for the collision and the element distinctness problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Algorithms for Element Distinctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Algorithms for the Triangle Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of Ambainis lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures and decision tree complexity: a survey. / rank
 
Normal rank

Revision as of 15:38, 5 July 2024

scientific article
Language Label Description Also known as
English
QUANTUM QUERY COMPLEXITY OF CONSTANT-SIZED SUBGRAPH CONTAINMENT
scientific article

    Statements

    QUANTUM QUERY COMPLEXITY OF CONSTANT-SIZED SUBGRAPH CONTAINMENT (English)
    0 references
    0 references
    30 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    quantum query complexity
    0 references
    learning graph
    0 references
    0 references