Quantum walks can find a marked element on any graph (Q262276): 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 Walk Algorithm 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: Quantum verification of matrix products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum complexity of testing group commutativity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spatial search and the Dirac equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete quantum walks hit exponentially faster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster quantum-walk algorithm for the two-dimensional spatial search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hitting times of quantum versus random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Is as Easy as Detecting for Quantum Walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3262596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of probability and random processes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithms revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with Noisy Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem / rank
 
Normal rank

Latest revision as of 16:08, 11 July 2024

scientific article
Language Label Description Also known as
English
Quantum walks can find a marked element on any graph
scientific article

    Statements

    Quantum walks can find a marked element on any graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 March 2016
    0 references
    quantum algorithms
    0 references
    quantum walks
    0 references
    Markov chains
    0 references
    interpolated quantum walks
    0 references

    Identifiers

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