Anna Leonteva
Research Subjects
Anna Leonteva has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Guido Masella
QPerfect
3 shared publications Anne Jeannin-Girardon
University of Strasbourg
2 shared publications- Maxime Outteryck
QPerfect
2 shared publications Pierre Collet
University of Strasbourg
2 shared publicationsPierre Parrend
University of Strasbourg
2 shared publications- Asier Piñeiro Orioli
QPerfect, Strasbourg, France
1 shared publication
Latest Publications
- 2 September 2026
- Published by Springer Nature
- p. 268-283
Circuit-Aware Hyperparameter Prediction for MPS Quantum Simulators
- 2 September 2026
- Published by Springer Nature
- p. 268-283
Circuit-Aware Hyperparameter Prediction for MPS Quantum Simulators
- Open Access
- 27 January 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 7 (2) , 1-29
Comparative Benchmarking of Utility-Scale Quantum Emulators
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.
- 27 January 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 7 (2) , 1-29
Open AccessComparative Benchmarking of Utility-Scale Quantum Emulators
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.
- 30 November 2020
- Published by Springer Nature
- p. 95-106
Quantum-Inspired Algorithm with Evolution Strategy
- 30 November 2020
- Published by Springer Nature
- p. 95-106
Quantum-Inspired Algorithm with Evolution Strategy
- 29 April 2020
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 82-95
Fast Evolutionary Algorithm for Solving Large-Scale Multi-objective Problems
- 29 April 2020
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 82-95
Fast Evolutionary Algorithm for Solving Large-Scale Multi-objective Problems