arXiv subjects

Henrik Dreyer

Publications and source records attributed to Henrik Dreyer.

At least 19 recordsLinked to original sources

arXiv2026

Backpropagating Pauli Propagation

We develop a backpropagation algorithm for evaluating parameter gradients in quantum circuits using Pauli propagation simulation. The method has computational complexity comparable to that of standard sparse Pauli simulation techniques, while producing gradients whose accuracy is of the same order as the corresponding observable expectation values. By exploiting the reversibility of quantum circuits, the algorithm reduces the memory cost by a factor of $\mathcal{O}(n_\text{param})$ compared with conventional reverse-mode automatic differentiation, where $n_\text{param}$ denotes the number of parameters in the circuit. Compared with finite difference methods, the algorithm is $\mathcal{O}(n_\text{param})$ more efficient in function evaluations. These features enable efficient and accurate classical optimization of quantum circuits for applications such as state preparation and time-evolution compression, while also allowing operator-complexity measures such as the operator stabilizer Rényi entropy to be monitored and regularized during optimization. We demonstrate the method by optimizing low-energy state-preparation circuits for transverse-field Ising models in one, two, and three dimensions and for the three-dimensional Heisenberg model, and by compressing two-dimensional time-evolution circuits.

quant-ph↗

arXiv2026

Dynamical structure factor with a pumping approach on a trapped-ion quantum computer

Dynamical structure factors (DSF) measured with neutron-scattering experiments provide key insights into the structure of materials. Their computation requires both the preparation of an equilibrium state and the implementation of Hamiltonian dynamics. We demonstrate the feasibility of computing DSF on the Quantinuum Reimei trapped-ion quantum computer, comparing the DSF of 1D Heisenberg model on $20$ sites, and that of the copper sulfate crystal. To that end, we introduce a pumping approach for computing the DSF $S(q,ω)$ on quantum computers that enables targeting specific arbitrary values of frequencies $ω$. This method time-evolves the initial state using a time-dependent Hamiltonian perturbed by a source term oscillating at the target frequency $ω$. When targeting only a few frequency values, this approach provides a significant reduction in shot overhead compared to previous methods.

quant-ph↗

arXiv2026

Universal Gates from Braiding and Fusing Anyons on Quantum Hardware

Topological quantum computation encodes quantum information in the internal fusion space of non-Abelian anyonic quasiparticles, whose braiding implements logical gates. This goes beyond Abelian topological order (TO) such as the toric code, as its anyons lack internal structure. However, the simplest non-Abelian generalizations of the toric code do not support universality via braiding alone. Here we demonstrate that such minimally non-Abelian TOs can be made universal by treating anyon fusion as a computational primitive. We prepare a 54-qubit TO wavefunction associated with the smallest non-Abelian group, $S_3$, on Quantinuum's H2 quantum processor. This phase of matter exhibits cyclic anyon fusion rules, known to underpin universality, which we evidence by trapping a single non-Abelian anyon on the torus. We encode logical qutrits in the nonlocal fusion space of non-Abelian fluxes and, by combining an entangling braiding operation with anyon charge measurements, realize a universal topological gate set and read-out, which we further demonstrate by topologically preparing a magic state. This work establishes $S_3$ TO as simple enough to be prepared efficiently, yet rich enough to enable universal topological quantum computation.

quant-ph↗

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

Spectral functions on a quantum computer through system-environment interaction

Spectral functions measured with angle-resolved photoemission spectroscopy (ARPES) provide key insight to elucidate the band structure of materials. Comparison with theory requires computing dynamical one-point functions in some equilibrium state, which can be classically challenging. Their measurement on quantum computers poses multiple problems and comes with a large sampling overhead when standard techniques are used. We introduce an efficient way of measuring spectral functions on a quantum computer by directly modeling the interaction of the system with the environment involved in ARPES experiments. We develop quantum circuits whose local expectation values are proportional to the spectral function $A(k,ω)$ for all momentum $k$ and a specific chosen frequency $ω$. Although coming with a qubit and two-qubit gate overhead, our approach requires $O(N)$ times less sampling than previous approaches, translating into a factor $O(N)$ faster in runtime, and is particularly adapted to ion-trap quantum computers. The algorithm requires to implement a fermionic Fourier transform (FFT). We write out an efficient gate decomposition for generic radix-$n$ FFT and benchmark it on hardware for radix-$3$ on $27$ qubits. We finally demonstrate our algorithm on a Quantinuum System Model H2 ion-trap system, computing the spectral function on a one-dimensional system of $27$ sites, using $54$ qubits.

quant-ph↗

arXiv2026

Digital quantum magnetism on a trapped-ion quantum computer

Digital quantum matter -- realized when discrete quantum gates approximate continuous time evolution -- is susceptible to heating into chaotic, structureless states. If digitization errors are adequately suppressed, a long-lived transient regime of approximately energy-conserving dynamics can be observed on gate-based quantum computers. Conservation of energy, in turn, enables the exploration of a wide variety of complex behaviors observed in equilibrium systems, ranging from the nontrivial microscopic origins of thermalization itself to the stabilization of effective models hosting exotic emergent properties. Here, we use Quantinuum's system model H2 quantum computer to simulate digitized dynamics of the quantum Ising model, suppressing digitization errors well enough to observe thermalization on timescales that severely challenge classical simulation methods. Relaxation of an inhomogeneous state reveals an emergent hydrodynamics due to approximate energy conservation, and we compute the associated diffusion constant. By reprogramming our simulations to take place on a triangular lattice with periodic boundary conditions, we observe thermalization consistent with emergent gauge and topological constraints resulting from lattice frustration. Our results were enabled by continued advances in two-qubit gate quality (native partial entangler fidelities of $99.94(1)\%$), and establish digital quantum computers as powerful tools for studying (effectively) continuous-time dynamics.

quant-ph↗

arXiv2026

Adiabatic preparation of thermal states and entropy-noise relation on noisy quantum computers

We consider the problem of preparing thermal equilibrium states at finite temperature on quantum computers. Assuming thermalization, we show that states that are locally at thermal equilibrium can be prepared by evolving adiabatically an initial thermal Gibbs state of a simple Hamiltonian with an interpolating time-dependent Hamiltonian, identically to adiabatic ground state preparation. We argue that the entropy density of local density matrices is conserved during the adiabatic evolution in the thermodynamic limit, so that both the entropy and energy of the final state can be computed, and thus the final temperature too. We show that in the presence of hardware noise, the entropy created by the noisy evolution can be precisely benchmarked with mirror circuits. We give numerical evidence that the resulting thermal state preparation protocol is noise-resilient for depolarizing noise, in the sense that the energy-temperature curve measured on a noisy quantum computer is remarkably insensitive to the amplitude of depolarizing noise in the state preparation. We finally propose a protocol to estimate the lack of adiabaticity in a given actual Trotter implementation of the dynamics. We test our protocol on Quantinuum's H1-1 ion-trap device. We measure that a circuit with $640$ two-qubit gates implemented on hardware generates an entropy per site of $0.166 \pm 0.0045$, giving a benchmark metric for this state preparation. We report the preparation of a thermal state with temperature $2.56 \pm 0.26$ of the Ising model in size $5\times 4$.

quant-ph↗

arXiv2026

Observation of glueball excitations and string breaking in a $2+1$D $\mathbb{Z}_2$ lattice gauge theory on a trapped-ion quantum computer

A major goal of the quantum simulation of high-energy physics (HEP) is to probe real-time nonperturbative far-from-equilibrium quantum processes underlying phenomena such as hadronization in quantum chromodynamics (QCD). The quantum simulation of the dynamics of confining strings and glueballs, both essential aspects of quark confinement, in a controllable first-principles way is an important step towards this goal. Here, we realize a $\mathbb{Z}_2$ lattice gauge theory in $2+1$D with a tunable plaquette term on a \texttt{Quantinuum System Model H2} trapped-ion quantum computer. We implement a shallow depth-6 Trotter circuit on a $6 \times 5$ matter-site square lattice utilizing all $56$ available qubits to execute over $1000$ entangling gates. We prepare far-from-equilibrium initial string configurations that we quench across a range of parameters to observe rich dynamical phenomena, such as the formation of gauge-invariant closed-loop excitations reminiscent of glueballs in QCD and multi-order string breaking accompanied by spontaneous matter creation. We further demonstrate experimentally that the system displays genuine $2+1$D dynamics, as evidenced by string snapshots over time that cannot be trivially mapped to $1+1$D physics. Our results demonstrate digital quantum simulations of nonequilibrium dynamics in a higher-dimensional lattice gauge theory and provide an experimentally accessible setting for phenomena related to confinement physics.

hep-lat↗

arXiv2026

Observation of genuine $2+1$D string dynamics in a U$(1)$ lattice gauge theory with a tunable plaquette term on a trapped-ion quantum computer

Quantum simulations of high-energy physics in $2+1$D can probe dynamical phenomena nonexistent in one spatial dimension and access regimes that are challenging for existing classical simulation methods. For string dynamics -- relevant to hadronization -- a plaquette term is required to realize genuine $2+1$D behavior, as it endows the gauge field with dynamics and enables the propagation of photon-like excitations. Here, we realize a U$(1)$ quantum link model of quantum electrodynamics in two spatial dimensions with a tunable plaquette term on a \texttt{Quantinuum System Model H2} quantum computer. We implement, to our knowledge, the largest quantum simulation of string-breaking dynamics reported to date, on a $5 \times 4$ matter-site square lattice using $51$ qubits. The simulation uses a shallow circuit design with a two-qubit gate depth of $28$ per Trotter step and up to $1540$ entangling gates. Starting from far-from-equilibrium string configurations, we measure the probability for the string to propagate within the lattice plane and find signatures of genuine $2+1$D dynamics only when the plaquette term is present. In a resonant regime, we observe the annihilation of string segments accompanied by the production of electron--positron pairs that screen them. We further find that, only with a nonzero plaquette term, matter creation extends across the lattice plane rather than remaining confined to the initial string path. These results experimentally realize string breaking and demonstrate the emergence of dynamical gauge fields in two spatial dimensions, establishing a route to photon-like propagation in programmable quantum simulators of gauge theories.

quant-ph↗

arXiv2026

Superconducting pairing correlations on a trapped-ion quantum computer

The Fermi-Hubbard model is the starting point for the simulation of many strongly correlated materials, including high-temperature superconductors, whose modelling is a key motivation for the construction of quantum simulation and computing devices. However, the detection of superconducting pairing correlations has so far remained out of reach, both because of their off-diagonal character - which makes them inaccessible to local density measurements - and because of the difficulty of preparing superconducting states. Here, we report measurement of significant pairing correlations in three different regimes of Fermi-Hubbard models simulated on Quantinuum's Helios trapped-ion quantum computer. Specifically, we measure non-equilibrium pairing induced by an electromagnetic field in the half-filled square lattice model, d-wave pairing in an approximate ground state of the checkerboard Hubbard model at $1/6$-doping, and s-wave pairing in a bilayer model relevant to nickelate superconductors. These results show that a quantum computer can reliably create and probe physically relevant states with superconducting pairing correlations, opening a path to the exploration of superconductivity with quantum computers.

quant-ph↗

arXiv2025

Ground State Energy via Adiabatic Evolution and Phase Measurement for a Molecular Hamiltonian on an Ion-Trap Quantum Computer

Estimating molecular ground-state energies is a central application of quantum computing, requiring both the preparation of accurate quantum states and efficient energy readout. Understanding the effect of hardware noise on these experiments is crucial to distinguish errors that have low impact, errors that can be mitigated, and errors that must be reduced at the hardware level. We ran a state preparation and energy measurement protocol on an ion-trap quantum computer, without any non-scalable off-loading of computational tasks to classical computers, and show that leakage errors are the main obstacle to chemical accuracy. More specifically, we apply adiabatic state preparation to prepare the ground state of a six-qubit encoding of the H3+ molecule and extract its energy using a noise-resilient variant of iterative quantum phase estimation. Our results improve upon the classical Hartree-Fock energy. Analyzing the effect of hardware noise on the result, we find that while coherent and incoherent noise have little influence, the hardware results are mainly impacted by leakage errors. Absent leakage errors, noisy numerical simulations show that with our experimental settings we would have achieved close to chemical accuracy, even shot noise included. These insights highlight the importance of targeting leakage suppression in future algorithm and hardware development.

quant-ph↗

arXiv2025

Fermionic dynamics on a trapped-ion quantum computer beyond exact classical simulation

Simulation of the time-dynamics of fermionic many-body systems has long been predicted to be one of the key applications of quantum computers. Such simulations -- for which classical methods are often inaccurate -- are critical to advancing our knowledge and understanding of quantum chemistry and materials, underpinning a wide range of fields, from biochemistry to clean-energy technologies and chemical synthesis. However, the performance of all previous digital quantum simulations of fermions has been matched by classical methods, and it has thus far remained unclear whether near-term, intermediate-scale quantum hardware could offer any computational advantage in this area. Here, we implement an efficient quantum simulation algorithm on Quantinuum's System Model H2 trapped-ion quantum computer for the time dynamics of a 56-qubit system that is too complex for exact classical simulation. We focus on the periodic spinful 2D Fermi-Hubbard model and present evidence of spin-charge separation, where the elementary electron's charge and spin decouple. In the limited cases where ground truth is available through exact classical simulation, we find that it agrees with the results we obtain from the quantum device. Employing long-range Wilson operators to study deconfinement of the effective gauge field between spinons and the effective potential between charge carriers, we find behaviour that differs from predictions made by classical tensor network methods. Our results herald the use of quantum computing for simulating strongly correlated electronic systems beyond the capacity of classical computing.

quant-ph↗

arXiv2025

Simulating sparse SYK model with a randomized algorithm on a trapped-ion quantum computer

The Sachdev-Ye-Kitaev (SYK) model describes a strongly correlated quantum system that shows a strong signature of quantum chaos. Due to its chaotic nature, the simulation of real-time dynamics becomes quickly intractable by means of classical numerics, and thus, quantum simulation is deemed to be an attractive alternative. Nevertheless, quantum simulations of the SYK model on noisy quantum processors are severely limited by the complexity of its Hamiltonian. In this work, we simulate the real-time dynamics of a sparsified version of the SYK model with 24 Majorana fermions on a trapped-ion quantum processor. We adopt a randomized quantum algorithm, TETRIS, and develop an error mitigation technique tailored to the algorithm. Leveraging the hardware's high-fidelity quantum operations and all-to-all connectivity of the qubits, we successfully calculate the Loschmidt amplitude for sufficiently long times so that its decay is observed. Based on the experimental and further numerical results, we assess the future possibility of larger-scale simulations of the SYK model by estimating the required quantum resources. Moreover, we present a scalable mirror-circuit benchmark based on the randomized SYK Hamiltonian and the TETRIS algorithm, which we argue provides a better estimate of the decay of fidelity for local observables than standard mirror-circuits.

quant-ph↗

arXiv2025

BenchQC -- Scalable and modular benchmarking of industrial quantum computing applications

We present BenchQC, a research project funded by the state of Bavaria, which promotes an application-centric perspective for benchmarking real-world quantum applications. Diverse use cases from industry consortium members are the starting point of a benchmarking workflow, that builds on the open-source platform QUARK, encompassing the full quantum software stack from the hardware provider interface to the application layer. By identifying and evaluating key metrics across the entire pipeline, we aim to uncover meaningful trends, provide systematic guidance on quantum utility, and distinguish promising research directions from less viable approaches. Ultimately, this initiative contributes to the broader effort of establishing reliable benchmarking standards that drive the transition from experimental demonstrations to practical quantum advantage.

quant-ph↗

arXiv2025

AppQSim: Application-oriented benchmarks for Hamiltonian simulation on a quantum computer

We introduce AppQSim, a benchmarking suite for quantum computers focused on applications of Hamiltonian simulation. We consider five different settings for which we define a precise task and score: condensed matter and material simulation (dynamic and static properties), nuclear magnetic resonance simulation, chemistry ground state preparation, and classical optimization. These five different benchmark tasks display different resource requirements and scalability properties. We introduce a metric to evaluate the quality of the output of a tested quantum hardware, called distinguishability cost, defined as the minimal number of gates that a perfect quantum computer would have to run to certify that the output of the benchmarked hardware is incorrect.

quant-ph↗

arXiv2024

Qutrit Toric Code and Parafermions in Trapped Ions

The development of programmable quantum devices can be measured by the complexity of manybody states that they are able to prepare. Among the most significant are topologically ordered states of matter, which enable robust quantum information storage and processing. While topological orders are more readily accessible with qudits, experimental realisations have thus far been limited to lattice models of qubits. Here, we prepare a ground state of the Z3 toric code state on 24 qutrits in a trapped ion quantum processor with fidelity per qutrit exceeding 96.5(3)%. We manipulate two types of defects which go beyond the conventional qubit toric code: a parafermion, and its bound state which is related to charge conjugation symmetry. We further demonstrate defect fusion and the transfer of entanglement between anyons and defects, which we use to control topological qutrits. Our work opens up the space of long-range entangled states with qudit degrees of freedom for use in quantum simulation and universal error-correcting codes.

quant-ph↗

arXiv2024

Analog simulation of noisy quantum circuits

It is well-known that simulating quantum circuits with low but non-zero hardware noise is more difficult than without noise. It requires either to perform density matrix simulations (coming with a space overhead) or to sample over "quantum trajectories" where Kraus operators are inserted randomly (coming with a runtime overhead). We propose a simulation technique based on a representation of hardware noise in terms of trajectories generated by operators that remain close to identity at low noise. This representation significantly reduces the variance over the quantum trajectories, speeding up noisy simulations by factors around $10$ to $100$. As a by-product, we provide a formula to factorize multiple-Pauli channels into a concatenation of single Pauli channels.

quant-ph↗

arXiv2024

Experimental Demonstration of Break-Even for the Compact Fermionic Encoding

The utility of solving the Fermi-Hubbard model has been estimated in the billions of dollars. Digital quantum computers can in principle address this task, but have so far been limited to quasi one-dimensional models. This is because of exponential overheads caused by the interplay of noise and the non-locality of the mapping between fermions and qubits. Here, we show experimentally that a recently developed local encoding can overcome this problem. We develop a new compilation scheme, called "corner hopping", that reduces the cost of simulating fermionic hopping by 42% which allows us to conduct the largest digital quantum simulations of a fermionic model to date, using a trapped ion quantum computer to prepare adiabatically the ground state of a 6 x 6 spinless Fermi-Hubbard model encoded in 48 physical qubits. We also develop two new error mitigation schemes for systems with conserved quantities, one based on local postselection and one on extrapolation of local observables. Our results suggest that Fermi-Hubbard models beyond classical simulability can be addressed by digital quantum computers without large increases in gate fidelity.

quant-ph↗