Reading Group
Provable & Practical Quantum Advantage
Quantum computers are advancing rapidly in scale, fidelity, coherence, and control. However, demonstrating a convincing and ideally provable quantum advantage requires much more than building a larger device. It requires proposing well-defined and meaningful computational tasks, establishing rigorous separations from the best classical methods, and understanding whether those theoretical advantages survive the noise, resource constraints, and architectural limitations of realistic quantum hardware.
This reading group studies four complementary directions: quantum factoring algorithms, quantum chemistry, quantum streaming algorithms, and decoded quantum interferometry.
Participants: Minbo Gao, Zhenyu Jiang, Haoyu Wang, and Guangxu Yang.
Current Reading List
Quantum Factoring Algorithms
Parallel Spooky Pebbling Makes Regev Factoring More Practical
How to factor 2048 bit RSA integers with less than a million noisy qubits
The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
Quantum Algorithms for Optimization Problems
Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model
Exponential Quantum Space Advantage for Approximating Max-kSAT in the Streaming Setting
Realization of a Quantum Streaming Algorithm on Long-lived Trapped-ion Qubits
Optimization by Decoded Quantum Interferometry
To join the reading group or suggest a paper, contact Guangxu Yang .