ACM Transactions on Quantum Computing, Volume 7, Issue 2, Article 8, Pages 1 – 29
Anna Leonteva1, Guido Masella1, Maxime Outteryck1, Asiere Piñeiro Orioli1 2, Shannon Whitlock1 2
Evaluating quantum algorithms at utility-scale—involving more than 100 qubits—is a key step toward advancing real-world applications of quantum computing. In this study, we benchmark seven state-of-the-art quantum emulators employing techniques such as tensor networks, matrix product states (MPS), decision diagrams, and factorized ket based methods, running on CPU based hardware and focusing on effectively exact simulations. Performance is assessed on 13 benchmark circuits from the MQTBench library, spanning circuit sizes from 4 to 1,024 qubits. Our results reveal that MPS-based emulators outperform other approaches overall, successfully solving 8 benchmarks up to the maximum size of 1,024 qubits and 12 benchmarks up to at least 100 qubits in less than 5 minutes. We find evidence that all circuits except a random one can be simulated in polynomial time. This work demonstrates that quantum emulators can faithfully simulate a broad range of large and complex universal quantum circuits with high fidelity, far beyond the limits of statevector simulators and today’s quantum hardware.
- 1 QPerfect SAS, France
- 2 European Center for Quantum Sciences (CESQ-ISIS, UMR 7006), University of Strasbourg and CNRS
