Two-particle quantum walks: Entanglement and graph isomorphism testing
The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
We study discrete-time quantum walks on the line and on general undirected graphs with two interacting or noninteracting particles. We introduce two simple interaction schemes and show that they both lead to a diverse range of probability distributions that depend on the correlations and relative phases between the initial coin states of the two particles. We investigate the characteristics of these quantum walks and the time evolution of the entanglement between the two particles from both separable and entangled initial states. We also test the capability of two-particle discrete-time quantum walks to distinguish nonisomorphic graphs. For strongly regular graphs, we show that noninteracting discrete-time quantum walks can distinguish some but not all nonisomorphic graphs with the same family parameters. By incorporating an interaction between the two particles, all nonisomorphic strongly regular graphs tested are successfully distinguished.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Quantum random walks: An introductory overview
Kempe, J. (2003) · Contemporary Physics · doi:10.1080/00107151031000110776 · Cited by 1,413
Quantum random-walk search algorithm
Shenvi, N., Kempe, J., & Whaley, K. B. (2003) · Physical Review A · doi:10.1103/physreva.67.052307 · Cited by 1,150
Quantum Walks of Correlated Photons
Peruzzo, A., Lobino, M., Matthews, J. C. F., Matsuda, N., Politi, A., Poulios, K., Zhou, X.-Q., Lahini, Y., Ismail, N., Wörhoff, K., et al. (2010) · Science · doi:10.1126/science.1193515 · Cited by 929
Measures and dynamics of entangled states
Mintert, F., Carvalho, A. R. R., Kuś, M., & Buchleitner, A. (2005) · Physics Reports · doi:10.1016/j.physrep.2005.04.006 · Cited by 420
Quantum walk on a line with two entangled particles
Omar, Y., Paunković, N., Sheridan, L., & Bose, S. (2006) · Physical Review A · doi:10.1103/physreva.74.042304 · Cited by 149
Two-particle quantum walks applied to the graph isomorphism problem
Gamble, J. K., Friesen, M., Zhou, D., Joynt, R., & Coppersmith, S. N. (2010) · Physical Review A · doi:10.1103/physreva.81.052313 · Cited by 145
A classical approach to the graph isomorphism problem using quantum walks
Douglas, B. L., & Wang, J. B. (2008) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/41/7/075303 · Cited by 126
Self-citationQuantum random walk of two photons in separable and entangled states
Pathak, P. K., & Agarwal, G. S. (2007) · Physical Review A · doi:10.1103/physreva.75.032351 · Cited by 83
Rohde, P. P., Schreiber, A., Štefaňák, M., Jex, I., & Silberhorn, C. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/1/013001 · Cited by 81
Asymptotic entanglement in 2D quantum walks
Annabestani, M., Abolhasani, M. R., & Abal, G. (2010) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/43/7/075301 · Cited by 46
The meeting problem in the quantum walk
Štefanák, M., Kiss, T., Jex, I., & Mohring, B. (2006) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/39/48/009 · Cited by 24
Cited by
Quantum walks: a comprehensive review
Venegas-Andraca, S. E. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0432-5 · Cited by 934
A 2D Quantum Walk Simulation of Two-Particle Dynamics
Schreiber, A., Gábris, A., Rohde, P. P., Laiho, K., Štefaňák, M., Potoček, V., Hamilton, C., Jex, I., & Silberhorn, C. (2012) · Science · doi:10.1126/science.1218448 · Cited by 425
Efficient quantum walk on a quantum processor
Qiang, X., Loke, T., Montanaro, A., Aungskunsiri, K., Zhou, X., O’Brien, J. L., Wang, J. B., & Matthews, J. C. F. (2016) · Nature Communications · doi:10.1038/ncomms11511 · Cited by 108
Self-citationImplementing graph-theoretic quantum algorithms on a silicon photonic quantum walk processor
Qiang, X., Wang, Y., Xue, S., Ge, R., Chen, L., Liu, Y., Huang, A., Fu, X., Xu, P., Yi, T., et al. (2021) · Science Advances · doi:10.1126/sciadv.abb8375 · Cited by 96
Self-citationQuantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer
Huerta Alderete, C., Singh, S., Nguyen, N. H., Zhu, D., Balu, R., Monroe, C., Chandrashekar, C. M., & Linke, N. M. (2020) · Nature Communications · doi:10.1038/s41467-020-17519-4 · Cited by 48
Metadata
- Authors
- Berry, S. D., & Wang, J. B.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2011-04-14
- Volume
- 83
- Issue
- 4
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2037771163
- Cited by
- 152
- References
- 12
- FWCI
- 8.57
- Type
- journal article
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.