Complexity Bounds for Hamiltonian Simulation in Unitary Representations

• URL: http://arxiv.org/abs/2603.07231v1
• Date: Sat, 07 Mar 2026 14:28:46 GMT
• Title: Complexity Bounds for Hamiltonian Simulation in Unitary Representations
• Abstract summary: We consider the Hamiltonian evolution [ U_X(t) coloneqq (exp(tX)) = et,d(X), qquad tinmathbbR.<n>We first describe how the Hamiltonian (d(X)) is distributed along the directions of root spaces $mathfrakg_$.<n>Our main result shows that for each fixed (Xinmathfrakg) there exists a constant such that
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: For any unitary representation $ρ$ on a finite-dimensional Hilbert space \(V\) with differential \(dρ: \mathfrak{g} \to \mathfrak{u}(V)\) for the Lie algebra $\mathfrak g$, we consider the Hamiltonian evolution \[ U_X(t) \coloneqq ρ(\exp(tX)) = e^{t\,dρ(X)}, \qquad t\in\mathbb{R}. \] For any complexification $ X_\mathbb{C} = X_0 + \sum\limits_{α\inΔ} x_αE_α$ associated with the root system $Δ$, we introduce the numerical invariants %\emph{root activity} and \emph{root curvature} functionals \begin{align*} \mathcal{A}_p(X) &\coloneqq \Bigl(\sum_{α\inΔ} |x_α|^p \,\|dρ(E_α)\|_{\mathrm{op}}^p\Bigr)^{1/p}, \quad 1\le p<\infty\\ \mathcal{C}(X) &\coloneqq \Bigl(\sum_{α\inΔ} |α(X_0)|^2\,|x_α|^2 \,\|dρ(E_α)\|_{\mathrm{op}}^2\Bigr)^{1/2}, \end{align*} where \(\|\cdot\|_{\mathrm{op}}\) is the operator norm on \(\mathrm{End}(V)\). We first describe how the Hamiltonian \(dρ(X)\) is distributed along the directions of root spaces $\mathfrak{g}_α$. Our main result shows that for each fixed \(X\in\mathfrak{g}\) there exists a constant \(C_X>0\) such that \[ \bigl\| e^{t(dρ(X_0)+dρ(X_{\mathrm{root}}))} - e^{\frac{t}{2}dρ(X_0)} e^{t dρ(X_{\mathrm{root}})} e^{\frac{t}{2}dρ(X_0)} \bigr\|_{\mathrm{op}} \le C_X\,t^{3}\,\bigl(\mathcal{C}(X)+\mathcal{A}_1(X_{\mathrm{root}})\bigr) \] for all sufficiently small \(|t|\). We also introduce a root-gate circuit model and test this on spin$-$chain Hamiltonians on \((\mathbb{C}^2)^{\otimes n}\subset\mathfrak{su}(2^n)\), where root spaces are spanned by matrix units, \(\mathcal{A}_p\), and \(\mathcal{C}\), which gives sharper complexity bounds and dimension$-$free representation$-$theoretic invariants.

Related papers

• Optimal Neural Network Approximation via Empirical Least Squares with Deterministic Samples [7.864201093845001]
  We develop a theory of discrete residual least-squares approximation for elliptic spectral equations $mathfrak L_u=f$ using linearized ReLU$k$ neural networks.<n>We establish a high-probability residual estimate, up to a logarithmic factor and an arbitrarily small smoothness loss.<n>The key analytical ingredient is a Bernstein inequality for linearized ReLU$k$ network spaces.
  arXiv  Detail & Related papers  (2026-08-07T01:22:27Z)
• Approximate eigenfunctions for some aperiodic crystals [4.56877715768796]
  Hamiltonians for aperiodic crystals of the form H_varepsilon:=T(-inabla_x+mathbf A(x,varepsilon x))+V(x,varepsilon x),qquad xin mathbb Rd endalign* where $T$ represents either a Dirac operators or a Schrdinger operator.
  arXiv  Detail & Related papers  (2026-07-09T10:03:51Z)
• Approximating the operator norm of local Hamiltonians via few quantum states [53.16156504455106]
  Consider a Hermitian operator $A$ acting on a complex Hilbert space of $2n$.<n>We show that when $A$ has small degree in the Pauli expansion, or in other words, $A$ is a local $n$-qubit Hamiltonian.<n>We show that whenever $A$ is $d$-local, textiti.e., $deg(A)le d$, we have the following discretization-type inequality.
  arXiv  Detail & Related papers  (2025-09-15T14:26:11Z)
• The Space Complexity of Approximating Logistic Loss [11.338399194998933]
  We prove a general $tildeOmega(dcdot mu_mathbfy(mathbfX))$ space lower bound when $epsilon$ is constant.<n>We also refute a prior conjecture that $mu_mathbfy(mathbfX)$ is hard to compute.
  arXiv  Detail & Related papers  (2024-12-03T18:11:37Z)
• Learning a Single Neuron Robustly to Distributional Shifts and Adversarial Label Noise [38.551072383777594]
  We study the problem of learning a single neuron with respect to the $L2$ loss in the presence of adversarial distribution shifts. A new algorithm is developed to approximate the vector vector squared loss with respect to the worst distribution that is in the $chi2$divergence to the $mathcalp_0$.
  arXiv  Detail & Related papers  (2024-11-11T03:43:52Z)
• Efficient Continual Finite-Sum Minimization [52.5238287567572]
  We propose a key twist into the finite-sum minimization, dubbed as continual finite-sum minimization. Our approach significantly improves upon the $mathcalO(n/epsilon)$ FOs that $mathrmStochasticGradientDescent$ requires. We also prove that there is no natural first-order method with $mathcalOleft(n/epsilonalpharight)$ complexity gradient for $alpha 1/4$, establishing that the first-order complexity of our method is nearly tight.
  arXiv  Detail & Related papers  (2024-06-07T08:26:31Z)
• Towards verifications of Krylov complexity [0.0]
  I present the exact and explicit expressions of the moments $mu_m$ for 16 quantum mechanical systems which are em exactly solvable both in the Schr"odinger and Heisenberg pictures.
  arXiv  Detail & Related papers  (2024-03-11T02:57:08Z)
• Exact objectives of random linear programs and mean widths of random polyhedrons [0.0]
  We consider emphrandom linear programs (rlps) as a subclass of emphrandom optimization problems (rops) Our particular focus is on appropriate linear objectives which connect the rlps to the mean widths of random polyhedrons/polytopes.
  arXiv  Detail & Related papers  (2024-03-06T11:51:52Z)
• Provably learning a multi-head attention layer [55.2904547651831]
  Multi-head attention layer is one of the key components of the transformer architecture that sets it apart from traditional feed-forward models. In this work, we initiate the study of provably learning a multi-head attention layer from random examples. We prove computational lower bounds showing that in the worst case, exponential dependence on $m$ is unavoidable.
  arXiv  Detail & Related papers  (2024-02-06T15:39:09Z)
• Learning a Single Neuron with Adversarial Label Noise via Gradient Descent [50.659479930171585]
  We study a function of the form $mathbfxmapstosigma(mathbfwcdotmathbfx)$ for monotone activations. The goal of the learner is to output a hypothesis vector $mathbfw$ that $F(mathbbw)=C, epsilon$ with high probability.
  arXiv  Detail & Related papers  (2022-06-17T17:55:43Z)
• On Outer Bi-Lipschitz Extensions of Linear Johnson-Lindenstrauss Embeddings of Low-Dimensional Submanifolds of $\mathbb{R}^N$ [0.24366811507669117]
  Let $mathcalM$ be a compact $d$-dimensional submanifold of $mathbbRN$ with reach $tau$ and volume $V_mathcal M$. We prove that a nonlinear function $f: mathbbRN rightarrow mathbbRmm exists with $m leq C left(d / epsilon2right) log left(fracsqrt[d]V_math
  arXiv  Detail & Related papers  (2022-06-07T15:10:46Z)
• Low-degree learning and the metric entropy of polynomials [44.99833362998488]
  We prove that any (deterministic or randomized) algorithm which learns $mathscrF_nd$ with $L$-accuracy $varepsilon$ requires at least $Omega(sqrtvarepsilon)2dlog n leq log mathsfM(mathscrF_n,d,|cdot|_L,varepsilon) satisfies the two-sided estimate $$c (1-varepsilon)2dlog
  arXiv  Detail & Related papers  (2022-03-17T23:52:08Z)
• On the Self-Penalization Phenomenon in Feature Selection [69.16452769334367]
  We describe an implicit sparsity-inducing mechanism based on over a family of kernels. As an application, we use this sparsity-inducing mechanism to build algorithms consistent for feature selection.
  arXiv  Detail & Related papers  (2021-10-12T09:36:41Z)
• Linear Bandits on Uniformly Convex Sets [88.3673525964507]
  Linear bandit algorithms yield $tildemathcalO(nsqrtT)$ pseudo-regret bounds on compact convex action sets. Two types of structural assumptions lead to better pseudo-regret bounds.
  arXiv  Detail & Related papers  (2021-03-10T07:33:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.