Cited by 40

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Mixing times in quantum walks on the hypercube

Marquezino, F. L., Portugal, R., Abal, G., Donangelo, R.·2008·Physical Review A

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreva.77.042312

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The expressions presented can be readily applied to quantify the CPE of quantum walks in higher dimensions, such as the n-dimensional hypercube.

    “The expressions we have presented can be readily applied to quantify the CPE of quantum walks in higher dimensions, such as the n-dimensional hypercube [25,26].”

    From Asymptotic entanglement in 2D quantum walks (2010) · cites this paper as [26]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 13

  1. 10.1080/00107151031000110776 · DOI · Paper page
  2. A. Ambainis, 2004, Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS)
  3. 10.1103/PhysRevA.70.022314 · DOI · Paper page
  4. C. Moore, 2002, Proceedings of the 6th International Workshop on Randomization and Approximation Techniques (RANDOM 2002), Cambridge, MA
  5. J. Kempe, 2003, Proceedings of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM 03)
  6. 10.1103/PhysRevA.73.032341 · DOI
  7. D. Aharonov, 2001, Proceedings of the 33rd ACM Symposium on Theory of Computation (STOC’01)
  8. 10.1103/PhysRevA.67.032304 · DOI
  9. 10.1016/j.physa.2004.08.070 · DOI
  10. G. Abal, 2007, Physica A, 387, 335, 10.1016/j.physa.2007.08.058 · DOI
  11. 10.1103/PhysRevA.74.012312 · DOI
  12. 10.1103/PhysRevA.72.062304 · DOI
  13. 10.1088/1367-2630/9/4/087 · DOI

Cited by

Sorted by citations

Metadata

Authors
Marquezino, F. L., Portugal, R., Abal, G., & Donangelo, R.
Venue
Physical Review A
Published
2008-04-16
Volume
77
Issue
4
ISSN
  • 1050-2947
  • 1094-1622
Cited by
40
References
5
Language
en

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review