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:2611.05079

Data informed Ansatz Selection for Variational Quantum Circuits

Manav Seksaria, Advith Desu, A K Prabhakar

Published Nov 3, 2026• 0 citations
arXivHTMLPDF

Abstract

Choosing a variational quantum circuit (VQC) usually means searching over ansatze and depths, and training each candidate. We give three rules that fix these choices from the data and the gate set alone, before any training. First, a circuit without entangling gates has a rank-one Fourier coefficient tensor on every subset of qubits. A singular value decomposition of a dataset's Fourier coefficients therefore indicates whether entanglement is needed, which qubits it connects, and a lower bound on the error of omitting it. Second, the rank of the quantum Fisher information matrix grows by $p_0$ per layer, after a first-layer deficit $d_0$, until it reaches a ceiling set by the dynamical Lie algebra. This law fixes the depth. Third, reading out all $2^N - 1$ Pauli-Z products from one batch of shots resolves half of the state's directions, the most any single-basis readout can. A single-qubit readout resolves an exponentially small fraction. For the Madelon dataset, the rules prescribe 7 blocks of 3 qubits at depth 3: a 239-parameter classifier with 78.5% test accuracy, found without a grid search. Ablations confirm three predicted effects: shallower circuits, smaller blocks and dropping reuploading all lower accuracy.

DOI
10.48550/arxiv.2611.05079

Related papers

Parameter Efficiency of Variational Quantum Circuits in Image Classification: The Role of Circuit Depth

Pranauv Muthuraman

The practical value of quantum machine learning must be derived from efficiency rather than scale, as current NISQ processors support only small, shallow circuits. This paper evaluated whether variational quantum circuits (VQCs) can reduce the trainable parameter count in an image classification scenario while preserving accuracy. Experimentation compared quantum classifier heads to parameter-matched classical heads on an identical set of frozen features drawn from the Fashion-MNIST dataset by a CNN. 9 configurations of a quantum circuit crossed 4, 6, and 8 qubits with 1, 2, and 4 entangling layers, each matched to a multilayer perceptron with an approximately equal parameter count. The linear probes served as a floor baseline for all 105 runs across 5 random seed values. 7 out of 9 quantum-based configurations met the mean test accuracy of no more than 1 percentage point below its matched classical head, enforced by the pre-specified criterion. The 2 failures were single-layer circuits, with each falling roughly 8 points below its matched classical head and 12 points below the circuit-free linear probe; in total, 6 configs with 2+ layers passed, with the smallest at 74 trainable parameters. The general trend noticed was that accuracy increased progressively with depth. The 4-layer circuits exceeded the linear probe at every qubit count and produced the highest accuracy at 6 and 8 qubits. The simulation ran noiselessly; VQCs preserved accuracy at the matched parameter budget when depth was given, showcasing depth rather than qubit count gating performance.

•Aug 15, 2026•0 citations

Ansatz-Independent Variational Quantum Classifiers and the Price of Ansatz

Hideyuki Miyahara, Vwani Roychowdhury

The paradigm of variational quantum classifiers (VQCs) encodes classical information as quantum states, followed by quantum processing and then measurements to generate classical predictions. VQCs are promising candidates for efficient utilizations of noisy intermediate scale quantum (NISQ) devices: classifiers involving M-dimensional datasets can be implemented with only [Formula: see text] qubits by using an amplitude encoding. A general framework for designing and training VQCs, however, is lacking. An encouraging specific embodiment of VQCs, quantum circuit learning (QCL), utilizes an ansatz: a circuit with a predetermined circuit geometry and parametrized gates expressing a time-evolution unitary operator; training involves learning the gate parameters through a gradient-descent algorithm where the gradients themselves can be efficiently estimated by the quantum circuit. The representational power of QCL, however, depends strongly on the choice of the ansatz, as it limits the range of possible unitary operators that a VQC can search over. Equally importantly, the landscape of the optimization problem may have challenging properties such as barren plateaus and the associated gradient-descent algorithm may not find good local minima. Thus, it is critically important to estimate (i) the price of ansatz; that is, the gap between the performance of QCL and the performance of ansatz-independent VQCs, and (ii) the price of using quantum circuits as classical classifiers: that is, the performance gap between VQCs and equivalent classical classifiers. This paper develops a computational framework to address both these open problems. First, it shows that VQCs, including QCL, fit inside the well-known kernel method. Next it introduces a framework for efficiently designing ansatz-independent VQCs, which we call the unitary kernel method (UKM). The UKM framework enables one to estimate the first known computationally-determined bounds on both the price of ansatz and the price of any speedup advantages of VQCs: numerical results with datatsets of various dimensions, ranging from 4 to 256, show that the ansatz-induced gap can vary between 10 and 20[Formula: see text], while the VQC-induced gap (between VQC and kernel method) can vary between 10 and 16[Formula: see text]. To further understand the role of ansatz in VQCs, we also propose a method of decomposing a given unitary operator into a quantum circuit, which we call the variational circuit realization (VCR): given any parameterized circuit block (as for example, used in QCL), it finds optimal parameters and the number of layers of the circuit block required to approximate any target unitary operator with a given precision.

arXiv:2102.01759•Scientific Reports•Nov 14, 2022•19 citations

Expressibility and trainability of a two-dimensional pairwise quantum-circuit ansatz

Shuai Zhang, Wei Liu, Ji-Chong Yang

Parameterized quantum circuits~(PQCs) constitute a central building block of variational quantum algorithms~(VQAs) and quantum machine learning~(QML) methods. Existing ansatz designs often adopt hardware-agnostic or simplified 1D chain/ring entanglement patterns. However, as quantum hardware continues to develop, native 2D connectivity patterns, such as planar superconducting-qubit architectures, are becoming increasingly important. Inspired by this hardware structure, we construct a native 2D pairwise ansatz and compare its expressibility and trainability with representative 1D ansatze at identical layer depths, despite their different circuit depths. For the fixed 16-qubit system, the 2D ansatz has the smallest KL divergence at $L=1$ and $2$, and its second-order frame potential approaches the theoretical lower bound more rapidly at shallow layer counts than the frame potentials of the three 1D ansatze. We also evaluate the gradient variance of the Pauli-$Z$-string expectation value $\langle Z_0\otimes\cdots\otimes Z_{15}\rangle$ with respect to the first $R_y$ angle. For this Pauli-$Z$ string and fixed parameter, the gradient variance is smaller for the 2D circuit at $L=1$--$4$. The differences narrow at $L=5$, and the four ansatze yield statistically compatible variances at $L=6$.

quant-pharXiv:2607.12996•Jul 15, 2026•0 citations

Predictingthe Trainability of Variational Quantum Circuits: A Data-Driven Model for BarrenPlateaus

Md Habibur Rahman

Abstract Barren plateaus are the main obstacle to training quantum machine-learning models. On a barren plateau, the cost-function gradient shrinks exponentially as the circuit grows, and training stalls. Today the only reliable test is to measure it. That means sampling many gradients for every candidate circuit, which is expensive. We ask a different question. Can a classical model predict trainability from the circuit architecture alone? The architecture here means qubit count, depth, ansatz type, entanglement pattern, entangler gate, and cost-observable locality. We test this directly. We use an exact statevector simulator to build a dataset of \Nrows{} random variational circuits. For each circuit we estimate the gradient variance $\mathrm{Var}[\partial C/\partial\theta]$ from \Samples{} random parameter vectors, using the parameter-shift rule. This variance is the label. A gradient-boosted regressor then predicts $\log_{10}\mathrm{Var}$ with $R^2 = \RsqHold{}$ on held-out architectures. A classifier separates barren from trainable circuits with an area under the ROC curve of \AucHold{}. We also test transfer to larger circuits. We train only on small circuits and test on the two largest unseen sizes ($n=11,12$). The model still reaches $R^2 = \RsqExtrap{}$. Permutation importance then recovers established theory. Cost-observable locality and entanglement structure matter most. We make no quantum-advantage claim. This is classical machine learning about quantum circuits. It offers a cheap way to screen ans\"atze, and it shows which design choices cause untrainability.

•Aug 19, 2026•0 citations

Correlation-Informed Permutation of Qubits for Reducing Ansatz Depth in the Variational Quantum Eigensolver

Nikolay V. Tkachenko, James Sud, Yu Zhang +6 more

The variational quantum eigensolver (VQE) is a method of choice to solve the electronic structure problem for molecules on near-term gate-based quantum computers.However, the circuit depth is expected to grow significantly with the problem size.Increased depth can both degrade the accuracy of the results and reduce trainability.In this work, we propose an approach to reduce ansatz circuit depth.Our approach, called "PermVQE," adds an additional optimization loop to the VQE that permutes qubits in order to solve for the qubit Hamiltonian that maximally localizes correlations in the ground state.The choice of permutations is based on mutual information, which is a measure of interaction between electrons and/or holes in spin-orbitals.Encoding strongly entangled spin-orbitals into proximal qubits on a quantum chip naturally reduces the circuit depth needed to prepare the ground state.For representative molecular systems, LiH, H 2 , (H 2 ) 2 , H = 4 , H + 3 , and N 2 , we demonstrate that placing entangled qubits in close proximity leads to shallower depth circuits required to reach a given eigenvalue-eigenvector accuracy.The approach is designed for hardware-efficient ansatz of any qubit connectivity, and examples are demonstrated for linear and twodimensional grid architectures.The main ideas can also be applied to simulate molecules with other ansatz as well as variational quantum algorithms beyond the VQE.In particular, we demonstrate the beneficial effect of qubit permutations to build fermionic-adaptive derivative assembled pseudo-Trotter ansatz on a linear qubit connectivity architecture with nearly a twofold reduction of the number of controlled NOT gates.

arXiv:2009.04996•PRX Quantum•Jun 9, 2021•81 citations

Trainability and Expressivity of Hamming-Weight Preserving Quantum Circuits for Machine Learning

Léo Monbroussou, Eliott Z. Mamon, Jonas Landman +3 more

Quantum machine learning (QML) has become a promising area for real world applications of quantum computers, but near-term methods and their scalability are still important research topics. In this context, we analyze the trainability and controllability of specific Hamming weight preserving variational quantum circuits (VQCs). These circuits use qubit gates that preserve subspaces of the Hilbert space, spanned by basis states with fixed Hamming weight k . In this work, we first design and prove the feasibility of new heuristic data loaders, performing quantum amplitude encoding of (nk) -dimensional vectors by training an n -qubit quantum circuit. These data loaders are obtained using controllability arguments, by checking the Quantum Fisher Information Matrix (QFIM)'s rank. Second, we provide a theoretical justification for the fact that the rank of the QFIM of any VQC state is almost-everywhere constant, which is of separate interest. Lastly, we analyze the trainability of Hamming weight preserving circuits, and show that the variance of the l2 cost function gradient is bounded according to the dimension (nk) of the subspace. This proves conditions of existence/lack of Barren Plateaus for these circuits, and highlights a setting where a recent conjecture on the link between controllability and trainability of variational quantum circuits does not apply.

arXiv:2309.15547•Quantum•May 15, 2025•43 citations
Choosing a variational quantum circuit (VQC) usually means searching over ansatze and depths, and training each candidate. We give three rules that fix these choices from the data and the gate set alone, before any training. First, a circuit without entangling gates has a rank-one Fourier coefficient tensor on every subset of qubits. A singular value decomposition of a dataset's Fourier coefficients therefore indicates whether entanglement is needed, which qubits it connects, and a lower bound on the error of omitting it. Second, the rank of the quantum Fisher information matrix grows by p0p_0p0​ per layer, after a first-layer deficit d0d_0d0​, until it reaches a ceiling set by the dynamical Lie algebra. This law fixes the depth. Third, reading out all 2N−12^N - 12N−1 Pauli-Z products from one batch of shots resolves half of the state's directions, the most any single-basis readout can. A single-qubit readout resolves an exponentially small fraction. For the Madelon dataset, the rules prescribe 7 blocks of 3 qubits at depth 3: a 239-parameter classifier with 78.5% test accuracy, found without a grid search. Ablations confirm three predicted effects: shallower circuits, smaller blocks and dropping reuploading all lower accuracy.
The practical value of quantum machine learning must be derived from efficiency rather than scale, as current NISQ processors support only small, shallow circuits. This paper evaluated whether variational quantum circuits (VQCs) can reduce the trainable parameter count in an image classification scenario while preserving accuracy. Experimentation compared quantum classifier heads to parameter-matched classical heads on an identical set of frozen features drawn from the Fashion-MNIST dataset by a CNN. 9 configurations of a quantum circuit crossed 4, 6, and 8 qubits with 1, 2, and 4 entangling layers, each matched to a multilayer perceptron with an approximately equal parameter count. The linear probes served as a floor baseline for all 105 runs across 5 random seed values. 7 out of 9 quantum-based configurations met the mean test accuracy of no more than 1 percentage point below its matched classical head, enforced by the pre-specified criterion. The 2 failures were single-layer circuits, with each falling roughly 8 points below its matched classical head and 12 points below the circuit-free linear probe; in total, 6 configs with 2+ layers passed, with the smallest at 74 trainable parameters. The general trend noticed was that accuracy increased progressively with depth. The 4-layer circuits exceeded the linear probe at every qubit count and produced the highest accuracy at 6 and 8 qubits. The simulation ran noiselessly; VQCs preserved accuracy at the matched parameter budget when depth was given, showcasing depth rather than qubit count gating performance.
The paradigm of variational quantum classifiers (VQCs) encodes classical information as quantum states, followed by quantum processing and then measurements to generate classical predictions. VQCs are promising candidates for efficient utilizations of noisy intermediate scale quantum (NISQ) devices: classifiers involving M-dimensional datasets can be implemented with only [Formula: see text] qubits by using an amplitude encoding. A general framework for designing and training VQCs, however, is lacking. An encouraging specific embodiment of VQCs, quantum circuit learning (QCL), utilizes an ansatz: a circuit with a predetermined circuit geometry and parametrized gates expressing a time-evolution unitary operator; training involves learning the gate parameters through a gradient-descent algorithm where the gradients themselves can be efficiently estimated by the quantum circuit. The representational power of QCL, however, depends strongly on the choice of the ansatz, as it limits the range of possible unitary operators that a VQC can search over. Equally importantly, the landscape of the optimization problem may have challenging properties such as barren plateaus and the associated gradient-descent algorithm may not find good local minima. Thus, it is critically important to estimate (i) the price of ansatz; that is, the gap between the performance of QCL and the performance of ansatz-independent VQCs, and (ii) the price of using quantum circuits as classical classifiers: that is, the performance gap between VQCs and equivalent classical classifiers. This paper develops a computational framework to address both these open problems. First, it shows that VQCs, including QCL, fit inside the well-known kernel method. Next it introduces a framework for efficiently designing ansatz-independent VQCs, which we call the unitary kernel method (UKM). The UKM framework enables one to estimate the first known computationally-determined bounds on both the price of ansatz and the price of any speedup advantages of VQCs: numerical results with datatsets of various dimensions, ranging from 4 to 256, show that the ansatz-induced gap can vary between 10 and 20[Formula: see text], while the VQC-induced gap (between VQC and kernel method) can vary between 10 and 16[Formula: see text]. To further understand the role of ansatz in VQCs, we also propose a method of decomposing a given unitary operator into a quantum circuit, which we call the variational circuit realization (VCR): given any parameterized circuit block (as for example, used in QCL), it finds optimal parameters and the number of layers of the circuit block required to approximate any target unitary operator with a given precision.
Parameterized quantum circuits~(PQCs) constitute a central building block of variational quantum algorithms~(VQAs) and quantum machine learning~(QML) methods. Existing ansatz designs often adopt hardware-agnostic or simplified 1D chain/ring entanglement patterns. However, as quantum hardware continues to develop, native 2D connectivity patterns, such as planar superconducting-qubit architectures, are becoming increasingly important. Inspired by this hardware structure, we construct a native 2D pairwise ansatz and compare its expressibility and trainability with representative 1D ansatze at identical layer depths, despite their different circuit depths. For the fixed 16-qubit system, the 2D ansatz has the smallest KL divergence at L=1L=1L=1 and 222, and its second-order frame potential approaches the theoretical lower bound more rapidly at shallow layer counts than the frame potentials of the three 1D ansatze. We also evaluate the gradient variance of the Pauli-ZZZ-string expectation value ⟨Z0⊗⋯⊗Z15⟩\langle Z_0\otimes\cdots\otimes Z_{15}\rangle⟨Z0​⊗⋯⊗Z15​⟩ with respect to the first RyR_yRy​ angle. For this Pauli-ZZZ string and fixed parameter, the gradient variance is smaller for the 2D circuit at L=1L=1L=1--444. The differences narrow at L=5L=5L=5, and the four ansatze yield statistically compatible variances at L=6L=6L=6.
Abstract Barren plateaus are the main obstacle to training quantum machine-learning models. On a barren plateau, the cost-function gradient shrinks exponentially as the circuit grows, and training stalls. Today the only reliable test is to measure it. That means sampling many gradients for every candidate circuit, which is expensive. We ask a different question. Can a classical model predict trainability from the circuit architecture alone? The architecture here means qubit count, depth, ansatz type, entanglement pattern, entangler gate, and cost-observable locality. We test this directly. We use an exact statevector simulator to build a dataset of \Nrows{} random variational circuits. For each circuit we estimate the gradient variance Var[∂C/∂θ]\mathrm{Var}[\partial C/\partial\theta]Var[∂C/∂θ] from \Samples{} random parameter vectors, using the parameter-shift rule. This variance is the label. A gradient-boosted regressor then predicts log⁡10Var\log_{10}\mathrm{Var}log10​Var with $R^2 = \RsqHold{}$ on held-out architectures. A classifier separates barren from trainable circuits with an area under the ROC curve of \AucHold{}. We also test transfer to larger circuits. We train only on small circuits and test on the two largest unseen sizes (n=11,12n=11,12n=11,12). The model still reaches $R^2 = \RsqExtrap{}$. Permutation importance then recovers established theory. Cost-observable locality and entanglement structure matter most. We make no quantum-advantage claim. This is classical machine learning about quantum circuits. It offers a cheap way to screen ans\"atze, and it shows which design choices cause untrainability.
The variational quantum eigensolver (VQE) is a method of choice to solve the electronic structure problem for molecules on near-term gate-based quantum computers.However, the circuit depth is expected to grow significantly with the problem size.Increased depth can both degrade the accuracy of the results and reduce trainability.In this work, we propose an approach to reduce ansatz circuit depth.Our approach, called "PermVQE," adds an additional optimization loop to the VQE that permutes qubits in order to solve for the qubit Hamiltonian that maximally localizes correlations in the ground state.The choice of permutations is based on mutual information, which is a measure of interaction between electrons and/or holes in spin-orbitals.Encoding strongly entangled spin-orbitals into proximal qubits on a quantum chip naturally reduces the circuit depth needed to prepare the ground state.For representative molecular systems, LiH, H 2 , (H 2 ) 2 , H = 4 , H + 3 , and N 2 , we demonstrate that placing entangled qubits in close proximity leads to shallower depth circuits required to reach a given eigenvalue-eigenvector accuracy.The approach is designed for hardware-efficient ansatz of any qubit connectivity, and examples are demonstrated for linear and twodimensional grid architectures.The main ideas can also be applied to simulate molecules with other ansatz as well as variational quantum algorithms beyond the VQE.In particular, we demonstrate the beneficial effect of qubit permutations to build fermionic-adaptive derivative assembled pseudo-Trotter ansatz on a linear qubit connectivity architecture with nearly a twofold reduction of the number of controlled NOT gates.
Quantum machine learning (QML) has become a promising area for real world applications of quantum computers, but near-term methods and their scalability are still important research topics. In this context, we analyze the trainability and controllability of specific Hamming weight preserving variational quantum circuits (VQCs). These circuits use qubit gates that preserve subspaces of the Hilbert space, spanned by basis states with fixed Hamming weight k . In this work, we first design and prove the feasibility of new heuristic data loaders, performing quantum amplitude encoding of (nk) -dimensional vectors by training an n -qubit quantum circuit. These data loaders are obtained using controllability arguments, by checking the Quantum Fisher Information Matrix (QFIM)'s rank. Second, we provide a theoretical justification for the fact that the rank of the QFIM of any VQC state is almost-everywhere constant, which is of separate interest. Lastly, we analyze the trainability of Hamming weight preserving circuits, and show that the variance of the l2 cost function gradient is bounded according to the dimension (nk) of the subspace. This proves conditions of existence/lack of Barren Plateaus for these circuits, and highlights a setting where a recent conjecture on the link between controllability and trainability of variational quantum circuits does not apply.