The Grover search as a naturally occurring phenomenon

Giuseppe Di Molfetta; Mathieu Roget; Pablo Arrighi; St\'ephane Guillet

REVIEW 3 major objections 4 minor 34 references

The Grover search as a naturally occurring phenomenon

T0 review · 3 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Dirac quantum walks on defective lattices naturally perform Grover-like search, localizing around a missing tile in O(√N) steps.

desk verdict A plausible numerical observation that Dirac quantum walks localize near missing tiles with Grover scaling, but the physical claim about naturally occurring topological-defect search is not yet backed by evidence beyond one idealized boundary condition. read the letter →

arxiv 1908.11213 v3 pith:SJR25TOW submitted 2019-08-29 quant-ph cond-mat.othercs.DS

Mathieu Roget , Stéphane Guillet , Pablo Arrighi , Giuseppe Di Molfetta This is my paper · ORCID

classification quant-phcond-mat.othercs.DS

keywords quantumwalksGroversearchDiracequationtopologicaldefectsspatiallatticesimulationspin-1/2fermion

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper argues that Grover search does not need an engineered oracle: a freely propagating spin-1/2 particle described by a Dirac-like quantum walk will, from a uniform initial state, accumulate around a missing tile in a crystalline lattice. The authors provide numerical evidence on two lattices that the localization time scales as O(√N) and the peak success probability as O(1/log N), matching known quantum-walk spatial-search results. The significance would be that physical defects in materials could act as the oracle, so fermions searching for defects are implementing Grover's algorithm naturally, with no oracle query.

What carries the argument

The load-bearing object is the Dirac quantum walk, a discrete-time unitary evolution whose continuum limit is the $(2+1)$-dimensional Dirac Hamiltonian, so it simulates free spin-1/2 fermions. On the square lattice the step is $U=W_+ T_{y,\varepsilon} W_- T_{x,\varepsilon}$; on the triangular lattice it is the product $W T_{2,\varepsilon} W T_{1,\varepsilon} W T_{0,\varepsilon}$. The paper turns the Grover oracle into a geometric object: a missing tile, surrounded by facets where the coin is frozen to $W=I$, making the walker reflect off the hole. Repeated cycles around the hole accumulate amplitude there in the same way Grover iterations amplify the marked state.

What would settle it

Find a physically motivated alternative for the boundary rule $W=I$, e.g. a potential barrier or an absorbing edge, and simulate the same uniform walk: if the peak localization time stops being $O(\sqrt{N})$ or the peak probability stops being $O(1/\log N)$, the oracle role is an artifact of the ideal reflecting boundary.

Watch

Extended reading notes

Core claim

The paper's central claim is a conjecture: starting from a uniformly superposed wavefunction, a Dirac quantum walk on a square or triangular lattice with a missing tile localizes around the defect in $O(\sqrt{N})$ steps, with probability $O(1/\log N)$, where $N$ is the number of tiles. The defect is implemented by setting the coin operator $W$ to identity on the facets around the missing ball, so incoming amplitudes are reflected. Numerical simulations on both lattices exhibit the expected scalings, with mass-dependent prefactors, and the scaling survives when several defects are present. The paper reads these results as evidence that the Dirac walk supplies the Grover diffusion step while the topological defect supplies the oracle step.

Load-bearing premise

The load-bearing premise is that a real missing tile reflects an incoming quantum walker exactly like the paper's boundary condition, in which the coin operation is set to identity on the facets around the hole.

Editorial extensions

If this is right

If the conjecture is right, a single uniform Dirac walker can find a point defect in a lattice in $O(\sqrt{N})$ steps, and repeated runs make the detection probability close to one in $O(\sqrt{N}\log N)$ total time.
The search needs no oracle subroutine: the 'marked item' is encoded in the lattice itself, so passive propagation over a defective material is the whole algorithm.
The same scaling on both square and triangular lattices, and with two, three, or four defects, suggests the effect is generic to rotation- and coin-based Dirac walks, not a single lattice's accident.
Since the prefactors depend on the mass parameter but not on the number of defects, tuning the mass gives a natural implementation a handle on detection efficiency.
If experimentally confirmed, this offers a route to defect detection in real materials without a universal, error-corrected quantum computer.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

A testable extension is to check other physical boundary conditions, such as an absorbing boundary or a phase-shifting interface, to see whether the $\sqrt{N}$ and $1/\log N$ scalings are tied to reflection or are a more general defect property.
The paper's QR-code idea implies one could search for one specific embedded pattern among many; if quantum interference keeps the same scaling, that would be a natural search over the configuration space rather than over marked nodes.
Comparing the square lattice, which has trivial topology at zero mass, with the triangular lattice, which has Chern number one, suggests a controlled experiment: if edge states are the mechanism, the localization probability should differ strongly between massive and massless cases on the square lattice.
A natural experimental test would be to propagate a two-dimensional photonic or atomic quantum walk with an engineered hole and measure recurrence time as a function of lattice size, giving a direct check of the predicted exponents.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

The short version: this is a reasonable, honest numerical paper showing that Dirac-type quantum walks on square and triangular lattices localize near a missing tile in O(√N) steps with peak probability O(1/log N). If that observation holds up, it is a nice bridge between spatial search by quantum walks and Dirac dynamics. The stronger claim—that this amounts to a naturally occurring Grover search—is plausible but not demonstrated.

What is actually new: previous QW spatial search used AKR-style walks and explicit oracle steps; this one uses Dirac walks whose continuum limit is the (2+1)-D Dirac equation, and replaces the oracle with a missing tile. That combination is original. The numerical checks on two lattices, including mass dependence and multi-defect cases, are a solid starting point. The authors are appropriately cautious in their wording: 'first evidence,' 'suggests,' and a clearly stated conjecture.

Soft spots, in rough order of importance. First, the defect is implemented by setting the coin to identity on facets around the missing ball, which reflects incoming signals. That is a natural free boundary for a vacancy, but the paper never tests any alternative local boundary unitary, such as a potential well or a spin-dependent phase. A generic reflecting wall might produce the same scaling, which would weaken the 'topological defect' label. The square lattice with m=0 is topologically trivial, so calling the hole 'topological' needs more support than citing edge states from the triangular case. This is the main thing I would want a referee to probe.

Second, the O(√N) and O(1/log N) laws are interpolated from finite-size data without error bars or an independent derivation. That is acceptable for a letter, but the asymptotic claim is a fit, not a proof. Third, the parameter α in the triangular coin (Eq. 4) is used but never defined; that looks like a typo or a missing sentence and should be fixed. Fourth, no code or data is shared, so the numbers cannot be independently checked.

None of these flaws is fatal to the numerical observation. The central result—that Dirac walks localize around missing tiles with scaling comparable to previous QW search—probably holds. What is not established is that the effect survives realistic defect couplings or that it is specifically topological in origin. The authors acknowledge the simplicity of the defect model, but the 'naturally occurring' language in the title and conclusion goes beyond the evidence.

Who this is for: people working on quantum walk search, Dirac walk simulators, and analog quantum search proposals. It is a useful pointer, not a proof of natural Grover search. I would cite the numerical scaling result if I were writing about QW search with defects, and I would bring it to a reading group for a discussion of what 'natural implementation' would require. It deserves serious peer review, with requests for a defined α, error estimates or raw data, and ideally one alternative boundary condition as a robustness check.

Referee Report

3 major / 4 minor

Summary. The paper studies discrete-time quantum walks on square and triangular lattices whose continuum limits recover the (2+1)-dimensional Dirac equation. A small number of tiles is removed to create a defect, which is modeled by setting the coin operator to the identity on the facets around the missing ball. Starting from a uniformly superposed state, the authors numerically observe that the probability of finding the walker near the defect peaks at a recurrence time t(N) in O(√N) with a peak probability p(N) in O(1/log N), in line with known two-dimensional spatial search results. They conjecture that Dirac quantum walks on defective lattices provide a naturally occurring Grover search, with the topological defect acting as the oracle, and discuss applications to detecting topological properties of configuration spaces.

Significance. If correct, the conjecture is conceptually valuable: it would connect the physical propagation of spin-1/2 fermions (via Dirac quantum walks) to a Grover-like spatial search whose oracle is a topological defect rather than an artificial oracle query. The paper's strengths are its use of two concrete, well-motivated Dirac walks on different lattices, explicit numerical data, and an honest framing of the result as a conjecture supported by finite-size simulations. The significance is conditional, however, because the central scaling laws are interpolated from limited numerical data and the defect model is a single unvalidated boundary condition. The work is likely to interest the quantum walk and quantum simulation communities, and it points to a testable physical scenario, but the evidence as presented is not yet sufficient to establish the 'naturally occurring' claim.

major comments (3)

[Triangular grid, Eq. (4)] The coin operator for the triangular walk is written with an explicit parameter α, but the manuscript never defines α, its range, or how it is fixed. Since the numerical results for the triangular lattice depend on the coin, the reported scalings are ambiguous. Please define α (even by reference to [4]) and state whether the O(√N)/O(1/log N) behavior is stable over a range of α.
[Defects (after Eq. 4)] The defect is modeled by setting W=I on the facets around the boundary ∂B, with the assertion that this reflects incoming signals. This is the only oracle implementation tested. The central physical claim—that a topological defect in a material naturally implements a Grover search—requires some evidence that this boundary condition faithfully represents a physical vacancy or defect. The paper does not compare with alternative local boundary unitaries (e.g., a phase shift, a potential well, or a spin-dependent reflection) nor does it provide a defect-free control. Without these tests, the observed localization could be a generic property of any reflecting wall, which would sever the link between the numerical result and the 'topological defect' narrative.
[Grover search, Figs. 3–5] The asymptotic laws t(N)=Θ(√N) and p(N)=Θ(1/log N) are inferred by interpolating finite-size data, but the manuscript gives no error bars, no fitting procedure, and no independent analytical derivation. The claim that p(N) first follows a 1/N transient before entering a 1/log N regime is especially sensitive to the chosen range of N and to finite-size effects near the boundary. Please report the data table or a statistical fitting analysis (including uncertainties and goodness-of-fit), or provide an analytical argument for the asymptotic behavior.

minor comments (4)

[Abstract] The phrase 'featuring topological—without the need for a specific oracle step' appears to be missing the word 'defects' after 'topological'; please correct the wording.
[Grover search (repetitions)] The text states that quantum amplitude amplification reduces the number of repetitions to O(√log N), yielding an overall complexity of O(√N log N). The final expression should be O(√N √log N) (or O(√N log N) if a different repetition count is intended); please clarify and correct the notation.
[Figs. 4 and 5] The figures have small axis labels and legends; in particular, the triangular-grid figure (Fig. 5) does not distinguish the data series for m=0, 0.2, 0.4 clearly. Please enlarge fonts and use distinguishable markers or a legend.
[Defects paragraph] The sentence 'Both Dirac walks reduce to just anti-clockwise rotation R as in Eq. (1)' is slightly confusing because R alone is also a shift operator; please rephrase for clarity.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the Grover-like localization scaling is measured numerically against external benchmarks, and the self-citations only establish the Dirac continuum limit, not the target result.

full rationale

The paper's central claim is a numerical conjecture: Dirac quantum walks on defective square and triangular lattices localize around the defect in O(sqrt N) steps with probability O(1/log N). This scaling is not built into the definitions of the walk or of the defect. The defect is implemented by setting W=I on facets around a missing tile, a reflective boundary condition, and the observed localization is an emergent numerical result rather than an input to the model. The scalings are benchmarked against independent prior results: Childs-Goldstone, Patel et al., and Tulsi. The only load-bearing self-citations are Refs. [4] and [5], which prove that the chosen coin operators recover the Dirac equation in the continuum limit; those are earlier, separately published proofs of a different statement, used as premises rather than as the conclusion being tested. The functional forms t(N) approximately sqrt N and p(N) approximately 1/log N are interpolated from the measured peak data, not predictions of withheld data, so this is ordinary numerical characterization and not a fitted input called a prediction. Whether the W=I boundary faithfully models a physical topological defect is a legitimate physical-modeling concern, but it is not a circularity in the derivation chain.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

No new particles or forces are introduced. The load-bearing assumptions are the Dirac-walk construction from prior work (partly self-cited), the identity-coin boundary condition used as the defect and oracle, the uniform initial state, and the extrapolation of finite-size scaling.

free parameters (3)

mass m = 0, 0.2, 0.4 (varied in simulations)
Appears in the square coin θ± = ±(π/4 ± ε m) and in the triangular coin. The authors observe that prefactors of the scaling depend on m, but the exponents do not. It is a model parameter, not fitted to the target scaling.
alpha (α) in the triangular coin = not defined in the text
The coin operator in Eq. (4) uses α without definition. If α is a free angle, the reported triangular results may depend on it, and the naturalness claim would require showing that the search is robust to α.
defect geometry = missing ball of unit radius (unit-radius ball of missing tiles)
The defect is idealized as a small missing ball with reflective boundary W=I. The scaling may depend on this idealization, and it doubles as the oracle marking the target.

assumptions (4)

domain assumption The square and triangular walks recover the (2+1)-dimensional Dirac equation in the continuum limit, proved in refs [5] and [4].
This is the link between the quantum walk and real spin-1/2 fermions. The paper relies on it to speak of 'naturally occurring' behavior. Reference [4] is self-cited.
ad hoc to paper Setting W=I on the facets around the defect faithfully models a topological defect by reflecting incoming signals.
This boundary condition is introduced in the 'Defects' paragraph as the simplest model. There is no derivation from a material Hamiltonian, and it acts as the oracle that marks the target.
domain assumption The initial state can be prepared as a uniform superposition over all accessible sites with coin (|v+>+|v->)/√2.
The search result depends on this initial state. Natural occurrence requires that such a delocalized state arises physically, which is not shown.
domain assumption Finite-size simulations up to N≈2500 are representative of the asymptotic O(√N) and O(1/log N) behavior.
The scaling laws are interpolated from finite data. The paper provides no rigorous asymptotics or larger-N verification for the triangular lattice.

how reviews work

0 comments

Cite this review

Pith. "Pith review of The Grover search as a naturally occurring phenomenon." pith.science (2026). https://pith.science/paper/SJR25TOW

@misc{pith2026190811213,
  author       = {Pith},
  title        = {Pith review of: The Grover search as a naturally occurring phenomenon},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SJR25TOW}},
  note         = {Machine review of arXiv:1908.11213}
}

abstract

We provide first evidence that under certain conditions, 1/2-spin fermions may naturally behave like a Grover search, looking for topological defects in a material. The theoretical framework is that of discrete-time quantum walks (QW), i.e. local unitary matrices that drive the evolution of a single particle on the lattice. Some QW are well-known to recover the $(2+1)$--dimensional Dirac equation in continuum limit, i.e. the free propagation of the 1/2-spin fermion. We study two such Dirac QW, one on the square grid and the other on a triangular grid reminiscent of graphene-like materials. The numerical simulations show that the walker localises around the defects in $O(\sqrt{N})$ steps with probability $O(1/\log{N})$, in line with previous QW search on the grid. The main advantage brought by those of this paper is that they could be implemented as `naturally occurring' freely propagating particles over a surface featuring topological---without the need for a specific oracle step. From a quantum computing perspective, however, this hints at novel applications of QW search : instead of using them to look for `good' solutions within the configuration space of a problem, we could use them to look for topological properties of the entire configuration space.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

34 extracted references · 34 canonical work pages

[4]

A quantum cel- lular automaton for one-dimensional qed

Pablo Arrighi, C ´edric B´eny, and Terry Farrelly. A quantum cel- lular automaton for one-dimensional qed. Quantum Informa- tion Processing, 19(3) :88, 2020

work page 2020
[1]

Quantum search of spa- tial regions

Scott Aaronson and Andris Ambainis. Quantum search of spa- tial regions. In44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pages 200–209. IEEE, 2003

work page 2003
[2]

The Quantum Information Structure of Spacetime (QISS)

Notice that am- plitude inside the defect is zero ; (ii) Let the walker evolve with time ; (iii) Quantify the number of stepst(N) before the walker reaches its probability peak p(N) of being localized in a ball of radius 2 around the center of the defect, namely the peak recurrence time and estimate this probability peak, at ﬁxedN ; (iv) Characterizet(N) ...

work page 2018
[3]

Any and-or formula of size n can be evaluated in time nˆ1/2+o(1) on a quantum computer

Andris Ambainis, Andrew M Childs, Ben W Reichardt, Robert ˇSpalek, and Shengyu Zhang. Any and-or formula of size n can be evaluated in time nˆ1/2+o(1) on a quantum computer. SIAM Journal on Computing, 39(6) :2513–2530, 2010

work page 2010
[5]

The Dirac equation as a quantum walk over the honeycomb and triangular lattices

Pablo Arrighi, Giuseppe Di Molfetta, Iv ´an M ´arquez-Mart´ın, and Armando P ´erez. The Dirac equation as a quantum walk over the honeycomb and triangular lattices. Physical Review A, 97(6) :062111, June 2018. arXiv : 1803.01015

work page Pith review arXiv 2018
[6]

The dirac equation as a quantum walk : higher dimensions, observational convergence

Pablo Arrighi, Vincent Nesme, and Marcelo Forets. The dirac equation as a quantum walk : higher dimensions, observational convergence. Journal of Physics A : Mathematical and Theore- tical, 47(46) :465302, 2014

work page 2014
[7]

Edge-state-enhanced transport in a two-dimensional quantum walk

Janos K Asboth and Jonathan M Edge. Edge-state-enhanced transport in a two-dimensional quantum walk. Physical Review A, 91(2) :022324, 2015

work page 2015
[8]

De- cision problems for 3–manifolds and their fundamental groups

Matthias Aschenbrenner, Stefan Friedl, and Henry Wilton. De- cision problems for 3–manifolds and their fundamental groups. Geometry & Topology Monographs, 19(1) :201–236, 2015

work page 2015

Show all 34 references

[9]

Weyl, Dirac, and Maxwell equations on a lattice as unitary cellular automata

Iwo Bialynicki-Birula. Weyl, Dirac, and Maxwell equations on a lattice as unitary cellular automata. Physical Review D , 49(12) :6920–6927, June 1994

1994
[10]

Improved classical and quantum algorithms for subset-sum

Xavier Bonnetain, R ´emi Bricout, Andr ´e Schrottenloher, and Yixin Shen. Improved classical and quantum algorithms for subset-sum. arXiv preprint arXiv :2002.05276, 2020

2002 arXiv
[11]

Quantum amplitude ampliﬁcation and estimation

Gilles Brassard, Peter Hoyer, Michele Mosca, and Alain Tapp. Quantum amplitude ampliﬁcation and estimation. Contempo- rary Mathematics, 305 :53–74, 2002

2002
[12]

Detection of zak phases and topological invariants in a chiral quantum walk of twisted photons

Filippo Cardano, Alessio D’Errico, Alexandre Dauphin, Ma- ria Maffei, Bruno Piccirillo, Corrado de Lisio, Giulio De Filip- pis, Vittorio Cataudella, Enrico Santamato, Lorenzo Marrucci, et al. Detection of zak phases and topological invariants in a chiral quantum walk of twiste...

2017
[13]

Spatial search by quantum walk

Andrew M Childs and Jeffrey Goldstone. Spatial search by quantum walk. Physical Review A, 70(2) :022314, 2004

2004
[14]

A quantum walk with both a continuous-time limit and a continuous-spacetime limit

Giuseppe Di Molfetta and Pablo Arrighi. A quantum walk with both a continuous-time limit and a continuous-spacetime limit. Quantum Information Processing, 19(2) :47, 2020

2020
[15]

Quantum walks in artiﬁcial electric and gravitational ﬁelds

Giuseppe Di Molfetta, Marc Brachet, and Fabrice Deb- basch. Quantum walks in artiﬁcial electric and gravitational ﬁelds. Physica A : Statistical Mechanics and its Applications , 397 :157–168, 2014

2014
[16]

Quantum walks as simulators of neutrino oscillations in a vacuum and matter.New Journal of Physics, 18(10) :103038, 2016

Giuseppe Di Molfetta and Armando P ´erez. Quantum walks as simulators of neutrino oscillations in a vacuum and matter.New Journal of Physics, 18(10) :103038, 2016

2016
[17]

Electric quantum walks with individual atoms

Maximilian Genske, Wolfgang Alt, Andreas Steffen, Albert H Werner, Reinhard F Werner, Dieter Meschede, and Andrea Al- berti. Electric quantum walks with individual atoms. Physical review letters, 110(19) :190601, 2013

2013
[18]

Lov K. Grover. A fast quantum mechanical algorithm for data- base search. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC ’96 , pages 212– 219, Philadelphia, Pennsylvania, United States, 1996. ACM Press

1996
[19]

Quantum walk hydrodynamics

Mohamed Hatiﬁ, Giuseppe Di Molfetta, Fabrice Debbasch, and Marc Brachet. Quantum walk hydrodynamics. Scientiﬁc re- ports, 9(1) :2989, 2019

2019
[20]

Solid-State Physics : An Introduc- tion to Theory and Experiment

Harald Ibach and Hans L ¨uth. Solid-State Physics : An Introduc- tion to Theory and Experiment. Springer-Verlag, 1995

1995
[21]

Topological phenomena in quantum walks : elementary introduction to the physics of topological phases

Takuya Kitagawa. Topological phenomena in quantum walks : elementary introduction to the physics of topological phases. Quantum Information Processing, 11(5) :1107–1148, 2012

2012
[22]

Exploring topological phases with quantum walks

Takuya Kitagawa, Mark S Rudner, Erez Berg, and Eugene Demler. Exploring topological phases with quantum walks. Physical Review A, 82(3) :033429, 2010

2010
[23]

On the hitting times of quantum versus random walks

Fr ´ed´eric Magniez, Ashwin Nayak, Peter C Richter, and Miklos Santha. On the hitting times of quantum versus random walks. Algorithmica, 63(1-2) :91–116, 2012

2012
[24]

The topological theory of defects in ordered media

N David Mermin. The topological theory of defects in ordered media. Reviews of Modern Physics, 51(3) :591, 1979

1979
[25]

David A. Meyer. From quantum cellular automata to quantum lattice gases. Journal of Statistical Physics, 85(5-6) :551–574, December 1996. arXiv : quant-ph/9604003

1996 arXiv
[26]

Search on a hypercubic lattice using a quantum random walk

Apoorva Patel, KS Raghunathan, and Md Aminoor Rahaman. Search on a hypercubic lattice using a quantum random walk. ii. d= 2. Physical Review A, 82(3) :032331, 2010

2010
[27]

Efﬁcient energy transport in photosynthesis : Roles of coherence and entanglement

Apoorva D Patel. Efﬁcient energy transport in photosynthesis : Roles of coherence and entanglement. In AIP Conference Pro- ceedings, volume 1384, pages 102–107. AIP, 2011

2011
[28]

Romanelli, A

A. Romanelli, A. Auyuanet, and R. Donangelo. Quantum 6 search with resonances. Physica A : Statistical Mechanics and its Applications, 360(2) :274 – 284, 2006

2006
[29]

Quantum walk based search algorithms

Miklos Santha. Quantum walk based search algorithms. In In- ternational Conference on Theory and Applications of Models of Computation, pages 31–46. Springer, 2008

2008
[30]

Ex- perimental two-dimensional quantum walk on a photonic chip

Hao Tang, Xiao-Feng Lin, Zhen Feng, Jing-Yuan Chen, Jun Gao, Ke Sun, Chao-Yue Wang, Peng-Cheng Lai, Xiao-Yun Xu, Yao Wang, Lu-Feng Qiao, Ai-Lin Yang, and Xian-Min Jin. Ex- perimental two-dimensional quantum walk on a photonic chip. Science Advances, 4(5), 2018

2018
[31]

Faster quantum-walk algorithm for the two- dimensional spatial search

Avatar Tulsi. Faster quantum-walk algorithm for the two- dimensional spatial search. Physical Review A, 78(1) :012310, 2008

2008
[32]

Edge states in a two-dimensional quan- tum walk with disorder

Alberto D Verga. Edge states in a two-dimensional quan- tum walk with disorder. The European Physical Journal B , 90(3) :41, 2017

2017
[33]

Efﬁcient quantum algorithms for analyzing large sparse electrical networks

Guoming Wang. Efﬁcient quantum algorithms for analyzing large sparse electrical networks. Quantum Info. Comput. , 17(11-12) :987–1026, September 2017

2017
[34]

Observation of to- pological edge states in parity–time-symmetric quantum walks

L Xiao, X Zhan, ZH Bian, KK Wang, X Zhang, XP Wang, J Li, K Mochizuki, D Kim, N Kawakami, et al. Observation of to- pological edge states in parity–time-symmetric quantum walks. Nature Physics, 13(11) :1117–1123, 2017

2017

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [4]

A quantum cel- lular automaton for one-dimensional qed

Pablo Arrighi, C ´edric B´eny, and Terry Farrelly. A quantum cel- lular automaton for one-dimensional qed. Quantum Informa- tion Processing, 19(3) :88, 2020

work page 2020

[2] [1]

Quantum search of spa- tial regions

Scott Aaronson and Andris Ambainis. Quantum search of spa- tial regions. In44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pages 200–209. IEEE, 2003

work page 2003

[3] [2]

The Quantum Information Structure of Spacetime (QISS)

Notice that am- plitude inside the defect is zero ; (ii) Let the walker evolve with time ; (iii) Quantify the number of stepst(N) before the walker reaches its probability peak p(N) of being localized in a ball of radius 2 around the center of the defect, namely the peak recurrence time and estimate this probability peak, at ﬁxedN ; (iv) Characterizet(N) ...

work page 2018

[4] [3]

Any and-or formula of size n can be evaluated in time nˆ1/2+o(1) on a quantum computer

Andris Ambainis, Andrew M Childs, Ben W Reichardt, Robert ˇSpalek, and Shengyu Zhang. Any and-or formula of size n can be evaluated in time nˆ1/2+o(1) on a quantum computer. SIAM Journal on Computing, 39(6) :2513–2530, 2010

work page 2010

[5] [5]

The Dirac equation as a quantum walk over the honeycomb and triangular lattices

Pablo Arrighi, Giuseppe Di Molfetta, Iv ´an M ´arquez-Mart´ın, and Armando P ´erez. The Dirac equation as a quantum walk over the honeycomb and triangular lattices. Physical Review A, 97(6) :062111, June 2018. arXiv : 1803.01015

work page Pith review arXiv 2018

[6] [6]

The dirac equation as a quantum walk : higher dimensions, observational convergence

Pablo Arrighi, Vincent Nesme, and Marcelo Forets. The dirac equation as a quantum walk : higher dimensions, observational convergence. Journal of Physics A : Mathematical and Theore- tical, 47(46) :465302, 2014

work page 2014

[7] [7]

Edge-state-enhanced transport in a two-dimensional quantum walk

Janos K Asboth and Jonathan M Edge. Edge-state-enhanced transport in a two-dimensional quantum walk. Physical Review A, 91(2) :022324, 2015

work page 2015

[8] [8]

De- cision problems for 3–manifolds and their fundamental groups

Matthias Aschenbrenner, Stefan Friedl, and Henry Wilton. De- cision problems for 3–manifolds and their fundamental groups. Geometry & Topology Monographs, 19(1) :201–236, 2015

work page 2015