Wandering range of robust quantum symmetries

arXiv:2604.13894 · quant-ph, math-ph, math.MP · Submitted 2026-04-15 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.

Kai: We're looking at the paper: "Wandering range of robust quantum symmetries".

Mira: Here's the gist of the paper. The gist: This paper introduces and analyzes the concept of the wandering range of a robust symmetry S of a Hamiltonian H, quantifying how much its perturbed time evolution deviates from its unperturbed counterpart, and identifies conditions under which this deviation scales linearly with the perturbation strength ε.

Kai: Symmetries play a crucial role in describing physical systems, as they are identified with operators that commute with the Hamiltonian of the system in quantum systems

3: .

Mira: In real physical applications, where the Hamiltonian is known only approximately, it is important to understand whether a symmetry remains stable under perturbations of the Hamiltonian

4, 5: .

Kai: This stability is essential for analog quantum simulation and understanding experimental imperfections

6, 7, 8: .

Title and authors: Kai: So, let's talk about what they actually wrote in "Wandering range of robust quantum symmetries." It’s a deep dive into how symmetries behave when you introduce a small change to the Hamiltonian H.

Mira: They are focusing on this idea of the wandering range, which is essentially measuring the deviation between the time evolution of the perturbed Hamiltonian and what it would be if there were no perturbation at all.

Lev: So, they're setting up a framework where they classify symmetries into robust ones—the good ones that stay close to their starting point—and fragile ones that drift away over time.

Kai: They introduce the wandering range specifically to quantify that deviation for the robust symmetries, which helps us see how sensitive those symmetries actually are to external changes.

Mira: The core question they are answering is whether this wandering range scales linearly with epsilon, because if it does, we get a much more predictable behavior for our simulations and experiments.

Lev: That linear scaling is what we need for practical error correction because it gives us a concrete upper bound on the error accumulation over time.

The paper's summary: Kai: So, the paper summarizes by saying they look at two main scenarios where they find this linear scaling holds: first, when you are looking at states that live in a dense subspace—specifically, the linear span of the eigenvectors of the unperturbed Hamiltonian.

Mira: And second, they find it holds for symmetries that are finite-rank; these are symmetries that aren't infinitely complex in terms of their structure.

Lev: That means for those specific types of states or symmetries, they can actually prove that the wandering range is bounded by something proportional to epsilon.

Kai: The paper also dedicates a section to completely robust symmetries, which are robust against *any* bounded perturbation you throw at them, and they prove that here too the wandering range is uniformly of order epsilon.

Mira: And for those completely robust cases under bounded perturbations, they give us an explicit norm bound: sup t in R e itH(epsilon)Se-itH(epsilon) - S is less than or equal to beta v eta S epsilon, where beta and rho are some constants.

Lev: That explicit bound is what matters for me; it tells us exactly how the error grows and what controls that growth, like the spectral gap eta.

The paper's improvements: Kai: One of the key improvements they suggest is moving beyond just saying it’s *not* generally of order epsilon, to actively identifying those specific conditions where it *is* linear scaling.

Mira: They achieve this by using a very technical tool called a quantum KAM iteration scheme, which they use to construct an eternal block-diagonal approximation of the perturbed Hamiltonian.

Lev: That quantum KAM iteration is heavy lifting; it involves constructing operators W(epsilon) and Vˆ (epsilon) through recursive conditions derived from comparing terms in formal power series expansions, and that’s where the complexity lands.

Kai: They also use combinatorial sequences like Catalan numbers to prove that these formal series actually converge when they construct the operators Bs(epsilon), which gives us concrete estimates for their norms.

Mira: The improvement there is really about making the proof rigorous; they use these sequence estimates to show convergence, which leads directly to that explicit bound mentioned earlier in Theorem three point one <ref:2604.13894#pg1>.

Conclusion: Kai: So, wrapping up this paper on "Wandering range of robust quantum symmetries," the main point is that we can identify conditions—like being in the dense subspace or having a finite-rank symmetry—where we know the wandering range scales linearly with epsilon.

Mira: And for completely robust symmetries under bounded perturbations, they provide a very strong explicit norm bound involving beta, v, eta, and epsilon up to eta over vrho.

Lev: From my side, this means that if you can find a system satisfying those conditions—like the Josephson junction example they use—you have a concrete way to measure the error accumulation without having to track every single term in the expansion.

Kai: It’s about giving us a measurable quantity, so we can actually quantify how much deviation we expect over time when things are perturbed.

Mira: And this whole approach relies on using quantum KAM iteration to build those approximations, which is powerful because it allows them to handle unbounded Hamiltonians without needing to know the number of distinct eigenvalues.

Lev: So, for real hardware running error correction protocols, this suggests we can calculate the expected error accumulation based on the known properties of our physical system rather than just relying on theoretical worst-case estimates.

Friedrich-Alexander University of Erlangen-Nuremberg · Dipartimento di Fisica, Universita di Bari · INFN Sezione di Bari · Dipartimento di Matematica, Universita di Bari · Department of Physics, Waseda University

quant-ph, math-ph, math.MP

Submitted: 2026-04-15

Updated: 2026-04-15

Comments: 34 pages, 1 figure

Journal ref: Journal of Physics A: Mathematical and Theoretical 59, 395303 (2026)

DOI: 10.1088/1751-8121/ae94bf

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 77/100

The gist: The gist: This paper introduces and analyzes the concept of the wandering range of a robust symmetry S of a Hamiltonian H, quantifying how much its perturbed time evolution deviates from its

Key concepts

Wandering Range
This quantifies the deviation of a perturbed symmetry's time evolution from its unperturbed path. A robust symmetry has a wandering range that goes to zero as the perturbation strength ($\epsilon$) approaches zero, distinguishing it from fragile symmetries.
Robust Symmetry
A symmetry is considered robust if its evolution remains close to its initial value even when the Hamiltonian is slightly perturbed. The paper investigates conditions under which this robustness guarantees that the deviation (wandering range) scales linearly with the perturbation strength $\epsilon$.
Quantum KAM Iteration
This technical framework uses a Schrieffer-Wolff transformation, equivalent to a quantum Kolmogorov-Arnold-Moser (KAM) iteration. This process constructs an eternal block-diagonal approximation of the perturbed Hamiltonian, allowing for the study of dynamics that are uniform across all time.
Schrieffer-Wolff Transformation
This is a unitary transformation used in the analysis to construct a new Hamiltonian that commutes with the unperturbed symmetry. It is equivalent to a quantum KAM iteration scheme and is crucial for generating approximations of the perturbed evolution uniformly in time.

Summary

The gist: This paper introduces and analyzes the concept of the wandering range of a robust symmetry S of a Hamiltonian H, quantifying how much its perturbed time evolution deviates from its unperturbed counterpart, and identifies conditions under which this deviation scales linearly with the perturbation strength ε.

Introduction to Symmetries and Perturbations

Symmetries play a crucial role in describing physical systems, as they are identified with operators that commute with the Hamiltonian of the system in quantum systems [3]. In real physical applications, where the Hamiltonian is known only approximately, it is important to understand whether a symmetry remains stable under perturbations of the Hamiltonian [4, 5]. This stability is essential for analog quantum simulation and understanding experimental imperfections [6, 7, 8]. Symmetries are classified based on their long-time stability: robust symmetries remain close to their initial value throughout the entire evolution despite a perturbation, while fragile symmetries accumulate non-negligible deviations over time [4].

Defining the Wandering Range

The wandering range of a robust symmetry quantifies the deviation of the perturbed symmetry from its unperturbed evolution [2]. The goal of this paper is to analyze how this wandering range depends on the strength of the perturbation ε, specifically identifying conditions under which it exhibits linear scaling with ε [2].

Scaling Behavior for Specific Subspaces and Symmetries

The paper establishes that for states belonging to the dense subspace given by the linear span of the eigenvectors of the unperturbed Hamiltonian, or for finite-rank symmetries, the wandering range is indeed of order ε [2]. This result is established in Theorem 2.1 for admissible perturbations satisfying a regularity condition and in Theorem 2.3 for arbitrary linear perturbations of a compact-resolvent Hamiltonian [8].

Analysis of Completely Robust Symmetries

The second part of the paper focuses on completely robust symmetries, which are robust against any bounded perturbation [3]. In this case, the wandering range is proven to be uniformly of order ε, and an explicit bound in terms of the norm of the perturbation and the minimal spectral gap η is derived in Theorem 3.1 [10]. The core proof involves constructing a new perturbation that commutes with H and generates dynamics approximating the perturbed evolution uniformly in time—an eternal block-diagonal approximation [10].

Technical Framework: Quantum KAM Iteration

The technical framework relies on the construction of a unitary block-diagonalizing transformation, known as the Schrieffer-Wolff transformation [11–13], which is equivalent to a quantum Kolmogorov-Arnold-Moser (KAM) iteration scheme [14, 15]. The analysis utilizes the homological equation, also known as the commutator equation in matrix analysis [16] and extended to unbounded Hamiltonians via Theorem 4.1 [8]. The formal construction of bounded operators W(ε) and Vˆ (ε) satisfying the properties of Theorem 3.3 is achieved through quantum KAM iteration, where coefficients are determined by recursive conditions derived from comparing terms in the formal series expansions [20, 21].

Convergence and Explicit Bounds

The convergence of the formal expansion is established by exploiting combinatorial sequences like the Catalan numbers [18]. Lemma 4.4 provides explicit estimates for operators Bs(ε), showing that their norm is bounded by a term involving Catalan numbers and constants α, b, and η [23]. The final construction shows that for states in the dense subspace, there exists a constant Cψ > 0 such that the wandering range is of order ε [34]. For completely robust symmetries under bounded perturbations, an explicit norm bound is obtained: sup t∈R eitH(ε)Se−itH(ε) − S ≤ β v η Sε for 0 ≤ ε ≤ η/vρ [51].

Physical Applications

Example 4.1 illustrates the application of these results to the Hamiltonian of a Josephson junction in an inductive loop [26]. The paper demonstrates that KAM iteration can be applied when the perturbation strength satisfies conditions such as ε∥V∥ ≤ ηρ, which relates to physical parameters like pEJ /ECEL/EC or π2/2 EL/EC + EJ/4EC < 1ρ [30].

In conclusion, the work provides sufficient conditions for the wandering range of robust symmetries to be linear in ε for specific states and symmetries, and it establishes explicit norm bounds for completely robust symmetries under bounded perturbations by employing a Schrieffer-Wolff transformation based on a quantum KAM iteration scheme. The derivation of these bounds generalizes results from finite-dimensional systems to unbounded Hamiltonians while removing dependence on the number of distinct eigenvalues [31].

--- Page 1 ---

Wandering range of robust quantum symmetries 1

How it works

  1. The wandering range is defined as δH(ε)(S, ψ) = sup t∈R (eitH(ε)Se−itH(ε) − S)ψ [7]. A symmetry S is robust if this wandering range goes to zero as ε → 0 [8].

  2. The paper proves that for states in the dense subspace given by the linear span of eigenvectors of H, or for finite-rank symmetries, the wandering range is indeed of order ε [2].

  3. For completely robust symmetries under bounded perturbations, an explicit norm bound is derived: sup t∈R eitH(ε)Se−itH(ε) − S ≤ β v η Sε for 0 ≤ ε ≤ η/vρ [51].

  4. The proof of this bound utilizes a Schrieffer-Wolff transformation constructed through a KAM iteration scheme, which requires the use of Catalan numbers to control the convergence of the formal series expansions [10, 26].

Key Results

(i) If ψ ∈ H belongs to the linear span D of the eigenvectors of H, then there exists a Cψ > 0 such that sup t∈R (eitH(ε)Se−itH(ε) − S)ψ ≤ Cψε [25].

(ii) If S is a finite-rank operator, then there exists a C > 0 such that sup t∈R eitH(ε)Se−itH(ε) − S ≤ Cε [26].

(iii) For completely robust symmetries under bounded perturbations, the wandering range is bounded by sup t∈R eitH(ε)Se−itH(ε) − S ≤ β v η Sε for 0 ≤ ε ≤ η/vρ [51].

Conclusion

The work establishes sufficient conditions for the wandering range of robust symmetries to scale linearly with the perturbation strength ε for specific states and symmetries, and it provides an explicit norm bound for completely robust symmetries under bounded perturbations by employing a Schrieffer-Wolff transformation based on a quantum KAM iteration scheme. The derivation of these bounds generalizes results from finite-dimensional systems to unbounded Hamiltonians while removing dependence on the number of distinct eigenvalues [31].

--- Page 2 ---

Wandering range of robust quantum symmetries 2

Key Results

(i) If ψ ∈ H belongs to the linear span D of the eigenvectors of H, then there exists a Cψ > 0 such that sup t∈R (eitH(ε)Se−itH(ε) − S)ψ ≤ Cψε [25].

(ii) If S is a finite-rank operator, then there exists a C > 0 such that sup t∈R eitH(ε)Se−itH(ε) − S ≤ Cε [26].

**(iii) For completely robust symmetries under bounded perturbations, the wandering range is bounded by sup t∈R eitH(ε)Se−itH(ε) − S ≤ β v η Sε for 0 ≤ ε ≤ η/vρ [51].

Improvements for AI systems

  1. The AI system can achieve precise quantification of symmetry stability by measuring the wandering range of a robust symmetry, which quantifies the deviation of the perturbed symmetry from its unperturbed evolution. This allows for distinguishing between robust symmetries and fragile symmetries based on whether the deviation is of order ε.

  2. The system can establish explicit, nonperturbative bounds for the wandering range under specific conditions, as demonstrated by Theorem 3.1: its wandering range is bounded by sup t∈R e itH(ε)Se−itH(ε) − S ≤ β v η Sε, where β ≈ 15.3 and ρ ≈ 34.8 are defined in Table 1.

  3. The system can perform a quantum KAM iteration scheme to construct an eternal block-diagonal approximation of the perturbed Hamiltonian, which allows for the study of dynamics that approximates the perturbed evolution uniformly in time.

  4. The system can apply the derived bounds to complex physical models, such as a Josephson junction Hamiltonian, enabling predictive modeling when conditions like εV ≤ ηρ are met.

  5. The AI can analyze spectral properties of Hamiltonians to determine robustness; specifically, a symmetry S is robust against an admissible perturbation H(ε) if [S, Pn(0)] = 0 for all n ≥ 1.

Related papers