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

Perspectives on Quantum Sensing and Computation for Particle Physics

Lena Funcke

Published Jan 1, 2021• 0 citations
OpenAlex

Abstract

<!--HTML-->Parametric quantum circuits play a crucial role in the performance of many variational quantum algorithms. To successfully implement such algorithms, one must design efficient quantum circuits that sufficiently approximate the solution space while maintaining a low parameter count and circuit depth. In this talk, we present a method to analyze the dimensional expressivity of parametric quantum circuits. This technique allows for identifying superfluous parameters in the circuit layout and for obtaining a maximally expressive ansatz with a minimum number of parameters. Using a hybrid quantum-classical approach, we show how to efficiently implement the expressivity analysis using quantum hardware, and we provide a proof of principle demonstration of this procedure on IBM's quantum hardware. We also discuss the effect of symmetries and demonstrate how to incorporate or remove symmetries from the parametrized ansatz.

Related papers

Dimensional Expressivity Analysis of Parametric Quantum Circuits

Lena Funcke, Tobias Hartung, Karl Jansen +2 more

Parametric quantum circuits play a crucial role in the performance of many variational quantum algorithms. To successfully implement such algorithms, one must design efficient quantum circuits that sufficiently approximate the solution space while maintaining a low parameter count and circuit depth. In this paper, develop a method to analyze the dimensional expressivity of parametric quantum circuits. Our technique allows for identifying superfluous parameters in the circuit layout and for obtaining a maximally expressive ansatz with a minimum number of parameters. Using a hybrid quantum-classical approach, we show how to efficiently implement the expressivity analysis using quantum hardware, and we provide a proof of principle demonstration of this procedure on IBM's quantum hardware. We also discuss the effect of symmetries and demonstrate how to incorporate or remove symmetries from the parametrized ansatz.

arXiv:2011.03532•Quantum•Mar 29, 2021•82 citations

Dimensional Expressivity Analysis, best-approximation errors, and automated design of parametric quantum circuits

Tobias Hartung, Lena Funcke, Karl Jansen +3 more

The design of parametric quantum circuits (PQCs) for efficient use in variational quantum simulations (VQS) is subject to two competing factors. On one hand, the set of states that can be generated by the PQC has to be large enough to contain the solution state. Otherwise, one may at best find the best approximation of the solution restricted to the states generated by the chosen PQC. On the other hand, the PQC should contain as few parametric quantum gates as possible to minimize noise from the quantum device. Thus, when designing a PQC one needs to ensure that there are no redundant parameters. The dimensional expressivity analysis discussed in these proceedings is a means of addressing these counteracting effects. Its main objective is to identify independent and redundant parameters in the PQC. Using this information, superfluous parameters can be removed and the dimension of the space of states that are generated by the PQC can be computed. Knowing the dimension of the physical state space then allows us to deduce whether or not the PQC can reach all physical states. Furthermore, the dimensional expressivity analysis can be implemented efficiently using a hybrid quantum-classical algorithm. This implementation has relatively small overhead costs both for the classical and quantum part of the algorithm and could therefore be used in the future for on-the-fly circuit construction. This would allow for optimized circuits to be used in every loop of a VQS rather than the same PQC for the entire VQS. These proceedings review and extend work in [1, 2].

arXiv:2111.11489•International Symposium on Lattice Field Theory (LATTICE)•May 16, 2022•6 citations

Expressibility and Entangling Capability of Parameterized Quantum Circuits for Hybrid Quantum‐Classical Algorithms

Sukin Sim, Peter D. Johnson, Alán Aspuru‐Guzik

Abstract Parameterized quantum circuits (PQCs) play an essential role in the performance of many variational quantum algorithms. One challenge in implementing such algorithms is choosing an effective circuit that well represents the solution space while maintaining a low circuit depth and parameter count. To characterize and identify expressible, yet compact, circuits, several descriptors are proposed, including expressibility and entangling capability, that are statistically estimated from classical simulations. These descriptors are computed for different circuit structures, varying the qubit connectivity and selection of gates. From these simulations, circuit fragments that perform well with respect to the descriptors are identified. In particular, a substantial improvement in performance of two‐qubit gates in a ring or all‐to‐all connected arrangement, compared to that of those on a line, is observed. Furthermore, improvement in both descriptors is achieved by sequences of controlled X‐rotation gates compared to sequences of controlled Z‐rotation gates. In addition, it is investigated how expressibility “saturates” with increased circuit depth, finding that the rate and saturated value appear to be distinguishing features of a PQC. While the correlation between each descriptor and algorithm performance remains to be investigated, methods and results from this study can be useful for algorithm development and design of experiments.

arXiv:1905.10876•Advanced Quantum Technologies•Oct 14, 2019•1,178 citations

Best-approximation error for parametric quantum circuits

Lena Funcke, Tobias Hartung, Karl Jansen +3 more

In Variational Quantum Simulations, the construction of a suitable parametric quantum circuit is subject to two counteracting effects. The number of parameters should be small for the device noise to be manageable, but also large enough for the circuit to be able to represent the solution. Dimensional expressivity analysis can optimize a candidate circuit considering both aspects. In this article, we will first discuss an inductive construction for such candidate circuits. Furthermore, it is sometimes necessary to choose a circuit with fewer parameters than necessary to represent all relevant states. To characterize such circuits, we estimate the best-approximation error using Voronoi diagrams. Moreover, we discuss a hybrid quantum-classical algorithm to estimate the worst-case best-approximation error, its complexity, and its scaling in state space dimensionality. This allows us to identify some obstacles for variational quantum simulations with local optimizers and underparametrized circuits, and we discuss possible remedies.

arXiv:2107.07378•IEEE International Conference on Web Services (ICWS)•Sep 1, 2021•5 citations

Efficiently architecting VQAs: Expressibility--Trainability--Resources Pareto-Optimality

Rodrigo M. Sanz, Andreu Angles-Castillo, Eduard Alarcon +1 more

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.

quant-pharXiv:2603.22142•IEEE Transactions on Quantum Engineering•Mar 24, 2026•2 citations

Genetic optimization of ansatz expressibility for enhanced variational-quantum-algorithm performance

Manish Mallapur, Ronit Raj, Ankur Raina

Variational quantum algorithms have emerged as a leading paradigm that extracts practical computation from near-term intermediate-scale quantum devices, enabling advances in quantum chemistry simulations, combinatorial optimization, and quantum machine learning. However, the performance of variational quantum algorithms is highly sensitive to the design of the ansatze. To be effective, ansatze must be expressive enough to capture target states but shallow enough to be trainable. We propose a genetic algorithm-inspired framework for designing ansatze that achieve high expressibility while maintaining shallow depth and low parameter count. Our approach evolves ansatze through mutation and selection based on an expressibility metric. The circuit generated by our framework consistently demonstrates high expressibility at any target depth and performs comparably to traditional ansatz design approaches. This work presents a problem-agnostic, scalable solution for ansatz design, producing expressive, low-depth circuits that need to be designed only once and can serve a wide range of applications.

arXiv:2509.05804•Physical Review A•Feb 18, 2026•1 citation
<!--HTML-->Parametric quantum circuits play a crucial role in the performance of many variational quantum algorithms. To successfully implement such algorithms, one must design efficient quantum circuits that sufficiently approximate the solution space while maintaining a low parameter count and circuit depth. In this talk, we present a method to analyze the dimensional expressivity of parametric quantum circuits. This technique allows for identifying superfluous parameters in the circuit layout and for obtaining a maximally expressive ansatz with a minimum number of parameters. Using a hybrid quantum-classical approach, we show how to efficiently implement the expressivity analysis using quantum hardware, and we provide a proof of principle demonstration of this procedure on IBM's quantum hardware. We also discuss the effect of symmetries and demonstrate how to incorporate or remove symmetries from the parametrized ansatz.
Parametric quantum circuits play a crucial role in the performance of many variational quantum algorithms. To successfully implement such algorithms, one must design efficient quantum circuits that sufficiently approximate the solution space while maintaining a low parameter count and circuit depth. In this paper, develop a method to analyze the dimensional expressivity of parametric quantum circuits. Our technique allows for identifying superfluous parameters in the circuit layout and for obtaining a maximally expressive ansatz with a minimum number of parameters. Using a hybrid quantum-classical approach, we show how to efficiently implement the expressivity analysis using quantum hardware, and we provide a proof of principle demonstration of this procedure on IBM's quantum hardware. We also discuss the effect of symmetries and demonstrate how to incorporate or remove symmetries from the parametrized ansatz.
The design of parametric quantum circuits (PQCs) for efficient use in variational quantum simulations (VQS) is subject to two competing factors. On one hand, the set of states that can be generated by the PQC has to be large enough to contain the solution state. Otherwise, one may at best find the best approximation of the solution restricted to the states generated by the chosen PQC. On the other hand, the PQC should contain as few parametric quantum gates as possible to minimize noise from the quantum device. Thus, when designing a PQC one needs to ensure that there are no redundant parameters. The dimensional expressivity analysis discussed in these proceedings is a means of addressing these counteracting effects. Its main objective is to identify independent and redundant parameters in the PQC. Using this information, superfluous parameters can be removed and the dimension of the space of states that are generated by the PQC can be computed. Knowing the dimension of the physical state space then allows us to deduce whether or not the PQC can reach all physical states. Furthermore, the dimensional expressivity analysis can be implemented efficiently using a hybrid quantum-classical algorithm. This implementation has relatively small overhead costs both for the classical and quantum part of the algorithm and could therefore be used in the future for on-the-fly circuit construction. This would allow for optimized circuits to be used in every loop of a VQS rather than the same PQC for the entire VQS. These proceedings review and extend work in [1, 2].
Abstract Parameterized quantum circuits (PQCs) play an essential role in the performance of many variational quantum algorithms. One challenge in implementing such algorithms is choosing an effective circuit that well represents the solution space while maintaining a low circuit depth and parameter count. To characterize and identify expressible, yet compact, circuits, several descriptors are proposed, including expressibility and entangling capability, that are statistically estimated from classical simulations. These descriptors are computed for different circuit structures, varying the qubit connectivity and selection of gates. From these simulations, circuit fragments that perform well with respect to the descriptors are identified. In particular, a substantial improvement in performance of two‐qubit gates in a ring or all‐to‐all connected arrangement, compared to that of those on a line, is observed. Furthermore, improvement in both descriptors is achieved by sequences of controlled X‐rotation gates compared to sequences of controlled Z‐rotation gates. In addition, it is investigated how expressibility “saturates” with increased circuit depth, finding that the rate and saturated value appear to be distinguishing features of a PQC. While the correlation between each descriptor and algorithm performance remains to be investigated, methods and results from this study can be useful for algorithm development and design of experiments.
In Variational Quantum Simulations, the construction of a suitable parametric quantum circuit is subject to two counteracting effects. The number of parameters should be small for the device noise to be manageable, but also large enough for the circuit to be able to represent the solution. Dimensional expressivity analysis can optimize a candidate circuit considering both aspects. In this article, we will first discuss an inductive construction for such candidate circuits. Furthermore, it is sometimes necessary to choose a circuit with fewer parameters than necessary to represent all relevant states. To characterize such circuits, we estimate the best-approximation error using Voronoi diagrams. Moreover, we discuss a hybrid quantum-classical algorithm to estimate the worst-case best-approximation error, its complexity, and its scaling in state space dimensionality. This allows us to identify some obstacles for variational quantum simulations with local optimizers and underparametrized circuits, and we discuss possible remedies.
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.
Variational quantum algorithms have emerged as a leading paradigm that extracts practical computation from near-term intermediate-scale quantum devices, enabling advances in quantum chemistry simulations, combinatorial optimization, and quantum machine learning. However, the performance of variational quantum algorithms is highly sensitive to the design of the ansatze. To be effective, ansatze must be expressive enough to capture target states but shallow enough to be trainable. We propose a genetic algorithm-inspired framework for designing ansatze that achieve high expressibility while maintaining shallow depth and low parameter count. Our approach evolves ansatze through mutation and selection based on an expressibility metric. The circuit generated by our framework consistently demonstrates high expressibility at any target depth and performs comparably to traditional ansatz design approaches. This work presents a problem-agnostic, scalable solution for ansatz design, producing expressive, low-depth circuits that need to be designed only once and can serve a wide range of applications.