RECORD
Lively quantum walks on cycles
Quantum Physics · Submitted 9 Dec 2015
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We show that the liveliness parameter, controlling the magnitude of the additional long-range move, has a direct impact on the periodicity of the limiting distribution.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
We introduce a family of quantum walks on cycles parametrized by their liveliness, defined by the ability to execute a long-range move. We investigate the behaviour of the probability distribution and time-averaged probability distribution. We show that the liveliness parameter, controlling the magnitude of the additional long-range move, has a direct impact on the periodicity of the limiting distribution. We also show that the introduced model provides a method for network exploration which is robust against trapping.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We introduce a family of quantum walks on cycles parametrized by their liveliness, defined by the ability to execute a long-range move. | contribution 0.99 | 0.90 | 0.08 | asserted 0.99 |
| s1 | We investigate the behaviour of the probability distribution and time-averaged probability distribution. | contribution 0.80 | 0.88 | 0.04 | unclear 0.53 |
| s2 | We show that the liveliness parameter, controlling the magnitude of the additional long-range move, has a direct impact on the periodicity of the limiting distribution. | result 1.00 | 0.95 | 0.49 | asserted 1.00 |
| s3 | We also show that the introduced model provides a method for network exploration which is robust against trapping. | result 0.73 | 0.92 | 0.26 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
We introduce a family of quantum walks on cycles parametrized by their liveliness, defined by the ability to execute a long-range move. We investigate the behaviour of the probability distribution and time-averaged probability distribution. We show that the liveliness parameter, controlling the magnitude of the additional long-range move, has a direct impact on the periodicity of the limiting distribution. We also show that the introduced model provides a method for network exploration which is robust against trapping.
Human review
How the literature uses it
What this paper does with the arXiv papers it cites
What it cites · 1 sentence without a confident label
Cites as background 4 papers
-
Quantum walks [ref] , quantum counterparts of classical Markov processes, provide a powerful method for developing new quantum algorithms [ref] and protocols [ref] .
Quantum walks with memory on cycles · Introduction · 1.00
-
Quantum walks [ref] , quantum counterparts of classical Markov processes, provide a powerful method for developing new quantum algorithms [ref] and protocols [ref] .
Quantum network exploration with a faulty sense of direction · Introduction · 1.00
-
Quantum walks [ref] , quantum counterparts of classical Markov processes, provide a powerful method for developing new quantum algorithms [ref] and protocols [ref] .
Quantum spatial search on planar networks · Introduction · 1.00
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.