SearcharxivSearch

arXiv subjects

Andrea Maestri

Publications and source records attributed to Andrea Maestri.

2 recordsLinked to original sources

Higher-order structure of Hamiltonian truncation effective theory

We study the Hamiltonian truncation for the two-dimensional $λϕ^4$ theory within the framework of Hamiltonian truncation effective theory, where truncation artifacts are mitigated through a systematic inclusion of corrective terms organized in inverse powers of the ultraviolet energy cut-off $E_{\rm max}$. Building on the leading-order matching program, we develop two complementary extensions. First, we derive compact all-order expressions for the local matching corrections to the mass and quartic coupling by resumming infinite classes of diagrams sharing fixed topologies within the local approximation. Second, we extend the non-local sector by computing the next-to-next-to-local corrections contributing at $\mathcal{O}(E_{\rm max}^{-4})$, following a continuum-first matching procedure, in which the effective corrections are computed in infinite volume and the spatial direction is subsequently re-compactified to obtain a discrete basis of free-Hamiltonian eigenstates on which the truncated operator construction is implemented. Our results show that an increasingly rich operator basis is necessary to describe the theory beyond leading order.

hep-ph

Qudit Gate Decomposition Dependence for Lattice Gauge Theories

In this work, we investigate the effect of decomposition basis on primitive qudit gates on superconducting radio-frequency cavity-based quantum computers with applications to lattice gauge theory. Three approaches are tested: SNAP & Displacement gates, ECD & single-qubit rotations $R(θ,ϕ)$, and optimal pulse control. For all three decompositions, implementing the necessary sequence of rotations concurrently rather then sequentially can reduce the primitive gate run time. The number of blocks required for the faster ECD & $R_p(θ)$ is found to scale $\mathcal{O}(d^2)$, while slower SNAP & Displacement set scales at worst $\mathcal{O}(d)$. For qudits with $d<10$, the resulting gate times for the decompositions is similar, but strongly-dependent on experimental design choices. Optimal control can outperforms both decompositions for small $d$ by a factor of 2-12 at the cost of higher classical resources. Lastly, we find that SNAP & Displacement are slightly more robust to a simplified noise model.

quant-ph