Quantum NETwork: from theory to practice

Fang, Kun; Zhao, Jingtian; Li, Xiufan; Li, Yifei; Duan, Runyao

doi:10.1007/s11432-023-3773-4

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article6

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 10 publications

(1 citation statement)

References 305 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Quantum computation has drown a lot of attension in computer science since it can provide efficient algorithms on many problems [1][2][3][4]. Quantum walk, as the quantum analog of random walk, has been extensively adopted in quantum algorithms.…”

Section: Introductionmentioning

confidence: 99%

Search algorithm on strongly regular graph by lackadaisical quantum walk

Peng,

Li,

Sun

2024

J. Phys. A: Math. Theor.

View full text Add to dashboard Cite

Quantum walk is a widely used method in designing quantum algorithms. In this article, we consider the lackadaisical discrete-time quantum walk (DTQW) on strongly regular graphs (SRG). When there is a single marked vertex in a SRG, we prove that lackadaisical DTQW can find the marked vertex with asymptotic success probability $1$, with a quadratic speedup compared to classical random walk. This paper deals with any parameter family of SRG and argues that, by adding self-loops with proper weights, the asymptotic success probability can reach $1$. The running time and asymptotic success probability matches the result of continuous-time quantum walk, and improves the result of DTQW.

show abstract

Section: Introductionmentioning

confidence: 99%