Degree Distribution in Quantum Walks on Complex Networks
Open accessThe DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Abstract
Google's search engine algorithmically determines the relative importance of the world's webpages by exploiting the physics of a classical random walker on the complex network of nodes (pages) and links (hyperlinks). What happens if the classical random walker is replaced by a quantum one? Researchers develop and investigate a simple model of a quantum walker on a complex network, uncovering interesting quantum-classical correspondence as well as fundamentally intriguing differences.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Penrose, M. (2003) · doi:10.1093/acprof:oso/9780198506263.001.0001 · Cited by 2,480
Self-similar community structure in a network of human interactions
Guimerà, R., Danon, L., Díaz-Guilera, A., Giralt, F., & Arenas, A. (2003) · Physical Review E · doi:10.1103/physreve.68.065103 · Cited by 1,515
Quantum random walks: An introductory overview
Kempe, J. (2003) · Contemporary Physics · doi:10.1080/00107151031000110776 · Cited by 1,413
Quantum computation and decision trees
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.58.915 · Cited by 1,215
Environment-assisted quantum walks in photosynthetic energy transfer
Mohseni, M., Rebentrost, P., Lloyd, S., & Aspuru-Guzik, A. (2008) · The Journal of Chemical Physics · doi:10.1063/1.3002335 · Cited by 1,189
Universal Computation by Quantum Walk
Childs, A. M. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.180501 · Cited by 1,002
Caruso, F., Chin, A. W., Datta, A., Huelga, S. F., & Plenio, M. B. (2009) · The Journal of Chemical Physics · doi:10.1063/1.3223548 · Cited by 655
Perseguers, S., Lewenstein, M., Acín, A., & Cirac, J. I. (2010) · Nature Physics · doi:10.1038/nphys1665 · Cited by 139
Paparo, G. D., & Martin-Delgado, M. A. (2012) · Scientific Reports · doi:10.1038/srep00444 · Cited by 136
Quantum stochastic walks: A generalization of classical random walks and quantum walks
Whitfield, J. D., Rodríguez-Rosario, C. A., & Aspuru-Guzik, A. (2010) · Physical Review A · doi:10.1103/physreva.81.022323 · Cited by 126
Cited by
Spatial Search by Quantum Walk is Optimal for Almost all Graphs
Chakraborty, S., Novo, L., Ambainis, A., & Omar, Y. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.100501 · Cited by 164
Spectral Entropies as Information-Theoretic Tools for Complex Network Comparison
De Domenico, M., & Biamonte, J. (2016) · Physical Review X · doi:10.1103/physrevx.6.041062 · Cited by 160
Self-citationComplex networks from classical to quantum
Biamonte, J., Faccin, M., & De Domenico, M. (2019) · Communications Physics · doi:10.1038/s42005-019-0152-6 · Cited by 149
Self-citationComplex quantum network geometries: Evolution and phase transitions
Bianconi, G., Rahmede, C., & Wu, Z. (2015) · Physical Review E · doi:10.1103/physreve.92.022815 · Cited by 63
Lu, D., Biamonte, J. D., Li, J., Li, H., Johnson, T. H., Bergholm, V., Faccin, M., Zimborás, Z., Laflamme, R., Baugh, J., et al. (2016) · Physical Review A · doi:10.1103/physreva.93.042302 · Cited by 58
“Here we develop an approach based on a complex network theory viewpoint of quantum systems [4, 11, 12], in which probability transfer is directed by the controlled breaking of time-reversal symmetry, creating a so-called chiral quantum walk [13– 17].”
BackgroundMethodSelf-citationCommunity Detection in Quantum Complex Networks
Faccin, M., Migdał, P., Johnson, T. H., Bergholm, V., & Biamonte, J. D. (2014) · Physical Review X · doi:10.1103/physrevx.4.041012 · Cited by 43
Self-citationSupersymmetric multiplex networks described by coupled Bose and Fermi statistics
Bianconi, G. (2015) · Physical Review E · doi:10.1103/physreve.91.012810 · Cited by 32
Complex quantum networks: From universal breakdown to optimal transport
Mülken, O., Dolgushev, M., & Galiceanu, M. (2016) · Physical Review E · doi:10.1103/physreve.93.022304 · Cited by 26
Quantized recurrence time in unital iterated open quantum dynamics
Sinkovicz, P., Kurucz, Z., Kiss, T., & Asbóth, J. K. (2015) · Physical Review A · doi:10.1103/physreva.91.042108 · Cited by 21
Metadata
- Authors
- Faccin, M., Johnson, T., Biamonte, J., Kais, S., & Migdał, P.
- Venue
- Physical Review X
- Publisher
- American Physical Society (APS)
- Published
- 2013-10-24
- Volume
- 3
- Issue
- 4
- ISSN
- 2160-3308 (ISSN-L)
- OpenAlex
- W2024134595
- Cited by
- 45
- References
- 15
- FWCI
- 4.05
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.