Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

Longer titles found: Quantum walk search (view), Continuous-time quantum walk (view)

searching for Quantum walk 13 found (26 total)

alternate case: quantum walk

Quantum finance (1,545 words) [view diff] exact match in snippet view article find links to article

calculations. In 2020 David Orrell proposed an option-pricing model based on a quantum walk which can run on a photonics device. In their review of Baaquie's work
Jingbo Wang (1,129 words) [view diff] exact match in snippet view article find links to article
Jeremy L.; Wang, Jingbo B.; Matthews, Jonathan C. F. (2016). "Efficient quantum walk on a quantum processor". Nature Communications. 7 (1) 11511. arXiv:1510
Quantum optimization algorithms (3,586 words) [view diff] exact match in snippet view article find links to article
process is essentially an alternating application of a continuous-time quantum walk on an underlying graph followed by a quality-dependent phase shift applied
Richard Cleve (415 words) [view diff] exact match in snippet view article find links to article
Gutmann; Daniel A. Spielman (2003). "Exponential algorithmic speedup by a quantum walk". Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Rotation map (484 words) [view diff] exact match in snippet view article find links to article
consistent rotation map can be used to encode a coined discrete time quantum walk on a (regular) graph. A rotation map is π {\displaystyle \pi } -consistent
Quantum simulator (2,777 words) [view diff] exact match in snippet view article find links to article
(2010). "On the relationship between continuous- and discrete-time quantum walk". Communications in Mathematical Physics. 294 (2): 581–603. arXiv:0810
Element distinctness problem (893 words) [view diff] exact match in snippet view article find links to article
doi:10.1007/s00236-003-0125-8, S2CID 24821585 Ambainis, Andris (2007), "Quantum walk algorithm for element distinctness", SIAM Journal on Computing, 37 (1):
Claw finding problem (582 words) [view diff] case mismatch in snippet view article find links to article
217750. Tani, Seiichiro (November 2009). "Claw Finding Algorithms Using Quantum Walk". Theoretical Computer Science. 410 (50): 5285–5297. arXiv:0708.2584
Implicit graph (2,839 words) [view diff] exact match in snippet view article find links to article
Sam; Spielman, Daniel A. (2003), "Exponential algorithmic speedup by a quantum walk", Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing
Rydberg atom (5,782 words) [view diff] no match in snippet view article find links to article
S2CID 54710282. Khazali, Mohammadsadegh (2022-03-03). "Discrete-Time Quantum-Walk & Floquet Topological Insulators via Distance-Selective Rydberg-Interaction"
Boson sampling (6,888 words) [view diff] exact match in snippet view article find links to article
the same half of the output array of a continuous-time many-particle quantum walk) has been proven to discriminate the behavior of distinguishable and
Topological insulator (9,298 words) [view diff] no match in snippet view article find links to article
S2CID 21800060. Khazali, Mohammadsadegh (2022-03-03). "Discrete-Time Quantum-Walk & Floquet Topological Insulators via Distance-Selective Rydberg-Interaction"
Viv Kendon (491 words) [view diff] exact match in snippet view article find links to article
April 2010). "Universal quantum computation using the discrete-time quantum walk". Physical Review A. 81 (4). arXiv:0910.1024. Bibcode:2010PhRvA..81d2330L