RECORD
Quantum walks with memory on cycles
Quantum Physics · Submitted 14 Jan 2013
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk.
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 study the model of quantum walks on cycles enriched by the addition of 1-step memory. We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. Using the obtained results, we discuss the properties of the introduced model and the difference in comparison to the memoryless model.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We study the model of quantum walks on cycles enriched by the addition of 1-step memory. | contribution 0.91 | 0.56 | 0.06 | asserted 0.91 |
| s1 | We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. | result 0.51 | 0.96 | 0.35 | asserted 1.00 |
| s2 | Using the obtained results, we discuss the properties of the introduced model and the difference in comparison to the memoryless model. | interpretation 0.70 | 0.85 | 0.21 | asserted 0.80 |
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 study the model of quantum walks on cycles enriched by the addition of 1-step memory. We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. Using the obtained results, we discuss the properties of the introduced model and the difference in comparison to the memoryless model.
Human review
How the literature uses it
1 arXiv paper cite this in 1 sentence
Papers citing it
Cites it as background 1 paper
-
Quantum walks [ref] , quantum counterparts of classical Markov processes, provide a powerful method for developing new quantum algorithms [ref] and protocols [ref] .
Lively quantum walks on cycles · Introduction · 1.00
What it cites · 6 sentences without a confident label
Builds on 3 papers
-
In this paper we introduce and study the model of quantum walks on cycle [ref] enriched by the addition of 1-step memory [ref] .
One Dimensional Quantum Walks with Memory · Introduction · 0.86
-
In this paper we introduce and study the model of quantum walks on cycle [ref] enriched by the addition of 1-step memory [ref] .
Quantum Walks On Graphs · Introduction · 0.86
-
In this paper we introduce and study the model of quantum walks on cycle [ref] enriched by the addition of 1-step memory [ref] .
Quantum walks on cycles · Introduction · 0.86
Uses the method or tool of 2 papers
-
In order to obtain the expression for the amplitudes of the quantum walk with memory on cycle we use the method introduced in [ref] and represent time evolution of the walk using the Fourier transform [equation] From the above we get a recursive relation for the time evolution in the Fourier basis [equation] where [equation]
Quantum Walk on the Line · Fourier analysis · 0.96
-
In order to obtain expression for the probability distribution on the cycle we use Fourier analysis method [ref] .
Limit theorems for quantum walks with memory · Fourier analysis · 1.00
Cites as background 1 paper
-
The survey of quantum algorithms based on quantum walks is presented in [ref] .
Quantum walks and their algorithmic applications · Introduction · 0.99
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.