CoChat
Sign Up
Cited by 128

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

Entanglement in coined quantum walks on regular graphs

Carneiro, Ivens, Loo, Meng, Xu, Xibai, Girerd, Mathieu, Kendon, Viv, Knight, Peter L·2005·New Journal of Physics
DOI 10.1088/1367-2630/7/1/156
Open this paper in CoChat — free account

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.1088/1367-2630/7/1/156

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?

  • After several steps, coin-position entanglement converges to a well-defined value determined by the initial state for a given evolution operator.

    “After several steps, the coin-position entanglement (CPE) converges to a well defined value which depends on the initial state.”

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

  • For a one-dimensional Hadamard walk starting at the origin with |L or |R as the initial coin, the asymptotic CPE is E0 ≃ 0.872.

    “In this cases, the asymptotic CPE is E 0 ≃ 0.872, [21,31].”

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

  • The method is applicable to other coin operations such as Grover or DFT.

    “Our method is also applicable to other cases of interest, such as the Grover or DFT coin operations [21].”

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

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: 22

  1. Childs A M Cleve R Deotto E Farhi E Gutmann S Spielman D A, 2003, Proc. 35th Annual ACM Symp. on Theory of Computing (STOC 2003), 59
  2. Magniez F Santha M Szegedy M, 2005, Proc. 16th ACM - SIAM Symp. on Discrete Algorithms, 1109
  3. 10.1109/FOCS.2004.54 · DOI
  4. Kempe J, 2003, Contemp. Phys., 44, 302, 10.1080/00107151031000110776 · DOI · Paper page
  5. 10.1142/S0219749903000383 · DOI · Paper page
  6. Jerrum M Sinclair A Vigoda E, 2001, Proc. 33rd Annual ACM Symp. on Theory of Computing (STOC 2001), 712
  7. Schöning U, 1999, 40th Ann. Symp. on Found. of Comp. Sci., 17
  8. 10.1145/102782.102783 · DOI
  9. Motwani R, 1995, Randomized Algorithms, 10.1017/CBO9780511814075 · DOI
  10. 10.1006/jcss.2000.1732 · DOI
  11. Aharanov D Ambainis A Kempe J Vazirani U, 2001, Proc. 33rd Annual ACM Symp. on Theory of Computing (STOC 2001), 50
  12. Ambainis A Bach E Nayak A Vishwanath A Watrous J, 2001, Proc. 33rd Annual ACM Symp. on Theory of Computing (STOC 2001), 60
  13. 10.1103/PhysRevA.70.022314 · DOI · Paper page
  14. 10.1103/PhysRevA.70.042312 · DOI · Paper page
  15. Mackay T D, 2002, J. Phys. A: Math. Gen., 35, 2745, 10.1088/0305-4470/35/12/304 · DOI · Paper page
  16. Tregenna B, 2003, New J. Phys., 5, 83, 10.1088/1367-2630/5/1/383 · DOI
  17. 10.1103/PhysRevA.71.022307 · DOI
  18. 10.1016/j.optcom.2003.09.024 · DOI
  19. 10.1016/j.jcss.2004.03.005 · DOI
  20. Moore C, 2002, Proc. 6th Int. Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM '02), 164, 10.1007/3-540-45726-7_14 · DOI
  21. Ahmadi A, 2003, Quantum Inform. Comput., 3, 611, 10.26421/QIC3.6-4 · DOI
  22. Kempe J, 2003, Proc. 7th Int. Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM '03)

Cited by

Sorted by citations

Metadata

Authors
Carneiro, I., Loo, M., Xu, X., Girerd, M., Kendon, V., & Knight, P. L.
Venue
New Journal of Physics
Publisher
IOP Publishing
Published
2005-07-12
Volume
7
Pages
156-156
ISSN
1367-2630
DOI
10.1088/1367-2630/7/1/156
Cited by
128
References
5

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