arXiv (All)
open access
Pulsation of quantum walk on finite graph
We study discrete-time quantum walks on weighted graphs, where every edge in an edge cut set is assigned a small weight $ε>0$. The parameter $ε$ represents the strength of the connections through the cut edges: as $ε\to 0$, these connections vanish, and the graph decomposes into the connected compon
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Localization Without Disorder: Quantum Walks on Structured Graphs#924057
- Localization Without Disorder: Quantum Walks on Structured Graphs#919828
- Circuit Implementation of Discrete-Time Quantum Walks on Complex Networks#160823
- Laziness of Quantum Walks on Graphs#659293
- Laziness of Quantum Walks on Graphs#657157
Record · ID 1217143
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive