Reducing the Number of Qubits in Quantum Factoring

Learn how to minimize qubit requirements in quantum factoring algorithms through this 54-minute conference talk by André Schrottenloher from INRIA, presented as part of the Simons Institute's Summer Cluster on Quantum Computing. Explore advanced techniques and theoretical approaches for optimizing quantum circuits used in integer factorization, examining methods to reduce the quantum computational resources needed while maintaining algorithmic effectiveness. Discover the latest research developments in quantum algorithm optimization and understand the practical implications for implementing factoring algorithms on near-term quantum devices with limited qubit counts.