Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2506.23775

High-Performance Contraction of Quantum Circuits for Riemannian Optimization

Fabian Putterer, Max M. Zumpe, Isabel Nha Minh Le, Qunsheng Huang, Christian B. Mendl

Published Jun 30, 2025• 5 citations
arXivHTMLPDF

Abstract

This work focuses on optimizing the gates of a quantum circuit with a given topology to approximate the unitary time evolution governed by a Hamiltonian. Recognizing that unitary matrices form a mathematical manifold, we employ Riemannian optimization methods -- specifically the Riemannian trust-region algorithm -- which involves second derivative calculations with respect to the gates. Our key technical contribution is a matrix-free algorithmic framework that avoids the explicit construction and storage of large unitary matrices acting on the whole Hilbert space. Instead, we evaluate all quantities as sums over state vectors, assuming that these vectors can be stored in memory. We develop HPC-optimized kernels for applying gates to state vectors and for the gradient and Hessian computation. Further improvements are achieved by exploiting sparsity structures due to Hamiltonian conservation laws, such as parity conservation, and lattice translation invariance. We benchmark our implementation on the Fermi-Hubbard model with up to 16 sites, demonstrating a nearly linear parallelization speed-up with up to 112 CPU threads. Finally, we compare our implementation with an alternative matrix product operator-based approach.

DOI
10.48550/arxiv.2506.23775

Related papers

Riemannian quantum circuit optimization for Hamiltonian simulation

Ayse Kotil, Rahul Banerjee, Qunsheng Huang +1 more

Abstract Hamiltonian simulation, i.e. simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful approximation can lead to relatively deep circuits. Here we start from the insight that for translation invariant systems, the gates in such circuit topologies can be further optimized on classical computers to decrease the circuit depth and/or increase the accuracy. We employ tensor network techniques and devise a method based on the Riemannian trust-region algorithm on the unitary matrix manifold for this purpose. For the Ising and Heisenberg models on a one-dimensional lattice, we achieve orders of magnitude accuracy improvements compared to fourth-order splitting methods. The optimized circuits could also be of practical use for the time-evolving block decimation algorithm.

arXiv:2212.07556•Journal of Physics A Mathematical and Theoretical•Feb 27, 2024•18 citations

Quantum circuit design from a retraction-based Riemannian optimization framework

Zhijian Lai, Hantao Nie, Jiayuan Wu +1 more

Designing quantum circuits for ground state preparation is a fundamental task in quantum information science. However, standard Variational Quantum Algorithms (VQAs) are often constrained by limited ansatz expressivity and difficult optimization landscapes. To address these issues, we adopt a geometric perspective, formulating the problem as the minimization of an energy cost function directly over the unitary group. We establish a retraction-based Riemannian optimization framework for this setting, ensuring that all algorithmic procedures are implementable on quantum hardware. Within this framework, we unify existing randomized gradient approaches under a Riemannian Random Subspace Gradient Projection (RRSGP) method. While recent geometric approaches have predominantly focused on such first-order gradient descent techniques, efficient second-order methods remain unexplored. To bridge this gap, we derive explicit expressions for the Riemannian Hessian and show that it can be estimated directly on quantum hardware via parameter-shift rules. Building on this, we propose the Riemannian Random Subspace Newton (RRSN) method, a scalable second-order algorithm that constructs a Newton system from measurement data. Numerical simulations indicate that RRSN achieves quadratic convergence, yielding high-precision ground states in significantly fewer iterations compared to both existing first-order approaches and standard VQA baselines. Ultimately, this work provides a systematic foundation for applying a broader class of efficient Riemannian algorithms to quantum circuit design.

quant-pharXiv:2602.20605•Feb 25, 2026•3 citations

Riemannian quantum circuit optimization based on matrix product operators

Isabel Nha Minh Le, Shuo Sun, Christian B. Mendl

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.

arXiv:2501.08872•Quantum•Aug 27, 2025•19 citations

Hessian-vector products for tensor networks via recursive tangent-state propagation

Isabel Nha Minh Le, Roeland Wiersema, Christian B. Mendl

Optimizing tensor networks with standard first-order methods often leads to slow convergence and entrapment in local minima. Although second-order optimization offers enhanced robustness, explicitly constructing the full Hessian matrix is computationally prohibitive for large-scale systems. In this work, we bypass this bottleneck by introducing an analytical Hessian-vector product kernel designed for arbitrary compositions of linear maps. This two-pass algorithm leverages recursive tangent-state propagation with a bounded virtual bond dimension to guarantee scalability. We demonstrate the practical utility of this kernel by integrating it into a Riemannian trust-region framework for quantum circuit compression. Evaluated on time-evolution circuits for various spin chains, our second-order approach achieves up to a four-order-of-magnitude improvement in fidelity over naive Trotterization, while delivering significantly smoother, faster convergence than conventional first-order methods such as Riemannian ADAM.

quant-pharXiv:2604.20384•Apr 23, 2026•1 citation

Optimizing quantum circuits with Riemannian gradient flow

Roeland Wiersema, Nathan Killoran

Variational quantum algorithms are a promising class of algorithms that can be performed on currently available quantum computers. In most settings, the free parameters of a variational circuit are optimized using a classical optimizer that updates parameters in Euclidean geometry. Since quantum circuits are elements of the special unitary group, we can consider an alternative optimization perspective that depends on the structure of this group. In this work, we investigate a Riemannian optimization scheme over the special unitary group and we discuss its implementation on a quantum computer. We illustrate that the resulting Riemannian gradient-flow algorithm has favorable optimization properties for deep circuits and that an approximate version of this algorithm can be performed on near-term hardware. We highlight the connections of our work with previously proposed heuristics like ADAPT-VQE and show that they can be understood as variants of our algorithm.

arXiv:2202.06976•Physical Review A•Jun 27, 2023•50 citations

Quantum Circuit Optimization using Differentiable Programming of Tensor Network States

David Rogerson, Ananda Roy

Efficient quantum circuit optimization schemes are central to quantum simulation of strongly interacting quantum many body systems. Here, we present an optimization algorithm which combines machine learning techniques and tensor network methods. The said algorithm runs on classical hardware and finds shallow, accurate quantum circuits by minimizing scalar cost functions. The gradients relevant for the optimization process are computed using the reverse mode automatic differentiation technique implemented on top of the time-evolved block decimation algorithm for matrix product states. A variation of the ADAM optimizer is utilized to perform a gradient descent on the manifolds of charge conserving unitary operators to find the optimal quantum circuit. The efficacy of this approach is demonstrated by finding the ground states of spin chain Hamiltonians for the Ising, three-state Potts and the massive Schwinger models for system sizes up to L=100. The first ten excited states of these models are also obtained for system sizes L=24. All circuits achieve high state fidelities within reasonable CPU time and modest memory requirements.

arXiv:2408.12583•Aug 22, 2024•16 citations
This work focuses on optimizing the gates of a quantum circuit with a given topology to approximate the unitary time evolution governed by a Hamiltonian. Recognizing that unitary matrices form a mathematical manifold, we employ Riemannian optimization methods -- specifically the Riemannian trust-region algorithm -- which involves second derivative calculations with respect to the gates. Our key technical contribution is a matrix-free algorithmic framework that avoids the explicit construction and storage of large unitary matrices acting on the whole Hilbert space. Instead, we evaluate all quantities as sums over state vectors, assuming that these vectors can be stored in memory. We develop HPC-optimized kernels for applying gates to state vectors and for the gradient and Hessian computation. Further improvements are achieved by exploiting sparsity structures due to Hamiltonian conservation laws, such as parity conservation, and lattice translation invariance. We benchmark our implementation on the Fermi-Hubbard model with up to 16 sites, demonstrating a nearly linear parallelization speed-up with up to 112 CPU threads. Finally, we compare our implementation with an alternative matrix product operator-based approach.
Abstract Hamiltonian simulation, i.e. simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful approximation can lead to relatively deep circuits. Here we start from the insight that for translation invariant systems, the gates in such circuit topologies can be further optimized on classical computers to decrease the circuit depth and/or increase the accuracy. We employ tensor network techniques and devise a method based on the Riemannian trust-region algorithm on the unitary matrix manifold for this purpose. For the Ising and Heisenberg models on a one-dimensional lattice, we achieve orders of magnitude accuracy improvements compared to fourth-order splitting methods. The optimized circuits could also be of practical use for the time-evolving block decimation algorithm.
Designing quantum circuits for ground state preparation is a fundamental task in quantum information science. However, standard Variational Quantum Algorithms (VQAs) are often constrained by limited ansatz expressivity and difficult optimization landscapes. To address these issues, we adopt a geometric perspective, formulating the problem as the minimization of an energy cost function directly over the unitary group. We establish a retraction-based Riemannian optimization framework for this setting, ensuring that all algorithmic procedures are implementable on quantum hardware. Within this framework, we unify existing randomized gradient approaches under a Riemannian Random Subspace Gradient Projection (RRSGP) method. While recent geometric approaches have predominantly focused on such first-order gradient descent techniques, efficient second-order methods remain unexplored. To bridge this gap, we derive explicit expressions for the Riemannian Hessian and show that it can be estimated directly on quantum hardware via parameter-shift rules. Building on this, we propose the Riemannian Random Subspace Newton (RRSN) method, a scalable second-order algorithm that constructs a Newton system from measurement data. Numerical simulations indicate that RRSN achieves quadratic convergence, yielding high-precision ground states in significantly fewer iterations compared to both existing first-order approaches and standard VQA baselines. Ultimately, this work provides a systematic foundation for applying a broader class of efficient Riemannian algorithms to quantum circuit design.
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.
Optimizing tensor networks with standard first-order methods often leads to slow convergence and entrapment in local minima. Although second-order optimization offers enhanced robustness, explicitly constructing the full Hessian matrix is computationally prohibitive for large-scale systems. In this work, we bypass this bottleneck by introducing an analytical Hessian-vector product kernel designed for arbitrary compositions of linear maps. This two-pass algorithm leverages recursive tangent-state propagation with a bounded virtual bond dimension to guarantee scalability. We demonstrate the practical utility of this kernel by integrating it into a Riemannian trust-region framework for quantum circuit compression. Evaluated on time-evolution circuits for various spin chains, our second-order approach achieves up to a four-order-of-magnitude improvement in fidelity over naive Trotterization, while delivering significantly smoother, faster convergence than conventional first-order methods such as Riemannian ADAM.
Variational quantum algorithms are a promising class of algorithms that can be performed on currently available quantum computers. In most settings, the free parameters of a variational circuit are optimized using a classical optimizer that updates parameters in Euclidean geometry. Since quantum circuits are elements of the special unitary group, we can consider an alternative optimization perspective that depends on the structure of this group. In this work, we investigate a Riemannian optimization scheme over the special unitary group and we discuss its implementation on a quantum computer. We illustrate that the resulting Riemannian gradient-flow algorithm has favorable optimization properties for deep circuits and that an approximate version of this algorithm can be performed on near-term hardware. We highlight the connections of our work with previously proposed heuristics like ADAPT-VQE and show that they can be understood as variants of our algorithm.
Efficient quantum circuit optimization schemes are central to quantum simulation of strongly interacting quantum many body systems. Here, we present an optimization algorithm which combines machine learning techniques and tensor network methods. The said algorithm runs on classical hardware and finds shallow, accurate quantum circuits by minimizing scalar cost functions. The gradients relevant for the optimization process are computed using the reverse mode automatic differentiation technique implemented on top of the time-evolved block decimation algorithm for matrix product states. A variation of the ADAM optimizer is utilized to perform a gradient descent on the manifolds of charge conserving unitary operators to find the optimal quantum circuit. The efficacy of this approach is demonstrated by finding the ground states of spin chain Hamiltonians for the Ising, three-state Potts and the massive Schwinger models for system sizes up to L=100. The first ten excited states of these models are also obtained for system sizes L=24. All circuits achieve high state fidelities within reasonable CPU time and modest memory requirements.