返回
Implementing graph-theoretic quantum algorithms on a silicon photonic quantum walk processor
DOI:10.1126/sciadv.abb8375.png)
摘要
En 中文
Applications of quantum walks can depend on the number, exchange symmetry and indistinguishability of the particles involved, and the underlying graph structures where they move. Here, we show that silicon photonics, by exploiting an entanglement-driven scheme, can realize quantum walks with full control over all these properties in one device. The device we realize implements entangled two-photon quantum walks on any five-vertex graph, with continuously tunable particle exchange symmetry and indistinguishability. We show how this simulates single-particle walks on larger graphs, with size and geometry controlled by tuning the properties of the composite quantum walkers. We apply the device to quantum walk algorithms for searching vertices in graphs and testing for graph isomorphisms. In doing so, we implement up to 100 sampled time steps of quantum walk evolution on each of 292 different graphs. This opens the way to large-scale, programmable quantum walk processors for classically intractable applications.
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12.5
论文数:
2.0W
被引数:
18.1W
机构
引用论文
On the experimental verification of quantum complexity in linear optics关于线性光学中量子复杂性的实验验证
NATURE PHOTONICS
IF32.9
Large-scale silicon quantum photonics implementing arbitrary two-qubit processing实现任意两量子位处理的大规模硅量子光子学
NATURE PHOTONICS
IF32.9
Manipulation of multiphoton entanglement in waveguide quantum circuits波导量子电路中多光子纠缠的操纵
NATURE PHOTONICS
IF32.9
Healing of Chronic Wounds by Copper Oxide-Impregnated Wound Dressings—Case Series氧化铜浸渍伤口敷料对慢性伤口的愈合-病例系列
Medicina
IF0

