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

A four-player potential game for barren-plateau-aware quantum ansatz design

Rubén Darío Guerrero

quant-phcs.MASubmitted Apr 23, 2026• Announced Apr 24, 2026• 0 citations
arXivHTMLPDF

Abstract

We cast the design of parameterized quantum circuits as a four-player potential game whose state is a circuit directed acyclic graph (DAG) and whose players encode trainability, non-stabilizerness, task performance, and hardware cost. Per-player restricted action sets factorize the move space into append, remove, retype, and rewire operations; a block-coordinate $\varepsilon$-Nash residual $δ_\text{Nash}$ certifies that no single player can improve unilaterally. A single weight sweep on MaxCut $K_4$ traces a Pareto frontier from a Clifford endpoint $(M_2/n,\langle H\rangle)=(0,4.00)$ to a non-Clifford endpoint $(0.48,3.30)$. On three four-qubit hardware topologies (heavy-hex, $2\times 2$ grid, Rydberg all-to-all), Nash search achieves the highest mean potential; on the $2\times 2$ grid Nash reaches the theoretical ceiling $Φ_\text{max}=4.10$ on two of five seeds while the simulated-annealing baseline does so on one; paired Wilcoxon tests over five seeds cannot reject the null on any single topology ($p\ge 0.22$). On LiH/STO-3G, seeding Nash from a 58-gate Givens-doubles ansatz produces a 48-operation, depth-25 circuit retaining $97.7\%$ of the correlation energy while simultaneously reducing gate count, increasing non-stabilizerness, and controlling trainability. The framework is complementary to energy-only searches such as ADAPT-VQE and k-UpCCGSD, which reach chemical accuracy with fewer operations but do not optimize the other three axes.

Comments
8 pages, 4 figures

Related papers

Game, Set, Quantum: Parameterized Quantum Circuit for Correlated Equilibrium in Bayesian Games

Param Pathak, Vidhi Oad, Nouhaila Innan +2 more

Strategic decision-making among many agents under incomplete information is central to economics, security, and multi-agent artificial intelligence (AI). Computing equilibria in such settings is challenging because the joint type-action space grows exponentially with the number of players. In binary-type, binary-action Bayesian games with $n$ players, an explicit representation over type-action profiles requires $O(2^{2n})$ entries, making direct linear-programming (LP) formulations increasingly costly as $n$ grows. We propose a hybrid quantum-classical framework for approximating Bayes correlated equilibrium (BCE) using a parameterized quantum circuit (PQC). The PQC represents the conditional distribution over joint actions using $O(nL)$ trainable parameters, where $L$ denotes the circuit depth; for the largest trained setting, $n=8$ and $L=2$, this corresponds to $48$ trainable angles. Each player count is trained independently by maximizing expected social welfare with a penalty on positive aggregated BCE obedience violations. On a strategically coupled Bayesian congestion game with $n=2,4,6,8$ players, feasible PQC solutions attain higher welfare than MCCFR and DCFR product-strategy baselines while satisfying $ε_{\max}\leq10^{-3}$, where $ε_{\max}$ denotes the maximum positive aggregated BCE obedience violation. Across five independent runs per setting, all runs are feasible for $n=2,4,6$, while four of five are feasible for $n=8$. PQC welfare remains below the exact LP optimum, with the absolute gap increasing with $n$, while classical state-vector simulation prevents PQC training beyond eight players. These results demonstrate the use of a compact PQC parameterization for approximate equilibrium computation and quantify its welfare, feasibility, and classical simulation scaling on the studied benchmark.

quant-pharXiv:2606.03109•Jun 3, 2026•0 citations

How to find expressible and trainable parameterized quantum circuits?

Peter Röseler, Dennis Willsch, Kristel Michielsen

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 \times$ fewer parameters, and for VQE on $\mathrm{H}_2$ we achieve UCCSD-like accuracy at substantially reduced circuit complexity.

quant-pharXiv:2603.14451•Mar 17, 2026•7 citations

Trainability-Aware Quantum Gate Pruning for Variational Quantum Circuits Using Saliency and Quantum Fisher Information

M Vedhanth, S Mahadevi, Anil G Kumar

Variational quantum circuits (VQCs) suffer from barren plateaus, where gradients vanish exponentially with system size, limiting effective optimization. While prior mitigation strategies focus on circuit design and initialization, the effect of circuit compression – specifically, which gates are removed – on trainability remains comparatively unexplored. In this work we study quantum gate pruning from a trainability perspective in a controlled, noiseless 6-qubit simulation testbed, and report numerical evidence that gate-selection criterion plays a substantial role in preserving the optimization landscape of compressed circuits. We propose Q-AGASP, a saliency-based pruning framework that ranks parameterized quantum gates using a combination of gradient-weight sensitivity and quantum activation, and introduce a Quantum Fisher Information (QFI)-motivated saliency variant that targets parameters associated with low gradient variance. Both approaches are applied through an iterative pruning schedule with frozen weights. Experiments on a hybrid quantum-classical model (6-qubit, 144-parameter VQC) show that saliency-guided pruning improves the gradient variance of the surviving parameters relative to uninformed methods – by 6–9 $\times $ at 90% gate sparsity in our tested regime – while random or magnitude-based pruning can produce near-zero gradient variance in some seeds. We further find that post-fine-tuning accuracy converges across methods under our 15-epoch fine-tuning budget, which suggests that accuracy and pre-fine-tuning gradient variance are complementary rather than interchangeable diagnostics, with accuracy becoming less discriminative precisely when the fine-tuning budget is generous relative to circuit size. To analyze how gate rankings evolve during compression we introduce saliency drift, a Spearman-rank-correlation-based metric, and derive a distribution-free bound relating the observed correlation to the magnitude of ranking reshuffles; drift increases with sparsity in our experiments, consistent with iterative recomputation capturing structural changes not visible to one-shot pruning. We are explicit that these findings are numerical observations from a single ansatz, qubit count, and dataset rather than architecture-independent theorems, and we discuss how ansatz topology, entanglement structure, and circuit depth would be expected to modulate them, together with the changes needed to extend the framework to noisy hardware and to chemistry-motivated ansätze.

IEEE Access•Jan 1, 2026•0 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

Gradient usability in few-qubit quantum Neural Networks: A signal-to-noise ratio framework for evaluating mitigation strategies

Brandon Shen, Karena Ling

The barren-plateau problem—the exponential flattening of optimization landscapes—severely limits the trainability of quantum neural networks (QNNs) on near-term hardware. This review examines ansatz-design and complementary mitigation strategies for few-qubit QNNs under finite-shot noisy intermediate-scale quantum (NISQ) constraints. Its primary conceptual contribution is a literature-grounded reframing of gradient-based trainability around pointwise finite-shot gradient signal-to-noise ratio (SNR) while retaining exact-gradient landscape variance as a complementary theoretical diagnostic. This reframing follows because gradient-based optimization acts on finite-shot gradient estimates whose statistical resolvability directly determines whether the optimizer receives a reliably distinguishable update signal, whereas numerical studies restricted to 2–10 qubits generally cannot establish asymptotic exponential or polynomial gradient-decay laws without theoretical support. Estimator SNR therefore addresses the immediate experimental question of whether the update signal is distinguishable from its sampling uncertainty, whereas exact-gradient variance characterizes landscape concentration. The review surveys ansatz design, parameter initialization, cost-function selection, and error management, and develops a conditional design heuristic: problem-inspired ansätze are preferred when the task maps onto circuit families with demonstrated trainability properties; otherwise, shallow hardware-efficient ansätze provide controlled baselines. As a secondary contribution, the review proposes a complete eight-configuration 2 3 factorial framework for evaluating interactions among restricted entanglement, local cost functions, and active residual shortcuts under matched measurement budgets. An exact identity motivates testing the interaction between restricted entanglement and local costs at the exact-gradient-signal level, but the interaction is tested two-sided; all estimator-SNR interactions remain open empirical questions. The framework is presented as an implementable research agenda enabled by the SNR perspective rather than as evidence that any interaction has been established.

Journal of High School Science•Aug 1, 2026•0 citations

Taming Barren Plateaus in Arbitrary Parameterized Quantum Circuits without Sacrificing Expressibility

Zhenyu Chen, Yuguo Shao, Zhengwei Liu +1 more

Quantum algorithms based on parameterized quantum circuits (PQCs) have enabled a wide range of applications on near-term quantum devices. However, existing PQC architectures face several challenges, among which the ``barren plateaus" phenomenon is particularly prominent. In such cases, the loss function concentrates exponentially with increasing system size, thereby hindering effective parameter optimization. To address this challenge, we propose a general and hardware-efficient method for eliminating barren plateaus in an arbitrary PQC. Specifically, our approach achieves this by inserting a layer of easily implementable quantum channels into the original PQC, each channel requiring only one ancilla qubit and four additional gates, yielding a modified PQC (MPQC) that is provably at least as expressive as the original PQC and, under mild assumptions, is guaranteed to be free from barren plateaus. Furthermore, by appropriately adjusting the structure of MPQCs, we rigorously prove that any parameter in the original PQC can be made trainable. Importantly, the absence of barren plateaus in MPQCs is robust against realistic noise, making our approach directly applicable to near-term quantum hardware. Numerical simulations demonstrate that MPQC effectively eliminates barren plateaus in PQCs for preparing thermal states of systems with up to 100 qubits and 2400 layers. Furthermore, in end-to-end simulations, MPQC significantly outperforms PQC in finding the ground-state energy of a complex Hamiltonian.

quant-pharXiv:2511.13408•Nov 18, 2025•4 citations
We cast the design of parameterized quantum circuits as a four-player potential game whose state is a circuit directed acyclic graph (DAG) and whose players encode trainability, non-stabilizerness, task performance, and hardware cost. Per-player restricted action sets factorize the move space into append, remove, retype, and rewire operations; a block-coordinate ε\varepsilonε-Nash residual δNashδ_\text{Nash}δNash​ certifies that no single player can improve unilaterally. A single weight sweep on MaxCut K4K_4K4​ traces a Pareto frontier from a Clifford endpoint (M2/n,⟨H⟩)=(0,4.00)(M_2/n,\langle H\rangle)=(0,4.00)(M2​/n,⟨H⟩)=(0,4.00) to a non-Clifford endpoint (0.48,3.30)(0.48,3.30)(0.48,3.30). On three four-qubit hardware topologies (heavy-hex, 2×22\times 22×2 grid, Rydberg all-to-all), Nash search achieves the highest mean potential; on the 2×22\times 22×2 grid Nash reaches the theoretical ceiling Φmax=4.10Φ_\text{max}=4.10Φmax​=4.10 on two of five seeds while the simulated-annealing baseline does so on one; paired Wilcoxon tests over five seeds cannot reject the null on any single topology (p≥0.22p\ge 0.22p≥0.22). On LiH/STO-3G, seeding Nash from a 58-gate Givens-doubles ansatz produces a 48-operation, depth-25 circuit retaining 97.7%97.7\%97.7% of the correlation energy while simultaneously reducing gate count, increasing non-stabilizerness, and controlling trainability. The framework is complementary to energy-only searches such as ADAPT-VQE and k-UpCCGSD, which reach chemical accuracy with fewer operations but do not optimize the other three axes.
Strategic decision-making among many agents under incomplete information is central to economics, security, and multi-agent artificial intelligence (AI). Computing equilibria in such settings is challenging because the joint type-action space grows exponentially with the number of players. In binary-type, binary-action Bayesian games with nnn players, an explicit representation over type-action profiles requires O(22n)O(2^{2n})O(22n) entries, making direct linear-programming (LP) formulations increasingly costly as nnn grows. We propose a hybrid quantum-classical framework for approximating Bayes correlated equilibrium (BCE) using a parameterized quantum circuit (PQC). The PQC represents the conditional distribution over joint actions using O(nL)O(nL)O(nL) trainable parameters, where LLL denotes the circuit depth; for the largest trained setting, n=8n=8n=8 and L=2L=2L=2, this corresponds to 484848 trainable angles. Each player count is trained independently by maximizing expected social welfare with a penalty on positive aggregated BCE obedience violations. On a strategically coupled Bayesian congestion game with n=2,4,6,8n=2,4,6,8n=2,4,6,8 players, feasible PQC solutions attain higher welfare than MCCFR and DCFR product-strategy baselines while satisfying εmax⁡≤10−3ε_{\max}\leq10^{-3}εmax​≤10−3, where εmax⁡ε_{\max}εmax​ denotes the maximum positive aggregated BCE obedience violation. Across five independent runs per setting, all runs are feasible for n=2,4,6n=2,4,6n=2,4,6, while four of five are feasible for n=8n=8n=8. PQC welfare remains below the exact LP optimum, with the absolute gap increasing with nnn, while classical state-vector simulation prevents PQC training beyond eight players. These results demonstrate the use of a compact PQC parameterization for approximate equilibrium computation and quantify its welfare, feasibility, and classical simulation scaling on the studied benchmark.
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×6 \times6× fewer parameters, and for VQE on H2\mathrm{H}_2H2​ we achieve UCCSD-like accuracy at substantially reduced circuit complexity.
Variational quantum circuits (VQCs) suffer from barren plateaus, where gradients vanish exponentially with system size, limiting effective optimization. While prior mitigation strategies focus on circuit design and initialization, the effect of circuit compression – specifically, which gates are removed – on trainability remains comparatively unexplored. In this work we study quantum gate pruning from a trainability perspective in a controlled, noiseless 6-qubit simulation testbed, and report numerical evidence that gate-selection criterion plays a substantial role in preserving the optimization landscape of compressed circuits. We propose Q-AGASP, a saliency-based pruning framework that ranks parameterized quantum gates using a combination of gradient-weight sensitivity and quantum activation, and introduce a Quantum Fisher Information (QFI)-motivated saliency variant that targets parameters associated with low gradient variance. Both approaches are applied through an iterative pruning schedule with frozen weights. Experiments on a hybrid quantum-classical model (6-qubit, 144-parameter VQC) show that saliency-guided pruning improves the gradient variance of the surviving parameters relative to uninformed methods – by 6–9 $\times $ at 90% gate sparsity in our tested regime – while random or magnitude-based pruning can produce near-zero gradient variance in some seeds. We further find that post-fine-tuning accuracy converges across methods under our 15-epoch fine-tuning budget, which suggests that accuracy and pre-fine-tuning gradient variance are complementary rather than interchangeable diagnostics, with accuracy becoming less discriminative precisely when the fine-tuning budget is generous relative to circuit size. To analyze how gate rankings evolve during compression we introduce saliency drift, a Spearman-rank-correlation-based metric, and derive a distribution-free bound relating the observed correlation to the magnitude of ranking reshuffles; drift increases with sparsity in our experiments, consistent with iterative recomputation capturing structural changes not visible to one-shot pruning. We are explicit that these findings are numerical observations from a single ansatz, qubit count, and dataset rather than architecture-independent theorems, and we discuss how ansatz topology, entanglement structure, and circuit depth would be expected to modulate them, together with the changes needed to extend the framework to noisy hardware and to chemistry-motivated ansätze.
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.
The barren-plateau problem—the exponential flattening of optimization landscapes—severely limits the trainability of quantum neural networks (QNNs) on near-term hardware. This review examines ansatz-design and complementary mitigation strategies for few-qubit QNNs under finite-shot noisy intermediate-scale quantum (NISQ) constraints. Its primary conceptual contribution is a literature-grounded reframing of gradient-based trainability around pointwise finite-shot gradient signal-to-noise ratio (SNR) while retaining exact-gradient landscape variance as a complementary theoretical diagnostic. This reframing follows because gradient-based optimization acts on finite-shot gradient estimates whose statistical resolvability directly determines whether the optimizer receives a reliably distinguishable update signal, whereas numerical studies restricted to 2–10 qubits generally cannot establish asymptotic exponential or polynomial gradient-decay laws without theoretical support. Estimator SNR therefore addresses the immediate experimental question of whether the update signal is distinguishable from its sampling uncertainty, whereas exact-gradient variance characterizes landscape concentration. The review surveys ansatz design, parameter initialization, cost-function selection, and error management, and develops a conditional design heuristic: problem-inspired ansätze are preferred when the task maps onto circuit families with demonstrated trainability properties; otherwise, shallow hardware-efficient ansätze provide controlled baselines. As a secondary contribution, the review proposes a complete eight-configuration 2 3 factorial framework for evaluating interactions among restricted entanglement, local cost functions, and active residual shortcuts under matched measurement budgets. An exact identity motivates testing the interaction between restricted entanglement and local costs at the exact-gradient-signal level, but the interaction is tested two-sided; all estimator-SNR interactions remain open empirical questions. The framework is presented as an implementable research agenda enabled by the SNR perspective rather than as evidence that any interaction has been established.
Quantum algorithms based on parameterized quantum circuits (PQCs) have enabled a wide range of applications on near-term quantum devices. However, existing PQC architectures face several challenges, among which the ``barren plateaus" phenomenon is particularly prominent. In such cases, the loss function concentrates exponentially with increasing system size, thereby hindering effective parameter optimization. To address this challenge, we propose a general and hardware-efficient method for eliminating barren plateaus in an arbitrary PQC. Specifically, our approach achieves this by inserting a layer of easily implementable quantum channels into the original PQC, each channel requiring only one ancilla qubit and four additional gates, yielding a modified PQC (MPQC) that is provably at least as expressive as the original PQC and, under mild assumptions, is guaranteed to be free from barren plateaus. Furthermore, by appropriately adjusting the structure of MPQCs, we rigorously prove that any parameter in the original PQC can be made trainable. Importantly, the absence of barren plateaus in MPQCs is robust against realistic noise, making our approach directly applicable to near-term quantum hardware. Numerical simulations demonstrate that MPQC effectively eliminates barren plateaus in PQCs for preparing thermal states of systems with up to 100 qubits and 2400 layers. Furthermore, in end-to-end simulations, MPQC significantly outperforms PQC in finding the ground-state energy of a complex Hamiltonian.