Communications of the ACM
Quantum Annealing Can Beat Classical Computing in Limited Cases
Bin Yan (left) and Nikolai Sinitsyn (right) developed an analytical proof based on quantum theory constraining the conditions under which a quantum annealing computer can outperform a classical computer.
Credit: Los Alamos National Laboratory
Quantum annealing computers can run algorithms faster than classical computers in certain instances, but typically not when time is limited.
Nikolai Sinitsyn and Bin Yan at the U.S. Department of Energy's Los Alamos National Laboratory designed an analytical strategy to demonstrate a simple untuned process that solves any computational problem considered by a quantum annealing system, with computational accuracy characterized at any point during runtime. However, this accuracy is rarely superior to classical algorithmic performance because efficient quantum computing depends on quantum effects, while many quantum histories interfere to magnify the useful information in the final state.
Without fine-tuning, the proper interference becomes unlikely, though there are exceptions which leave the niche for superior quantum computing.
From Los Alamos National Laboratory
View Full Article
Abstracts Copyright © 2021 SmithBucklin, Washington, DC, USA
No entries found