Researchers at IBM T. J. Watson Research Center discovered unexpectedly a new mathematical proof of quantum advantage – the elusive threshold at which quantum computers outperform classical machines in certain use cases.
They study shows the smallest known computation that is more efficient when implemented quantumly rather than on a classical reversible computer, counting the 2-(qu)bit gates in respective circuits. This illustrates what can be called a “white box” quantum advantage. In contrast, a number of “black box”-style advantages are known, with the difference that a black box assumes no knowledge of own inner workings, whereas white box is an explicit circuit.
A black box algorithm usually concerns discovering a property of the function computed by the given black box. The Bernstein–Vazirani algorithm is an example of a black box algorithm that discovers the hidden linear function computed by the black box with a single query, thus providing a quantum advantage over the best possible classical algorithm (whose query complexity is linear in the number of inputs to the black box).
They used a circuit, rather than an algorithm, to more transparently demonstrate the quantum advantage. The ability to express solutions to problems by quantum circuits requiring fewer resources (such as the number of gates used) than classical circuits solving the same problem defines the power and extent of the advantage by a quantum computer.
The paper contains an instance of computational quantum advantage where an optimal classical 8-gate reversible linear circuit is implemented more efficiently using seven entangling gates as a quantum Clifford circuit. This work extends previous studies examining quantum advantage.
The paper can be read there.
Read more.
