Related Experiment Video
Updated: Jan 22, 2026

05:30
Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
1.1K
Clustering-induced localization of quantum walks on networks
Lucas Böttcher1,2, Mason A Porter3,4,5
1Frankfurt School of Finance and Management, Department of Computational Science and Philosophy, 60322 Frankfurt am Main, Germany.
Physical Review. E
|January 21, 2026
Summary
Quantum walks on networks exhibit localization, a phenomenon influenced by network structure. This study reveals that local clustering in networks can induce this localization, impacting quantum information processing.
Area of Science:
- Quantum Information Theory
- Network Science
- Condensed Matter Physics
Background:
- Quantum walks are essential models in quantum information theory with applications in search and analysis.
- Unlike classical walks, quantum walks evolve unitarily and do not reach a stationary distribution.
- Understanding the long-time behavior and network impact on quantum walks is crucial for applications.
Purpose of the Study:
- To investigate the phenomenon of localization in continuous-time quantum walks on networks.
- To derive an analytical expression for the long-time inverse participation ratio.
- To explore the relationship between network structure, particularly local clustering, and quantum walk localization.
Main Methods:
- Derivation of an analytical expression for the long-time inverse participation ratio.
- Analysis of quantum walks on specifically constructed highly clustered networks (recursively attached triangles).
- Examination of quantum walks on established network models: Kleinberg navigable small-world and Holme-Kim power-law cluster networks.
Main Results:
- An analytical expression for the long-time inverse participation ratio was derived, dependent on eigenvectors of the quantum-walk Hamiltonian.
- Localization was observed in constructed highly clustered networks.
- Localization was also demonstrated in Kleinberg navigable small-world and Holme-Kim power-law cluster networks, confirming the role of local clustering.
Conclusions:
- Local clustering is a key network feature that can induce localization of continuous-time quantum walks.
- The findings provide insights into the long-time dynamics of quantum walks and their dependence on network topology.
- This research contributes to understanding quantum walk behavior for potential applications in quantum information processing and network analysis.
Related Concept Videos
Quantum Numbers
49.4K
It is said that the energy of an electron in an atom is quantized; that is, it can be equal only to certain specific values and can jump from one energy level to another but not transition smoothly or stay between these levels.
49.4K
The Quantum-Mechanical Model of an Atom
56.7K
Shortly after de Broglie published his ideas that the electron in a hydrogen atom could be better thought of as being a circular standing wave instead of a particle moving in quantized circular orbits, Erwin Schrödinger extended de Broglie’s work by deriving what is now known as the Schrödinger equation. When Schrödinger applied his equation to hydrogen-like atoms, he was able to reproduce Bohr’s expression for the energy and, thus, the Rydberg formula governing hydrogen spectra.
56.7K
Protein Networks
4.5K
An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
4.5K
Protein Networks
2.8K
2.8K
Network Covalent Solids
16.1K
Network covalent solids contain a three-dimensional network of covalently bonded atoms as found in the crystal structures of nonmetals like diamond, graphite, silicon, and some covalent compounds, such as silicon dioxide (sand) and silicon carbide (carborundum, the abrasive on sandpaper). Many minerals have networks of covalent bonds.
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
16.1K
Cluster Sampling Method
14.1K
Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
14.1K

