SearcharxivSearch

arXiv subjects

E. M. Stoudenmire

Publications and source records attributed to E. M. Stoudenmire.

At least 19 recordsLinked to original sources

Control-driven critical fluctuations across quantum trajectories

Monitored quantum circuits in which entangling unitary dynamics compete with projective local measurements can host measurement-induced phase transitions witnessed by entanglement measures at late times. Adding feedback conditioned on the measurement outcomes gives rise to another type of phase transition witnessed by local order parameters and correlation functions. These transitions, known as control or absorbing-state transitions, generically occur within the area-law entanglement phase and are thought to be governed by classical physics in that their critical exponents match those of the classical limit of the model. In this work, we examine quantum features of these transitions, focusing on a Bernoulli circuit model with a well-defined classical limit, in the presence of unitary dynamics, measurements, and feedback. First we demonstrate that, in the local basis defined by the absorbing state, the steady-state quantum coherence undergoes a phase transition at the control transition, where its logarithm changes discontinuously from volume- to area-law scaling. Second, we analyze the control transition from the perspective of fluctuations in observables, which carry two contributions: classical fluctuations over circuit realizations (present in the classical limit), and quantum fluctuations over trajectories and states (both absent in the classical limit). Both contributions can be estimated in experiments without post-selection. The circuit-to-circuit fluctuations, the dominant contribution, carry the critical behavior of the classical limit. However, the subleading quantum fluctuations that represent fluctuations between different quantum ``worlds'' also go critical at the control transition. These critical quantum fluctuations at the control transition also occur in other models, and we discuss how they can be measured experimentally without post-selection.

quant-ph

Disentangling Interacting Systems with Fermionic Gaussian Circuits: Application to Quantum Impurity Models

Tensor network quantum states are powerful tools for strongly correlated systems, tailored to capture local correlations such as in ground states with entanglement area laws. When applying tensor network states to interacting fermionic systems, a proper choice of the basis or orbitals can reduce the bond dimension of tensors and provide physically relevant orbitals. We introduce such a change of basis with unitary gates obtained from compressing fermionic Gaussian states into quantum circuits corresponding to various tensor networks. These circuits can reduce the ground state entanglement entropy and improve the performance of algorithms such as the density matrix renormalization group. We study the Anderson impurity model with one and two impurities to show the potential of the method for improving computational efficiency and interpreting impurity physics. Furthermore, fermionic Gaussian circuits can also suppress entanglement during the time evolution out of low-energy state. Last, we consider Gaussian multi-scale entanglement renormalization ansatz (GMERA) circuits which compress fermionic Gaussian states hierarchically. The emergent coarse-grained physical models from these GMERA circuits are studied in terms of their entanglement properties and suitability for performing time evolution.

cond-mat.str-el

Opening the Black Box Inside Grover's Algorithm

Grover's algorithm is a primary algorithm offered as evidence that quantum computers can provide an advantage over classical computers. It involves an "oracle" specified for a given application whose structure is not part of the formal scaling of the quadratic speedup guaranteed by the algorithm. Grover's algorithm also requires exponentially many calls to the quantum oracle to succeed (about $\sqrt{2^n}$ calls for $n$ qubits), raising the question of its implementation on both noisy and error-corrected quantum computers. In this work, we construct a quantum-inspired algorithm, executable on a classical computer, that performs Grover's task in a linear number of calls to (simulations of) the oracle - an exponentially smaller number than Grover's algorithm - and demonstrate this algorithm explicitly for Boolean satisfiability problems. The complexity of our algorithm depends on the cost to simulate the oracle once which may or may not be exponential. Indeed, Grover's algorithm does not have an a priori quantum speedup as soon as one is given access to the "source code" of the oracle. Our findings illustrate this point explicitly as our algorithm exploits the structure of the quantum circuit used to program the quantum computer to speed up the search. There remain problems where Grover's algorithm would provide an asymptotic speedup if it could be run accurately for large enough sizes. Our quantum-inspired algorithm provides lower bounds, in terms of circuit complexity, for quantum hardware to beat classical approaches for these problems. These estimates, combined with the unfavorable scaling of the success probability of Grover's algorithm - which in the presence of noise decays as a double exponential in the number of qubits - makes a practical speedup unrealistic even under extremely optimistic assumptions of the evolution of both hardware quality and availability.

quant-ph

Quantum Fourier Transform Has Small Entanglement

The Quantum Fourier Transform (QFT) is a key component of many important quantum algorithms, most famously as being the essential ingredient in Shor's algorithm for factoring products of primes. Given its remarkable capability, one would think it can introduce large entanglement to qubit systems and would be difficult to simulate classically. While early results showed QFT indeed has maximal operator entanglement, we show that this is entirely due to the bit reversal in the QFT. The core part of the QFT has Schmidt coefficients decaying exponentially quickly, and thus it can only generate a constant amount of entanglement regardless of the number of qubits. In addition, we show the entangling power of the QFT is the same as the time evolution of a Hamiltonian with exponentially decaying interactions, and thus a variant of the area law for dynamics can be used to understand the low entanglement intuitively. Using the low entanglement property of the QFT, we show that classical simulations of the QFT on a matrix product state with low bond dimension only take time linear in the number of qubits, providing a potential speedup over the classical fast Fourier transform (FFT) on many classes of functions. We demonstrate this speedup in test calculations on some simple functions. For data vectors of length $10^6$ to $10^8$, the speedup can be a few orders of magnitude.

quant-ph

Equilibrium Quantum Impurity Problems via Matrix Product State Encoding of the Retarded Action

In the $0+1$ dimensional imaginary-time path integral formulation of quantum impurity problems, the retarded action encodes the hybridization of the impurity with the bath. In this Article, we explore the computational power of representing the retarded action as matrix product state (RAMPS). We focus on the challenging Kondo regime of the single-impurity Anderson model, where non-perturbative strong-correlation effects arise at very low energy scales. We demonstrate that the RAMPS approach reliably reaches the Kondo regime for a range of interaction strengths $U$, with a numerical error scaling as a weak power law with inverse temperature. We investigate the convergence behavior of the method with respect to bond dimension and time discretization by analyzing the error of local observables in the full interacting problem and find polynomial scaling in both parameters. Our results show that the RAMPS approach offers promise as an alternative tool for studying quantum impurity problems in regimes that challenge established methods, such as multi-orbital systems. Overall, our study contributes to the development of efficient and accurate non-wavefunction-based tensor-network methods for quantum impurity problems.

cond-mat.str-el

Generative modeling via tensor train sketching

In this paper, we introduce a sketching algorithm for constructing a tensor train representation of a probability density from its samples. Our method deviates from the standard recursive SVD-based procedure for constructing a tensor train. Instead, we formulate and solve a sequence of small linear systems for the individual tensor train cores. This approach can avoid the curse of dimensionality that threatens both the algorithmic and sample complexities of the recovery problem. Specifically, for Markov models under natural conditions, we prove that the tensor cores can be recovered with a sample complexity that scales logarithmically in the dimensionality. Finally, we illustrate the performance of the method with several numerical experiments.

math.NA

DMRG Approach to Optimizing Two-Dimensional Tensor Networks

Tensor network algorithms have been remarkably successful solving a variety of problems in quantum many-body physics. However, algorithms to optimize two-dimensional tensor networks known as PEPS lack many of the aspects that make the seminal density matrix renormalization group (DMRG) algorithm so powerful for optimizing one-dimensional tensor networks known as matrix product states. We implement a framework for optimizing two-dimensional PEPS tensor networks which includes all of steps that make DMRG so successful for optimizing one-dimension tensor networks. We present results for several 2D spin models and discuss possible extensions and applications.

cond-mat.str-el

Learning Relevant Features of Data with Multi-scale Tensor Networks

Inspired by coarse-graining approaches used in physics, we show how similar algorithms can be adapted for data. The resulting algorithms are based on layered tree tensor networks and scale linearly with both the dimension of the input and the training set size. Computing most of the layers with an unsupervised algorithm, then optimizing just the top layer for supervised classification of the MNIST and fashion-MNIST data sets gives very good results. We also discuss mixing a prior guess for supervised weights together with an unsupervised representation of the data, yielding a smaller number of features nevertheless able to give good performance.

stat.ML

Many-body localization in disorder-free systems: the importance of finite-size constraints

Recently it has been suggested that many-body localization (MBL) can occur in translation-invariant systems, and candidate 1D models have been proposed. We find that such models, in contrast to MBL systems with quenched disorder, typically exhibit much more severe finite-size effects due to the presence of two or more vastly different energy scales. In a finite system, this can easily create an artificial splitting of the density of states (DOS) into bands separated by large energy gaps. We argue that in order for such models to faithfully represent the physics of the thermodynamic limit, the ratio of the relevant coupling parameters must be larger than a certain cutoff that depends on system size, and should be chosen in such a way that various bands in the DOS of a given model overlap with one another. By setting the parameters in this way to minimize the finite-size effects, we then perform exact diagonalization studies of several translation-invariant MBL candidate models. Based on the variety of diagnostics, including entanglement properties and the behaviour of local observables, we find the systems exhibit thermal (ergodic), rather than MBL-like behaviour. Our results suggest that MBL in translation-invariant systems with two or more very different energy scales is less robust than perturbative arguments suggest, possibly pointing to the importance of non-perturbative effects which induce delocalization in the thermodynamic limit.

cond-mat.stat-mech

Assembling Fibonacci Anyons From a $\mathbb{Z}_3$ Parafermion Lattice Model

Recent concrete proposals suggest it is possible to engineer a two-dimensional bulk phase supporting non-Abelian Fibonacci anyons out of Abelian fractional quantum Hall systems. The low-energy degrees of freedom of such setups can be modeled as $\mathbb{Z}_3$ parafermions "hopping" on a two-dimensional lattice. We use the density matrix renormalization group to study a model of this type interpolating between the decoupled-chain, triangular-lattice, and square-lattice limits. The results show clear evidence of the Fibonacci phase over a wide region of the phase diagram, most notably including the isotropic triangular lattice point. We also study the broader phase diagram of this model and show that elsewhere it supports an Abelian state with semionic excitations.

cond-mat.str-el

Corner contribution to the entanglement entropy of strongly-interacting O(2) quantum critical systems in 2+1 dimensions

In a D=2+1 quantum critical system, the entanglement entropy across a boundary with a corner contains a subleading logarithmic scaling term with a universal coefficient. It has been conjectured that this coefficient is, to leading order, proportional to the number of field components N in the associated O(N) continuum $ϕ^4$ field theory. Using density matrix renormalization group calculations combined with the powerful numerical linked cluster expansion technique, we confirm this scenario for the O(2) Wilson-Fisher fixed point in a striking way, through direct calculation at the quantum critical points of two very different microscopic models. The value of this corner coefficient is, to within our numerical precision, twice the coefficient of the Ising fixed point. Our results add to the growing body of evidence that this universal term in the Rényi entanglement entropy reflects the number of low-energy degrees of freedom in a system, even for strongly interacting theories.

cond-mat.str-el

Kohn-Sham calculations with the exact functional

As a proof of principle, self-consistent Kohn--Sham calculations are performed with the exact exchange-correlation functional. Finding the exact functional for even one trial density requires solving the interacting Schrödinger equation many times. The density matrix renormalization group method makes this possible for one-dimensional, real-space systems of more than two interacting electrons. We illustrate and explore the convergence properties of the exact KS scheme for both weakly and strongly correlated systems. We also explore the spin-dependent generalization and densities for which the functional is ill defined.

physics.chem-ph

Corner contribution to the entanglement entropy of an O(3) quantum critical point in 2+1 dimensions

The entanglement entropy for a quantum critical system across a boundary with a corner exhibits a sub-leading logarithmic scaling term with a scale-invariant coefficient. Using a Numerical Linked Cluster Expansion, we calculate this universal quantity for a square-lattice bilayer Heisenberg model at its quantum critical point. We find, for this 2+1 dimensional O(3) universality class, that it is thrice the value calculated previously for the Ising universality class. This relation gives substantial evidence that this coefficient provides a measure of the number of degrees of freedom of the theory, analogous to the central charge in a 1+1 dimensional conformal field theory.

cond-mat.str-el

Guaranteed convergence of the Kohn-Sham equations

A sufficiently damped iteration of the Kohn-Sham equations with the exact functional is proven to always converge to the true ground-state density, regardless of the initial density or the strength of electron correlation, for finite Coulomb systems. We numerically implement the exact functional for one-dimensional continuum systems and demonstrate convergence of the damped KS algorithm. More strongly correlated systems converge more slowly.

cond-mat.mtrl-sci

Real-Space Parallel Density Matrix Renormalization Group

We demonstrate how to parallelize the density matrix renormalization group (DMRG) algorithm in real space through a straightforward modification of serial DMRG. This makes it possible to apply at least an order of magnitude more computational power to challenging simulations, greatly accelerating investigations of two-dimensional systems and large parameter spaces. We discuss details of the algorithm and present benchmark results including a study of valence-bond-solid order within the square-lattice Q2 model and Neel order within the triangular lattice Heisenberg model. The parallel DMRG algorithm also motivates an alternative canonical form for matrix product states.

cond-mat.str-el

Topological phases in ultracold polar-molecule quantum magnets

We show how to use polar molecules in an optical lattice to engineer quantum spin models with arbitrary spin S >= 1/2 and with interactions featuring a direction-dependent spin anisotropy. This is achieved by encoding the effective spin degrees of freedom in microwave-dressed rotational states of the molecules and by coupling the spins through dipolar interactions. We demonstrate how one of the experimentally most accessible anisotropies stabilizes symmetry protected topological phases in spin ladders. Using the numerically exact density matrix renormalization group method, we find that these interacting phases -- previously studied only in the nearest-neighbor case -- survive in the presence of long-range dipolar interactions. We also show how to use our approach to realize the bilinear-biquadratic spin-1 and the Kitaev honeycomb models. Experimental detection schemes and imperfections are discussed.

cond-mat.quant-gas

One-dimensional Continuum Electronic Structure with the Density Matrix Renormalization Group and Its Implications For Density Functional Theory

We extend the density matrix renormalization group to compute exact ground states of continuum many-electron systems in one dimension with long-range interactions. We find the exact ground state of a chain of 100 strongly correlated artificial hydrogen atoms. The method can be used to simulate 1d cold atom systems and to study density functional theory in an exact setting. To illustrate, we find an interacting, extended system which is an insulator but whose Kohn-Sham system is metallic.

cond-mat.str-el

Reference electronic structure calculations in one dimension

Large strongly correlated systems provide a challenge to modern electronic structure methods, because standard density functionals usually fail and traditional quantum chemical approaches are too demanding. The density-matrix renormalization group method, an extremely powerful tool for solving such systems, has recently been extended to handle long-range interactions on real-space grids, but is most efficient in one dimension where it can provide essentially arbitrary accuracy. Such 1d systems therefore provide a theoretical laboratory for studying strong correlation and developing density functional approximations to handle strong correlation, {\em if} they mimic three-dimensional reality sufficiently closely. We demonstrate that this is the case, and provide reference data for exact and standard approximate methods, for future use in this area.

cond-mat.mtrl-sci