Quantum computing: too much to handle
8 days ago
- #quantum-supremacy
- #quantum-computing
- #research-updates
- Scott Aaronson is participating in the Inkhaven blogging residency, requiring daily posts, despite his usual posting frequency being much lower.
- Quantum computing (QC) is advancing rapidly, with too many developments to cover comprehensively, making it overwhelming to stay updated.
- Google announced verifiable quantum advantage using Out-of-Time-Order-Correlators (OTOC), demonstrating a regime where quantum computers outperform classical ones.
- Quantinuum introduced its Helios processor with 98 qubits, high-fidelity gates, and improved flexibility in gate application.
- Quantinuum and JP Morgan Chase improved a protocol for generating cryptographically certified random bits using quantum supremacy experiments.
- BlueQubit demonstrated verifiable quantum supremacy via obfuscated peaked random circuits, following a proposed method to hide high-probability outputs.
- A theoretical proposal for quantum advantage from peaked quantum circuits based on error-correcting codes was announced.
- A proof of a classical oracle separation between QMA and QCMA was announced, potentially settling a long-open problem.
- Oxford Ionics achieved a 2-qubit gate with 99.99% fidelity, a record surpassing the threshold for quantum fault-tolerance.
- Recent work claims to remove imaginary numbers from quantum mechanics, though the practical implications are debated.
- The QIP conference accepted talks for its upcoming event in Riga, Latvia, showcasing significant QC research.
- Phasecraft announced simulations of fermionic systems that might achieve quantum advantage, using Google’s and Quantinuum’s hardware.
- Key takeaways include the growing evidence against quantum computing skeptics, the potential for fault-tolerant QC soon, and the central challenge of verifiable quantum supremacy on current hardware.