arXiv subjects

Adam Gammon-Smith

Publications and source records attributed to Adam Gammon-Smith.

10 recordsLinked to original sources

arXiv2026

Quantum trajectory simulation of two-dimensional non-equilibrium steady states with a trapped ion quantum processor

Digital quantum computers offer a promising route for studying complex many-body systems that are otherwise inaccessible by their classical counterparts. Capabilities including mid-circuit measurements and feedback allow for simulating the dynamics of interacting open quantum systems. Using the Quantinuum System Model H1 trapped-ion quantum computer, we experimentally realise quantum trajectories for a two-dimensional system of (interacting) particles-hard-core bosons or fermions-undergoing stochastic driving at a source and drain at opposite corners of a square lattice. We study the non-equilibrium steady state with persistent current resulting from the this in/out flow of particles. The particle statistics, presence of interactions, and introduction of a magnetic field produce measurable effects on the steady state. Our findings highlight the rich physics in this corner driven two-dimensional setup and showcases both the power and current limitations of quantum computers as a platform to study it.

quant-ph↗

arXiv2026

Matchgate circuit representation of fermionic Gaussian states: optimal preparation, approximation, and classical simulation

Fermionic Gaussian states (FGSs) and the associated matchgate circuits play a central role in quantum information theory and condensed matter physics. Despite being possibly highly entangled, they can still be efficiently simulated on classical computers. We address the question of how to optimally create such states when using matchgate circuits acting on product states. To this end, we derive lower bounds on the number of gates required to prepare an arbitrary pure FGS: We establish both an asymptotic bound on the minimal gate count over general nearest-neighbor gate sets and an exact bound for circuits composed solely of matchgates. We present explicit algorithms whose constructions saturate these bounds, thereby proving their optimality. We furthermore determine when an FGS can be prepared with a circuit of any given depth, and derive an algorithm that constructs such a circuit whenever this condition is satisfied, either exactly or approximately. Our results have direct applications to (approximate) state preparation and to disentangling procedures. Moreover, we introduce a new classical simulation algorithm for matchgate circuits, based entirely on manipulating the generating circuits of the FGSs. Finally, we briefly study an extension of our framework for $t$-doped Gaussian states and circuits.

quant-ph↗

arXiv2026

Topological Superconductivity in Altermagnetic Heterostructures on a Honeycomb Lattice

Altermagnet-superconductor heterostructures have been shown, in principle, to provide a route towards realising topological superconductivity, and therefore host topologically protected boundary states. In this work we demonstrate that the topological states observed are dependent on the structure of the underlying lattice. By deriving and analysing a model on a honeycomb lattice, we demonstrate that the topological phase diagram has a rich structure containing both chiral edge modes and Majorana corner modes, the latter of which are an indication of higher-order topology. We analyse the effect of disorder on these states and find that whilst the edge modes are robust to a disordered system, any potential observation of the corner modes may be sensitive to the microscopic details. In particular, we show that vacancies can lead to other low energy bound states that may be difficult to distinguish from the corner modes.

cond-mat.mes-hall↗

arXiv2025

Simulating Topological Order on Quantum Processors

It is an ongoing quest to realize topologically ordered quantum states on different platforms including condensed matter systems, quantum simulators and digital quantum processors. Unlike conventional states characterized by their local order, these exotic states are characterized by their non-local entanglement. The consequences of topological order can be as profound as they are surprising, ranging from the emergence of fractionalized anyonic excitations to potentially providing a scalable platform for quantum error correction. This deep connection to quantum computing naturally motivates the realization and study of topologically ordered quantum states on quantum processors. However, due to the non-local nature of these states, their study presents a challenge for near-term quantum devices. This Perspective aims to review the recent progress towards the experimental realization of topologically ordered quantum states, their potential applications, and promising directions of future research.

cond-mat.str-el↗

arXiv2025

Phases of Interacting Fibonacci Anyons on a Ladder at Half-Filling

Two-dimensional many-body quantum systems can exhibit topological order and support collective excitations with anyonic statistics different from the usual fermionic or bosonic ones. With the emergence of these exotic point-like particles, it is natural to ask what phases can arise in interacting many-anyon systems. To study this topic, we consider the particular case of Fibonacci anyons subject to an anyonic tight-binding model with nearest-neighbor repulsion on a two-leg ladder. Focusing on the case of half-filling, for low interaction strengths an ``anyonic'' metal is found, whereas for strong repulsion, the anyons form an insulating charge-density wave. Within the latter regime, we introduce an effective one-dimensional model up to sixth order in perturbation theory arising from anyonic superexchange processes. We numerically identify four distinct phases of the effective model, which we characterize using matrix product state methods. These include both the ferro- and antiferromagnetic golden chain phases, as well as phases with $\mathbb{Z}_2$ and incommensurate correlations.

cond-mat.str-el↗

arXiv2025

Disentangling strategies and entanglement transitions in unitary circuit games with matchgates

In unitary circuit games, two competing parties, an "entangler" and a "disentangler", can induce an entanglement phase transition in a quantum many-body system. The transition occurs at a certain rate at which the disentangler acts. We analyze such games within the context of matchgate dynamics, which equivalently corresponds to evolutions of non-interacting fermions. We first investigate general entanglement properties of fermionic Gaussian states (FGS). We introduce a representation of FGS using a minimal matchgate circuit capable of preparing the state and derive an algorithm based on a generalized Yang-Baxter relation for updating this representation as unitary operations are applied. This representation enables us to define a natural disentangling procedure that reduces the number of gates in the circuit, thereby decreasing the entanglement contained in the system. We then explore different strategies to disentangle the systems and study the unitary circuit game in two different scenarios: with braiding gates, i.e., the intersection of Clifford gates and matchgates, and with generic matchgates. For each model, we observe qualitatively different entanglement transitions, which we characterize both numerically and analytically.

quant-ph↗

arXiv2025

Translation symmetry restoration in integrable systems: the noninteracting case

The study of symmetry restoration has recently emerged as a fruitful means to extract high-level information on the relaxation of quantum many-body systems. However, while the restoration of internal symmetries has been investigated intensively, that of spatial symmetries has hitherto only been considered in the context of random unitary circuits. Here we present a complementary study of translation symmetry restoration in integrable systems. In particular, we consider a one-dimensional chain of spinless, non-interacting fermions quenched from a $\nu>1$ shift invariant state, and follow the local restoration of one-site shift invariance using the Frobenius distance $\Delta F_A$ between the state on a subsystem and its symmetrised counterpart. Distinct from the case of random unitary circuits, where symmetry restoration occurs abruptly for times proportional to the subsystem size, we find that symmetry here is restored smoothly and over timescales of the order of the subsystem size squared. We also find that the so-called `quantum Mpemba effect' is readily observed. Most importantly, we show that - in contrast to the case of continuous internal symmetries - this discrete symmetry restoration is not qualitatively described by a quasiparticle picture for $\Delta F_A$, and therefore goes beyond the hydrodynamic description. Our results can be directly extended to higher dimensions.

cond-mat.stat-mech↗

arXiv2024

A recipe for local simulation of strongly-correlated fermionic matter on quantum computers: the 2D Fermi-Hubbard model

The simulation of quantum many-body systems, relevant for quantum chemistry and condensed matter physics, is one of the most promising applications of near-term quantum computers before fault-tolerance. However, since the vast majority of quantum computing technologies are built around qubits and discrete gate-based operations, the translation of the physical problem into this framework is a crucial step. This translation will often be device specific, and a suboptimal implementation will be punished by the exponential compounding of errors on real devices. The importance of an efficient mapping is already revealed for models of spinful fermions in two or three dimensions, which naturally arise when the relevant physics relates to electrons. Using the most direct and well-known mapping, the Jordan-Wigner transformation, leads to a non-local representation of local degrees of freedom, and necessities efficient decompositions of non-local unitary gates into a sequence of hardware accessible local gates. In this paper, we provide a step-by-step recipe for simulating the paradigmatic two-dimensional Fermi-Hubbard model on a quantum computer using only local operations. To provide the ingredients for such a recipe, we briefly review the plethora of different approaches that have emerged recently but focus on the Derby-Klassen compact fermion mapping in order to make our discussion concrete. We provide a detailed recipe for an end-to-end simulation including embedding on a physical device, preparing initial states such as ground states, simulation of unitary time evolution, and measurement of observables and spectral functions. We explicitly compute the resource requirements for simulating a global quantum quench and conclude by discussing the challenges and future directions for simulating strongly-correlated fermionic matter on quantum computers.

quant-ph↗

arXiv2023

Scalable simulation of non-equilibrium quantum dynamics via classically optimised unitary circuits

The advent of near-term digital quantum computers could offer us an exciting opportunity to investigate quantum many-body phenomena beyond that of classical computing. To make the best use of the hardware available, it is paramount that we have methods that accurately simulate Hamiltonian dynamics for limited circuit depths. In this paper, we propose a method to classically optimise unitary brickwall circuits to approximate quantum time evolution operators. Our method is scalable in system size through the use of tensor networks. We demonstrate that, for various three-body Hamiltonians, our approach produces quantum circuits that can outperform Trotterization in both their accuracy and the quantum circuit depth needed to implement the dynamics, with the exact details being dependent on the Hamiltonian. We also explain how to choose an optimal time step that minimises the combined errors of the quantum device and the brickwall circuit approximation.

quant-ph↗

arXiv2023

Quench dynamics in lattices above one dimension: the free fermionic case

We begin a systematic investigation of quench dynamics in higher-dimensional lattice systems considering the case of non-interacting fermions with conserved particle number. We prepare the system in a translational-invariant non-equilibrium initial state -- the simplest example being a classical configuration with fermions at fixed positions on the lattice -- and let it to evolve in time. We characterise the system's dynamics by measuring the entanglement between a finite connected region and its complement. We observe the transmutation of entanglement entropy into thermodynamic entropy and investigate how this process depends on the shape and orientation of the region with respect to the underlying lattice. Interestingly, we find that irregular regions display a distinctive multi-slope entanglement growth, while the dependence on the orientation angle is generically fairly weak. This is particularly true for regions with a large (discrete) rotational symmetry group. The main tool of our analysis is the celebrated quasiparticle picture of Calabrese and Cardy, which we generalise to describe the case at hand. Specifically, we show that for generic initial configurations (even when restricting to classical ones) one has to allow for the production of multiplets involving ${n>2}$ quasiparticles and carrying non-diagonal correlations. We obtain quantitatively accurate predictions -- tested against exact numerics -- and propose an efficient Monte Carlo-based scheme to evaluate them for arbitrary connected regions of generic higher dimensional lattices.

quant-ph↗