[EN] This bachelor’s thesis explores parameterized quantum circuits (PQCs) or ansatzes in variational quantum algorithms (VQAs) for preparing the ground state of different Hamiltonians, comparing them using trainability and expressiveness metrics. Based on these results, the study examines how the structure of the ansatz—if selected correctly—can improve both properties simultaneously by incorporating symmetries of the Hamiltonian to constrain the search space and facilitate training. Finally, the impact of these physics-informed versions is evaluated against standard, state-of-the-art designs.
[EN] This bachelor’s thesis explores parameterized quantum circuits (PQCs) or ansatzes in variational quantum algorithms (VQAs) for preparing the ground state of different Hamiltonians, comparing them using trainability and expressiveness metrics. Based on these results, the study examines how the structure of the ansatz—if selected correctly—can improve both properties simultaneously by incorporating symmetries of the Hamiltonian to constrain the search space and facilitate training. Finally, the impact of these physics-informed versions is evaluated against standard, state-of-the-art designs.
Ansatz selection is a key factor in the performance of variational quantum algorithms (VQAs). While much of the state-of-the-art still relies on heuristic choices, an inadequate circuit structure can compromise both the expressive power and the trainability of the resulting model. Recent results have also established theoretical connections between expressibility and the onset of barren plateaus, highlighting the need for systematic criteria for ansatz selection. In this work, the ansatz is treated as a design feature to be optimized rather than a fixed block, and a design space exploration (DSE) is performed over a diverse set of parametrized quantum circuits (PQCs). Three complementary metrics -- expressibility, trainability, and resource cost -- are evaluated and used to analyze the trade-offs that emerge across different PQCs. Beyond identifying Pareto-optimal candidates, this multi-objective perspective helps clarify the interplay between these metrics and contributes quantitative evidence toward understanding the expressibility--trainability tension in variational circuits.
Whether parameterized quantum circuits (PQCs) can be systematically constructed to be both trainable and expressive remains an open question. Highly expressive PQCs often exhibit barren plateaus, while several trainable alternatives admit efficient classical simulation. We address this question by deriving a finite-sample, dimension-independent concentration bound for estimating the variance of a PQC cost function, yielding explicit trainability guarantees. Across commonly used ansätze, we observe an anticorrelation between trainability and expressibility, consistent with theoretical insights. Building on this observation, we propose a property-based ansatz-search framework for identifying circuits that combine trainability and expressibility. We demonstrate its practical viability on a real quantum computer and apply it to variational quantum algorithms. We identify quantum neural network ansätze with improved effective dimension using over 6× fewer parameters, and for VQE on H2 we achieve UCCSD-like accuracy at substantially reduced circuit complexity.
Abstract In the context of Variational Quantum Algorithms (VQAs), selecting an appropriate ansatz is crucial for efficient problem-solving. Hamiltonian expressibility has been introduced as a metric to quantify a circuit’s ability to uniformly explore the energy landscape associated with a Hamiltonian ground state search problem. However, its influence on solution quality remains largely unexplored. In this work, we estimate the Hamiltonian expressibility of a well-defined set of circuits applied to various Hamiltonians using a Monte Carlo-based approach. We analyse how ansatz depth influences expressibility and identify the most and least expressive circuits across different problem types. We then train each ansatz using the Variational Quantum Eigensolver (VQE) and analyse the correlation between solution quality and expressibility. Our results indicate that, under ideal or low-noise conditions and particularly for small-scale problems, ansätze with high Hamiltonian expressibility yield better solution quality for problems with non-diagonal Hamiltonians and superposition state solutions. Conversely, circuits with low expressibility are more effective for problems whose solutions are basis states, including those defined by diagonal Hamiltonians. Under noisy conditions, low-expressibility circuits remain preferable for problems with solutions in a computational basis state, while intermediate expressibility yields better results for some problems involving superposition state solutions.
Variational quantum algorithms (VQAs) rely on parameterized quantum circuits (PQCs), whose performance is governed by expressibility and trainability. Existing studies typically evaluate these properties at the logical circuit level, implicitly assuming that designed PQCs remain unchanged during hardware execution. In practice, however, hardware-aware transpilation modifies circuit structure through qubit mapping, routing, and basis decomposition, potentially altering PQC behavior. In this paper, we perform a systematic hardware-aware analysis of expressibility and trainability by comparing logical and transpiled PQCs across multiple ansatz families, qubit counts, and circuit depths. Expressibility is measured using fidelity-based KL divergence, while trainability is quantified through gradient variance. Our results show that transpilation acts as an implicit architectural perturbation, producing strongly ansatz-dependent effects. Expressibility deviations exceed upto 125% in some cases, while trainability variations reach up to 25%. Structured ansatzes are generally more robust, whereas highly entangled architectures are more sensitive to transpilation-induced transformations. We further show that transpilation can alter the commonly assumed expressibility-trainability trade-off, demonstrating that logical-level analyses may not reliably predict hardware-level behavior. These findings highlight the importance of hardware-aware evaluation for accurate characterization of VQAs.
Parameterized quantum circuits (PQCs) serve as a flexible framework for implementing various quantum algorithms, particularly in quantum machine learning and optimization tasks. However, their training is challenging due to both theoretical constraints and the inherent limitations in current quantum hardware. A judicious choice of PQC architecture is crucial for accurately representing the solution space, and for ensuring convergence in training. Several works introduced measures of expressibility and entangling capability for PQCs, and compared these metrics across different circuit structures, providing insights into how they impact performance and efficiency. However, these investigations often assumed idealized all-to-all qubit connectivity, which is not applicable to most hardware architectures. In practice, additional transpilation steps are performed prior to execution on hardware. The potential impact of better alignment of the PQC structure with the underlying native topology has in fact motivated introduction of hardware-efficient ansatze. In our work, we extend the methodology of measuring PQC efficiency to include more realistic quantum hardware models. We examine several popular hardware topologies, including hexagonal, square, circular, linear, and all-to-all. We evaluate the expressibility and entangling capability of circuits with different connectivity types and various arrangements of rotation gates. We assess the training performance of these PQC types in the context of a variational compiling procedure and identify the preferred gate patterns. This approach provides a more realistic evaluation of PQC performance, thus offering practical insights into their applications on existing quantum devices.
Variational quantum algorithms (VQAs) have emerged as the leading strategy for using these noisy devices to achieve an advantage over their classical counterparts.VQAs use a hybrid quantum-classical framework, in which one employs the quantum computer to prepare a parameterized quantum state and outsource the optimization to a classical subroutine. VQAs have been proposed for applications in various fields, including physics, quantum chemistry, machine learning, and optimization. Nevertheless, many challenges must be addressed before we can use them for practical tasks. In this dissertation, we propose strategies to overcome some challenges in implementing VQAs. We first look at the issue of trainability for VQAs and propose three methods for optimizing them.The first method is based on natural evolutionary strategies (NES) and can alleviate the issue of vanishing gradients for randomly initialized parameterized quantum circuits (PQCs). The second method is based on the notion of information flow in PQCs and uses a mutual information-based distance metric to define paths for stochastic optimization of VQAs. Finally, we develop gradient evaluation procedures for optimizing objectives with the unitary coupled-cluster ansatz. Next, we study the issue of expressibility of PQCs used in variational algorithms.First, using the theory of quantum optimal control we define a notion of reachability of general ans\"atze used in VQAs. Next, using a variational autoencoder (VAE) coupled with a regression model, we try to gain a better understanding of the parameterization of PQCs. Finally, we attempt to remedy the inefficient usage of quantum resources for storing quantum data using evolutionary strategies to design quantum circuits for compressing quantum data. We present numerical evidence that the work presented here can increase trainability, efficiency, and understanding of VQAs.We believe our work is of interest to the quantum computing community as we continue to push the limits of NISQ devices for solving practical problems.