arXiv subjects

Henry Lamm

Publications and source records attributed to Henry Lamm.

At least 19 recordsLinked to original sources

arXiv2026

Exact chiral symmetry with quantum signal processing

We give a quantum signal processing (QSP) algorithm for the overlap fermion Hamiltonian which preserves the Ginsparg-Wilson relation up to a controllable error $\epsilon_e$. Quantum simulations of Dirac fermions with exact chiral symmetry are thus nearly free: applying the overlap Hamiltonian costs only a factor logarithmic in $\epsilon_e$ more than the Wilson-Dirac Hamiltonian. Comparing to domain-wall fermions, a mild overhead is found in circuit complexity while reducing qubit costs. We show how QSP effectively constructs an extra dimension when simulating the overlap operator, illustrating that the scaling of quantum algorithms reflects the deeper physics of overlap fermions arising at the boundary of domain-wall fermions.

hep-lat↗

arXiv2026

Ether of Orbifolds

The orbifold lattice has been proposed as a route to practical quantum simulation of Yang--Mills theory, with claims of exponential speedup over all known approaches. Through analytical derivations, Monte Carlo simulation, and explicit circuit construction, we identify compounding costs entirely absent in Kogut--Susskind formulations: a mass-dependent Trotter overhead that scales as $m^4$, non-singlet contamination that grows as $m^2$ and worsens with penalty terms, and a mandatory mass extrapolation. Monte Carlo simulations of SU(3) establish a universal scaling: the continuum limit forces $m^2 \propto 1/a$, binding the Trotter step to the lattice spacing through a cost unique to orbifolds. For a fiducial $10^3$ calculation, the orbifold is $10^4$--$10^{10}$ times more expensive than every published alternative. These results indicate that the claimed computational advantages do not at present survive quantitative scrutiny.

hep-lat↗

arXiv2026

Preparing Fermions via Classical Sampling and Linear Combinations of Unitaries

We present an extension of the Evolving density matrices on Qubits (E$\rho$OQ) framework that enables efficient fault-tolerant preparation of fermionic quantum states. The original method circumvents state preparation by stochastic sampling, but faces a sign problem in fermionic systems leading to a large number of circuits necessary. We resolve this by combining classical stochastic sampling with a linear combination of unitaries method that avoids the exponential circuit scaling that plagued na\"{i}ve implementations. The resulting algorithm requires $\mathcal{O}(M^2)$ $R_Z$ rotations for circuit preparation, where $M$ is the number of retained basis states. We validate the method for ground and excited states in the Thirring model, including by computing two-point correlation functions relevant to scattering. In this model for fixed accuracy $\varepsilon$, $M$ is found to scale empirically as $M \propto \frac{1}{mg}\log(1/g)\log(1/m)$.

quant-ph↗

arXiv2026

No Quantum Utility from Hadron Masses? No, Quantum Utility from Hadron Masses!

Is there a quantum utility in establishing the masses of hadrons? Here we show that the best response is that of Farr\'es, Cap\'o, and Davis: perhaps, perhaps, perhaps. This is interesting given the general case that particle physics demands quantum computers. For stable hadrons, classical LQCD has achieved sub-percent precision with no sign problem, and quantum computers offer no advantage. For resonances, the Maiani-Testa theorem is an obstruction that quantum simulation is immune to. For nuclei, Wick contractions and signal-to-noise are genuine classical barriers. Underlying these cases is a unified picture connecting the sign problem to Wigner negativity and T gate cost. This manuscript was drafted from extensive interaction with \textsc{Claude}.

hep-lat↗

arXiv2025

Magic State Distillation using Asymptotically Good Codes on Qudits

Qudits offer the potential for low-overhead magic state distillation, although previous results for asymptotically good codes have required qudit dimension $q\gg 100$ or code length $\mathcal{N}\gg 100$. These parameters far exceed experimental demonstrations of qudit platforms, and thus motivate the search for better codes. Using a novel lifting procedure, we construct the first family of good triorthogonal codes on the $\mathbb{F}_{2^{2m}}$ alphabet with $m \geq 3$ that lies above the Tsfasman-Vladut-Zink bound. These codes yield a family of asymptotically good quantum codes with transversal CCZ gates, enabling constant space overhead magic state distillation with qudit dimension as small as $q=64$. Further, we identify a promising code with parameters $[[42,14,6]]_{64}$. Finally, we show that a distilled $|{CCZ}\rangle_{2^{2m}}$ can be reduced to a $|{CCZ}\rangle_{2^n}$ state for arbitrary $n$ with a constant-depth Clifford circuit of at most 9 computational basis measurements, 12 single-qudit and 9 two-qudit Clifford gates.

quant-ph↗

arXiv2025

Primitive Quantum Gates for an $SU(3)$ Discrete Subgroup: $\Sigma(72\times3)$

We construct a primitive gate set for the digital quantum simulation of a discrete subgroup of $SU(3)$: the 216-element $\Sigma(72\times3)$. The necessary primitives are the inversion gate, the group multiplication gate, the trace gate, and the group Fourier transform, for which we provide qubit decompositions. The resulting fault-tolerant T gate costs for a fiducial calculation of shear viscosity would require about $10^{12}$ T gates which compares favorably to other modern estimates.

hep-lat↗

arXiv2025

The 2T-quoctit: a two-mode bosonic qudit for high energy physics

In this work, we study a two-mode bosonic encoding of a quoctit inside a non-Abelian group-structured constellation of coherent states. This work is motivated by the importance of nonabelian symmetry in particle physics and the desire to have transversal nonabelian logical gates. We use the previously developed $2T$-constellation of states used to encode a so-called $2T$-qutrit. The fidelity of the $2T$-quoctit is benchmarked against other bosonic qudits for different noise models and find it compare favorably when power constraints are considered. This paves the way for the construction of higher-dimensional qudits (e.g. a quicosotetrit with $2T$ group structure) in bosonic systems with practical applications in quantum simulations of particle physics.

quant-ph↗

arXiv2025

Ultracoherent superconducting cavity-based multiqudit platform with error-resilient control

Realizing the promise of quantum computing requires simultaneously increasing Hilbert-space size and coherence times. While qubit-based architectures have long been the dominant paradigm, large local Hilbert spaces enable qudits, which offer more compact circuits and natural representations for quantum simulation in chemistry, condensed matter, and high-energy physics. Superconducting radio-frequency (SRF) cavities are attractive building blocks for qudit-based quantum technologies because of their exceptionally low dissipation and large bosonic Hilbert spaces, but turning them into programmable modules requires extra effort because the nonlinear circuitry required for control and measurement often introduces loss and noise that erode the memory advantage. Here we demonstrate a two-mode SRF cavity module weakly coupled to an ancillary transmon circuit and engineered to suppress controller-induced dissipation and dephasing, achieving single-photon lifetimes of 20.6 ms and 15.6 ms and a dephasing time exceeding 40 ms. Using sideband interactions together with error-resilient protocols incorporating measurement-based correction and post-selection, we prepare Fock states up to $N=20$ with fidelities exceeding 95% and generate two-mode entanglement near the coherence limit, approaching 99.9%. By combining ultracoherent storage with high-fidelity control, this work moves cavity-based hardware beyond memory-only operation and establishes a practical route toward high-dimensional encodings and scalable modular quantum information processing.

quant-ph↗

arXiv2025

Synthesis of Single Qutrit Circuits from Clifford+R

We present two deterministic algorithms to approximate single-qutrit gates. These algorithms utilize the Clifford + $\mathbf{R}$ group to find the best approximation of diagonal rotations. The first algorithm exhaustively searches over the group; while the second algorithm searches only for Householder reflections. The exhaustive search algorithm yields an average $\mathbf{R}$ count of $2.193(11) + 8.621(7) \log_{10}(1 / \varepsilon)$, albeit with a time complexity of $\mathcal{O}(\varepsilon^{-4.4})$. The Householder search algorithm results in a larger average $\mathbf{R}$ count of $3.20(13) + 10.77(3) \log_{10}(1 / \varepsilon)$ at a reduced time complexity of $\mathcal{O}(\varepsilon^{-0.42})$, greatly extending the reach in $\varepsilon$. These costs correspond asymptotically to 35% and 69% more non-Clifford gates compared to synthesizing the same unitary with two qubits. Such initial results are encouraging for using the $\mathbf{R}$ gate as the non-transversal gate for qutrit-based computation.

quant-ph↗

arXiv2024

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(\theta,\phi)$, 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(\theta)$ 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↗

arXiv2024

Surrogate Constructed Scalable Circuits ADAPT-VQE in the Schwinger model

Inspired by recent advancements of simulating periodic systems on quantum computers, we develop a new approach, (SC)$^2$-ADAPT-VQE, to further advance the simulation of these systems. Our approach extends the scalable circuits ADAPT-VQE framework, which builds an ansatz from a pool of coordinate-invariant operators defined for arbitrarily large, though not arbitrarily small, volumes. Our method uses a classically tractable ``Surrogate Constructed'' method to remove irrelevant operators from the pool, reducing the minimum size for which the scalable circuits are defined. Bringing together the scalable circuits and the surrogate constructed approaches forms the core of the (SC)$^2$ methodology. Our approach allows for a wider set of classical computations, on small volumes, which can be used for a more robust extrapolation protocol. While developed in the context of lattice models, the surrogate construction portion is applicable to a wide variety of problems where information about the relative importance of operators in the pool is available. As an example, we use it to compute properties of the Schwinger model - quantum electrodynamics for a single, massive fermion in $1+1$ dimensions - and show that our method can be used to accurately extrapolate to the continuum limit.

quant-ph↗

arXiv2024

Highly-efficient quantum Fourier transformations for some nonabelian groups

Quantum Fourier transformations are an essential component of many quantum algorithms, from prime factoring to quantum simulation. While the standard abelian QFT is well-studied, important variants corresponding to \emph{nonabelian} groups of interest have seen less development. In particular, fast nonabelian Fourier transformations are important components for both quantum simulations of field theories as well as approaches to the nonabelian hidden subgroup problem. In this work, we present fast quantum Fourier transformations for a number of nonabelian groups of interest for high energy physics, $\mathbb{BT}$, $\mathbb{BO}$, $\Delta(27)$, $\Delta(54)$, and $\Sigma(36\times3)$. For each group, we derive explicit quantum circuits and estimate resource scaling for fault-tolerant implementations. Our work shows that the development of a fast Fourier transformation can substantively reduce simulation costs by up to three orders of magnitude for the finite groups that we have investigated.

quant-ph↗

arXiv2024

Digitization and subduction of $SU(N)$ gauge theories

The simulation of lattice gauge theories on quantum computers necessitates digitizing gauge fields. One approach involves substituting the continuous gauge group with a discrete subgroup, but the implications of this approximation still need to be clarified. To gain insights, we investigate the subduction of $ SU(2) $ and $ SU(3)$ to discrete crystal-like subgroups. Using classical lattice calculations, we show that subduction offers valuable information based on subduced direct sums, helping us identify additional terms to incorporate into the lattice action that can mitigate the effects of digitization. Furthermore, we compute the static potentials of all irreducible representations of $ Σ(360 \times 3) $ at a fixed lattice spacing. Our results reveal a percent-level agreement with the Casimir scaling of ( SU(3) ) for irreducible representations that subduce to a single $ Σ(360 \times 3) $ irreducible representation. This provides a diagnostic measure of approximation quality, as some irreducible representations closely match the expected results while others exhibit significant deviations.

hep-lat↗

arXiv2024

Block Encodings of Discrete Subgroups on Quantum Computer

We introduce a block encoding method for mapping discrete subgroups to qubits on a quantum computer. This method is applicable to general discrete groups, including crystal-like subgroups such as $\mathbb{BI}$ of $SU(2)$ and $\mathbb{V}$ of $SU(3)$. We detail the construction of primitive gates -- the inversion gate, the group multiplication gate, the trace gate, and the group Fourier gate -- utilizing this encoding method for $\mathbb{BT}$ and for the first time $\mathbb{BI}$ group. We also provide resource estimations to extract the gluon viscosity. The inversion gates for $\mathbb{BT}$ and $\mathbb{BI}$ are benchmarked on the $\texttt{Baiwang}$ quantum computer with estimated fidelities of $40^{+5}_{-4}\%$ and $4^{+5}_{-3}\%$ respectively.

hep-lat↗

arXiv2024

Primitive Quantum Gates for an SU(3) Discrete Subgroup: $\Sigma(36\times3)$

We construct the primitive gate set for the digital quantum simulation of the 108-element $\Sigma(36\times3)$ group. This is the first time a nonabelian crystal-like subgroup of $SU(3)$ has been constructed for quantum simulation. The gauge link registers and necessary primitives -- the inversion gate, the group multiplication gate, the trace gate, and the $\Sigma(36\times3)$ Fourier transform -- are presented for both an eight-qubit encoding and a heterogeneous three-qutrit plus two-qubit register. For the latter, a specialized compiler was developed for decomposing arbitrary unitaries onto this architecture.

hep-lat↗

arXiv2024

Quantum error thresholds for gauge-redundant digitizations of lattice field theories

In the quantum simulation of lattice gauge theories, gauge symmetry can be either fixed or encoded as a redundancy of the Hilbert space. While gauge-fixing reduces the number of qubits, keeping the gauge redundancy can provide code space to mitigate and correct quantum errors by checking and restoring Gauss's law. In this work, we consider the correctable errors for generic finite gauge groups and design the quantum circuits to detect and correct them. We calculate the error thresholds below which the gauge-redundant digitization with Gauss's law error correction has better fidelity than the gauge-fixed digitization. Our results provide guidance for fault-tolerant quantum simulations of lattice gauge theories.

hep-lat↗

arXiv2023

Primitive Quantum Gates for an $SU(2)$ Discrete Subgroup: Binary Octahedral

We construct a primitive gate set for the digital quantum simulation of the 48-element binary octahedral ($\mathbb{BO}$) group. This nonabelian discrete group better approximates $SU(2)$ lattice gauge theory than previous work on the binary tetrahedral group at the cost of one additional qubit -- for a total of six -- per gauge link. The necessary primitives are the inversion gate, the group multiplication gate, the trace gate, and the $\mathbb{BO}$ Fourier transform.

hep-lat↗

arXiv2023

Simulating $\mathbb{Z}_2$ lattice gauge theory on a quantum computer

The utility of quantum computers for simulating lattice gauge theories is currently limited by the noisiness of the physical hardware. Various quantum error mitigation strategies exist to reduce the statistical and systematic uncertainties in quantum simulations via improved algorithms and analysis strategies. We perform quantum simulations of $1+1d$ $\mathbb{Z}_2$ gauge theory with matter to study the efficacy and interplay of different error mitigation methods: readout error mitigation, randomized compiling, rescaling, and dynamical decoupling. We compute Minkowski correlation functions in this confining gauge theory and extract the mass of the lightest spin-1 state from fits to their time dependence. Quantum error mitigation extends the range of times over which our correlation function calculations are accurate by a factor of six and is therefore essential for obtaining reliable masses.

hep-lat↗