Depth Optimization of Ansatz Circuits for Variational Quantum Algorithms

Spyros Tserkis, Muhammad Umer, Dimitris G. Angelakis

The increasing depth of quantum circuits presents a major limitation for the execution of quantum algorithms, as the limited coherence time of physical qubits leads to noise that manifests as errors during computation. In this work, we focus on circuits relevant to variational quantum algorithms and demonstrate that their depth can be reduced by introducing additional qubits, mid-circuit measurements, and classically controlled operations. As an illustrative example, we consider nonlinear dynamics governed by the one-dimensional Burgers’ equation, which has broad applications in computational fluid dynamics. In particular, we show that the proposed non-unitary quantum circuits can efficiently represent fluid flow configurations in both laminar and turbulent regimes. Furthermore, we demonstrate that, when noise is taken into account, these circuits are advantageous in regimes where two-qubit gate error rates are relatively low compared to idling error rates.

view on arxiv

Cite as BibTeX

@misc{tserkis2025depthoptimizationansatzcircuits,
title={Depth Optimization of Ansatz Circuits for Variational Quantum Algorithms},
author={Spyros Tserkis and Muhammad Umer and Dimitris G. Angelakis},
year={2025},
eprint={2511.13256},
archivePrefix={arXiv},
primaryClass={quant-ph},
url={https://arxiv.org/abs/2511.13256},
}

Depth Optimization of Ansatz Circuits for Variational Quantum Algorithms

Spyros Tserkis, Muhammad Umer, Dimitris G. Angelakis

You May Also Like

Tensor networks enable the calculation of turbulence probability distributions

Hamiltonian and Liouvillian learning in weakly-dissipative quantum many-body systems