Isabel Nha Minh Le
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Isabel Nha Minh Le has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Francesco Tacchino
IBM Quantum, IBM Research Zurich, 8803 Rüschlikon, Switzerland
2 shared publications - Hendrik Bluhm
JARA-FIT Institute for Quantum Information, Forschungszentrum Jülich GmbH and RWTH Aachen University, Aachen, Germany
2 shared publications - Julian Schuhmacher
IBM Quantum IBM Research Europe -Zürich 8803 Rüschlikon Switzerland
2 shared publications - Oriel Kiss
European Organization for Nuclear Research (CERN)
2 shared publications - Christian B. Mendl
Technical University of Munich, Munich, Germany
1 shared publication Ivano Tavernelli
IBM Quantum IBM Research Europe -Zurich 8803 Rueschlikon Switzerland
1 shared publication
Latest Publications
- Open Access
- 27 August 2025
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1833
Riemannian quantum circuit optimization based on matrix product operators
We significantly enhance the simulation accuracy of initial Trotter circuits for Hamiltonian simulation of quantum systems by integrating first-order Riemannian optimization with tensor network methods. Unlike previous approaches, our method imposes no symmetry assumptions, such as translational invariance, on the quantum systems. This technique is scalable to large systems through the use of a matrix product operator representation of the reference time evolution propagator. Our optimization routine is applied to various spin chains and fermionic systems described by the transverse-field Ising Hamiltonian, the Heisenberg Hamiltonian, and the spinful Fermi-Hubbard Hamiltonian. In these cases, our approach achieves a relative error improvement of up to four orders of magnitude for systems of 50 qubits, although our method is also applicable to larger systems. Furthermore, we demonstrate the versatility of our method by applying it to molecular systems, specifically lithium hydride, achieving an error improvement of up to eight orders of magnitude. This proof of concept highlights the potential of our approach for broader applications in quantum simulations.
- 27 August 2025
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1833
Open AccessRiemannian quantum circuit optimization based on matrix product operators
We significantly enhance the simulation accuracy of initial Trotter circuits for Hamiltonian simulation of quantum systems by integrating first-order Riemannian optimization with tensor network methods. Unlike previous approaches, our method imposes no symmetry assumptions, such as translational invariance, on the quantum systems. This technique is scalable to large systems through the use of a matrix product operator representation of the reference time evolution propagator. Our optimization routine is applied to various spin chains and fermionic systems described by the transverse-field Ising Hamiltonian, the Heisenberg Hamiltonian, and the spinful Fermi-Hubbard Hamiltonian. In these cases, our approach achieves a relative error improvement of up to four orders of magnitude for systems of 50 qubits, although our method is also applicable to larger systems. Furthermore, we demonstrate the versatility of our method by applying it to molecular systems, specifically lithium hydride, achieving an error improvement of up to eight orders of magnitude. This proof of concept highlights the potential of our approach for broader applications in quantum simulations.
- Open Access
- 1 February 2025
- Published by IOP Publishing in New Journal of Physics
- Vol. 27 (2) , 023015
Symmetry-invariant quantum machine learning force fields
Machine learning techniques are essential tools to compute efficient, yet accurate, force fields for atomistic simulations. This approach has recently been extended to incorporate quantum computational methods, making use of variational quantum learning models to predict potential energy surfaces and atomic forces from ab initio training data. However, the trainability and scalability of such models are still limited, due to both theoretical and practical barriers. Inspired by recent developments in geometric classical and quantum machine learning, here we design quantum neural networks that explicitly incorporate, as a data-inspired prior, an extensive set of physically relevant symmetries. We find that our invariant quantum learning models outperform their more generic counterparts on individual molecules of growing complexity. Furthermore, we study a water dimer as a minimal example of a system with multiple components, showcasing the versatility of our proposed approach and opening the way towards larger simulations. Finally, we perform a barren plateau analysis and numerically observe that our model does not exhibit a barren plateau in the shallow depth regime. Our results suggest that molecular force fields generation can significantly profit from leveraging the framework of geometric quantum machine learning, and that chemical systems represent, in fact, an interesting and rich playground for the development and application of advanced quantum machine learning tools.
- 1 February 2025
- Published by IOP Publishing in New Journal of Physics
- Vol. 27 (2) , 023015
Open AccessSymmetry-invariant quantum machine learning force fields
Machine learning techniques are essential tools to compute efficient, yet accurate, force fields for atomistic simulations. This approach has recently been extended to incorporate quantum computational methods, making use of variational quantum learning models to predict potential energy surfaces and atomic forces from ab initio training data. However, the trainability and scalability of such models are still limited, due to both theoretical and practical barriers. Inspired by recent developments in geometric classical and quantum machine learning, here we design quantum neural networks that explicitly incorporate, as a data-inspired prior, an extensive set of physically relevant symmetries. We find that our invariant quantum learning models outperform their more generic counterparts on individual molecules of growing complexity. Furthermore, we study a water dimer as a minimal example of a system with multiple components, showcasing the versatility of our proposed approach and opening the way towards larger simulations. Finally, we perform a barren plateau analysis and numerically observe that our model does not exhibit a barren plateau in the shallow depth regime. Our results suggest that molecular force fields generation can significantly profit from leveraging the framework of geometric quantum machine learning, and that chemical systems represent, in fact, an interesting and rich playground for the development and application of advanced quantum machine learning tools.
- Open Access
Symmetry-invariant quantum machine learning force fields
Machine learning techniques are essential tools to compute efficient, yet accurate, force fields for atomistic simulations. This approach has recently been extended to incorporate quantum computational methods, making use of variational quantum learning models to predict potential energy surfaces and atomic forces from ab initio training data. However, the trainability and scalability of such models are still limited, due to both theoretical and practical barriers. Inspired by recent developments in geometric classical and quantum machine learning, here we design quantum neural networks that explicitly incorporate, as a data-inspired prior, an extensive set of physically relevant symmetries. We find that our invariant quantum learning models outperform their more generic counterparts on individual molecules of growing complexity. Furthermore, we study a water dimer as a minimal example of a system with multiple components, showcasing the versatility of our proposed approach and opening the way towards larger simulations. Our results suggest that molecular force fields generation can significantly profit from leveraging the framework of geometric quantum machine learning, and that chemical systems represent, in fact, an interesting and rich playground for the development and application of advanced quantum machine learning tools.
Open AccessSymmetry-invariant quantum machine learning force fields
Machine learning techniques are essential tools to compute efficient, yet accurate, force fields for atomistic simulations. This approach has recently been extended to incorporate quantum computational methods, making use of variational quantum learning models to predict potential energy surfaces and atomic forces from ab initio training data. However, the trainability and scalability of such models are still limited, due to both theoretical and practical barriers. Inspired by recent developments in geometric classical and quantum machine learning, here we design quantum neural networks that explicitly incorporate, as a data-inspired prior, an extensive set of physically relevant symmetries. We find that our invariant quantum learning models outperform their more generic counterparts on individual molecules of growing complexity. Furthermore, we study a water dimer as a minimal example of a system with multiple components, showcasing the versatility of our proposed approach and opening the way towards larger simulations. Our results suggest that molecular force fields generation can significantly profit from leveraging the framework of geometric quantum machine learning, and that chemical systems represent, in fact, an interesting and rich playground for the development and application of advanced quantum machine learning tools.
- 2 February 2022
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 17 (2) , 024006
Analytic Filter-Function Derivatives for Quantum Optimal Control
Autocorrelated noise appears in many solid-state qubit systems and hence needs to be taken into account when developing gate operations for quantum information processing. However, explicitly simulating this kind of noise is often less efficient than approximate methods. Here, we focus on the filter function formalism, which allows the computation of gate fidelities in the presence of autocorrelated classical noise. Hence, this formalism can be combined with optimal control algorithms to design control pulses, which optimally implement quantum gates. To enable the use of gradient-based algorithms with fast convergence, we present analytically derived filter function gradients with respect to control pulse amplitudes, and analyze the computational complexity of our results. When comparing pulse optimization using our derivatives to a gradient-free approach, we find that the gradient-based method is roughly 2 orders of magnitude faster for our test cases. We also provide a modular computational implementation compatible with quantum optimal control packages.
- 2 February 2022
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 17 (2) , 024006
Analytic Filter-Function Derivatives for Quantum Optimal Control
Autocorrelated noise appears in many solid-state qubit systems and hence needs to be taken into account when developing gate operations for quantum information processing. However, explicitly simulating this kind of noise is often less efficient than approximate methods. Here, we focus on the filter function formalism, which allows the computation of gate fidelities in the presence of autocorrelated classical noise. Hence, this formalism can be combined with optimal control algorithms to design control pulses, which optimally implement quantum gates. To enable the use of gradient-based algorithms with fast convergence, we present analytically derived filter function gradients with respect to control pulse amplitudes, and analyze the computational complexity of our results. When comparing pulse optimization using our derivatives to a gradient-free approach, we find that the gradient-based method is roughly 2 orders of magnitude faster for our test cases. We also provide a modular computational implementation compatible with quantum optimal control packages.
- Open Access
Analytic Filter Function Derivatives for Quantum Optimal Control
Auto-correlated noise appears in many solid state qubit systems and hence needs to be taken into account when developing gate operations for quantum information processing. However, explicitly simulating this kind of noise is often less efficient than approximate methods. Here, we focus on the filter function formalism, which allows the computation of gate fidelities in the presence of auto-correlated classical noise. Hence, this formalism can be combined with optimal control algorithms to design control pulses, which optimally implement quantum gates. To enable the use of gradient-based algorithms with fast convergence, we present analytically derived filter function gradients with respect to control pulse amplitudes, and analyze the computational complexity of our results. When comparing pulse optimization using our derivatives to a gradient-free approach, we find that the gradient-based method is roughly two orders of magnitude faster for our test cases. We also provide a modular computational implementation compatible with quantum optimal control packages.
Open AccessAnalytic Filter Function Derivatives for Quantum Optimal Control
Auto-correlated noise appears in many solid state qubit systems and hence needs to be taken into account when developing gate operations for quantum information processing. However, explicitly simulating this kind of noise is often less efficient than approximate methods. Here, we focus on the filter function formalism, which allows the computation of gate fidelities in the presence of auto-correlated classical noise. Hence, this formalism can be combined with optimal control algorithms to design control pulses, which optimally implement quantum gates. To enable the use of gradient-based algorithms with fast convergence, we present analytically derived filter function gradients with respect to control pulse amplitudes, and analyze the computational complexity of our results. When comparing pulse optimization using our derivatives to a gradient-free approach, we find that the gradient-based method is roughly two orders of magnitude faster for our test cases. We also provide a modular computational implementation compatible with quantum optimal control packages.