SearcharxivSearch

arXiv · 2603.07231

Complexity Bounds for Hamiltonian Simulation in Unitary Representations

Abstract

For any unitary representation $\rho$ on a finite-dimensional Hilbert space \(V\) with differential \(d\rho : \mathfrak{g} \to \mathfrak{u}(V)\) for the Lie algebra $\mathfrak g$, we consider the Hamiltonian evolution \[ U_X(t) \coloneqq \rho(\exp(tX)) = e^{t\,d\rho(X)}, \qquad t\in\mathbb{R}. \] For any complexification $ X_\mathbb{C} = X_0 + \sum\limits_{\alpha\in\Delta} x_\alpha E_\alpha $ associated with the root system $\Delta$, we introduce the numerical invariants %\emph{root activity} and \emph{root curvature} functionals \begin{align*} \mathcal{A}_p(X) &\coloneqq \Bigl(\sum_{\alpha\in\Delta} |x_\alpha|^p \,\|d\rho(E_\alpha)\|_{\mathrm{op}}^p\Bigr)^{1/p}, \quad 1\le p<\infty\\ \mathcal{C}(X) &\coloneqq \Bigl(\sum_{\alpha\in\Delta} |\alpha(X_0)|^2\,|x_\alpha|^2 \,\|d\rho(E_\alpha)\|_{\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\rho(X)\) is distributed along the directions of root spaces $\mathfrak{g}_\alpha$. 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\rho(X_0)+d\rho(X_{\mathrm{root}}))} - e^{\frac{t}{2}d\rho(X_0)} e^{t d\rho(X_{\mathrm{root}})} e^{\frac{t}{2}d\rho(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.

Explore related subjects

Keep this discovery

BibTeXRIS

Naihuan Jing, Molena Nguyen. 2026-03-07. Complexity Bounds for Hamiltonian Simulation in Unitary Representations. https://arxiv.org/abs/2603.07231

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph