Demonstration of Algorithmic Quantum Speedup,Physical Review Letters

当前位置： X-MOL 学术 › Phys. Rev. Lett. › 论文详情

Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)

Demonstration of Algorithmic Quantum Speedup
Physical Review Letters ( IF 8.1 ) Pub Date : 2023-05-26 , DOI: 10.1103/physrevlett.130.210602
Bibek Pokharel ₁ , Daniel A Lidar ₂

Affiliation

Despite the development of increasingly capable quantum computers, an experimental demonstration of a provable algorithmic quantum speedup employing today’s non-fault-tolerant devices has remained elusive. Here, we unequivocally demonstrate such a speedup within the oracular model, quantified in terms of the scaling with the problem size of the time-to-solution metric. We implement the single-shot Bernstein-Vazirani algorithm, which solves the problem of identifying a hidden bitstring that changes after every oracle query, using two different 27-qubit IBM Quantum superconducting processors. The speedup is observed on only one of the two processors when the quantum computation is protected by dynamical decoupling but not without it. The quantum speedup reported here does not rely on any additional assumptions or complexity-theoretic conjectures and solves a bona fide computational problem in the setting of a game with an oracle and a verifier.

中文翻译：

算法量子加速演示

尽管量子计算机的能力越来越强，但使用当今的非容错设备来证明算法量子加速的实验演示仍然难以实现。在这里，我们明确地证明了神谕模型中的这种加速，并通过解决方案时间指标的问题规模的缩放来量化。我们实现了单次 Bernstein-Vazirani 算法，该算法使用两个不同的 27 量子位 IBM Quantum 超导处理器解决了识别每次 Oracle 查询后都会更改的隐藏位串的问题。当量子计算受到动态解耦保护时，仅在两个处理器之一上观察到加速，但在没有动态解耦的情况下并非如此。

更新日期：2023-05-26

点击分享查看原文

点击收藏

公开下载

阅读更多本刊最新论文本刊介绍/投稿指南11