Vertices cannot be hidden from quantum spatial search for almost all random graphs (Q1654045): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exponential algorithmic speedup by a quantum walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noise resistance of adiabatic quantum computation using random matrix theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust quantum spatial search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spatial search by continuous-time quantum walk with multiple marked vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian versus adjacency matrix in quantum walk search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entrywise bounds for eigenvectors of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral statistics of Erdős-Rényi graphs. I: Local semicircle law / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectra of general random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral measure of large random Hankel, Markov and Toeplitz matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral techniques applied to sparse random graphs / rank
 
Normal rank

Latest revision as of 07:08, 16 July 2024

scientific article
Language Label Description Also known as
English
Vertices cannot be hidden from quantum spatial search for almost all random graphs
scientific article

    Statements

    Vertices cannot be hidden from quantum spatial search for almost all random graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 August 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    quantum spatial search
    0 references
    random graphs
    0 references
    continuous-time quantum walk
    0 references
    Erdős-Rényi graphs
    0 references
    0 references
    0 references
    0 references