Evidence for the utility of quantum computing before fault tolerance

🤖 Plain-English Summary

Abstract Quantum computing promises to offer substantial speed-ups over its classical counterpart for certain problems. In the regime of strong entanglement, the quantum computer provides correct 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 2,3 break down.

🔑 Key Findings

• However, the greatest impediment to realizing its full potential is noise that is inherent to these systems.
• The widely accepted solution to this challenge is the implementation of fault-tolerant quantum circuits, which is out of reach for current processors.
• Here we report experiments on a noisy 127-qubit processor and demonstrate the measurement of accurate expectation values for circuit volumes at a scale beyond brute-force classical computation.

🔗 Related Resources