We characterize the geometric and algebraic conditions governing noise-induced landscape regularization in Recurrent Quantum Circuits (Q-RNNs). In quantum recurrent models training on sequence parity (temporal XOR), gradient optimization typically encounters a severe topological trap (the parity plateau at accuracy ≈ 0.72–0.75). While physical environmental noise is conventionally viewed as detrimental to quantum information, we provide empirical evidence that the primary boundary separating regularizing and non-regularizing open-system channels is unitality. Specifically: 1. Unital Channels (e.g., Pauli depolarizing, phase-flip, bit-flip, and phase damping) contract the Bloch sphere symmetrically, preserving the loss landscape's up/down parity symmetry and enabling optimizers to escape the topological traps. 2. Non-Unital Channels (e.g., amplitude damping) shift the center of the Bloch sphere; large non-unital origin drift severely disrupts the optimization landscape by breaking the loss landscape's up/down parity symmetry. 3. We map this boundary empirically by conducting a Generalized Amplitude Damping (GAD) sweep over the thermal parameter [0.0, 1.0] across varying damping rates \0.25, 0.35, 0.50, 0.75\ (Sweep 1), and a state-initialization asymmetry sweep (Sweep 2). We show that convergence is restored within a near-unital basin (e.g., [0.42, 0.56] at =0.50). We show that the slight asymmetry of this basin (which is invariant to the initial state of the memory qubit) is consistent with a structural loop asymmetry caused by the recurrent input qubit reset to |0. We also map the parametric scaling of this basin, showing that the critical displacement boundary |v_z, crit| shrinks as increases due to the rapid contraction of the available state space volume. 4. We characterize the fine-grained transition of the bit-flip channel, revealing a sharp degeneracy hole at exactly p=0.50 where the Bloch sphere contracts to a 1D line. 5. We characterize an empirical optimizer-class robustness pattern at this finite experimental depth (2-qubit, T=3): normalized direction-preserving optimizers (Adam, signSGD, Muon, Normalized GD) achieve 6/6 convergence under unital noise, whereas non-normalized gradient descent (SGD, Heavy Ball) fails (2/6) due to recurrent gradient magnitude contraction. We discuss the analogy between this regularization structure and Quantum Error Correction (QEC), noting that the symmetries protecting parity in stabilizer codes appear to play a parallel role in protecting parity classification landscapes under unital noise. All results are from 2-qubit Q-RNN simulations on T=3 parity; generalization to larger circuits and longer sequences is a target for future work.
We characterize the geometric and algebraic conditions governing noise-induced landscape regularization in Recurrent Quantum Circuits (Q-RNNs). In quantum recurrent models training on sequence parity (temporal XOR), gradient optimization typically encounters a severe topological trap (the parity plateau at accuracy ≈ 0.72–0.75). While physical environmental noise is conventionally viewed as detrimental to quantum information, we provide empirical evidence that the primary boundary separating regularizing and non-regularizing open-system channels is unitality. Specifically: 1. Unital Channels (e.g., Pauli depolarizing, phase-flip, bit-flip, and phase damping) contract the Bloch sphere symmetrically, preserving the loss landscape's up/down parity symmetry and enabling optimizers to escape the topological traps. 2. Non-Unital Channels (e.g., amplitude damping) shift the center of the Bloch sphere; large non-unital origin drift severely disrupts the optimization landscape by breaking the loss landscape's up/down parity symmetry. 3. We map this boundary empirically by conducting a Generalized Amplitude Damping (GAD) sweep over the thermal parameter [0.0, 1.0] across varying damping rates \0.25, 0.35, 0.50, 0.75\ (Sweep 1), and a state-initialization asymmetry sweep (Sweep 2). We show that convergence is restored within a near-unital basin (e.g., [0.42, 0.56] at =0.50). We show that the slight asymmetry of this basin (which is invariant to the initial state of the memory qubit) is consistent with a structural loop asymmetry caused by the recurrent input qubit reset to |0. We also map the parametric scaling of this basin, showing that the critical displacement boundary |v_z, crit| shrinks as increases due to the rapid contraction of the available state space volume. 4. We characterize the fine-grained transition of the bit-flip channel, revealing a sharp degeneracy hole at exactly p=0.50 where the Bloch sphere contracts to a 1D line. 5. We characterize an empirical optimizer-class robustness pattern at this finite experimental depth (2-qubit, T=3): normalized direction-preserving optimizers (Adam, signSGD, Muon, Normalized GD) achieve 6/6 convergence under unital noise, whereas non-normalized gradient descent (SGD, Heavy Ball) fails (2/6) due to recurrent gradient magnitude contraction. We discuss the analogy between this regularization structure and Quantum Error Correction (QEC), noting that the symmetries protecting parity in stabilizer codes appear to play a parallel role in protecting parity classification landscapes under unital noise. All results are from 2-qubit Q-RNN simulations on T=3 parity; generalization to larger circuits and longer sequences is a target for future work.
We revisit an established Quantum Control objective, characterize its exact local metric geometry, and reposition it as a rigorous benchmark for Search and Optimization. The trap-free topology of the landscape, established two decades ago, guarantees unhindered optimal pathways, but global topology alone does not govern convergence speed. Although the so-called Quantum Sphere is defined by the fourth power of the control field, we show that its yield gap admits an exact representation as a nonnegative linear combination of sin2 terms. From this single identity, we derive a two-sided quadratic sandwich with ratio 4/π2 on a certified, worst-case quarter-wave region, proving the optimal peak nondegenerate modulo its affine gauge and well-conditioned. For white-box optimization, on a halved (eighth-wave) region, the objective satisfies a Polyak-Łojasiewicz inequality with an explicit constant, granting Gradient Descent a linear rate of 1−16/(π4κr), where κr is the condition number of the relevant Hessian block. For black-box optimization, we prove that the elitist single-parent Evolution Strategy converges linearly, almost surely and in expected hitting time, from a certified sublevel set, despite the landscape's continuous gauge symmetry and its lattice of periodic optima; the certified level is explicit whenever the landscape is trap-free, and near the optimum the strategy provably sees only the quadratic tangent of the peak. Systematic numerical simulations corroborate the theory. Finally, we show that additive input (actuator) noise reweights each term of the representation by a Debye-Waller factor without disrupting the landscape's structure, and outline open challenges: output (signal) noise, far-field plateau escape, angular-synchronization certificates, and another physically scalable benchmark (SHG with Glass).
Very little is known about the cost landscape for parametrized Quantum Circuits (PQCs). Nevertheless, PQCs are employed in Quantum Neural Networks and Variational Quantum Algorithms, which may allow for near-term quantum advantage. Such applications require good optimizers to train PQCs. Recent works have focused on quantum-aware optimizers specifically tailored for PQCs. However, ignorance of the cost landscape could hinder progress towards such optimizers. In this work, we analytically prove two results for PQCs: (1) We find an exponentially large symmetry in PQCs, yielding an exponentially large degeneracy of the minima in the cost landscape. Alternatively, this can be cast as an exponential reduction in the volume of relevant hyperparameter space. (2) We study the resilience of the symmetries under noise, and show that while it is conserved under unital noise, non-unital channels can break these symmetries and lift the degeneracy of minima, leading to multiple new local minima. Based on these results, we introduce an optimization method called Symmetry-based Minima Hopping (SYMH), which exploits the underlying symmetries in PQCs. Our numerical simulations show that SYMH improves the overall optimizer performance in the presence of non-unital noise at a level comparable to current hardware. Overall, this work derives large-scale circuit symmetries from local gate transformations, and uses them to construct a noise-aware optimization method.
Abstract The variational quantum eigensolver (VQE) is a fundamental algorithm in quantum computing, yet its theoretical understanding remains fragmented across fixed-ansatz and adaptive-circuit formulations, which are typically analyzed using different frameworks. As a result, a coherent geometric characterization of the VQE remains missing. In this paper, we establish a geometric analysis of VQE in terms of optimization landscape, initialization guarantee, and noise robustness. First, from a Riemannian geometric perspective, we study the optimization landscape via an ansatz-free product-unitary formulation over the unitary group, where each layer unitary is treated as an independent optimization variable, thereby capturing both fixed-ansatz and adaptive-circuit paradigms. For the single-unitary case, we establish explicit linear convergence guarantees for Riemannian gradient descent (RGD) under proper initialization and characterize the global landscape by proving that every critical point is either a global minimum or a strict saddle point. For the product-unitary case, we extend the convergence analysis of RGD and show that the convergence rate deteriorates polynomially with circuit depth, providing a convergence-theoretic explanation of the barren plateau phenomenon through the interplay between Hilbert-space geometry, target-unitary complexity, per-layer expressivity, and circuit depth. Second, we analyze initialization guarantees for the above convergence results. We consider a practical variational circuit composed of small-angle random Pauli rotations and prove that this initialization scheme satisfies the required geometric conditions with high probability. We further characterize how the resulting initialization error depends on the reference state, circuit depth, and random angles. Third, we study robustness under finite-shot measurements for VQE with Pauli-decomposed Hamiltonians. We show that RGD retains linear convergence up to a noise-dominated neighborhood of the global minimizer. Moreover, we extend the analysis to non-uniform measurement allocation under a fixed measurement budget and show that coefficient-adaptive allocation achieves strictly lower statistical error than uniform sampling. Together, these results provide a systematic geometric characterization of the optimization, initialization, and measurement behavior of VQE, offering new insights into its trainability and robustness.
Variational quantum algorithms (VQAs) hold much promise but face the challenge of exponentially small gradients. Unmitigated, this barren plateau (BP) phenomenon leads to an exponential training overhead for VQAs. Perhaps the most pernicious are noise-induced barren plateaus (NIBPs), a type of unavoidable BP arising from open system effects, which have so far been shown to exist for unital noise maps. Here, we generalize the study of NIBPs to more general completely positive, trace-preserving maps, investigating the existence of NIBPs in the unital case and a class of non-unital maps we call Hilbert-Schmidt (HS)-contractive. The latter includes amplitude damping. We identify the associated phenomenon of noise-induced limit sets (NILS) of the VQA cost function and prove its existence for both unital and HS-contractive non-unital noise maps. Along the way, we extend the parameter shift rule of VQAs to the noisy setting. We provide rigorous bounds in terms of the relevant variables that give rise to NIBPs and NILSs, along with numerical simulations of the depolarizing and amplitude-damping maps that illustrate our analytical results.
We formalize the exact optimization boundaries, physical time evolution minimums, and finite-resource measurement constraints that govern the performance of the Quantum Natural Gradient (QNG) update rule on parameterized variational manifolds. First, we state and prove Theorem 4.1 to characterize the exact convergence properties of QNG updates under bounded Riemannian metrics. Crucially, we isolate the causal mechanism linking ansatz expressivity to geometric degradation, proving that the pulled-back Fubini–Study metric elements inherit the exponential O(2−N ) variance collapse dictated by Haar measure integration over random unitary circuit layouts. This scaling is shown to drive an exponential inflation of the metric condition number, establishing a clear geometric origin for the numerical tracking instabilities that stall optimization vectors in large-scale parameter spaces. Second, we formalize the Information-Geometric Quantum Brachistochrone (Theorem 4.2), proving that under instantaneous velocity limitations derived from the system’s energy variance, the absolute minimum time T required to map a state vector between two configurations is bounded strictly below by the integrated Riemannian geodesic distance Lgeodesic. This result demonstrates that flat Euclidean metrics severely underestimate physical time requirements near highly entangled boundaries where local manifold curvature dominates. Finally, we derive a sharp Shot-Noise Metric Concentration Bound (Theorem 4.3), resolving an exact cyclic trace simplification to prove that finite-shot perturbation errors concentrate according to a structural noise alignment factor κ(θ) = Tr(Σg−1)/∥∆θ∥2g . Multi-trial multinomial simulations validate this relation across all shot budgets (102 to 105), verifying that the empirical breach probability tracks safely below the analytical trace constraint line. This bound exposes a fundamental engineering trade-off: as an optimization path approaches ill conditioned regions where the minimum eigenvalue collapses (λmin → 0), the tracking framework requires a quadratic expansion of measurement resources to suppress shot noise and stabilize control loops.
Non-unital noise is a fundamental feature of open quantum systems, governing energy exchange and inducing state translations on the Bloch sphere. While such translations can be useful for tasks such as state preparation and channel capacity, unital dynamics where no translation occurs are often preferred in quantum information processing, particularly for error correction. Phase-covariant dynamics provide a general framework encompassing dissipation, excitation, and dephasing processes in qubit systems; however, commonly used models such as the generalized amplitude damping (GAD) channel offer only limited control over these features. In this work, we present a constructive framework for generating a broader class of phase-covariant dynamics by mixing amplitude-damping and anti-damping channels with unequal decay parameters and time-dependent mixing probabilities. This approach enables independent control over contraction and translation, allows continuous tuning between non-unital and unital regimes, and yields an effective dephasing contribution absent in GAD. To characterize these dynamics, we employ the general theorem for P-divisibility and show that it can be used constructively by evaluating it in suitably chosen Hilbert space bases, leading to simplified conditions for both unital and non-unital cases. The framework captures a wide range of behaviors, including CP-divisible, P-divisible but not CP-divisible, and non-P-divisible dynamics. We further show that appropriate mixing can reduce the deviation from the ideal noiseless evolution and that such improvement persists even after tuning the dynamics to the unital regime. Our results provide a flexible approach to engineering open system dynamics beyond standard thermal models, with potential applications in noise control and quantum information processing.