These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

326 related articles for article (PubMed ID: 27015464)

  • 1. Spatial Search by Quantum Walk is Optimal for Almost all Graphs.
    Chakraborty S; Novo L; Ambainis A; Omar Y
    Phys Rev Lett; 2016 Mar; 116(10):100501. PubMed ID: 27015464
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Optimal Quantum Spatial Search on Random Temporal Networks.
    Chakraborty S; Novo L; Di Giorgio S; Omar Y
    Phys Rev Lett; 2017 Dec; 119(22):220503. PubMed ID: 29286791
    [TBL] [Abstract][Full Text] [Related]  

  • 3. How Fast Do Quantum Walks Mix?
    Chakraborty S; Luh K; Roland J
    Phys Rev Lett; 2020 Feb; 124(5):050501. PubMed ID: 32083889
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Systematic Dimensionality Reduction for Quantum Walks: Optimal Spatial Search and Transport on Non-Regular Graphs.
    Novo L; Chakraborty S; Mohseni M; Neven H; Omar Y
    Sci Rep; 2015 Sep; 5():13304. PubMed ID: 26330082
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Quadratic Speedup for Spatial Search by Continuous-Time Quantum Walk.
    Apers S; Chakraborty S; Novo L; Roland J
    Phys Rev Lett; 2022 Oct; 129(16):160502. PubMed ID: 36306753
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A parameter-independent algorithm of finding maximum clique with Seidel continuous-time quantum walks.
    Li X; Chen X; Hu S; Xu J; Liu Z
    iScience; 2024 Feb; 27(2):108953. PubMed ID: 38333715
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents.
    Draief M; Ganesh A
    Discret Event Dyn Syst; 2011; 21(1):41-61. PubMed ID: 32214674
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Finding structural anomalies in star graphs using quantum walks.
    Cottrell S; Hillery M
    Phys Rev Lett; 2014 Jan; 112(3):030501. PubMed ID: 24484125
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Deterministic Search on Star Graphs via Quantum Walks.
    Qu D; Marsh S; Wang K; Xiao L; Wang J; Xue P
    Phys Rev Lett; 2022 Feb; 128(5):050501. PubMed ID: 35179941
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Systematic dimensionality reduction for continuous-time quantum walks of interacting fermions.
    Izaac JA; Wang JB
    Phys Rev E; 2017 Sep; 96(3-1):032136. PubMed ID: 29346966
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Phase transitions in the coloring of random graphs.
    Zdeborová L; Krzakała F
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Sep; 76(3 Pt 1):031131. PubMed ID: 17930223
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Robustness of random graphs based on graph spectra.
    Wu J; Barahona M; Tan YJ; Deng HZ
    Chaos; 2012 Dec; 22(4):043101. PubMed ID: 23278036
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Marking Vertices to Find Graph Isomorphism Mapping Based on Continuous-Time Quantum Walk.
    Wang X; Zhang Y; Lu K; Wang X; Liu K
    Entropy (Basel); 2018 Aug; 20(8):. PubMed ID: 33265675
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Connectivity is a poor indicator of fast quantum search.
    Meyer DA; Wong TG
    Phys Rev Lett; 2015 Mar; 114(11):110503. PubMed ID: 25839249
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Quantum walk processes in quantum devices.
    Madhu AK; Melnikov AA; Fedichkin LE; Alodjants AP; Lee RK
    Heliyon; 2023 Mar; 9(3):e13416. PubMed ID: 36895413
    [TBL] [Abstract][Full Text] [Related]  

  • 16. On the centrality of vertices of molecular graphs.
    Randić M; Novič M; Vračko M; Plavšić D
    J Comput Chem; 2013 Nov; 34(29):2514-23. PubMed ID: 23955387
    [TBL] [Abstract][Full Text] [Related]  

  • 17. The average distances in random graphs with given expected degrees.
    Chung F; Lu L
    Proc Natl Acad Sci U S A; 2002 Dec; 99(25):15879-82. PubMed ID: 12466502
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Implementing graph-theoretic quantum algorithms on a silicon photonic quantum walk processor.
    Qiang X; Wang Y; Xue S; Ge R; Chen L; Liu Y; Huang A; Fu X; Xu P; Yi T; Xu F; Deng M; Wang JB; Meinecke JDA; Matthews JCF; Cai X; Yang X; Wu J
    Sci Adv; 2021 Feb; 7(9):. PubMed ID: 33637521
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Mean first-passage time for random walks in general graphs with a deep trap.
    Lin Y; Julaiti A; Zhang Z
    J Chem Phys; 2012 Sep; 137(12):124104. PubMed ID: 23020321
    [TBL] [Abstract][Full Text] [Related]  

  • 20. AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS.
    Kundeti V; Rajasekaran S; Dinh H
    Discrete Math Algorithms Appl; 2010; 1():184-196. PubMed ID: 25364472
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 17.