arXiv subjects

Angus Kan

Publications and source records attributed to Angus Kan.

13 recordsLinked to original sources

arXiv2026

Compiling the 2D Fermi-Hubbard ground-state energy estimation algorithm for active volume quantum architectures

As quantum computing enters the early fault-tolerant era, circuit compilation choices will increasingly depend on details of the underlying architecture rather than solely optimizing for generic proxies such as non-Clifford count. We present an active-volume-aware compilation of the ground-state energy estimation algorithm for the two-dimensional Fermi-Hubbard model using quantum phase estimation and Trotterized time evolution. The proposed compilation reduces the active volume across $L\times L$ square lattices with $L=4$ to $20$, achieving up to a $3.9\times$ reduction over prior work optimized for non-Clifford cost. As a by-product of these compilation improvements, the resulting circuits also achieve state-of-the-art Toffoli counts, with a ~$2\times$ reduction for the $L=20$ case. Lastly, the active volume architecture and recent execution scheduling advances provide a means of translating these reduction trends into runtime. This demonstrates the increasing importance of architecture-aware compilation for practical early fault-tolerant quantum computing.

quant-ph↗

arXiv2026

Fault-tolerant quantum algorithms for simulating atomic nuclei

To maximize the value of fault-tolerant quantum computers, it is essential to develop concrete applications beyond well-established domains such as chemistry and condensed-matter physics. Here we construct and compile quantum algorithms to simulate the structure of atomic nuclei -- a topic that has received relatively little attention from the quantum computing community despite its similarities to the electronic structure problem in chemistry -- via effective shell-model Hamiltonians and no-core-shell-model Hamiltonians with three-body interactions derived from chiral effective field theory. Furthermore, we provide quantum resource estimates, in terms of Toffoli gate and qubit counts, for these algorithms, which, to our knowledge, are the first such estimates for fault-tolerant quantum simulation of atomic nuclei. Notably, the estimates for $^{32}$Mg and $^{219}$At shell-model Hamiltonians are comparable to recent estimates of Femoco simulations, a standard benchmark in chemistry. For no-core-shell-model Hamiltonians suitable for light nuclei (up to $^{40}$Ca or so), we find that resource requirements are significantly higher, suggesting that more bespoke strategies are required to make such simulations practicable. Throughout this work, we draw upon the similarities between nuclear and electronic structure problems, while also highlighting challenges that are specific to the former. We hope this work will spur long-term collaborations between the nuclear and quantum computing community with the ultimate goal of realizing useful nuclear simulations on quantum computers.

quant-ph↗

arXiv2025

Optimized quantum algorithms for simulating the Schwinger effect

The Schwinger model, which describes lattice quantum electrodynamics in $1+1$ space-time dimensions, provides a valuable framework to investigate fundamental aspects of quantum field theory, and a stepping stone towards non-Abelian gauge theories. Specifically, it enables the study of physically relevant dynamical processes, such as the nonperturbative particle-antiparticle pair production, known as the Schwinger effect. In this work, we analyze the quantum computational resource requirements associated with simulating the Schwinger effect under two distinct scenarios: (1) a quench process, where the initial state is a simple product state of a non-interacting theory and then interactions are turned on at time $t=0$, and (2) a splitting (or scattering) process where two Gaussian states, peaked at given initial momenta, are shot away from (or towards) each other. We explore different physical regimes in which the Schwinger effect is expected to be observable. These regimes are characterized by initial momenta and coupling strengths, as well as simulation parameters such as lattice size and electric-field cutoffs. Leveraging known rigorous bounds for electric-field cutoffs, we find that a reliable simulation of the Schwinger effect is provably possible at high cutoff scales. Furthermore, we provide optimized circuit implementations of both the second-order Trotter formula and an interaction-picture algorithm based on the Dyson series to implement the time evolution. Our detailed resource estimates show the regimes in which the interaction-picture approach outperforms the Trotter approach, and vice versa. The improved theoretical error bounds, optimized quantum circuit designs, and explicitly compiled subroutines developed in this study are broadly applicable to simulations of other lattice models in high-energy physics and beyond.

quant-ph↗

arXiv2025

Quantum resource estimates for computing binary elliptic curve discrete logarithms

We perform logical and physical resource estimation for computing binary elliptic curve discrete logarithms using Shor's algorithm on fault-tolerant quantum computers. We adopt a windowed approach to design our circuit implementation of the algorithm, which comprises repeated applications of elliptic curve point addition operations and table look-ups. Unlike previous work, the point addition operation is implemented exactly, including all exceptional cases. We provide exact logical gate and qubit counts of our algorithm for cryptographically relevant binary field sizes. Furthermore, we estimate the hardware footprint and runtime of our algorithm executed on surface-code matter-based quantum computers with a baseline architecture, where logical qubits have nearest-neighbor connectivity, and on a surface-code photonic fusion-based quantum computer with an active-volume architecture, which enjoys a logarithmic number of non-local connections between logical qubits. At 10$\%$ threshold and compared to a baseline device with a $1\mu s$ code cycle, our algorithm runs $\gtrsim$ 2-20 times faster, depending on the operating regime of the hardware and over all considered field sizes, on a photonic active-volume device.

quant-ph↗

arXiv2024

Resource-optimized fault-tolerant simulation of the Fermi-Hubbard model and high-temperature superconductor models

Exploring low-cost applications is paramount to creating value in early fault-tolerant quantum computers. Here we optimize both gate and qubit counts of recent algorithms for simulating the Fermi-Hubbard model. We further devise and compile algorithms to simulate established models of cuprate and pnictide high-temperature superconductors, which include beyond-nearest-neighbor hopping terms and multi-orbital interactions that are absent in the Fermi-Hubbard model. We show that simulations of these more realistic models of high-temperature superconductors require only an order of magnitude or so more Toffoli gates than a simulation of the Fermi-Hubbard model. Furthermore, we find plenty classically difficult instances with Toffoli and qubit counts that far lower than commonly considered quantum phase estimation circuits for electronic structure problems in quantum chemistry. We believe our results pave the way towards studying high-temperature superconductors on early fault-tolerant quantum computers.

quant-ph↗

arXiv2023

Option pricing under stochastic volatility on a quantum computer

We develop quantum algorithms for pricing Asian and barrier options under the Heston model, a popular stochastic volatility model, and estimate their costs, in terms of T-count, T-depth and number of logical qubits, on instances under typical market conditions. These algorithms are based on combining well-established numerical methods for stochastic differential equations and quantum amplitude estimation technique. In particular, we empirically show that, despite its simplicity, weak Euler method achieves the same level of accuracy as the better-known strong Euler method in this task. Furthermore, by eliminating the expensive procedure of preparing Gaussian states, the quantum algorithm based on weak Euler scheme achieves drastically better efficiency than the one based on strong Euler scheme. Our resource analysis suggests that option pricing under stochastic volatility is a promising application of quantum computers, and that our algorithms render the hardware requirement for reaching practical quantum advantage in financial applications less stringent than prior art.

quant-ph↗

arXiv2023

Flexible entangled state generation in linear optics

Fault-tolerant quantum computation can be achieved by creating constant-sized, entangled resource states and performing entangling measurements on subsets of their qubits. Linear optical quantum computers can be designed based on this approach, even though entangling operations at the qubit level are non-deterministic in this platform. Probabilistic generation and measurement of entangled states must be pushed beyond the required threshold by some combination of scheme optimisation, introduction of redundancy and auxiliary state assistance. We report progress in each of these areas. We explore multi-qubit fusion measurements on dual-rail photonic qubits and their role in measurement-based resource state generation, showing that it is possible to boost the success probability of photonic GHZ state analysers with single photon auxiliary states. By incorporating generators of basic entangled "seed" states, we provide a method that simplifies the process of designing and optimising generators of complex, encoded resource states by establishing links to ZX diagrams.

quant-ph↗

arXiv2023

High photon-loss threshold quantum computing using GHZ-state measurements

We propose fault-tolerant architectures based on performing projective measurements in the Greenberger-Horne-Zeilinger (GHZ) basis on constant-sized, entangled resource states. We present linear-optical constructions of the architectures, where the GHZ-state measurements are encoded to suppress the errors induced by photon loss and the probabilistic nature of linear optics. Simulations of our constructions demonstrate high single-photon loss thresholds compared to the state-of-the-art linear-optical architecture realized with encoded two-qubit fusion measurements performed on constant-sized resource states. We believe this result shows a resource-efficient path to achieving photonic fault-tolerant quantum computing.

quant-ph↗

arXiv2021

3+1D $\theta$-Term on the Lattice from the Hamiltonian Perspective

Quantum and tensor network simulations have emerged as prominent sign-problem free approaches to lattice gauge theories. Unlike conventional Markov chain Monte Carlo methods, they are based on the Hamiltonian formulation. In this talk, we fill a gap in the literature and present the first derivation of the Hamiltonian 3+1D $\theta$-term -- which is an important sign-problem afflicted term -- for Abelian and non-Abelian lattice gauge theories. Furthermore, we perform exact diagonalization for a 3+1D U(1) lattice gauge theory including the $\theta$-term on a unit periodic cube. Our numerical results reveal a novel phase transition at fixed values of $\theta$ in the strong-coupling regime. The transition is evidenced by an avoided level crossing in the ground state energy, as well as sudden changes in the plaquette expectation value, the electric energy density, and the topological charge density. Extensions of our work to larger lattices can be readily performed using state-of-the-art tensor network simulations. Moreover, our work provides a concrete starting point for an eventual quantum simulation of the $\theta$-dependent phase structure and dynamics of lattice gauge theories in 3+1D. This talk is mainly based on [1]. We expand beyond [1] by including a derivation of the (non-)Abelian fixed-length Higgs term in the Hamiltonian formulation for future studies of (non-)Abelian-Higgs models with a $\theta$-term.

hep-lat↗

arXiv2021

Lattice Quantum Chromodynamics and Electrodynamics on a Universal Quantum Computer

It is widely anticipated that a large-scale quantum computer will offer an evermore accurate simulation of nature, opening the floodgates for exciting scientific breakthroughs and technological innovations. Here, we show a complete, instruction-by-instruction rubric to simulate U(1), SU(2), and SU(3) lattice gauge theories on a quantum computer. These theories describe quantum electrodynamics and chromodynamics, the key ingredients that form the fabric of our universe. We further provide a concrete estimate of the quantum computational resources required for an accurate simulation of lattice gauge theories using a second-order product formula. We show that lattice gauge theories in any spatial dimension can be simulated using $\tilde{O}(T^{3/2}N^{3/2}\Lambda/\epsilon^{1/2})$ T gates, where $N$ is the number of lattice sites, $\Lambda$ is the bosonic gauge field truncation, and $T$ is the simulation time.

quant-ph↗

arXiv2021

Investigating a (3+1)D Topological $\theta$-Term in the Hamiltonian Formulation of Lattice Gauge Theories for Quantum and Classical Simulations

Quantum technologies offer the prospect to efficiently simulate sign-problem afflicted regimes in lattice field theory, such as the presence of topological terms, chemical potentials, and out-of-equilibrium dynamics. In this work, we derive the (3+1)D topological $\theta$-term for Abelian and non-Abelian lattice gauge theories in the Hamiltonian formulation, paving the way towards Hamiltonian-based simulations of such terms on quantum and classical computers. We further study numerically the zero-temperature phase structure of a (3+1)D U(1) lattice gauge theory with the $\theta$-term via exact diagonalization for a single periodic cube. In the strong coupling regime, our results suggest the occurrence of a phase transition at constant values of $\theta$, as indicated by an avoided level-crossing and abrupt changes in the plaquette expectation value, the electric energy density, and the topological charge density. These results could in principle be cross-checked by the recently developed (3+1)D tensor network methods and quantum simulations, once sufficient resources become available.

hep-lat↗

arXiv2020

Towards simulating 2D effects in lattice gauge theories on a quantum computer

Gauge theories are the most successful theories for describing nature at its fundamental level, but obtaining analytical or numerical solutions often remains a challenge. We propose an experimental quantum simulation scheme to study ground state properties in two-dimensional quantum electrodynamics (2D QED) using existing quantum technology. The proposal builds on a formulation of lattice gauge theories as effective spin models in arXiv:2006.14160, which reduces the number of qubits needed by eliminating redundant degrees of freedom and by using an efficient truncation scheme for the gauge fields. The latter endows our proposal with the perspective to take a well-controlled continuum limit. Our protocols allow in principle scaling up to large lattices and offer the perspective to connect the lattice simulation to low energy observable quantities, e.g. the hadron spectrum, in the continuum theory. By including both dynamical matter and a non-minimal gauge field truncation, we provide the novel opportunity to observe 2D effects on present-day quantum hardware. More specifically, we present two Variational Quantum Eigensolver (VQE) based protocols for the study of magnetic field effects, and for taking an important first step towards computing the running coupling of QED. For both instances, we include variational quantum circuits for qubit-based hardware, which we explicitly apply to trapped ion quantum computers. We simulate the proposed VQE experiments classically to calculate the required measurement budget under realistic conditions. While this feasibility analysis is done for trapped ions, our approach can be easily adapted to other platforms. The techniques presented here, combined with advancements in quantum hardware pave the way for reaching beyond the capabilities of classical simulations by extending our framework to include fermionic potentials or topological terms.

quant-ph↗

arXiv2020

A resource efficient approach for quantum and classical simulations of gauge theories in particle physics

Gauge theories establish the standard model of particle physics, and lattice gauge theory (LGT) calculations employing Markov Chain Monte Carlo (MCMC) methods have been pivotal in our understanding of fundamental interactions. The present limitations of MCMC techniques may be overcome by Hamiltonian-based simulations on classical or quantum devices, which further provide the potential to address questions that lay beyond the capabilities of the current approaches. However, for continuous gauge groups, Hamiltonian-based formulations involve infinite-dimensional gauge degrees of freedom that can solely be handled by truncation. Current truncation schemes require dramatically increasing computational resources at small values of the bare couplings, where magnetic field effects become important. Such limitation precludes one from `taking the continuous limit' while working with finite resources. To overcome this limitation, we provide a resource-efficient protocol to simulate LGTs with continuous gauge groups in the Hamiltonian formulation. Our new method allows for calculations at arbitrary values of the bare coupling and lattice spacing. The approach consists of the combination of a Hilbert space truncation with a regularization of the gauge group, which permits an efficient description of the magnetically-dominated regime. We focus here on Abelian gauge theories and use $2+1$ dimensional quantum electrodynamics as a benchmark example to demonstrate this efficient framework to achieve the continuum limit in LGTs. This possibility is a key requirement to make quantitative predictions at the field theory level and offers the long-term perspective to utilise quantum simulations to compute physically meaningful quantities in regimes that are precluded to quantum Monte Carlo.

quant-ph↗