arXiv subjects

David T. Stephen

Publications and source records attributed to David T. Stephen.

At least 19 recordsLinked to original sources

arXiv2026

Long-range nonstabilizerness of topologically encoded states from mutual information

We study long-range nonstabilizerness (LRN), namely the obstruction to remove nonstabilizerness with shallow-depth local quantum circuits. In one-dimensional settings, the mutual information between disconnected spatial regions has proven to be a powerful tool to diagnose LRN. In this work, we focus on encoded states of two-dimensional topologically-ordered systems, and explore the ability of the mutual information to serve as a diagnostic of LRN. Focusing on the concrete setting of lattice models defined on a torus, we show that information about LRN can be gained from the analysis of the mutual information between non-overlapping regions containing non-contractible loops, and of the change of such mutual information under modular real-space transformations. We exemplify this idea in the toric code and the non-abelian string-net model with doubled Fibonacci topological order. In the former case, we show that the mutual information provides a full classification, certifying LRN for all encoded non-stabilizer states. In the latter case, instead, our approach does not lead to a full classification, as it detects LRN for all states except from a finite subset with special transformation properties under the modular group. Finally, we discuss how our results on LRN constrain the logical gates that can be implemented fault-tolerantly on the torus.

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,\omega)$ for all momentum $k$ and a specific chosen frequency $\omega$. 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

Fast stabilizer state preparation via AI-optimized graph decimation

We propose a general method for preparing stabilizer states with reduced two-qubit gate count and depth compared to the state of the art. The method starts from a graph state representation of the stabilizer state and iteratively reduces the number of edges in the graph using two-qubit Clifford gates to produce a unitary preparation circuit. We explore various heuristic search and AI-based approaches to optimally choose Clifford gates at each step, the most sophisticated of which is a combination of reinforcement learning and Monte Carlo tree search that we call QuSynth. We apply our method to synthesize code states of various quantum error correcting codes including the 23-qubit Golay code and the 144-qubit gross code, the latter of which is significantly beyond the qubit number that is accessible to prior optimal circuit synthesis methods. We demonstrate that our techniques are capable of reducing the required two-qubit gates by up to a factor of 2.5 compared to previous approaches while retaining low circuit depth.

quant-ph↗

arXiv2026

Directly estimating the fidelity of measurement-based quantum computation

In measurement-based quantum computation (MBQC), quantum circuits are implemented using adaptive measurements on an entangled resource state. In practice, the resource state will always be prepared with some noise, and it is crucial to understand the effect of this noise on the operation of MBQC. Typically, one measures the fidelity of the noisy resource state with the assumption that a high fidelity state means a high fidelity computation. However, the precise relationship between these two fidelities is not known. Here, we derive an expression that equates the average fidelity of the MBQC output state to a certain correlation function evaluated on the noisy resource state. Using this expression, we show that state fidelity provides a tight lower bound on average MBQC fidelity. Conversely, we also find that state fidelity can greatly underestimate average MBQC fidelity, implying that state fidelity is not a good indicator of MBQC performance in general. In response, we formulate an efficient method to directly estimate average MBQC fidelity by measuring the aforementioned correlation function. These results therefore improve our ability to characterize noisy resource states in quantum computers and benchmark MBQC performance.

quant-ph↗

arXiv2025

Many-body contextuality and self-testing quantum matter via nonlocal games

Contextuality is arguably the fundamental property that makes quantum mechanics different from classical physics. It is responsible for quantum computational speedups in both magic-state-injection-based and measurement-based models of computation, and can be directly probed in a many-body setting by multiplayer nonlocal quantum games. Here, we discuss a family of games that can be won with certainty when performing single-site Pauli measurements on a state that is a codeword of a Calderbank-Shor-Steane (CSS) error-correcting quantum code. We show that these games require deterministic computation of a code-dependent Boolean function, and that the classical probability of success is upper bounded by a generalized notion of nonlinearity/nonquadraticity. This success probability quantifies the state's contextuality, and is computed via the function's (generalized) Walsh-Hadamard spectrum. To calculate this, we introduce an efficient, many-body-physics-inspired method that involves identifying the symmetries of an auxiliary hypergraph state. We compute the classical probability of success for several paradigmatic CSS codes and relate it to both classical statistical mechanics models and to strange correlators of symmetry-protected topological states. We also consider CSS submeasurement games, which can only be won with certainty by sharing the appropriate codeword up to local isometries. These games therefore enable self-testing, which we illustrate explicitly for the 2D toric code. We also discuss how submeasurement games enable an extensive notion of contextuality in many-body states.

quant-ph↗

arXiv2025

Certified randomness amplification by dynamically probing remote random quantum states

Cryptography depends on truly unpredictable numbers, but physical sources emit biased or correlated bits. Quantum mechanics enables the amplification of imperfect randomness into nearly perfect randomness, but prior demonstrations have required physically co-located, loophole-free Bell tests, constraining the feasibility of remote operation. Here we realize certified randomness amplification across a network by dynamically probing large, entangled quantum states on Quantinuum's 98-qubit Helios trapped-ion quantum processor. Our protocol is secure even if the remote device acts maliciously or is compromised by an intercepting adversary, provided the samples are generated quickly enough to preclude classical simulation of the quantum circuits. We stream quantum gates in real time to the quantum processor, maintain quantum state coherence for $\approx 0.9$ seconds, and then reveal the measurement bases to the quantum processor only milliseconds before measurement. This limits the time for classical spoofing to 30 ms and constrains the location of hypothetical adversaries to a $4{,}500$ km radius. We achieve a fidelity of 0.586 on random circuits with 64 qubits and 276 two-qubit gates, enabling the amplification of realistic imperfect randomness with a low entropy rate into nearly perfect randomness.

quant-ph↗

arXiv2025

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

The Symmetry Taco: Equivalences between Gapped, Gapless, and Mixed-State SPTs

Symmetry topological field theory (SymTFT), or topological holography, offers a unifying framework for describing quantum phases of matter and phase transitions between them. While this approach has seen remarkable success in describing gapped and gapless pure-state phases in $1+1$d, its applicability to open quantum systems remains entirely unexplored. In this work, we propose a natural extension of the SymTFT framework to mixed-state phases by introducing the \textit{symmetry taco}: a bilayer topological order in $2+1$d whose folded geometry naturally encapsulates both strong and weak symmetries of the $1+1$d theory. We use this perspective to identify a series of correspondences, including a one-to-one map between intrinsically gapless SPTs (igSPTs) and certain gapped SPTs, and a mapping between igSPTs and intrinsically average SPTs (iASPTs) arising in $1+1$d mixed states. More broadly, our framework yields a classification of short-range correlated $G$-symmetric Choi states in $1+1$d, provides a route for systematically generating mixed-state SPTs via local decoherence of igSPTs, and allows us to identify a new mixed-state ``anomaly". Besides folding in mixed-state phases into the SymTFT paradigm, the symmetry taco opens new avenues for exploring dualities, anomalies, and non-equilibrium criticality in mixed-state quantum matter.

cond-mat.str-el↗

arXiv2025

Bulk Excitations of Invertible Phases

Recent developments in the study of topological defects highlight the importance of understanding the multi-dimensional structure of bulk excitations inside a quantum system. When the bulk ground state is trivial, i.e. a product state, excitations on top of it are decoupled from each other and correspond to lower-dimensional phases and their defects within. In this paper, we expand the discussion to invertible phases and study the bulk excitations in, for example, SPT phases, Majorana chains, p + ip superconductors etc. We find that there is a one-to-one correspondence between bulk excitations inside a nontrivial invertible phase and those in a product state. For SPT phases, this can be shown using the symmetric Quantum Cellular Automaton that maps from the product state to the SPT state. More generally, for invertible phases realizable using the Topological Holography construction, we demonstrate the correspondence using the fact that certain gapped boundary conditions of a topological bulk state have only relative distinctions but no absolute ones.

cond-mat.str-el↗

arXiv2025

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↗

arXiv2025

A Classifying Space for Phases of Matrix Product States

We construct a topological space $\mathcal{B}$ consisting of translation invariant injective matrix product states (MPS) of all physical and bond dimensions and show that it has the weak homotopy type $K(\mathbb{Z}, 2) \times K(\mathbb{Z}, 3)$. The implication is that the phase of a family of such states parametrized by a space $X$ is completely determined by two invariants: a class in $H^2(X; \mathbb{Z})$ corresponding to the Chern number per unit cell and a class in $H^3(X; \mathbb{Z})$, the so-called Kapustin-Spodyneiko (KS) number. The space $\mathcal{B}$ is defined as the quotient of a contractible space $\mathcal{E}$ of MPS tensors by an equivalence relation describing gauge transformations of the tensors. We prove that the projection map $p:\mathcal{E} \rightarrow \mathcal{B}$ is a quasifibration, and this allows us to determine the weak homotopy type of $\mathcal{B}$. As an example, we review the Chern number pump-a family of MPS parametrized by $S^3$-and prove that it generates $\pi_3(\mathcal{B})$.

math-ph↗

arXiv2024

Braiding for the win: Harnessing braiding statistics in topological states to win quantum games

Nonlocal quantum games provide proof of principle that quantum resources can confer advantage at certain tasks. They also provide a compelling way to explore the computational utility of phases of matter on quantum hardware. In a recent manuscript [Hart et al., arXiv:2403.04829] we demonstrated that a toric code resource state conferred advantage at a certain nonlocal game, which remained robust to small deformations of the resource state. In this manuscript we demonstrate that this robust advantage is a generic property of resource states drawn from topological or fracton ordered phases of quantum matter. To this end, we illustrate how several other states from paradigmatic topological and fracton ordered phases can function as resources for suitably defined nonlocal games, notably the three-dimensional toric-code phase, the X-cube fracton phase, and the double-semion phase. The key in every case is to design a nonlocal game that harnesses the characteristic braiding processes of a quantum phase as a source of contextuality. We unify the strategies that take advantage of mutual statistics by relating the operators to be measured to order and disorder parameters of an underlying generalized symmetry-breaking phase transition. Finally, we massively generalize the family of games that admit perfect strategies when codewords of homological quantum error-correcting codes are used as resources.

quant-ph↗

arXiv2024

Many-body quantum catalysts for transforming between phases of matter

A catalyst is a substance that enables otherwise impossible transformations between states of a system, without being consumed in the process. In this work, we apply the notion of catalysts to many-body quantum physics. In particular, we construct catalysts that enable transformations between different symmetry-protected topological (SPT) phases of matter using symmetric finite-depth quantum circuits. We discover a wide variety of catalysts, including GHZ-like states which spontaneously break the symmetry, gapless states with critical correlations, topological orders with symmetry fractionalization, and spin-glass states. These catalysts are all united under a single framework which has close connections to the theory of quantum anomalies, and we use this connection to put strong constraints on possible pure- and mixed-state catalysts. We also show how the catalyst approach leads to new insights into the structure of certain phases of matter, and to new methods to efficiently prepare SPT phases with long-range interactions or projective measurements.

quant-ph↗

arXiv2024

Duality between string and computational order in symmetry-enriched topological phases

We present the first examples of topological phases of matter with uniform power for measurement-based quantum computation. This is possible thanks to a new framework for analyzing the computational properties of phases of matter that is more general than previous constructions, which were limited to short-range entangled phases in one dimension. We show that ground states of the toric code in an anisotropic magnetic field yield a natural, albeit non-computationally-universal, application of our framework. We then present a new model with topological order whose ground states are universal resources for MBQC. Both topological models are enriched by subsystem symmetries, and these symmetries protect their computational power. Our framework greatly expands the range of physical models that can be analyzed from the computational perspective.

quant-ph↗

arXiv2024

Frobenius light cone and the shift unitary

We bound the time necessary to implement the shift unitary on a one-dimensional ring, both using local Hamiltonians and those with power-law interactions. This time is constrained by the Frobenius light cone; hence we prove that (for certain power law exponents) shift unitaries cannot be implemented in the same amount of time needed to prepare long-range Bell pairs. We note an intriguing similarity between the proof of our results, and the hardness of preparing symmetry-protected topological states with symmetry-preserving Hamiltonians.

quant-ph↗

arXiv2024

Duality via Sequential Quantum Circuit in the Topological Holography Formalism

Two quantum theories which look different but are secretly describing the same low-energy physics are said to be dual to each other. When realized in the Topological Holography formalism, duality corresponds to changing the gapped boundary condition on the top boundary of a topological field theory, which determines the symmetry of the system, while not affecting the bottom boundary where all the dynamics take place. In this paper, we show that duality in the Topological Holography formalism can be realized with a Sequential Quantum Circuit applied to the top boundary. As a consequence, the Hamiltonians before and after the duality mapping have exactly the same spectrum in the corresponding symmetry sectors, and the entanglement in the corresponding low-energy eigenstates differs by at most an area law term.

cond-mat.str-el↗

arXiv2024

Optimally generating $\mathfrak{su}(2^N)$ using Pauli strings

Any quantum computation consists of a sequence of unitary evolutions described by a finite set of Hamiltonians. When this set is taken to consist of only products of Pauli operators, we show that the minimal such set generating $\mathfrak{su}(2^{N})$ contains $2N+1$ elements. We provide a number of examples of such generating sets and furthermore provide an algorithm for producing a sequence of rotations corresponding to any given Pauli rotation, which is shown to have optimal complexity. We also observe that certain sets generate $\mathfrak{su}(2^{N})$ at a faster rate than others, and we show how this rate can be optimized by tuning the fraction of anticommuting pairs of generators. Finally, we briefly comment on implications for measurement-based and trapped ion quantum computation as well as the construction of fault-tolerant gate sets.

quant-ph↗

arXiv2024

Universal measurement-based quantum computation in a one-dimensional architecture enabled by dual-unitary circuits

A powerful tool emerging from the study of many-body quantum dynamics is that of dual-unitary circuits, which are unitary even when read `sideways', i.e., along the spatial direction. Here, we show that this provides the ideal framework to understand and expand on the notion of measurement-based quantum computation (MBQC). In particular, applying a dual-unitary circuit to a many-body state followed by appropriate measurements effectively implements quantum computation in the spatial direction. We show how the dual-unitary dynamics generated by the dynamics of the paradigmatic one-dimensional kicked Ising chain with certain parameter choices generate resource states for universal deterministic MBQC. Specifically, after $k$ time-steps, equivalent to a depth-$k$ quantum circuit, we obtain a resource state for universal MBQC on $\sim 3k/4$ encoded qubits. Our protocol allows generic quantum circuits to be `rotated' in space-time and gives new ways to exchange between resources like qubit number and coherence time in quantum computers. Beyond the practical advantages, we also interpret the dual-unitary evolution as generating an infinite sequence of new symmetry-protected topological phases with spatially modulated symmetries, which gives a vast generalization of the well-studied one-dimensional cluster state and shows that our protocol is robust to symmetry-respecting deformations.

quant-ph↗