Cited by 81Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Multi-walker discrete time quantum walks on arbitrary graphs, their properties and their photonic implementation

Open access
Rohde, Peter P, Schreiber, Andreas, Štefaňák, Martin, Jex, Igor, Silberhorn, Christine·2011·New Journal of Physics

Abstract

Quantum walks have emerged as an interesting alternative to the usual circuit model for quantum computing. While still universal for quantum computing, the quantum walk model has very different physical requirements, which lends itself more naturally to some physical implementations, such as linear optics. Numerous authors have considered walks with one or two walkers, on one dimensional graphs, and several experimental demonstrations have been performed. In this paper we discuss generalizing the model of discrete time quantum walks to the case of an arbitrary number of walkers acting on arbitrary graph structures. We present a formalism which allows for analysis of such situations, and several example scenarios for how our techniques can be applied. We consider the most important features of quantum walks -- measurement, distinguishability, characterization, and the distinction between classical and quantum interference. We also discuss the potential for physical implementation in the context of linear optics, which is of relevance to present day experiments.

AI snapshot

Written from the paper’s full text.

TL;DR

The paper develops a walker-operator formalism for discrete-time quantum walks with multiple walkers on arbitrary graphs, distinguishing indistinguishable from distinguishable walkers and analyzing measurement, characterization, and correlations. It applies the framework to two-photon linear-optics walks and shows that coherent-light implementations can reproduce only special cases, such as all walkers starting in the same position.

Key findings

  • Introduces a walker operator \(w(x,c)^\dagger\) and graph-dependent unitary operators \(A(x)\) to describe multi-walker discrete-time quantum walks on arbitrary graphs; the walk is characterized by the initial state and the coin matrices.
  • The joint probability distribution (JPD) has dimension \(O(N^n)\), where \(N\) is the number of position states and \(n\) the number of walkers, whereas single-walker characterization scales as \(O(N)\); full characterization is therefore infeasible for large numbers of walkers.
  • In two-photon line simulations with 4 and 7 levels (8 and 14 output modes), indistinguishable walkers produce correlated JPDs while distinguishable walkers produce uncorrelated product JPDs; for the 4-level case the correlation entropy is \(H(P)=1.74\) for indistinguishable walkers versus \(0\) for distinguishable walkers, and for the 7-level case the single-click distributions differ by \(L_1=0.04\).
  • Coherent states can simulate an arbitrary quantum walk when all walkers are initialized into the same position state, but not generally when walkers enter different inputs; a single-beamsplitter counterexample gives \(|11\rangle \to (|20\rangle+|02\rangle)/\sqrt{2}\), so one photon at each output is never measured, which coherent states cannot mimic.

Methods

  • Theoretical formalism: defines an empty walker state, walker creation operators, arbitrary bidirectional weighted graphs, neighborhood unitaries \(A(x)\), and coin/step operators, allowing time-dependent coins.
  • Two-photon linear-optics example: uses a beamsplitter coin represented as block-diagonal \(B_2 = H_0 \oplus H_1 \oplus H_2\), with Hong–Ou–Mandel interference in the two-photon block; simulates 4-level and 7-level walks with 8 and 14 output modes.
  • Analysis includes joint and coincidence probabilities, single-click projections, a correlation entropy measure, and comparison with coherent-state implementations, including a distinguishability parameter \(\alpha\) for partial indistinguishability.

Limitations

  • Stated in the paper: full JPD characterization scales as \(O(N^n)\) and is infeasible for large numbers of walkers, necessitating algorithm-specific metrics.
  • Stated in the paper: coherent states can simulate multiple walkers only in special cases—distinguishable photons or all walkers beginning in the same initial state—and cannot mimic nonseparable statistics from different inputs.
  • Evident from the text: the work is theoretical and simulation-based, with no new experimental data; it discusses potential photonic implementation and notes concurrent experimental demonstration by Peruzzo et al. The paper also states that diagonal meeting terms require number-resolving detection.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1088/1367-2630/13/1/013001

Cites

26 of 26 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Claims the paper makes

0 of 24 cited sources checked · 0 supported · 0 flagged

  • Findingcitation
    § C. The transition from distinguishable to indistinguishable walkers · p. 7

    The interference patterns differ between indistinguishable and distinguishable walker scenarios.

    “Notice the differing interference patterns between the indistinguishable and distinguishable walker scenarios [15].”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [15] source

      Not checked in the free run.

  • Findingreasoning
    § D. Photon correlation · p. 7

    For the 4-level walk, distinguishable walkers have H(P)=0 because the JPD is uncorrelated and diagonalizable with a single non-zero coefficient.

    “For distinguishable walkers the JPD is uncorrelated, so it is diagonalizable with a single non-zero coefficient, hence p 1 = 1 and H ( P ) = 0.”
    Quote in the paperNot a substantial claim
  • Findingnone given
    § IV. CONCLUSION · p. 8

    Single walker walks have linear scaling in terms of the number of parameters describing the system.

    “We have shown that single walker walks have linear scaling in terms of the number of parameters describing the system”
    Quote in the paperSubstantial claim
  • Findingown data
    § B. Photon statistics for the two photon quantum walk · p. 6

    In the 4-level system, two-photon interference is characterized by the suppression of the two diagonal peaks.

    “In the case of the 4 level system, it is evident that the two photon interference is characterized by the suppression of the two diagonal peaks.”
    Quote in the paperNot a substantial claim
  • Findingown data
    § B. Photon statistics for the two photon quantum walk · p. 6

    The projection onto single click events in the case of indistinguishable and distinguishable walkers produces very similar statistics.

    “Interestingly, the projection onto single click events in the case of indistinguishable and distinguishable walkers produce very similar statistics.”
    • Also stated in: § C. The transition from distinguishable to indistinguishable walkers · p. 7 · plain
      “However, upon projection onto single click events, both scenarios produce similar statistics.”
    Quote in the paperNot a substantial claim
  • Classified as probably not a substantial claim. 18
  • May combine two claims. 23
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingnone given
    § I. INTRODUCTION · p. 2

    At each step the reach of the position state expands outwards across the line.

    “At each step the reach of the position state expands outwards across the line.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingnone given
    § B. Photon statistics for the two photon quantum walk · p. 6

    In the case of distinguishable walkers, the coincidence matrix is uncorrelated and can be obtained by multiplying the single photon statistics along one axis by the single photon statistics along the other axis.

    “Note that in the case of distinguishable walkers the coincidence matrix is uncorrelated and can be obtained by multiplying the single photon statistics along one axis by the single photon statistics along the other axis.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingown data
    § B. Photon statistics for the two photon quantum walk · p. 6

    For the 7-level two-photon quantum walk, the projection onto single click events for distinguishable and indistinguishable walkers shows no discernible visual difference, with a small numerical L1 difference of 0.04.

    “Visually there is no discernable difference in (c) between the distinguishable probabilities ( P (1) i ) and indistinguishable probabilities ( P (2) i ), although there is a small numerical difference L 1 = 1 2 ∑ i | P (1) i -P (2) i | = 0 . 04.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingreasoning
    § D. Photon correlation · p. 7

    For indistinguishable walkers in the 4-level walk, H(P) is necessarily greater than zero, and in this example H(P)=1.74.

    “On the other hand, for indistinguishable walkers H ( P ) is necessarily greater than zero. In this example we have H ( P ) = 1 . 74, a characteristic of photon correlations.”
    Quote in the paperNot a substantial claim
  • Classified as probably not a substantial claim.

    Findingnone given
    § E. Comparison with coherent state implementations · p. 8

    For a single beamsplitter with two inputs and two outputs, putting a single photon into each port transforms the state |11> to (|20> + |02>)/√2.

    “Should we put a single photon into each beamsplitter port the system undergoes the transformation | 11 〉 → ( | 20 〉 + | 02 〉 ) / √ 2.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingreasoning
    § E. Comparison with coherent state implementations · p. 8

    Upon number-resolving detection after that transformation, both photons are always measured at one port or both at the other, each with 50% probability, and one photon at each output is never measured.

    “Thus upon performing number resolving detection, we will always measure both photons at one port or both photons at the other (each with 50% probability), whereas one photon at each output will never be measured.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingown data
    § B. Photon statistics for the two photon quantum walk · p. 6

    In the JPD of indistinguishable particles, clear oscillations exist between different terms, distinct from the distinguishable case, and this structure is lost upon projection into one dimension.

    “Notice that in the JPD of indistinguishable particles exist clear oscillations between different terms, which are distinct from the distinguishable case. This structure is lost upon projection into one dimension.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Premisecitation
    § I. INTRODUCTION · p. 1

    The first experiments investigating the impact of correlations in quantum walks with two walkers were done in the continuous time model, showing correlations by classical intensity correlation measurements and using coincidence measurements of two photons of a PDC source.

    “The first experiments investigating the impact of correlations in quantum walks with two walkers were done in the continuous time model: Bromberg et. al [15] showed correlations by classical intensity correlation measurements and Peruzzo et. al [16] used coincidence measurements of two photons of a PDC source, both with integrated wave guide devices.”
    Quote in the paperNot a substantial claim0 of 2 sources checked
    • cites [15] source

      Not checked in the free run.

    • cites [16] source

      Not checked in the free run.

  • Classified as probably not a substantial claim. May combine two claims.

    Interpretationnone given
    § I. INTRODUCTION · p. 1

    Quantum walks involving more particles unlock additional possibilities unavailable in classical random walks, as quantum particles can be entangled or indistinguishable fermions or bosons.

    “Indeed, quantum walks involving more particles unlock additional possibilities which are unavailable in classical random walks, as the quantum particles can be entangled or they can be indistinguishable fermions or bosons.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation
    § I. INTRODUCTION · p. 1

    Quantum walks offer an alternate approach to implementing quantum algorithms compared to the typical circuit or cluster state models for quantum algorithms.

    “Quantum walks [1] offer an alternate approach to implementing quantum algorithms [2] compared to the typical circuit [3] or cluster state [4, 5] models for quantum algorithms.”
    Quote in the paperNot a substantial claim0 of 3 sources checked
    • cites [1] source

      Not checked in the free run.

    • cites [2] Aharonov D Ambainis A Kempe J Vazirani U, 2001

      Not checked in the free run.

    • cites [3] Nielsen M A, 2000, Quantum Computation and Quantum Information

      Not checked in the free run.

  • May combine two claims.

    Interpretationreasoning
    § II. MULTI-WALKER QUANTUM WALKS ON ARBITRARY GRAPHS · p. 3

    Using the formalism, the walk is characterized completely by the initial state and the unitary coin matrices of the graph; the evolution of a particular walker is characterized entirely by its neighborhood.

    “Using this formalism the walk is characterized completely by (1) the initial state of the system, and (2) the unitary coin matrices of the graph. Additionally, the evolution of a particular walker is characterized entirely by its neighborhood in the graph.”
    Quote in the paperSubstantial claim
    • The authors state this as an assumption: The coin is independent of the number of walkers (no nonlinear cross-Kerr effects), so propagation is defined entirely by linear elements.
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisenone given
    § I. INTRODUCTION · p. 2

    The algorithm implemented by a quantum walk is characterized entirely by the choice of coin and step operators.

    “In fact, the algorithm implemented by a quantum walk is characterized entirely by this choice.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation
    § I. INTRODUCTION · p. 1

    Quantum walks have been successfully applied to database search and graph isomorphism problems.

    “Indeed, quantum walks have been successfully applied to database search [6] and graph isomorphism [7] problems.”
    Quote in the paperNot a substantial claim0 of 2 sources checked
    • cites [6] source

      Not checked in the free run.

    • cites [7] Douglas B L, 2008, J. Phys. A: Math Theor. source

      Not checked in the free run.

  • May combine two claims.

    Interpretationreasoning
    § II. MULTI-WALKER QUANTUM WALKS ON ARBITRARY GRAPHS · p. 2

    For arbitrary graphs with varying degree, a single coin cannot describe the dynamics of the entire graph; unique A(x) operators must be defined for every neighborhood.

    “In general, arbitrary graphs will have varying degree, i.e. different neighborhoods contain different numbers of vertices. Thus in general we cannot use a single coin to describe the dynamics of the entire graph. Instead, unique A ( x ) operators must be defined for every neighborhood.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Premisecitation
    § I. INTRODUCTION · p. 1

    Photonic discrete time quantum walks were experimentally demonstrated using weak coherent light and using single photons produced via parametric down-conversion.

    “Indeed, photonic discrete time quantum walks were experimentally demonstrated by Schreiber et al. [13] using weak coherent light and by Broome et. al [14] using single photons produced via parametric down-conversion (PDC).”
    Quote in the paperNot a substantial claim0 of 2 sources checked
    • cites [13] source

      Not checked in the free run.

    • cites [14] source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisenone given
    § I. INTRODUCTION · p. 2

    The choice of coin and step operators can vary at each step of the walk.

    “Not only can we choose arbitrary operators, but, in general, the choice can vary at each step of the walk.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation
    § I. INTRODUCTION · p. 1

    The universality of quantum walks has been shown for continuous and discrete systems.

    “More recently, the universality of quantum walks has been shown in the case of continuous [8] and discrete [9] systems.”
    Quote in the paperNot a substantial claim0 of 2 sources checked
    • cites [8] source

      Not checked in the free run.

    • cites [9] source

      Not checked in the free run.

  • May combine two claims.

    Interpretationreasoning
    § II. MULTI-WALKER QUANTUM WALKS ON ARBITRARY GRAPHS · p. 2

    The step operator in the general formalism must change both the coin and the position to ensure unitarity; the analogous transformation that updates only position would not be reversible.

    “This slight change in the formalism is necessary to ensure unitarity of the step operator. For example, if in analogy to Eq. 1 our step operator implemented the transformation w ( x, j ) † → w ( j, j ) † , the operation would not be reversible.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationreasoning
    § E. Comparison with coherent state implementations · p. 8

    In general, coherent states can only simulate multiple walkers in special cases: with distinguishable photons, which generate separable statistics, and when multiple walkers begin in the same initial state.

    “Thus, in general, coherent states can only simulate multiple walkers in special cases: (1) with distinguishable photons, which generate separable statistics, and (2) the example presented above where multiple walkers begin in the same initial state.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationnone given
    § C. The transition from distinguishable to indistinguishable walkers · p. 7

    In an arbitrary quantum walk, distinguishable walkers are possible with an appropriate choice of coin and step operators, and this arises naturally with distinguishable photons.

    “However, in an arbitrary quantum walk, distinguishable walkers are also possible with an appropriate choice of coin and step operators. This arises naturally with distinguishable photons.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationreasoning
    § D. Measurement · p. 5

    For distinguishable walkers, the coincidence probability contains no interference terms and has an uncorrelated form, i.e., it can be represented as the product of two independent functions.

    “This expression contains no interference terms, as expected. It is evident from Eq. 11 that for distinguishable walkers the coincidence probability has an uncorrelated form, i.e. it can be represented as the product of two independent functions.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationreasoning
    § Acknowledgments · p. 9

    For indistinguishable photons, normalization of the JPD requires the sum of the lower triangular elements of the matrix to be 1.

    “In the case of indistinguishable photons, for normalization we require that the sum of the lower triangular elements of the matrix be 1, ∑ N i =1 ∑ i j =1 P ij = 1, where N is the number of output modes.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Premisecitation
    § I. INTRODUCTION · p. 2

    Because the position states propagate in both directions, interference between the position states takes place; this is the defining feature that differentiates the quantum walk from a classical random walk.

    “Additionally, because the position states propagate in both directions, interference between the position states takes place. This is the defining feature that differentiates the quantum walk from a classical random walk [27].”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [27]

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationnone given
    § C. Characterizing quantum walks · p. 4

    The JPD can be used to derive any output statistics of interest.

    “The JPD can be used to derive any output statistics of interest.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Premisenone given
    § I. INTRODUCTION · p. 2

    The particular choice of coin and step operators for the one-dimensional walk can be optically implemented using 50/50 beamsplitters.

    “This particular choice of coin and step operators can be optically implemented using 50/50 beamsplitters.”
    Quote in the paperNot a substantial claim
    • The authors state this as an assumption: The coin is independent of the number of walkers (no nonlinear cross-Kerr effects), so propagation is defined entirely by linear elements.
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Premisenone given
    § II. MULTI-WALKER QUANTUM WALKS ON ARBITRARY GRAPHS · p. 2

    In general, time-dependent coins are allowed, and the evolution of the system is of the form ∏ i SC_i.

    “In general, time-dependent coins are allowed, and the evolution of the system will be of the form ∏ i SC i , where C i is the coin operator at time step i .”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Interpretationreasoning
    § C. The transition from distinguishable to indistinguishable walkers · p. 7

    When incident photons are in the same spatio-temporal mode, they will interfere within the quantum walk; when distinguishable, they will not interfere and evolve independently.

    “In the former case the incident photons will interfere within the quantum walk, whereas in the later case they will not and instead evolve completely independently of one another and no interference will be observed.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Premisecitation
    § C. Characterizing quantum walks · p. 4

    Differences in the meeting probability can be found also in the asymptotic regime, but quantum effects on the long-time scale are much more subtle, as discussed in Ref. [20].

    “Moreover, the differences in the meeting probability can be found also in the asymptotic regime. However, the quantum effects on the long-time scale are much more subtle, as discussed in detail in Ref. [20].”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [20] Štefaňák M, 2006, J. Phys. A: Math. Gen. source

      Not checked in the free run.

  • May combine two claims.

    Interpretationreasoning
    § C. Characterizing quantum walks · p. 4

    Fully characterizing the statistics of a multi-walker quantum walk is infeasible with large numbers of walkers, necessitating development of algorithm-specific metrics.

    “This implies that fully characterizing the statistics of a multi-walker quantum walk is infeasible with large numbers of walkers, necessitating the development of algorithm specific metrics for characterizing the system which do not require exponentially large numbers of measurements.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S4 (based). May combine two claims.

    Interpretationnone given
    § B. Distinguishable versus indistinguishable walkers · p. 4

    Indistinguishable walkers interfere with one another, and this is the interesting case.

    “In the following sections we will primarily consider the situation of indistinguishable walkers, since this is the interesting case where the walkers interfere with one another.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation
    § Acknowledgments · p. 8

    Peruzzo et al. experimentally demonstrated an optical implementation of a two photon quantum walk which overlaps with the techniques presented here.

    “While preparing this manuscript Peruzzo et. al [16] experimentally demonstrated an optical implementation of a two photon quantum walk which overlaps with the techniques presented here.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [16] source

      Not checked in the free run.

  • May combine two claims.

    Interpretationreasoning
    § D. Measurement · p. 4

    Upon measurement of a single walker, the factorizable nature of the two-walker state is lost, and the resulting state contains cross-combinations from different terms.

    “Thus, upon measurement the factorizeable nature of the state is lost, and our resulting state contains crosscombinations from the different terms in the initially factorizeable state.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationcitation
    § C. The transition from distinguishable to indistinguishable walkers · p. 7

    In the case of distinguishable walkers, {m,n} and {n,m} are distinct, leading to a different normalization condition than for indistinguishable walkers.

    “In the case of distinguishable walkers, { m,n } and { n, m } are now distinct. This leads to a different normalization condition than for the indistinguishable case [32].”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [32]

      Not checked in the free run.

    • The authors state this as an assumption: Detectors can resolve the distinct modes a and b.
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation
    § D. Photon correlation · p. 7

    This correlation was experimentally observed by Bromberg et al. in a continuous time quantum walk.

    “This was experimentally observed by Bromberg et. al in a continuous time quantum walk [15].”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [15] source

      Not checked in the free run.

  • May combine two claims.

    Interpretationreasoning
    § B. Photon statistics for the two photon quantum walk · p. 6

    The two-photon JPD and its projection onto one dimension can both be directly experimentally measured.

    “The two photon JPD and its projection onto one dimension can both be directly experimentally measured.”
    Quote in the paperNot a substantial claim
35 of 35
  • The authors state this as an assumption.

    The coin is independent of the number of walkers (no nonlinear cross-Kerr effects), so propagation is defined entirely by linear elements.

    “Importantly, in the above formalism we have implicitly assumed that the coin is independent of the number of walkers. For example, in the optical context one might imagine that the coin is based on a cross-Kerr effect, in which case the coin is dependent on the number of walkers. We implicitly rule out these kinds of effects such that, for example, in the optical case (to be discussed in detail in”
  • The authors state this as an assumption.

    Walkers with the same position and coin values are indistinguishable in the initial formalism.

    “In the above discussion we have implicitly assumed that walkers with the same position and coin values are indistinguishable, i.e. if we have two walkers in a given position and coin state, measurement cannot determine which walker is which.”
  • The authors state this as an assumption.

    The incident photons are indistinguishable for the two-photon beamsplitter coin analysis.

    “For now we assume the incident photons are indistinguishable.”
  • The paper relies on this without support.

    Quantum walks are universal for quantum computation.

    “Quantum walks have been shown to be universal for quantum computation”
  • The authors state this as an assumption.

    Detectors can resolve the distinct modes a and b.

    “assuming the detectors can resolve the difference between a † and b †”
    “assuming the detector is able to resolve the distinct modes a and b”
5 of 5

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?

  • True quantum effects, and genuine efficiency improvements in emulating quantum systems, will only emerge for non-classical input states.

    “True quantum effects, and genuine efficiency improvements in emulating quantum systems, will only emerge for non-classical input states as pointed out (for discrete-time walks) in [26].”

    From Two-photon quantum walks in an elliptical direct-write waveguide array (2011) · cites this paper as [26]

    Section E (pp. 7–8) shows that coherent light can reproduce some discrete-time multi-walker walks, but generally cannot reproduce the non-classical interference of single photons entering at different inputs. This supports the distinction between classical and genuinely quantum effects. The passages do not establish that non-classical inputs yield efficiency improvements in emulating quantum systems. (LLM, conf=0.85)

    Experimental — accuracy not yet measured
  • These single-photon walks can be efficiently simulated classically and it is not until multi-photon states are input that quantum effects are observed.

    “However, these walks can be efficiently simulated classically and it is not until we input multi-photon states that we observe quantum effects [26].”

    From Two-photon quantum walks in an elliptical direct-write waveguide array (2011) · cites this paper as [26]

    In “Characterizing quantum walks” (p. 4), the paper says a single walker requires O(N) parameters, consistent with efficient classical simulation. In “Comparison with coherent state implementations” (pp. 7–8), it identifies non-classical interference for photons entering different inputs, but also says multi-photon walks starting at the same input can be simulated with coherent light. Thus multi-photon input alone does not guarantee the claimed quantum effects. (LLM, conf=0.84)

    Experimental — accuracy not yet measured

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Rohde, P. P., Schreiber, A., Štefaňák, M., Jex, I., & Silberhorn, C.
Affiliations
  • The University of Queensland (AU)
  • Max Planck Institute for the Science of Light (DE)
  • Czech Technical University in Prague (CZ)
  • Paderborn University (DE)
Venue
New Journal of Physics
Published
2011-01-05
Volume
13
Issue
1
Pages
013001
ISSN
1367-2630 (ISSN-L)
OpenAlex
W1968909259
Cited by
81
References
26
Citations by year
2026: 5 · 2025: 4 · 2024: 2 · 2023: 4 · 2022: 4 · 2021: 3 · 2020: 7 · 2019: 8 · 2018: 7 · 2017: 1 · 2016: 3 · 2015: 4 · 2014: 3 · 2013: 6 · 2012: 14
FWCI
8.55
Type
journal article
Language
en
Open access
Licence
cc-by
Locations
  • New Journal of Physics (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • OPUS - Open Publications of UTS Scholars (University of Technology Sydney) (submittedVersion)
  • MPG.PuRe (Max Planck Society) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
discrete-time quantum walks, arbitrary graphs, linear optics, distinguishability, quantum interference, measurement, quantum computing models

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.

Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-07.

Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-07.

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