Pith.

Quantum Physics · arXiv:2611.17061 v1 · submitted 12 Nov 2026 · 33 references

Multi-particle quantum walk search on a two-dimensional lattice

Gonçalo Meneses, D. O. Oriekhov

The paper says

“In the present paper we study the formulation of a search problem and the efficiency of multi-particle quantum walk search algorithms. The discrete-time evolution of each particle in space is treated according to Grover's quantum walk evolution operator.”

more of the abstract

We focus on the local interactions models, where the particles' states are modified only when two or more of them appear on the same grid site. The main focus is given to the two-dimensional grid in space. We study the dependence of the search algorithm asymptotic success time and probability on the interaction strength and the generated maximal entanglement between particles. We show that the interacting and non-interacting two- and three-particle search algorithm attains a constant factor improvement over the single-particle counterpart. In addition, we provide a new generalized model of interactions for multi-particle quantum walks.

from the abstract

Pith says

Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person

It can be wrong. Challenge this review or reply to it.

Holds up, with conditions. Solid numerical demonstration of a constant-factor speedup for P=2 quantum walk search on a 2D grid, but the central claim rests on an unproven two-level approximation and the P=3 data is too limited to confirm the √P trend. This line is wrong

4 major objections · 12 minor

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the 33 references say.

The paper says, at §VII, Eq. (39)

The review did not quote this passage.

A classifier read this sentence of the paper as acknowledging the concern (probability 0.70):

“It is important to note, however, that since the walk operator is applied an integer number of times,τserves only to characterize the scaling, while Tpeak andp peak remain the operational figures of merit at each simulated size.”

Pith says: Objection 1 of 4 · major

The entire speedup claim τ(P) ≃ τ(1)/√P is extracted from fitting the success probability to the two-level form p_succ(T) ≃ A sin²(πT/(2τ)). For a single walker this form is justified by the analysis of Ref. [15], but for P>1 the authors state that they 'treat it as a model and test it against the simulations' (Sec.

more of objection 1

VII). The test consists of checking that the fit improves with lattice size, but no analytical argument is given that the multi-particle evolution operator U' (Eq. 13) has a dominant two-dimensional eigenspace. Without such an argument, the extracted τ is a phenomenological parameter whose relation to the actual search runtime is unclear. The claim that τ(P)/τ(1) → 1/√P is then a statement about this fitted parameter, not about the operational peak time T_peak, which the authors themselves note is 'nearly degenerate' for P=1 and 'better defined' for P=2 (Fig. 11). The ratio of fitted τ values may reflect the fitting procedure rather than a genuine speedup. The paper acknowledges that the two-level approximation is 'not proven analytically', but the entire speedup claim depends on this unproven assumption.

The paper says, at §VII, Fig. 13

The review did not quote this passage.

A classifier read this sentence of the paper as acknowledging the concern (probability 0.94):

“ForP= 3, the simulated lattices are too small to determine the limit.”

Pith says: Objection 2 of 4 · major

The evidence for P=3 is extremely limited: the simulated range is only L=5 to L=25 (N=25 to 625). The ratio τ(1)/τ(3) in Fig. 13 has not converged and is still far from √3 ≈ 1.732. The authors themselves state that 'the simulated lattices are too small to determine the limit' (Sec.

more of objection 2

VII). The claim that the constant-factor speedup extends to P=3 is therefore unsupported by the data presented. The paper should either provide larger-scale simulations for P=3 (perhaps using the distributed algorithm with more resources) or clearly state that the P=3 result is preliminary and not conclusive.

The paper says, at §VI, Fig. 9

The review did not quote this passage.

Pith says: Objection 3 of 4 · major

The conclusion that local interactions do not change the runtime (T_peak is independent of α and λ) is based on simulations up to L=16 for P=2 and L=10 for P=3. These are very small lattices where finite-size effects are strong.

more of objection 3

The authors then state that 'we therefore did not need to study how the runtime scales with the database size in the presence of these interactions' (Sec. VIII). This is a strong claim to base on such limited data. It is possible that interactions affect the scaling prefactor or even the asymptotic scaling at larger sizes, and the small-lattice simulations are not sufficient to rule this out.

The paper says, at §V, Fig. 10

The review did not quote this passage.

Pith says: Objection 4 of 4 · major

The peak success probability for P=2 is shown to match or slightly exceed the single-walker value for N≳900. However, the data for P=2 only go up to L=230 (N≈53,000). The trend in Fig. 10 (right panel) shows that p_peak for P=2 is still fluctuating and has not clearly converged relative to P=1. The claim that 'from N≈900 onwards it matches or slightly exceeds the single-walker value' is based on a few data points and should be stated more cautiously.

12 minor objections

The paper says, at §III B, Eq. (12)

Pith says: minor objection 1 of 12

The definition of the joint perturbed coin C' in Eq. (12) is given in terms of tensor factors reordered as H_c^⊗P ⊗ H_p^⊗P. The notation is somewhat confusing; it would be clearer to write C' = G^⊗P ⊗ (I_p^⊗P - P_m) - I_c^⊗P ⊗ P_m, where P_m is the projector onto configurations with at least one walker at m. The current expression with P_m defined in Eq. (11) is correct but hard to parse.

The paper says, at §III D, Eq. (18)

Pith says: minor objection 2 of 12

The phase interaction model assigns three phases λ_∥, λ_⇄, λ_⊥ to parallel, antiparallel, and perpendicular joint direction states. The paper then restricts to the uniform phase λ_∥ = λ_⇄ = λ_⊥ = λ in §VI B. It would be helpful to state explicitly that the uniform phase is a special case and that the general three-parameter model is not explored numerically.

show 10 more

The paper says, at §IV, Algorithm 1

Pith says: minor objection 3 of 12

The halo-exchange algorithm is described clearly, but the pseudocode in Algorithm 1 applies the Grover coin to each walker sequentially (lines 2-4) and then applies the marked coin (lines 5-7). However, the marked coin C' in Eq. (12) replaces the Grover coin with -I_c on marked configurations, so the order should be: apply G to all walkers, then overwrite marked slices with -I_c.

more of objection 3

The pseudocode does this correctly, but the text could be more explicit about the fact that the marked coin is not a separate operator but a modification of the Grover coin.

The paper says, at §V A

Pith says: minor objection 4 of 12

The definition of T_peak as 'the step at which the success probability p_succ(T) is maximal within its first period' is clear, but the paper later notes that for P=1 the maximum is nearly degenerate (Fig. 11). It would be useful to state the criterion used to select the maximum when there are multiple steps with nearly equal values (e.g., the first such step, or the one with the highest value).

The paper says, at §VII, Fig. 12

Pith says: minor objection 5 of 12

The plot of τ²/N vs ln N is a good way to visualize the scaling. However, the linear fits are shown only for L≥50 for P=1 and P=2. The fit range and the fit parameters (slope, intercept, R²) should be reported in the text or a table to allow quantitative comparison.

The paper says, at §I, Introduction

Pith says: minor objection 6 of 12

The introduction states that 'the first references reported a quantum walk search algorithm back in the early 2000s' and cites Refs. [14, 15]. Ref. [14] is Shenvi, Kempe, Whaley (2003) and Ref. [15] is Ambainis, Kempe, Rivosh (2004). The AKR paper is indeed a landmark, but the Shenvi-Kempe-Whaley paper is also important and should be cited correctly. The current citation [14] is to the Shenvi paper, but the text seems to attribute the AKR algorithm to both.

The paper says, at §II

Pith says: minor objection 7 of 12

The discussion of the classical hitting time on a 2D grid (Θ(N log N)) is helpful for intuition. However, the statement that 'P independent classical walkers reduce the hitting time by roughly a factor of P' is not precise: the hitting time for the fastest of P independent walkers scales as Θ(N log N / P) only if the walkers are independent and the search is for the first walker to hit the target.

more of objection 7

This is a standard result, but a brief justification or reference would be useful.

The paper says, at §III C, Eq. (15)

Pith says: minor objection 8 of 12

The interaction operator V_ab is defined as I + (O_ab - I_c^⊗2) ⊗ Π_ab. This is correct, but it might be helpful to note that this is a controlled unitary: if the positions coincide, apply O_ab; otherwise, do nothing.

The paper says, at §V C, Fig. 7

Pith says: minor objection 9 of 12

The entropy S(ρ_1) is plotted in bits (log base 2). The bound log₂(4N) ≈ 7.6 bits is mentioned. It would be useful to also plot the bound as a horizontal line in Fig. 7 for reference, as is done in Fig. 8.

The paper says, at §VI B, Fig. 9(b,d)

Pith says: minor objection 10 of 12

The uniform phase interaction results show symmetry about λ=π, which the authors attribute to complex conjugation. This is correct, but it would be helpful to note that the symmetry holds only because the initial state and all operators are real. If a complex phase were introduced elsewhere, the symmetry would break.

The paper says, at §VIII, Conclusions

Pith says: minor objection 11 of 12

The conclusion states that 'the geometry of the grid preserves the O(√N log N) scaling of the runtime'. This is consistent with the data for P=2, but for P=3 the data are insufficient to confirm the scaling. The statement should be qualified.

The paper says, at References

Pith says: minor objection 12 of 12

Ref. [19] (Mittal and Sowiński) is cited as 'Physical Review A 113, 10.1103/tg6f-v65l (2026)'. The DOI appears to be a placeholder or an internal identifier. Please verify that the reference is correct and accessible.

What would settle it

Compute the eigenphases of U' (Eq. 13) for P=2 on small lattices (e.g., L=5,7,9) by exact diagonalization. If the two-level approximation holds, the two dominant eigenphases should have a gap Δ = π/τ that scales as 1/√(N log N) and the initial state should have overlap >0.99 with the subspace they span. If the gap does not follow this scaling or the overlap is small, the fitted τ does not correspond to a genuine two-level search and the speedup claim is unsupported.

from the skeptic's reading

How the review went

4 readings by deepseek-v4-flash · 13 Nov 2026

  1. Reader holds up, with conditions confidence high
  2. Skeptic agrees 6 s · 24,819 tokens read, 784 written
  3. Editor wrote the verdict above 7 s · 25,822 tokens read, 582 written
  4. Referee major revision: 4 major objections, 12 minor 19 s · 25,247 tokens read, 2,456 written

Not run on this paper: the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The review in brief, machine-written

The paper does two things well. First, it constructs a genuine multi-particle quantum walk search algorithm with a joint marked coin that respects the any-walker criterion, which is not the same as running P independent single-particle searches. Second, it provides a clean numerical demonstration that for P=2 the fitted runtime τ(2) is smaller than τ(1) by a factor approaching √2 as N grows, and that the asymptotic scaling remains O(√N log N). The distributed halo-exchange simulation code is a practical contribution. The paper is clearly written and the limitations are stated openly.

The soft spot is the two-level approximation that underlies the runtime extraction. For a single walker the form p_succ(T) ≃ A sin²(πT/(2τ)) is justified by the spectral analysis of Ref. [15]. For P>1 the authors treat it as a model and test it numerically, but the fit quality improving with lattice size is not a proof that the multi-particle evolution operator has a dominant two-dimensional eigenspace. The extracted τ is a phenomenological parameter; the claim that τ(P) ≃ τ(1)/√P is a statement about this fitted parameter, not about the operational peak time T_peak, which for P=1 is nearly degenerate and for P=2 is better defined. The paper acknowledges this limitation, but the stress-test concern is real: the entire speedup claim depends on an unproven assumption. The P=3 data is too limited (L up to 25) to confirm the √P trend, and the authors say so.

That said, the paper is honest about what it does and does not prove. The constant-factor speedup for P=2 is a genuine numerical result, even if its interpretation depends on the fit model. The paper does not claim to have resolved the open question of O(√N) scaling on the 2D grid.

Who this is for: researchers working on quantum walk search algorithms, especially those interested in multi-particle extensions and numerical simulation techniques. A serious referee should engage with the paper, but should push the authors to either provide an analytical argument for the two-level approximation for P>1 or to present the operational peak time T_peak as the primary figure of merit alongside the fitted τ. The paper deserves peer review.

The strongest objection

The central quantitative claim—that the multi-particle search achieves a constant-factor speedup τ(P) ≃ τ(1)/√P—rests entirely on fitting the success probability to the two-level form p_succ(T) ≃ A sin²(πT/(2τ)) (Eq. 39). For a single walker this form is justified by the analysis of Ref. [15], which shows that the dynamics are dominated by two eigenvectors of the evolution operator. For P>1 the authors explicitly state that they 'treat it as a model and test it against the simulations' (Sec. VII). The test consists of checking that the fit improves with lattice size, but no analytical argument is given that the multi-particle evolution operator U' (Eq. 13) has a dominant two-dimensional eigenspace. Without such an argument, the extracted τ is a phenomenological parameter whose relation to the actual search runtime is unclear. The claim that τ(P)/τ(1) → 1/√P is then a statement about this fitted parameter, not about the operational peak time T_peak, which the authors themselves note is 'nearly degenerate' for P=1 and 'better defined' for P=2 (Fig. 11). The ratio of fitted τ values may reflect the fitting procedure rather than a genuine speedup. The paper acknowledges that the two-level approximation is 'not proven analytically' (reader's weakest_assumption), but the stress-test must note that the entire speedup claim depends on this unproven assumption. The concrete test would be to derive the effective Hamiltonian for the multi-particle walk and check whether the spectral gap between the two dominant eigenphases indeed scales as 1/√(N log N) with a √P prefactor, or to compute the overlap of the initial state with the putative two-level subspace.

The reader's weakest_assumption correctly identifies that the two-level approximation is not analytically justified for multiple particles. The stress-test agrees that this is the most load-bearing concern. The paper's central claim of a constant-factor speedup is extracted from a fit that assumes this approximation. Without a proof or a numerical check that the multi-particle dynamics are indeed dominated by two eigenvectors, the fitted τ is a phenomenological parameter whose relation to the search runtime is unclear. The concrete test proposed (exact diagonalization for small lattices) would directly verify the two-level assumption. The verdict remains CONDITIONAL because the paper is otherwise well-structured and the numerical evidence for P=2 is extensive, but the concern is significant enough that the claim cannot be accepted without addressing it. The agreement is 'agree' because the reader and stress-test identify the same weakest assumption.

The referee's report

If the constant-factor speedup holds, it is a practically relevant improvement for quantum walk search on 2D lattices, which is the critical dimension where the single-particle walk does not reach Grover's bound. The paper also provides a formal generalization of interaction models and a distributed simulation method. However, the central quantitative claim rests on a fit to the two-level approximation, which is not analytically justified for P>1, and the evidence for P=3 is limited to very small lattices.

Pith's reading of the paper (a machine's summary, not the authors')

The paper studies whether adding extra particles to a quantum walk search on a 2D grid can improve the search runtime. It defines a multi-particle quantum walk search algorithm that uses a joint marked coin operator, ensuring that the presence of any walker at the target vertex triggers the oracle. The authors simulate the algorithm numerically for two and three walkers on lattices up to size 230×230 (two walkers) and 25×25 (three walkers). They find that the asymptotic scaling remains O(√N log N), the same as the single-particle case, but the runtime is reduced by a constant factor that approaches √P for large N. Local interactions (phase and HPP collisions) generate additional entanglement but do not change the runtime or improve the success probability. The paper provides a new generalized framework for local interactions among P walkers and a distributed simulation algorithm using halo exchange.

What carries the argument. The central object is the joint multi-particle marked coin operator C' (Eq. 12), which applies a π phase shift to every configuration where at least one walker is at the marked vertex. This replaces the tensor product of independent marked coins and ensures the any-walker success criterion. The evolution operator is U' = S_ff^⊗P C'. The analysis also relies on the sinusoidal fit p_succ(T) ≈ A sin²(πT/(2τ)) (Eq. 39), which holds when the search dynamics are dominated by two eigenvectors of U', and the fitted τ extracts the runtime.

Core claim. The paper establishes that multi-particle quantum walk search on a 2D grid, using the any-walker criterion and a joint marked coin operator, achieves a constant-factor improvement in runtime over the single-particle case. The ratio τ(1)/τ(P) approaches √P for large N, as confirmed numerically for P=2 and suggested for P=3. The asymptotic scaling remains O(√N log N), so the logarithmic overhead of the 2D grid is not removed. The paper also shows that local interactions (phase and HPP) generate additional entanglement but do not change the runtime or improve the success probability, so the non-interacting search is the relevant one for scaling analysis.

The premise it rests on. The analysis assumes that the search dynamics are dominated by two eigenvectors of the evolution operator U', leading to the sinusoidal fit of Eq. (39). This is proven for the single-particle case by Ref. [15], but for multiple particles it is treated as a model and tested only numerically; the fit quality improves with lattice size, but the assumption is not proven analytically.

If the paper is right (Pith's inferences, not the authors')

Multi-particle quantum walk search can be directly implemented on quantum simulator platforms where nearest-neighbor locality is a constraint, offering a constant-factor speedup without changing the underlying hardware.

The √P reduction in runtime means that adding more walkers yields diminishing returns (e.g., four walkers halve the steps compared to one), but the practical benefit depends on the physical cost of adding particles.

The joint marked coin operator provides a template for multi-particle quantum search algorithms beyond walks, e.g., for multi-query Grover search or distributed quantum sensing.

The halo-exchange simulation algorithm enables numerical study of multi-particle quantum walks on larger lattices than previously possible, which may be useful for benchmarking other multi-particle quantum algorithms.

The observation that local interactions do not improve the search suggests that engineering interactions is not a promising route to overcome the 2D logarithmic overhead; other modifications (e.g., Tulsi's ancilla) may be needed.

The constant-factor speedup √P is reminiscent of the classical speedup from P independent random walkers, but the quantum walkers are entangled through the joint coin, so the mechanism is genuinely quantum. This suggests that multi-particle quantum walks may achieve similar constant-factor improvements in other search and hitting-time problems on recurrent graphs.

The numerical evidence for P=3 is limited to small lattices (L ≤ 25), so the √3 extrapolation is tentative. A more efficient simulation method or an analytic argument would be needed to confirm the trend for larger P.

The paper's framework for local interactions among P walkers (Eq. 16) could be extended to study other collective phenomena in quantum walks, such as topological phases or many-body localization, where interactions play a central role.

The finding that interactions do not affect the runtime but do affect the success probability suggests that the search is robust to certain types of noise or decoherence that mimic local phase shifts, which could be relevant for experimental implementations.

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

Abstract

In the present paper we study the formulation of a search problem and the efficiency of multi-particle quantum walk search algorithms. The discrete-time evolution of each particle in space is treated according to Grover's quantum walk evolution operator. We focus on the local interactions models, where the particles' states are modified only when two or more of them appear on the same grid site. The main focus is given to the two-dimensional grid in space. We study the dependence of the search algorithm asymptotic success time and probability on the interaction strength and the generated maximal entanglement between particles. We show that the interacting and non-interacting two- and three-particle search algorithm attains a constant factor improvement over the single-particle counterpart. In addition, we provide a new generalized model of interactions for multi-particle quantum walks.

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-11-14

The authors' main claim, as the classifier picked it out 1.00

“We show that the interacting and non-interacting two- and three-particle search algorithm attains a constant factor improvement over the single-particle counterpart.”

How the main claim is stated: asserted 1.00

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.11 · human participants 0.01 · controlled comparison 0.83 · randomized assignment 0.01 · states quantitative result 0.15 · compares with prior results 0.89 · mentions code or data availability 0.02

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
In the present paper we study the formulation of a search problem and the efficiency of multi-particle quantum walk search algorithms. contribution 0.95 0.83 0.04 asserted 0.60
The discrete-time evolution of each particle in space is treated according to Grover's quantum walk evolution operator. method 1.00 0.43 0.02 asserted 0.99
We focus on the local interactions models, where the particles' states are modified only when two or more of them appear on the same grid site. method 0.98 0.36 0.03 asserted 0.97
The main focus is given to the two-dimensional grid in space. method 0.61 0.38 0.02 asserted 0.96
We study the dependence of the search algorithm asymptotic success time and probability on the interaction strength and the generated maximal entanglement between particles. contribution 0.93 0.86 0.10 asserted 0.68
We show that the interacting and non-interacting two- and three-particle search algorithm attains a constant factor improvement over the single-particle counterpart. result 1.00 0.95 0.69 asserted 1.00
In addition, we provide a new generalized model of interactions for multi-particle quantum walks. contribution 1.00 0.93 0.06 asserted 0.99

What kind of paper the classifier reports this is: theoretical result 0.76 · evidence from proof or derivation 0.69

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-14: 1 request, 5,460 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

Figures (12)
Figure 1 of the paper
Figure 1. FIG. 1. Joint position space of two walkers; each axis lists
Figure 2 of the paper
Figure 2. FIG. 2. HPP collision rule for two particles meeting at a lat
Figure 3 of the paper
Figure 3. FIG. 3. Halo exchange for the distributed
Figure 4 of the paper
Figure 4. FIG. 4. Two-walker probabilities at the marked vertex over
Figure 5 of the paper
Figure 5. FIG. 5. Same as Figure
Figure 6 of the paper
Figure 6. FIG. 6. Any-walker probability
Figure 7 of the paper
Figure 7. FIG. 7. One-walker von Neumann entropy
Figure 9 of the paper
Figure 9. FIG. 9. Local interactions reduce peak success while generating additional entanglement. (a,b) Peak success probability
Figure 10 of the paper
Figure 10. FIG. 10. Search performance versus
Figure 11 of the paper
Figure 11. FIG. 11. Success probability
Figure 12 of the paper
Figure 12. FIG. 12. Squared fitted peak time divided by the database

Showing 11 of the paper's 12 figures. Figures are the authors', reproduced from the paper.

References (33)
  1. [15] A. Ambainis, J. Kempe, and A. Rivosh, Coins make quantum walks faster (2004), arXiv:quant-ph/0402107 [quant-ph] on PithPith's reviewarXiv
  2. [1] A. M. Childs, Universal computation by quantum walk, Physical Review Letters102, 180501 (2009) on Pith
  3. [2] N. B. Lovett, S. Cooper, M. Everitt, M. Trevers, and V. Kendon, Universal quantum computation using the discrete-time quantum walk, Phys. Rev. A81, 042330 (2010) on Pith
  4. [3] S. Singh, P. Chawla, A. Sarkar, and C. M. Chan- drashekar, Universal quantum computing using single- particle discrete-time quantum walk, Scientific Reports 11, 11551 (2021) on Pith
  5. [4] A. M. Childs, R. Kothari, and R. D. Somma, Quantum algorithm for systems of linear equations with exponen- tially improved dependence on precision, SIAM Journal on Computing46, 1920–1950 (2017) on Pith
  6. [5] C. A. Ryan, M. Laforest, J. C. Boileau, and R. Laflamme, Experimental implementation of a discrete-time quan- tum random walk on an nmr quantum-information pro- cessor, Phys. Rev. A72, 062317 (2005) on Pith
  7. [6] H. Schmitz, R. Matjeschk, C. Schneider, J. Glueckert, M. Enderlein, T. Huber, and T. Schaetz, Quantum walk of a trapped ion in phase space, Phys. Rev. Lett.103, 090504 (2009) on Pith
  8. [7] F. Z¨ ahringer, G. Kirchmair, R. Gerritsma, E. Solano, R. Blatt, and C. F. Roos, Realization of a quantum walk with one and two trapped ions, Phys. Rev. Lett.104, 100503 (2010) on Pith
  9. [8] M. Karski, L. F¨ orster, J.-M. Choi, A. Steffen, W. Alt, D. Meschede, and A. Widera, Quantum walk in position space with single optically trapped atoms, Science325, 174 (2009) on Pith
  10. [9] M. A. Broome, A. Fedrizzi, B. P. Lanyon, I. Kassal, A. Aspuru-Guzik, and A. G. White, Discrete single- photon quantum walks with tunable decoherence, Phys. Rev. Lett.104, 153602 (2010) on Pith
  11. [10] A. Schreiber, K. N. Cassemiro, V. Potoˇ cek, A. G´ abris, P. J. Mosley, E. Andersson, I. Jex, and C. Silberhorn, Photons walking the line: A quantum walk with ad- justable coin operations, Phys. Rev. Lett.104, 050502 (2010) on Pith
  12. [11] S. Dadras, A. Gresch, C. Groiseau, S. Wimberger, and G. S. Summy, Experimental realization of a momentum- space quantum walk, Phys. Rev. A99, 043617 (2019) on Pith
  13. [12] P. C. Farina, D. Jirovec, X. Zhang, E. Morozova, S. D. Oosterhout, S. Reale, T.-K. Hsiao, G. Scappucci, M. Veldhorst, and L. M. K. Vandersypen, Site-resolved magnon and triplon dynamics on a programmable quan- tum dot spin ladder (2025) on Pith
  14. [13] G. Almeida, R. Santos, L. Janiurek, and Y. Omar, Quan- tum Walks on Arbitrary Spatial Networks with Rydberg Atoms, Quantum10, 2235 (2026) on Pith
  15. [14] N. Shenvi, J. Kempe, and K. B. Whaley, Quantum random-walk search algorithm, Physical Review A67, 10.1103/physreva.67.052307 (2003) on Pithdoi:10.1103/physreva.67.052307
  16. [16] A. Tulsi, Faster quantum-walk algorithm for the two- dimensional spatial search, Phys. Rev. A78, 012310 (2008) on Pith
  17. [17] M. Roget, H. Kadri, and G. Di Molfetta, Optimality con- ditions for spatial search with multiple marked vertices, Phys. Rev. Res.5, 033021 (2023) on Pith
  18. [18] P. C. S. Costa, F. de Melo, and R. Portugal, Multiparticle quantum walk with a gaslike interaction, Phys. Rev. A 100, 042320 (2019) on Pith
  19. [19] V. Mittal and T. Sowi´ nski, Discrete-time quantum walk of locally interacting walkers, Physical Review A113, 10.1103/tg6f-v65l (2026) on Pithdoi:10.1103/tg6f-v65l
  20. [20] L. K. Grover, A fast quantum mechanical algorithm for database search, inProceedings of the Twenty-Eighth An- nual ACM Symposium on Theory of Computing (STOC ’96)(Association for Computing Machinery, 1996) pp. 212–219 on Pith
show 13 more
  1. [21] M. Szegedy, Quantum speed-up of markov chain based algorithms, in45th Annual IEEE Symposium on Foun- dations of Computer Science (FOCS)(2004) pp. 32–41 on Pith
  2. [22] H. Krovi, F. Magniez, M. Ozols, and J. Roland, Quantum walks can find a marked element on any graph, Algorith- mica74, 851 (2016) on Pith
  3. [23] A. M. Childs and J. Goldstone, Spatial search and the 17 dirac equation, Phys. Rev. A70, 042312 (2004) on Pith
  4. [24] J. Hardy, Y. Pomeau, and O. de Pazzis, Time evolution of a two-dimensional classical lattice system, Phys. Rev. Lett.31, 276 (1973) on Pith
  5. [25] E. Matwiejew and J. Wang, QSW MPI: A framework for parallel simulation of quantum stochastic walks, Com- puter Physics Communications260, 107724 (2021) on Pith
  6. [26] E. Matwiejew and J. B. Wang, QuOp MPI: A framework for parallel simulation of quantum variational algorithms, Journal of Computational Science62, 101711 (2022) on Pith
  7. [27] E. Piccinini, C. Benedetti, I. Siloi, M. G. Paris, and P. Bordone, Gpu-accelerated algorithms for many- particle continuous-time quantum walks, Computer Physics Communications215, 235 (2017) on Pith
  8. [28] P. Motta, G. A. Bezerra, A. F. Santos, and R. Portugal, Hiperwalk: Simulation of quantum walks with heteroge- neous high-performance computing, in2023 IEEE Inter- national Conference on Quantum Computing and Engi- neering (QCE), Vol. 01 (2023) pp. 424–433 on Pith
  9. [29] M. J. Quinn,Parallel Programming in C with MPI and OpenMP(McGraw-Hill Education Group, 2003) on Pith
  10. [30] T. G. Mattson, B. Sanders, and B. Massingill,Patterns for parallel programming(Pearson Education, 2004) on Pith
  11. [31] Delft High Performance Computing Centre (DHPC), DelftBlue Supercomputer (Phase 2),https: //www.tudelft.nl/dhpc/ark:/44463/DelftBluePhase2 (2024) on Pith
  12. [32] G. Meneses and D. O. Oriekhov, Multi-particle quan- tum walk search on a two-dimensional lattice: code and data (2026), implementation of the interacting quantum walk search algorithm, the generated sta- tistical data, and all presented plots. Source code also maintained athtt... on Pith
  13. [33] D. O. Oriekhov, G. Jin, and E. Greplova, Dynamical localization in 2D topological quantum random walks, arxiv:2406.18768 (2024) on PithPith's reviewarXiv

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment