Parameterized Quantum Circuits have emerged as a central framework for variational quantum algorithms in the NISQ regime, with major applications in quantum simulation, combinatorial optimization, and, more recently, quantum machine learning (QML). By developing a new approach for computing dynamical Lie algebras associated with quantum circuits combining parametrized gates and non-parametrized entangling gates, we aim to extend the applicability of recent algebraic results to architectures that are actually used in quantum machine learning.
AI Summary
The paper addresses how to define and compute dynamical Lie algebras (DLAs) for variational circuits that alternate trainable gates with a repeated fixed entangling block $U$. Fixed gates cannot be treated as continuously available generators, but they modify trainable directions through conjugation.
Rewriting a depth-$L$ circuit factors out $U^L$ and produces the effective generator set $\mathcal G_L=\bigcup_{j=0}^{L-1}\operatorname{Ad}_U^j(\mathcal G_0)$, with $\operatorname{Ad}_U(H)=U^\dagger HU$. Its Lie closure defines a nested sequence of depth-dependent DLAs. For Clifford $U$ and Pauli generators, the conjugation orbits are finite modulo phase. Representing conjugation by a binary symplectic matrix $M_U$ gives the bound $L_{\mathrm{Lie}}\leq\operatorname{ord}(M_U)$ on Lie-algebra saturation depth, distinct from the depth needed for overparameterization.
For local $R_Y$ rotations followed by an ordered CNOT ring, the binary action reduces to an $n\times n$ matrix with minimal and characteristic polynomial $(x+1)^n+x$. Factoring this square-free polynomial determines exact conjugation periods through multiplicative orders over finite fields. For $n=2,\ldots,8$, the periods are $3,7,15,21,21,127,63$. Computations find $\mathfrak g_n=\mathfrak{so}(2^n)$ and saturation depth four when $3\mid n$, otherwise two; these patterns remain unproved for general $n$.
The framework assumes identical fixed blocks and independently parameterized repeated trainable blocks; the finite-orbit analysis requires Clifford blocks and Pauli generators. Non-Clifford extensions are left open. Overparameterization and barren-plateau implications are discussed conditionally, rather than established as finite-depth performance results.
Little sign of AI-generated textIncrementalUnclear noveltyPossible error
Error found: The n=3 conjugation orbit incorrectly states Y2 X3 → Y1 X2 Z3; direct conjugation gives Y2 X3 → Z1 Y2 Z3.
The general-n overparameterization depth bound is presented unconditionally even though its assumed DLA dimension is established only numerically through n=8 and conjectured for larger n.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Comments
24 pages, accepted as a poster at the QTML Conference
Parameterized Quantum Circuits have emerged as a central framework for variational quantum algorithms in the NISQ regime, with major applications in quantum simulation, combinatorial optimization, and, more recently, quantum machine learning (QML). By developing a new approach for computing dynamical Lie algebras associated with quantum circuits combining parametrized gates and non-parametrized entangling gates, we aim to extend the applicability of recent algebraic results to architectures that are actually used in quantum machine learning.
The paper addresses how to define and compute dynamical Lie algebras (DLAs) for variational circuits that alternate trainable gates with a repeated fixed entangling block U. Fixed gates cannot be treated as continuously available generators, but they modify trainable directions through conjugation.
Rewriting a depth-L circuit factors out UL and produces the effective generator set GL=⋃j=0L−1AdUj(G0), with AdU(H)=U†HU. Its Lie closure defines a nested sequence of depth-dependent DLAs. For Clifford U and Pauli generators, the conjugation orbits are finite modulo phase. Representing conjugation by a binary symplectic matrix MU gives the bound LLie≤ord(MU) on Lie-algebra saturation depth, distinct from the depth needed for overparameterization.
For local RY rotations followed by an ordered CNOT ring, the binary action reduces to an n×n matrix with minimal and characteristic polynomial (x+1)n+x. Factoring this square-free polynomial determines exact conjugation periods through multiplicative orders over finite fields. For n=2,…,8, the periods are 3,7,15,21,21,127,63. Computations find gn=so(2n) and saturation depth four when 3∣n, otherwise two; these patterns remain unproved for general n.
The framework assumes identical fixed blocks and independently parameterized repeated trainable blocks; the finite-orbit analysis requires Clifford blocks and Pauli generators. Non-Clifford extensions are left open. Overparameterization and barren-plateau implications are discussed conditionally, rather than established as finite-depth performance results.
In the current noisy intermediate-scale quantum (NISQ)era, quantum machine learning is emerging as a dominant paradigm to program gate-based quantum computers. In quantum machine learning, the gates of a quantum circuit are parameterized, and the parameters are tuned via classical optimization based on data and on measurements of the outputs of the circuit. Parameterized quantum circuits (PQCs) can efficiently address combinatorial optimization problems, implement probabilistic generative models, and carry out inference (classification and regression). This monograph provides a self-contained introduction to quantum machine learning for an audience of engineers with a back groundin probability and linear algebra. It first describes the necessary background, concepts, and tools necessary to describe quantum operations and measurements. Then,it covers parameterized quantum circuits, the variation alquantum eigensolver, as well as unsupervised and supervised quantum machine learning formulations.
Parameterized quantum circuits (PQCs) are pivotal components of variational quantum algorithms (VQAs), which represent a promising pathway to quantum advantage in noisy intermediate-scale quantum (NISQ) devices. PQCs enable flexible encoding of quantum information through tunable quantum gates and have been successfully applied across domains such as quantum chemistry, combinatorial optimization, and quantum machine learning. Despite their potential, PQC performance on NISQ hardware is hindered by noise, decoherence, and the presence of barren plateaus, which can impede gradient-based optimization. To address these limitations, we propose novel methods for improving gradient-free optimizers Rotosolve, Fraxis, and FQS, incorporating information from previous parameter iterations. Our approach conserves computational resources by reallocating optimization efforts toward poorly optimized gates, leading to improved convergence. The experimental results demonstrate that our techniques consistently improve the performance of various optimizers, contributing to more robust and efficient PQC optimization.
Parameterized quantum circuits (PQCs) play an essential role in the application of variational quantum algorithms (VQAs) in noisy intermediate-scale quantum (NISQ) devices. The PQCs are a leading candidate to achieve a quantum advantage in NISQ devices and have already been applied in various domains such as quantum chemistry, quantum machine learning, combinatorial optimization, and many others. There is no single definitive way to optimize PQCs. The most commonly used methods are based on computing the gradient via the parameter-shift rule to use classical gradient descent (GD) optimizers like Adam, stochastic GD, and others. In addition, sequential single-qubit optimizers have been proposed, such as Rotosolve, Free-Axis Selection (Fraxis), Free-Quaternion Selection (FQS), and hybrid algorithms from the aforementioned optimizers. We further develop hybrid algorithms than those represented in the previous work by drawing inspiration from the early stopping method used in classical machine learning. The switch between the optimizers depends on the previous cost function values compared to the previous ones. We introduce two new hybrid algorithms that are more robust and scalable, and they outperform previous hybrid methods in terms of convergence towards the global minima across various cost functions. In addition, we find that they are feasible for NISQ devices with different noise profiles.
This monograph is motivated by a number of recent developments that appear to define a possible new role for researchers with an engineering profile. First, there are now several software libraries – such as IBM’s Qiskit, Google’s Cirq, and Xanadu’s PennyLane – that make programming quantum algorithms more accessible, while also providing cloud-based access to actual quantum computers. Second, a new framework is emerging for programming quantum algorithms to be run on current quantum hardware: quantum machine learning. In the current noisy intermediate-scale quantum (NISQ) era, quantum machine learning is emerging as a dominant paradigm to program gate-based quantum computers. In quantum machine learning, the gates of a quantum circuit are parametrized, and the parameters are tuned via classical optimization based on data and on measurements of the outputs of the circuit. Parametrized quantum circuits (PQCs) can efficiently address combinatorial optimization problems, implement probabilistic generative models, and carry out inference (classification and regression). This monograph provides a self-contained introduction to quantum machine learning for an audience of engineers with a background in probability and linear algebra. It first describes the background, concepts, and tools necessary to describe quantum operations and measurements. Then, it covers parametrized quantum circuits, the variational quantum eigensolver, as well as unsupervised and supervised quantum machine learning formulations.
Variational Quantum Circuits (VQCs) have emerged as a cornerstone of hybrid quantum–classical algorithms designed to harness the computational potential of near-term quantum devices. By combining parameterized quantum gates with classical optimization, VQCs provide a flexible framework for tackling machine learning, chemistry, and optimization problems intractable for classical methods. This review comprehensively overviews VQC design principles, ansatz structures, optimization strategies, and real-world applications. Furthermore, we discuss fundamental challenges such as barren plateaus, the expressibility–trainability trade-off, and current noisy intermediate-scale quantum (NISQ) hardware limitations. Finally, we highlight emerging directions that could enable scalable, noise-resilient, and physically interpretable variational quantum models for future quantum computing applications
Current experimental quantum computing devices are limited by noise, mainly originating from entangling gates. If an efficient gate sequence for an operation is unknown, one often employs layered parameterized quantum circuits, especially hardware-efficient ansätze, with fixed entangling layer structures. We demonstrate a reinforcement learning algorithm to improve on these by optimizing the entangling gate sequence in the task of quantum state preparation. This allows us to restrict the required number of CNOT gates while taking the qubit connectivity architecture into account. Recent advancements using reinforcement learning have already demonstrated the power of this technique when optimizing the circuit for a sequence of non-parameterized gates. We extend this approach to parameterized gate sets by incorporating general single-qubit unitaries, thus allowing us to consistently reach higher state preparation fidelities at the same number of CNOT gates compared to a hardware-efficient ansatz.