Lackadaisical discrete-time quantum walk on Johnson graph
F Peng, M Li, X Sun - Physica A: Statistical Mechanics and its Applications, 2024 - Elsevier
Quantum walk is widely used in search problems, and it has an ideal acceleration effect
compared with classical algorithm. Suppose there is a marked vertex w on Johnson graph J …
compared with classical algorithm. Suppose there is a marked vertex w on Johnson graph J …
Unifying quantum spatial search, state transfer and uniform sampling on graphs: simple and exact
Q Wang, Y Jiang, L Li - arXiv preprint arXiv:2407.02530, 2024 - arxiv.org
This article presents a novel and succinct algorithmic framework via alternating quantum
walks, unifying quantum spatial search, state transfer and uniform sampling on a large class …
walks, unifying quantum spatial search, state transfer and uniform sampling on a large class …
Spatial search on Johnson graphs by discrete-time quantum walk
The spatial search problem aims to find a marked vertex of a finite graph using a dynamic
with two constraints:(1) the walker has no compass and (2) the walker can check whether a …
with two constraints:(1) the walker has no compass and (2) the walker can check whether a …
Optimality of spatial search in graphs with infinite tail
W Xie, C Tamon - Physical Review A, 2023 - APS
Farhi and Gutmann [Phys. Rev. A 57, 2403 (1998) 1050-2947 10.1103/PhysRevA. 57.2403]
proved that a continuous-time analog of Grover search (also called spatial search) is optimal …
proved that a continuous-time analog of Grover search (also called spatial search) is optimal …
[PDF][PDF] 基于量子行走的电子支付协议
何业锋， 杨梦玫， 李智， 刘妍， 田哲铭 - Acta Optica Sinica, 2023 - researching.cn
摘要目前, 量子行走已广泛应用于量子计算和量子模拟中, 并可应用于量子隐形传态中.
提出了一种基于量子行走的电子支付协议. 在协议中, 买家基于可信第三方平台 …
提出了一种基于量子行走的电子支付协议. 在协议中, 买家基于可信第三方平台 …
Multimarked spatial search by continuous-time quantum walk
The quantum-walk-based spatial search problem aims to find a marked vertex using a
quantum walk on a graph with marked vertices. We describe a framework for determining …
quantum walk on a graph with marked vertices. We describe a framework for determining …
Of shadows and gaps in spatial search
Spatial search occurs in a connected graph if a continuous-time quantum walk on the
adjacency matrix of the graph, suitably scaled, plus a rank-one perturbation induced by any …
adjacency matrix of the graph, suitably scaled, plus a rank-one perturbation induced by any …
Universal approach to deterministic spatial search via alternating quantum walks
Q Wang, Y Jiang, S Feng, L Li - arXiv preprint arXiv:2307.16133, 2023 - arxiv.org
Spatial search is an important problem in quantum computation, which aims to find a marked
vertex on a graph. We propose a novel and universal approach for designing deterministic …
vertex on a graph. We propose a novel and universal approach for designing deterministic …
Walking on vertices and edges by continuous-time quantum walk
CFT Silva, D Posner, R Portugal - Quantum Information Processing, 2023 - Springer
The quantum walk dynamics obey the laws of quantum mechanics with an extra locality
constraint, which demands that the evolution operator is local in the sense that the walker …
constraint, which demands that the evolution operator is local in the sense that the walker …
Quantum search by continuous-time quantum walk on t-designs
PHG Lugão, R Portugal - Quantum Information Processing, 2024 - Springer
This work examines the time complexity of quantum search algorithms on combinatorial t-
designs with multiple marked elements using the continuous-time quantum walk. Through a …
designs with multiple marked elements using the continuous-time quantum walk. Through a …