arXiv subjects

James R. Garrison

Publications and source records attributed to James R. Garrison.

18 recordsLinked to original sources

arXiv2026

Lindblad Multiproduct Formulas

We introduce Lindblad Multiproduct Formulas: a quantum error mitigation technique that uses two-dimensional tensor networks contracted with loop-corrected belief propagation. The quantities required to implement the error mitigation scheme that are evaluated with tensor networks can be less computationally expensive to calculate than the expectation values themselves, thus allowing for the possibility of applying our method to certain systems for which tensor network methods may struggle to calculate the observable quantities of interest. The workflow incorporates Clifford rescaling techniques and outputs an estimated error bar. We apply our method to a model of two-dimensional discrete time crystals studied previously and implement it on $65$ qubits arranged in a $3\!\times\!3$ heavy-hexagonal topology on the quantum computer ibm_basquecountry. We show that a GPU implementation of the classical part of our workflow achieves a speedup of up to $5.6\times$.

quant-ph↗

arXiv2026

Preparing 100-qubit symmetry-protected topological order on a digital quantum computer

Symmetry-protected topological (SPT) phases extend the Landau paradigm of quantum matter by admitting distinct symmetry-preserving phases that lack any local order parameter. Demonstrating these phases at scale on programmable quantum processors is a key milestone in using quantum hardware to probe emergent many-body phenomena, yet it is impeded by the circuit depth normally required to capture non-trivial entanglement. Here we use a tensor network based approximate quantum compiling (AQC) protocol to construct shallow quantum circuits (18-39 CNOT depth), which prepare 100-site ground states of the spin-1/2 bond-alternating Heisenberg chain in both SPT phases, to 97.9-99.0% fidelity. Upon executing the circuits on IBM quantum hardware, the resulting states exhibit all defining signatures of SPT order including non-local string order for strings of up to length 20, characteristic degeneracies in the entanglement spectrum and clear evidence of symmetry-protected edge modes. The simultaneous observation of these independent diagnostics establishes current quantum computers as versatile platforms for large-scale studies of symmetry-protected quantum matter. More broadly, our results establish a practical foundation for probing non-equilibrium quench dynamics of such systems in regimes that challenge classical computational methods.

quant-ph↗

arXiv2026

Observation of Improved Accuracy over Classical Sparse Ground-State Solvers using a Quantum Computer

Demonstrating quantum advantage over classical algorithms for ground state energy problems is an outstanding open problem in quantum computation. We experimentally demonstrate that a quantum algorithm can outperform classical selected configuration interaction (SCI) methods, a key family of techniques used in computational chemistry and condensed matter physics. We construct a class of local Hamiltonian problems with sparse ground states, and show that SCI fails to find the ground state of a 49-qubit instance. We then show that sample-based Krylov quantum diagonalization, run on an IBM Heron R3 processor, succeeds at the same task. While the problem is solvable classically using iterative solvers designed to target our Hamiltonian construction, this work resolves the question of whether a sample-based quantum diagonalization algorithm can outperform standard SCI heuristics.

quant-ph↗

arXiv2020

Entanglement bounds on the performance of quantum computing architectures

There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular connectivity graph's performance as a quantum architecture can be difficult. In this paper, we show that a quantity known as the isoperimetric number establishes a lower bound on the time required to create highly entangled states. This metric we propose counts resources based on the use of two-qubit unitary operations, while allowing for arbitrarily fast measurements and classical feedback. We use this metric to evaluate the hierarchical architecture proposed by A. Bapat et al. [Phys. Rev. A 98, 062328 (2018)], and find it to be a promising alternative to the conventional grid architecture. We also show that the lower bound that this metric places on the creation time of highly entangled states can be saturated with a constructive protocol, up to a factor logarithmic in the number of qubits.

quant-ph↗

arXiv2019

Circuit Complexity across a Topological Phase Transition

We use Nielsen's geometric approach to quantify the circuit complexity in a one-dimensional Kitaev chain across a topological phase transition. We find that the circuit complexities of both the ground states and non-equilibrium steady states of the Kitaev model exhibit non-analytical behaviors at the critical points, and thus can be used to detect both {\it equilibrium} and {\it dynamical} topological phase transitions. Moreover, we show that the locality property of the real-space optimal Hamiltonian connecting two different ground states depends crucially on whether the two states belong to the same or different phases. This provides a concrete example of classifying different gapped phases using Nielsen's circuit complexity. We further generalize our results to a Kitaev chain with long-range pairing, and discuss generalizations to higher dimensions. Our result opens up a new avenue for using circuit complexity as a novel tool to understand quantum many-body systems.

quant-ph↗

arXiv2019

Site-by-site quantum state preparation algorithm for preparing vacua of fermionic lattice field theories

Answering whether quantum computers can efficiently simulate quantum field theories has both theoretical and practical motivation. From the theoretical point of view, it answers the question of whether a hypothetical computer that utilizes quantum field theory would be more powerful than other quantum computers. From the practical point of view, when reliable quantum computers are eventually built, these algorithms can help us better understand the underlying physics that govern our world. In the best known quantum algorithms for simulating quantum field theories, the time scaling is dominated by initial state preparation. In this paper, we exclusively focus on state preparation and present a heuristic algorithm that can prepare the vacuum of fermionic systems in more general cases and more efficiently than previous methods. With our method, state preparation is no longer the bottleneck, as its runtime has the same asymptotic scaling with the desired precision as the remainder of the simulation algorithm. We numerically demonstrate the effectiveness of our proposed method for the 1+1 dimensional Gross-Neveu model.

quant-ph↗

arXiv2019

Locality and digital quantum simulation of power-law interactions

The propagation of information in non-relativistic quantum systems obeys a speed limit known as a Lieb-Robinson bound. We derive a new Lieb-Robinson bound for systems with interactions that decay with distance $r$ as a power law, $1/r^α$. The bound implies an effective light cone tighter than all previous bounds. Our approach is based on a technique for approximating the time evolution of a system, which was first introduced as part of a quantum simulation algorithm by Haah et al., FOCS'18. To bound the error of the approximation, we use a known Lieb-Robinson bound that is weaker than the bound we establish. This result brings the analysis full circle, suggesting a deep connection between Lieb-Robinson bounds and digital quantum simulation. In addition to the new Lieb-Robinson bound, our analysis also gives an error bound for the Haah et al. quantum simulation algorithm when used to simulate power-law decaying interactions. In particular, we show that the gate count of the algorithm scales with the system size better than existing algorithms when $α>3D$ (where $D$ is the number of dimensions).

quant-ph↗

arXiv2018

Asymmetric Particle Transport and Light-Cone Dynamics Induced by Anyonic Statistics

We study the non-equilibrium dynamics of Abelian anyons in a one-dimensional system. We find that the interplay of anyonic statistics and interactions gives rise to spatially asymmetric particle transport together with a novel dynamical symmetry that depends on the anyonic statistical angle and the sign of interactions. Moreover, we show that anyonic statistics induces asymmetric spreading of quantum information, characterized by asymmetric light cones of out-of-time-ordered correlators. Such asymmetric dynamics is in sharp contrast with the dynamics of conventional fermions or bosons, where both the transport and information dynamics are spatially symmetric. We further discuss experiments with cold atoms where the predicted phenomena can be observed using state-of-the-art technologies. Our results pave the way toward experimentally probing anyonic statistics through non-equilibrium dynamics.

cond-mat.quant-gas↗

arXiv2018

Probing ground-state phase transitions through quench dynamics

The study of quantum phase transitions requires the preparation of a many-body system near its ground state, a challenging task for many experimental systems. The measurement of quench dynamics, on the other hand, is now a routine practice in most cold atom platforms. Here we show that quintessential ingredients of quantum phase transitions can be probed directly with quench dynamics in integrable and nearly integrable systems. As a paradigmatic example, we study global quench dynamics in a transverse-field Ising model with either short-range or long-range interactions. When the model is integrable, we discover a new dynamical critical point with a non-analytic signature in the short-range correlators. The location of the dynamical critical point matches that of the quantum critical point and can be identified using a finite-time scaling method. We extend this scaling picture to systems near integrability and demonstrate the continued existence of a dynamical critical point detectable at prethermal time scales. Therefore, our method can be used to approximately locate the quantum critical point. The scaling method is also relevant to experiments with finite time and system size, and our predictions are testable in near-term experiments with trapped ions and Rydberg atoms.

quant-ph↗

arXiv2018

Unitary Entanglement Construction in Hierarchical Networks

The construction of large-scale quantum computers will require modular architectures that allow physical resources to be localized in easy-to-manage packages. In this work, we examine the impact of different graph structures on the preparation of entangled states. We begin by explaining a formal framework, the hierarchical product, in which modular graphs can be easily constructed. This framework naturally leads us to suggest a class of graphs, which we dub hierarchies. We argue that such graphs have favorable properties for quantum information processing, such as a small diameter and small total edge weight, and use the concept of Pareto efficiency to identify promising quantum graph architectures. We present numerical and analytical results on the speed at which large entangled states can be created on nearest-neighbor grids and hierarchy graphs. We also present a scheme for performing circuit placement--the translation from circuit diagrams to machine qubits--on quantum systems whose connectivity is described by hierarchies.

quant-ph↗

arXiv2018

Scale-Invariant Continuous Entanglement Renormalization of a Chern Insulator

The multi-scale entanglement renormalization ansatz (MERA) postulates the existence of quantum circuits that renormalize entanglement in real space at different length scales. Chern insulators, however, cannot have scale-invariant discrete MERA circuits with finite bond dimension. In this Letter, we show that the continuous MERA (cMERA), a modified version of MERA adapted for field theories, possesses a fixed point wavefunction with nonzero Chern number. Additionally, it is well known that reversed MERA circuits can be used to prepare quantum states efficiently in time that scales logarithmically with the size of the system. However, state preparation via MERA typically requires the advent of a full-fledged universal quantum computer. In this Letter, we demonstrate that our cMERA circuit can potentially be realized in existing analog quantum computers, i.e., an ultracold atomic Fermi gas in an optical lattice with light-induced spin-orbit coupling.

quant-ph↗

arXiv2018

Lieb-Robinson bounds on $n$-partite connected correlation functions

Lieb and Robinson provided bounds on how fast bipartite connected correlations can arise in systems with only short-range interactions. We generalize Lieb-Robinson bounds on bipartite connected correlators to multipartite connected correlators. The bounds imply that an $n$-partite connected correlator can reach unit value in constant time. Remarkably, the bounds also allow for an $n$-partite connected correlator to reach a value that is exponentially large with system size in constant time, a feature which stands in contrast to bipartite connected correlations. We provide explicit examples of such systems.

quant-ph↗

arXiv2017

Extracting entanglement geometry from quantum states

Tensor networks impose a notion of geometry on the entanglement of a quantum system. In some cases, this geometry is found to reproduce key properties of holographic dualities, and subsequently much work has focused on using tensor networks as tractable models for holographic dualities. Conventionally, the structure of the network - and hence the geometry - is largely fixed a priori by the choice of tensor network ansatz. Here, we evade this restriction and describe an unbiased approach that allows us to extract the appropriate geometry from a given quantum state. We develop an algorithm that iteratively finds a unitary circuit that transforms a given quantum state into an unentangled product state. We then analyze the structure of the resulting unitary circuits. In the case of non-interacting, critical systems in one dimension, we recover signatures of scale invariance in the unitary network, and we show that appropriately defined geodesic paths between physical degrees of freedom exhibit known properties of a hyperbolic geometry.

cond-mat.str-el↗

arXiv2017

Partial breakdown of quantum thermalization in a Hubbard-like model

We study the possible breakdown of quantum thermalization in a model of itinerant electrons on a one-dimensional chain without disorder, with both spin and charge degrees of freedom. The eigenstates of this model exhibit peculiar properties in the entanglement entropy, the apparent scaling of which is modified from a "volume law" to an "area law" after performing a partial, site-wise measurement on the system. These properties and others suggest that this model realizes a new, non-thermal phase of matter, known as a quantum disentangled liquid (QDL). The putative existence of this phase has striking implications for the foundations of quantum statistical mechanics.

cond-mat.stat-mech↗

arXiv2016

Many-body localization in the presence of a small bath

In the presence of strong disorder and weak interactions, closed quantum systems can enter a many-body localized phase where the system does not conduct, does not equilibrate even for arbitrarily long times, and robustly violates quantum statistical mechanics. The starting point for such a many-body localized phase is usually taken to be an Anderson insulator where, in the limit of vanishing interactions, all degrees of freedom of the system are localized. Here, we instead consider a model where in the non-interacting limit, some degrees of freedom are localized while others remain delocalized. Such a system can be viewed as a model for a many-body localized system brought into contact with a small bath of a comparable number of degrees of freedom. We numerically and analytically study the effect of interactions on this system and find that generically, the entire system delocalizes. However, we find certain parameter regimes where results are consistent with localization of the entire system, an effect recently termed many-body proximity effect.

cond-mat.dis-nn↗

arXiv2015

Does a single eigenstate encode the full Hamiltonian?

The Eigenstate Thermalization Hypothesis (ETH) posits that the reduced density matrix for a subsystem corresponding to an excited eigenstate is "thermal." Here we expound on this hypothesis by asking: for which class of operators, local or non-local, is ETH satisfied? We show that this question is directly related to a seemingly unrelated question: is the Hamiltonian of a system encoded within a single eigenstate? We formulate a strong form of ETH where in the thermodynamic limit, the reduced density matrix of a subsystem corresponding to a pure, finite energy density eigenstate asymptotically becomes equal to the thermal reduced density matrix, as long as the subsystem size is much less than the total system size, irrespective of how large the subsystem is compared to any intrinsic length scale of the system. This allows one to access the properties of the underlying Hamiltonian at arbitrary energy densities/temperatures using just a $\textit{single}$ eigenstate. We provide support for our conjecture by performing an exact diagonalization study of a non-integrable 1D lattice quantum model with only energy conservation. In addition, we examine the case in which the subsystem size is a finite fraction of the total system size, and find that even in this case, a large class of operators continue to match their canonical expectation values. Specifically, the von Neumann entanglement entropy equals the thermal entropy as long as the subsystem is less than half the total system. We also study, both analytically and numerically, a particle number conserving model at infinite temperature which substantiates our conjectures.

cond-mat.str-el↗

arXiv2013

Theory of a competitive spin liquid state for weak Mott insulators on the triangular lattice

We propose a novel quantum spin liquid state that can explain many of the intriguing experimental properties of the low-temperature phase of the organic spin liquid candidate materials. This state of paired fermionic spinons preserves all symmetries of the system, and it has a gapless excitation spectrum with quadratic bands that touch at momentum ~ k = 0. This quadratic band touching is protected by the symmetry of the system. Using variational Monte Carlo techniques, we show that this state has highly competitive energy in the triangular lattice Heisenberg model supplemented with a realistically large ring-exchange term.

cond-mat.str-el↗

arXiv2013

Non-Fermi-liquid d-wave metal phase of strongly interacting electrons

Developing a theoretical framework for conducting electronic fluids qualitatively distinct from those described by Landau's Fermi-liquid theory is of central importance to many outstanding problems in condensed matter physics. One such problem is that, above the transition temperature and near optimal doping, high-transition-temperature copper-oxide superconductors exhibit `strange metal' behaviour that is inconsistent with being a traditional Landau Fermi liquid. Indeed, a microscopic theory of a strange-metal quantum phase could shed new light on the interesting low-temperature behaviour in the pseudogap regime and on the d-wave superconductor itself. Here we present a theory for a specific example of a strange metal---the 'd-wave metal'. Using variational wavefunctions, gauge theoretic arguments, and ultimately large-scale density matrix renormalization group calculations, we show that this remarkable quantum phase is the ground state of a reasonable microscopic Hamiltonian---the usual t-J model with electron kinetic energy $t$ and two-spin exchange $J$ supplemented with a frustrated electron `ring-exchange' term, which we here examine extensively on the square lattice two-leg ladder. These findings constitute an explicit theoretical example of a genuine non-Fermi-liquid metal existing as the ground state of a realistic model.

cond-mat.str-el↗