Pith. Sign in

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.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1512.02802 (version 2)
Pith ID3ZBJH3BE, Pith's permanent record of this paper and its review
CitationJaros{\l}aw Adam Miszczak, Mateusz Ostaszewski, Przemys{\l}aw Sadowski. "Lively quantum walks on cycles." arXiv:1512.02802 (2015). https://pith.science/paper/3ZBJH3BE
Claim paper

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

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,507 input tokens.

What the abstract itself states, as probabilities: claims first 0.06 · states limitation 0.07 · human participants 0.02 · controlled comparison 0.05 · randomized assignment 0.01 · states quantitative result 0.07 · compares with prior results 0.11 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

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

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
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 kind of paper the classifier reports this is: theoretical result 0.55 · evidence from proof or derivation 0.96.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

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

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

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.