CoChat
Sign Up
Cited by 96Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyPhotonic and Optical Devices

Implementing graph-theoretic quantum algorithms on a silicon photonic quantum walk processor

Open access
Qiang, Xiaogang, Wang, Yizhi, Xue, Shichuan, Ge, Renyou, Chen, Lifeng, Liu, Yingwen, Huang, Anqi, Fu, Xiang +10 more·2021·Science Advances
DOI 10.1126/sciadv.abb8375PMC PMC7909884
Open this paper in CoChat — free account

Abstract

Programmable silicon photonics realizes universal control over quantum walks.

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.1126/sciadv.abb8375

Cites

11 of 11 references verified0 citation errors · 0 not checkable

Statistics

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?

  • Recent works reported 2D continuous-time quantum walks of correlated photons, relying on arrays of coupled waveguides, and important results have also been achieved by means of superconductive quantum processors.

    “Recent works reported 2D continuous-time quantum walks of correlated photons, relying on arrays of coupled waveguides 21,38,52 , and important results have been also achieved by means of superconductive quantum processors 6 .”

    From Quantum walks of two correlated photons in a 2D synthetic lattice (2022) · cites this paper as [52]

    The Introduction reports quantum walks in arrays of evanescently coupled waveguides, and the References list a study of correlated photon pairs in two-dimensional waveguide arrays. But this paper’s own Results describe a reconfigurable silicon photonic circuit, not a 2D coupled-waveguide array, so it supports the background claim rather than serving as an example of that implementation. The superconducting-processor clause is attached to a different citation. (LLM, conf=0.85)

    Experimental — accuracy not yet measured

Self-check

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

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

Cites

Flagged first, then by citations

Research works printed but not linked: 39

  1. [3]A. M. Childs, D. Gosset, Z. Webb, Universal computation by multiparticle quantum walk. Science 339, 791– 794 (2013). 23413349
  2. [5]M. Mohseni, P. Rebentrost, S. Lloyd, A. Aspuru-Guzik, Environment-assisted quantum walks in photosynthetic energy transfer. J. Chem. Phys. 129, 174106 (2008). 19045332
  3. [7]A. M. Childs, J. Goldstone, Spatial search by quantum walk. Phys. Rev. A 70, 022314 (2004).
  4. [8]B. L. Douglas, J. B. Wang, A classical approach to the graph isomorphism problem using quantum walks. J. Phys. A 41, 075303 (2008).
  5. [9]J. K. Gamble, M. Friesen, D. Zhou, R. Joynt, S. N. Coppersmith, Two-particle quantum walks applied to the graph isomorphism problem. Phys. Rev. A 81, 052313 (2010).
  6. [11]E. Sánchez-Burillo, J. Duch, J. Gómez-Gardeñes, D. Zueco, Quantum navigation and ranking in complex networks. Sci. Rep. 2, 605 (2012). 22930671 PMC3428603
  7. [13]M. Pant, D. Towsley, D. Englund, S. Guha, Percolation thresholds for photonic quantum computing. Nat. Commun. 10, 1070 (2019). 30842425 PMC6403388
  8. [15]A. J. Menssen, A. E. Jones, B. J. Metcalf, M. C. Tichy, S. Barz, W. S. Kolthammer, I. A. Walmsley, Distinguishability and many-particle interference. Phys. Rev. Lett. 118, 153603 (2017). 28452506
  9. [16]A. A. Melnikov, L. E. Fedichkin, Quantum walks of interacting fermions on a cycle graph. Sci. Rep. 6, 34226 (2016). 27681057 PMC5041091
  10. [18]S. Aaronson, A. Arkhipov, The computational complexity of linear optics, in Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (ACM, New York, 2011), pp. 333–342.
  11. [19]J. Du, H. Li, X. Xu, M. Shi, J. Wu, X. Zhou, R. Han, Experimental implementation of the quantum random-walk algorithm. Phys. Rev. A 67, 042316 (2003).
  12. [20]H. Schmitz, R. Matjeschk, C. Schneider, J. Glueckert, M. Enderlein, T. Huber, T. Schaetz, Quantum walk of a trapped ion in phase space. Phys. Rev. Lett. 103, 090504 (2009). 19792773
  13. [21]M. Karski, L. Förster, J.-M. Choi, A. Steffen, W. Alt, D. Meschede, A. Widera, Quantum walk in position space with single optically trapped atoms. Science 325, 174– 177 (2009). 19589996
  14. [25]X. Qiang, T. Loke, A. Montanaro, K. Aungskunsiri, X. Zhou, J. L. O’Brien, J. B. Wang, J. C. F. Matthews, Efficient quantum walk on a quantum processor. Nat. Commun. 7, 11511 (2016). 27146471 PMC4858748
  15. [28]H. B. Perets, Y. Lahini, F. Pozzi, M. Sorel, R. Morandotti, Y. Silberberg, Realization of quantum walks with negligible decoherence in waveguide lattices. Phys. Rev. Lett. 100, 170506 (2008). 18518267
  16. [29]J. D. A. Meinecke, K. Poulios, A. Politi, J. C. F. Matthews, A. Peruzzo, N. Ismail, K. Wörhoff, J. L. O’Brien, M. G. Thompson, Coherent time evolution and boundary conditions of two-photon quantum walks in waveguide arrays. Phys. Rev. A 88, 012308 (2013).
  17. [31]J. Carolan, C. Harrold, C. Sparrow, E. Martín-López, N. J. Russell, J. W. Silverstone, P. J. Shadbolt, N. Matsuda, M. Oguma, M. Itoh, G. D. Marshall, M. G. Thompson, J. C. F. Matthews, T. Hashimoto, J. L. O’Brien, A. Laing, Universal linear optics. Science 349, 711– 716 (2015). 26160375
  18. [35]M. Reck, A. Zeilinger, H. Bernstein, P. Bertani, Experimental realization of any discrete unitary operator. Phys. Rev. Lett. 73, 58– 61 (1994). 10056719
  19. [39]J. J. Renema, A. Menssen, W. R. Clements, G. Triginer, W. S. Kolthammer, I. A. Walmsley, Efficient classical algorithm for boson sampling with partially distinguishable photons. Phys. Rev. Lett. 120, 220502 (2018). 29906153
  20. [40]Y.-S. Ra, M. C. Tichy, H.-T. Lim, O. Kwon, F. Mintert, A. Buchleitner, Y.-H. Kim, Nonmonotonic quantum-to-classical transition in multiparticle interference. Proc. Natl. Acad. Sci. 110, 1227– 1231 (2013). 23297196 PMC3557023
  21. [41]M. Tillmann, S.-H. Tan, S. E. Stoeckl, B. C. Sanders, H. de Guise, R. Heilmann, S. Nolte, A. Szameit, P. Walther, Generalized multiphoton quantum interference. Phys. Rev. X 5, 041015 (2015).
  22. [43]S. Chakraborty, L. Novo, A. Ambainis, Y. Omar, Spatial search by quantum walk is optimal for almost all graphs. Phys. Rev. Lett. 116, 100501 (2016). 27015464
  23. [44]M. Cattaneo, M. A. C. Rossi, M. G. A. Paris, S. Maniscalco, Quantum spatial search on graphs subject to dynamical noise. Phys. Rev. A 98, 052347 (2018).
  24. [45]S. Chakraborty, L. Novo, S. D. Giorgio, Y. Omar, Optimal quantum spatial search on random temporal networks. Phys. Rev. Lett. 119, 220503 (2017). 29286791
  25. [46]L. Babai, Graph isomorphism in quasipolynomial time, in Proceedings of the 48th annual ACM Symposium on Theory of Computing (ACM, 2016), pp. 684–697.
  26. [47]I. Hen, A. P. Young, Solving the graph-isomorphism problem with a quantum annealer. Phys. Rev. A 86, 042310 (2012).
  27. [48]P. W. Mills, R. P. Rundle, J. H. Samson, S. J. Devitt, T. Tilma, V. M. Dwyer, M. J. Everitt, Quantum invariants and the graph isomorphism problem. Phys. Rev. A 100, 052317 (2019).
  28. [49]K. Brádler, S. Friedland, J. Izaac, N. Killoran, D. Su, Graph isomorphism and gaussian boson sampling. arXiv: 1810.10644 (2018). · arXiv
  29. [50]D. Emms, E. R. Hancock, S. Severini, R. C. Wilson, A matrix representation of graphs and its spectrum as a graph invariant. Electron. J. Comb. 13, R34 (2006).
  30. [51]S. D. Berry, J. B. Wang, Two-particle quantum walks: Entanglement and graph isomorphism testing. Phys. Rev. A 83, 042317 (2011).
  31. [52]K. Rudinger, J. K. Gamble, M. Wellons, E. Bach, M. Friesen, R. Joynt, S. N. Coppersmith, Noninteracting multiparticle quantum random walks applied to the graph isomorphism problem for strongly regular graphs. Phys. Rev. A 86, 022334 (2012).
  32. [55]M. J. Collins, C. Xiong, I. H. Rey, T. D. Vo, J. He, S. Shahnia, C. Reardon, T. F. Krauss, M. J. Steel, A. S. Clark, B. J. Eggleton, Integrated spatial multiplexing of heralded single-photon sources. Nat. Commun. 4, 2582 (2013). 24107840 PMC3826656
  33. [57]C. M. Wilkes, X. Qiang, J. Wang, R. Santagati, S. Paesani, X. Zhou, D. A. B. Miller, G. D. Marshall, M. G. Thompson, J. L. O’Brien, 60 db high-extinction auto-configured Mach–Zehnder interferometer. Opt. Lett. 41, 5318– 5321 (2016). 27842122
  34. [58]J. Mower, N. C. Harris, G. R. Steinbrecher, Y. Lahini, D. Englund, High-fidelity quantum state evolution in imperfect photonic integrated circuits. Phys. Rev. A 92, 032322 (2015).
  35. [61]J. A. Izaac, J. B. Wang, Systematic dimensionality reduction for continuous-time quantum walks of interacting fermions. Phys. Rev. E 96, 032136 (2017). 29346966
  36. [62]X. Qiang, X. Yang, J. Wu, X. Zhu, An enhanced classical approach to graph isomorphism using continuous-time quantum walk. J. Phys. A 45, 045305 (2012).
  37. [66]J. Smith, Algebraic aspects of multi-particle quantum walks, PhD thesis, University of Waterloo (2012).
  38. [67]H. Wang, J. Wu, X. Yang, X. Yi, A graph isomorphism algorithm using signatures computed via quantum walk search model. J. Phys. A 48, 115302 (2015).
  39. [68]Y. Liu, M. Xiong, C. Wu, D. Wang, Y. Liu, J. Ding, A. Huang, X. Fu, X. Qiang, P. Xu, M. Deng, X. Yang, J. Wu, Sample caching Markov chain Monte Carlo approach to boson sampling simulation. New J. Phys. 22, 033022 (2020).

Cited by

Sorted by citations

Authors
Qiang, X., Wang, Y., Xue, S., Ge, R., Chen, L., Liu, Y., Huang, A., Fu, X., Xu, P., Yi, T., Xu, F., Deng, M., Wang, J. B., Meinecke, J. D. A., Matthews, J. C. F., Cai, X., Yang, X., & Wu, J.
Affiliations
  • National University of Defense Technology (CN)
  • Sun Yat-sen University (CN)
  • National Innovation Institute of Defense Technology, AMS, 100071 Beijing, China.
  • Beijing Academy of Quantum Information Sciences (CN)
  • The University of Western Australia (AU)
  • Max Planck Institute of Quantum Optics (DE)
  • University of Bristol (GB)
Corresponding author
  • Qiang, Xiaogang
  • Cai, Xinlun
  • Wu, Junjie
ORCID
Venue
Science Advances
Publisher
American Association for the Advancement of Science (AAAS)
Published
2021-02-26
Volume
7
Issue
9
ISSN
2375-2548 (ISSN-L)
DOI
10.1126/sciadv.abb8375
PMC
PMC7909884
OpenAlex
W3133207140
Cited by
96
References
11
Citations by year
2026: 9 · 2025: 18 · 2024: 19 · 2023: 19 · 2022: 24 · 2021: 7
FWCI
6.10
Type
journal article
Language
en
Open access
Licence
Locations
  • Science Advances (publishedVersion, cc-by-nc)
  • PubMed Central (publishedVersion, cc-by-nc)
  • UWA Profiles and Research Repository (UWA) (publishedVersion, cc-by-nc)
  • PubMed (publishedVersion)
Funders
  • National Natural Science Foundation of China (11804389, 61632021)
  • BAQIS Research Program (Y18G16)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Photonic and Optical Devices
Keywords
quantum walks, silicon photonics, indistinguishability, graph isomorphism testing, programmable quantum processors, continuous-variable quantum optics

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