4.8 Article

Recurrence and polya number of quantum walks

期刊

PHYSICAL REVIEW LETTERS
卷 100, 期 2, 页码 -

出版社

AMER PHYSICAL SOC
DOI: 10.1103/PhysRevLett.100.020501

关键词

-

向作者/读者索取更多资源

We analyze the recurrence probability (Polya number) for d-dimensional unbiased quantum walks. A sufficient condition for a quantum walk to be recurrent is derived. As a by-product we find a simple criterion for localization of quantum walks. In contrast with classical walks, where the Polya number is characteristic for the given dimension, the recurrence probability of a quantum walk depends in general on the topology of the walk, choice of the coin and the initial state. This allows us to change the character of the quantum walk from recurrent to transient by altering the initial state.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Physics, Multidisciplinary

Percolation assisted excitation transport in discrete-time quantum walks

M. Stefanak, J. Novotny, I. Jex

NEW JOURNAL OF PHYSICS (2016)

Article Quantum Science & Technology

Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs

M. Stefanak, S. Skoupy

QUANTUM INFORMATION PROCESSING (2017)

Article Multidisciplinary Sciences

Probing measurement-induced effects in quantum walks via recurrence

Thomas Nitsche, Sonja Barkhofen, Regina Kruse, Linda Sansoni, Martin Stefanak, Aurel Gabris, Vaclav Potocek, Tamas Kiss, Igor Jex, Christine Silberhorn

SCIENCE ADVANCES (2018)

Article Multidisciplinary Sciences

Relation between Quantum Walks with Tails and Quantum Walks with Sinks on Finite Graphs

Norio Konno, Etsuo Segawa, Martin Stefanak

Summary: The paper explores the survival probability of Grover walks with sinks and their connection to Grover walks with tails, showing that the relationship between them can be described using eigenspaces.

SYMMETRY-BASEL (2021)

Article Physics, Multidisciplinary

Survival probability of the Grover walk on the ladder graph

E. Segawa, S. Koyama, N. Konno, M. Stefanak

Summary: We provide a detailed analysis of the survival probability of the Grover walk on the ladder graph with an absorbing sink. By constructing an orthonormal basis in the dark subspace, a closed formula for the survival probability is derived. It is shown that the survival probability can change from increasing to decreasing by attaching a loop to one of the corners of the ladder.

JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL (2023)

Article Physics, Multidisciplinary

Monitored recurrence of a one-parameter family of three-state quantum walks

Martin Stefanak

Summary: This paper investigates the monitored recurrence of a one-parameter set of three-state quantum walks on a line. The calculations are simplified by choosing a suitable basis of the coin space. The study shows that the Polya number depends on the coin parameter and the probability of the walker being initially in a specific coin state where the walk returns to the origin with certainty. Finally, a brief investigation of the exact quantum state recurrence is presented.

PHYSICA SCRIPTA (2023)

Article Physics, Multidisciplinary

Quantum walk state transfer on a hypercube

Martin Stefanak, Stanislav Skoupy

Summary: In this study, state transfer on a hypercube through quantum walk is investigated. The search for a single marked vertex is analyzed first, demonstrating the possibility of state transfer between arbitrary vertices. The transfer of state between antipodal vertices is then considered, showing that high-fidelity transfer can be achieved in a shorter time by adjusting the weight of the loop. Finally, state transfer between vertices of arbitrary distance is investigated, with results for antipodal vertices being applicable when the distance is at least 2.

PHYSICA SCRIPTA (2023)

Article Optics

Key graph properties affecting transport efficiency of flip-flop Grover percolated quantum walks

J. Mares, J. Novotny, M. Stefanak, I Jex

Summary: Quantum walks exhibit properties without classical analogues. We provide a recipe for the construction of a complete basis of trapped states allowing to determine the asymptotic probability of trapping for arbitrary finite connected simple graphs, thus significantly generalizing the previously known result restricted to planar 3-regular graphs.

PHYSICAL REVIEW A (2022)

Article Optics

Quantum-walk-based state-transfer algorithms on the complete M-partite graph

S. Skoupy, M. Stefanak

Summary: The study focuses on the coined quantum-walk search and state-transfer algorithms, showing that marked vertices can be found with high probability in large graphs and successful state transfer between different partitions. However, when the sender and receiver are in the same partition, the fidelity does not reach exactly 1, leading to the proposal of a state-transfer algorithm with an active switch to address this issue.

PHYSICAL REVIEW A (2021)

Article Optics

Complete classification of trapping coins for quantum walks on the two-dimensional square lattice

B. Kollar, A. Gilyen, I Tkacova, T. Kiss, I Jex, M. Stefanak

PHYSICAL REVIEW A (2020)

Article Optics

Conditional limit measure of a one-dimensional quantum walk with an absorbing sink

Mohamed Sabri, Etsuo Segawa, Martin Stefanak

PHYSICAL REVIEW A (2018)

Proceedings Paper Engineering, Electrical & Electronic

Probing the measurement process in DTQW via recurrence

Thomas Nitsche, Regina Kruse, Linda Sansoni, Martin Stefanak, Tamas Kiss, Igor Jex, Sonia Barkhofen, Christine Silberhorn

2017 CONFERENCE ON LASERS AND ELECTRO-OPTICS (CLEO) (2017)

Article Optics

Persistence of unvisited sites in quantum walks on a line

M. Stefanak, I. Jex

PHYSICAL REVIEW A (2016)

Article Optics

Counterintuitive role of geometry in transport by quantum walks

J. Mares, J. Novotny, M. Stefanak, I Jex

PHYSICAL REVIEW A (2020)

暂无数据