Demonstrating the utility of quantum computing in the pre-fault-tolerant era

A technical paper titled „Evidence for Applications of Quantum Computing” was published by researchers from IBM Quantum, University of California Berkeley, RIKEN and Lawrence Berkeley National Laboratory.


„Quantum computing promises to provide significant speedup over its classical counterpart for some problems. However, the biggest obstacle to realizing its full potential is the noise inherent in these systems. A widely accepted solution to this challenge is to implement fault-tolerant quantum circuits that are beyond the reach of current processors. Noiseless 127- Here we report experiments on the qubit processor and measure precision expectation values ​​for circuit modules at a scale beyond brute-force classical computation. We argue that this represents evidence for the application of quantum computing in the pre-rotation-tolerance era. Synchronization and calibration of a superconducting processor of this scale and such a large device. These test results are enabled by the ability to classify and control noise throughout.We establish the accuracy of the measured expected values ​​by comparing them with the output of a properly verifiable circuit. In the regime of strong entanglement, the quantum computer provides exact results for which leading classical approximations such as pure-state-based 1D (matrix product states, MPS) and 2D (isometric tensor network states, isoTNS) tensor network methods break down. These experiments demonstrate a fundamental tool for approaching quantum applications.

to find out Technical sheet here. Published: June 2023.

Kim, Y., Eddins, A., Anand, S. and many others. Proof of use of quantum computing before fault tolerance. Nature 618, 500–505 (2023).

Related reading
Quantum Computing Knowledge Center

Dodaj komentarz

Twój adres e-mail nie zostanie opublikowany. Wymagane pola są oznaczone *