arXiv subjects

Mari Carmen Bañuls

Publications and source records attributed to Mari Carmen Bañuls.

At least 37 records · Page 2Linked to original sources

arXiv2024

Non-thermal eigenstates and slow relaxation in quantum Fredkin spin chains

We study the dynamics and thermalization of the Fredkin spin chain, a system with local three-body interactions, particle conservation and explicit kinetic constraints. We consider deformations away from its stochastic point in order to tune between regimes where kinetic energy dominates and those where potential energy does. By means of exact diagonalisation, perturbation theory and variational matrix product states, we show there is a sudden change of behaviour in the dynamics that occurs, from one of fast thermalization to one of slow metastable (prethermal) dynamics near the stochastic point. This change in relaxation is connected to the emergence of additional kinetic constraints which lead to the fragmentation of Hilbert space in the limit of a large potential energy. We also show that this change can lead to thermalization being evaded for special initial conditions due to non-thermal eigenstates (akin to quantum many-body scars). We provide clear evidence for the existence of these non-thermal states for large system sizes even when far from the large-potential-energy limit, and explain their connection to the emergent kinetic constraints.

cond-mat.stat-mech↗

arXiv2024

Dynamical heterogeneity and large deviations in the open quantum East glass model from tensor networks

We study the non-equilibrium dynamics of the dissipative quantum East model via numerical tensor networks. We use matrix product states to represent evolution under quantum-jump unravellings for sizes beyond those accessible to exact diagonalisation. This allows us to demonstrate that dynamical heterogeneity accompanies slow relaxation, in analogy with what is seen in classical glassy systems. Furthermore, using variational matrix product operators we: (i) compute the spectral gap of the Lindbladian, and show that glassiness is enhanced in the presence of weak quantum fluctuations compared to the pure classical case, and (ii) obtain the dynamical large deviations by calculating the leading eigenvector of the tilted Lindbladian, and find clear evidence for a first-order active-inactive dynamical phase transition. We also show how to directly sample the rare quantum trajectories associated to the large deviations.

cond-mat.stat-mech↗

arXiv2024

Optimal sampling of dynamical large deviations in two dimensions via tensor networks

We use projected entangled-pair states (PEPS) to calculate the large deviations (LD) statistics of the dynamical activity of the two dimensional East model, and the two dimensional symmetric simple exclusion process (SSEP) with open boundaries, in lattices of up to 40x40 sites. We show that at long-times both models have phase transitions between active and inactive dynamical phases. For the 2D East model we find that this trajectory transition is of the first-order, while for the SSEP we find indications of a second order transition. We then show how the PEPS can be used to implement a trajectory sampling scheme capable of directly accessing rare trajectories. We also discuss how the methods described here can be extended to study rare events at finite times.

cond-mat.stat-mech↗

arXiv2024

Efficient Quantum Algorithm for Filtering Product States

We introduce a quantum algorithm to efficiently prepare states with a small energy variance at the target energy. We achieve it by filtering a product state at the given energy with a Lorentzian filter of width $δ$. Given a local Hamiltonian on $N$ qubits, we construct a parent Hamiltonian whose ground state corresponds to the filtered product state with variable energy variance proportional to $δ\sqrt{N}$. We prove that the parent Hamiltonian is gapped and its ground state can be efficiently implemented in $\mathrm{poly}(N,1/δ)$ time via adiabatic evolution. We numerically benchmark the algorithm for a particular non-integrable model and find that the adiabatic evolution time to prepare the filtered state with a width $δ$ is independent of the system size $N$. Furthermore, the adiabatic evolution can be implemented with circuit depth $\mathcal{O}(N^2δ^{-4})$. Our algorithm provides a way to study the finite energy regime of many body systems in quantum simulators by directly preparing a finite energy state, providing access to an approximation of the microcanonical properties at an arbitrary energy.

quant-ph↗

arXiv2024

Nonstabilizerness via matrix product states in the Pauli basis

Nonstabilizerness, also known as ``magic'', stands as a crucial resource for achieving a potential advantage in quantum computing. Its connection to many-body physical phenomena is poorly understood at present, mostly due to a lack of practical methods to compute it at large scales. We present a novel approach for the evaluation of nonstabilizerness within the framework of matrix product states (MPS), based on expressing the MPS directly in the Pauli basis. Our framework provides a powerful tool for efficiently calculating various measures of nonstabilizerness, including stabilizer Rényi entropies, stabilizer nullity, and Bell magic, and enables the learning of the stabilizer group of an MPS. We showcase the efficacy and versatility of our method in the ground states of Ising and XXZ spin chains, as well as in circuits dynamics that has recently been realized in Rydberg atom arrays, where we provide concrete benchmarks for future experiments on logical qubits up to twice the sizes already realized.

quant-ph↗

arXiv2024

Phase-Sensitive Quantum Measurement without Controlled Operations

Many quantum algorithms rely on the measurement of complex quantum amplitudes. Standard approaches to obtain the phase information, such as the Hadamard test, give rise to large overheads due to the need for global controlled-unitary operations. We introduce a quantum algorithm based on complex analysis that overcomes this problem for amplitudes that are a continuous function of time. Our method only requires the implementation of real-time evolution and a shallow circuit that approximates a short imaginary-time evolution. We show that the method outperforms the Hadamard test in terms of circuit depth and that it is suitable for current noisy quantum computers when combined with a simple error-mitigation strategy.

quant-ph↗

arXiv2024

Real-time scattering in the lattice Schwinger model

Tensor network methods have demonstrated their suitability for the study of equilibrium properties of lattice gauge theories, even close to the continuum limit. We use them in an out-of-equilibrium scenario, much less explored so far, by simulating the real-time collisions of composite mesons in the lattice Schwinger model. Constructing wave-packets of vector mesons at different incoming momenta, we observe the opening of the inelastic channel in which two heavier mesons are produced and identify the momentum threshold. To detect the products of the collision in the strong coupling regime we propose local quantitites that could be measured in current quantum simulation platforms.

hep-lat↗

arXiv2024

Probing Off-diagonal Eigenstate Thermalization with Tensor Networks

Energy filter methods in combination with quantum simulation can efficiently access the properties of quantum many-body systems at finite energy densities [Lu et al. PRX Quantum 2, 020321 (2021)]. Classically simulating this algorithm with tensor networks can be used to investigate the microcanonical properties of large spin chains, as recently shown in [Yang et al. Phys. Rev. B 106, 024307 (2022)]. Here we extend this strategy to explore the properties of off-diagonal matrix elements of observables in the energy eigenbasis, fundamentally connected to the thermalization behavior and the eigenstate thermalization hypothesis. We test the method on integrable and non-integrable spin chains of up to 60 sites, much larger than accessible with exact diagonalization. Our results allow us to explore the scaling of the off-diagonal functions with the size and energy difference, and to establish quantitative differences between integrable and non-integrable cases.

quant-ph↗

arXiv2023

Many-body correlations in one-dimensional optical lattices with alkaline-earth(-like) atoms

We explore the rich nature of correlations in the ground state of ultracold atoms trapped in state-dependent optical lattices. In particular, we consider interacting fermionic ytterbium or strontium atoms, realizing a two-orbital Hubbard model with two spin components. We analyze the model in one-dimensional setting with the experimentally relevant hierarchy of tunneling and interaction amplitudes by means of exact diagonalization and matrix product states approaches, and study the correlation functions in density, spin, and orbital sectors as functions of variable densities of atoms in the ground and metastable excited states. We show that in certain ranges of densities these atomic systems demonstrate strong density-wave, ferro- and antiferromagnetic, as well as antiferroorbital correlations.

cond-mat.quant-gas↗

arXiv2023

Simulating prethermalization using near-term quantum computers

Quantum simulation is one of the most promising scientific applications of quantum computers. Due to decoherence and noise in current devices, it is however challenging to perform digital quantum simulation in a regime that is intractable with classical computers. In this work, we propose an experimental protocol for probing dynamics and equilibrium properties on near-term digital quantum computers. As a key ingredient of our work, we show that it is possible to study thermalization even with a relatively coarse Trotter decomposition of the Hamiltonian evolution of interest. Even though the step size is too large to permit a rigorous bound on the Trotter error, we observe that the system prethermalizes in accordance with previous results for Floquet systems. The dynamics closely resemble the thermalization of the model underlying the Trotterization up to long times. We extend the reach of our approach by developing an error mitigation scheme based on measurement and rescaling of survival probabilities. To demonstrate the effectiveness of the entire protocol, we apply it to the two-dimensional XY model and numerically verify its performance with realistic noise parameters for superconducting quantum devices. Our proposal thus provides a route to achieving quantum advantage for relevant problems in condensed matter physics.

quant-ph↗

arXiv2023

Collective Monte Carlo updates through tensor network renormalization

We introduce a Metropolis-Hastings Markov chain for Boltzmann distributions of classical spin systems. It relies on approximate tensor network contractions to propose correlated collective updates at each step of the evolution. We present benchmarks for a wide variety of instances of the two-dimensional Ising model, including ferromagnetic, antiferromagnetic, (fully) frustrated and Edwards-Anderson spin glass cases, and we show that, with modest computational effort, our Markov chain achieves sizeable acceptance rates, even in the vicinity of critical points. In each of the situations we have considered, the Markov chain compares well with other Monte Carlo schemes such as the Metropolis or Wolff algorithm: equilibration times appear to be reduced by a factor that varies between 40 and 2000, depending on the model and the observable being monitored. We also present an extension to three spatial dimensions, and demonstrate that it exhibits fast equilibration for finite ferro and antiferromagnetic instances. Additionally, and although it is originally designed for a square lattice of finite degrees of freedom with open boundary conditions, the proposed scheme can be used as such, or with slight modifications, to study triangular lattices, systems with continuous degrees of freedom, matrix models, a confined gas of hard spheres, or to deal with arbitrary boundary conditions.

cond-mat.stat-mech↗

arXiv2022

Light cone tensor network and time evolution

The transverse folding algorithm [Phys. Rev. Lett. 102, 240603] is a tensor network method to compute time-dependent local observables in out-of-equilibrium quantum spin chains that can sometimes overcome the limitations of matrix product states. We present a contraction strategy that makes use of the exact light cone structure of the tensor network representing the observables. The strategy can be combined with the hybrid truncation proposed for global quenches in [Phys. Rev. A 91, 032306], which significantly improves the efficiency of the method. We demonstrate the performance of this transverse light cone contraction also for transport coefficients, and discuss how it can be extended to other dynamical quantities.

quant-ph↗

arXiv2022

Tensor Network Algorithms: a Route Map

Tensor networks provide extremely powerful tools for the study of complex classical and quantum many-body problems. Over the last two decades, the increment in the number of techniques and applications has been relentless, and especially the last ten years have seen an explosion of new ideas and results that may be overwhelming for the newcomer. This short review introduces the basic ideas, the best established methods and some of the most significant algorithmic developments that are expanding the boundaries of the tensor network potential. The goal is to help the reader not only appreciate the many possibilities offered by tensor networks, but also find their way through state-of-the-art codes, their applicability and some avenues of ongoing progress.

quant-ph↗

arXiv2022

Classical algorithms for many-body quantum systems at finite energies

We investigate quantum inspired algorithms to compute physical observables of quantum many-body systems at finite energies. They are based on the quantum algorithms proposed in [Lu et al. PRX Quantum 2, 020321 (2021)], which use the quantum simulation of the dynamics of such systems, as well as classical filtering and sampling techniques. Here, we replace the quantum simulation by standard classical methods based on matrix product states and operators. As a result, we can address significantly larger systems than those reachable by exact diagonalization or by other algorithms. We demonstrate the performance with spin chains up to 80 sites.

quant-ph↗

arXiv2022

Finite time large deviations via matrix product states

Recent work has shown the effectiveness of tensor network methods for computing large deviation functions in constrained stochastic models in the infinite time limit. Here we show that these methods can also be used to study the statistics of dynamical observables at arbitrary finite time. This is a harder problem because, in contrast to the infinite time case where only the extremal eigenstate of a tilted Markov generator is relevant, for finite time the whole spectrum plays a role. We show that finite time dynamical partition sums can be computed efficiently and accurately in one dimension using matrix product states, and describe how to use such results to generate rare event trajectories on demand. We apply our methods to the Fredrickson-Andersen (FA) and East kinetically constrained models, and to the symmetric simple exclusion process (SSEP), unveiling dynamical phase diagrams in terms of counting field and trajectory time. We also discuss extensions of this method to higher dimensions.

cond-mat.stat-mech↗

arXiv2021

Rényi free energy and variational approximations to thermal states

We propose the construction of thermodynamic ensembles that minimize the Rényi free energy, as an alternative to Gibbs states. For large systems, the local properties of these Rényi ensembles coincide with those of thermal equilibrium, and they can be used as approximations to thermal states. We provide algorithms to find tensor network approximations to the 2-Rényi ensemble. In particular, a matrix-product-state representation can be found by using gradient-based optimization on Riemannian manifolds, or via a non-linear evolution which yields the desired state as a fixed point. We analyze the performance of the algorithms and the properties of the ensembles on one-dimensional spin chains.

quant-ph↗

arXiv2021

Optimal sampling of dynamical large deviations via matrix product states

The large deviation (LD) statistics of dynamical observables is encoded in the spectral properties of deformed Markov generators. Recent works have shown that tensor network methods are well suited to compute the relevant leading eigenvalues and eigenvectors accurately. However, the efficient generation of the corresponding rare trajectories is a harder task. Here we show how to exploit the MPS approximation of the dominant eigenvector to implement an efficient sampling scheme which closely resembles the optimal (so-called "Doob") dynamics that realises the rare events. We demonstrate our approach on three well-studied lattice models, the Fredrickson-Andersen and East kinetically constrained models (KCMs), and the symmetric simple exclusion process (SSEP). We discuss how to generalise our approach to higher dimensions.

cond-mat.stat-mech↗

arXiv2021

Algorithms for quantum simulation at finite energies

We introduce two kinds of quantum algorithms to explore microcanonical and canonical properties of many-body systems. The first one is a hybrid quantum algorithm that, given an efficiently preparable state, computes expectation values in a finite energy interval around its mean energy. This algorithm is based on a filtering operator, similar to quantum phase estimation, which projects out energies outside the desired energy interval. However, instead of performing this operation on a physical state, it recovers the physical values by performing interferometric measurements without the need to prepare the filtered state. We show that the computational time scales polynomially with the number of qubits, the inverse of the prescribed variance, and the inverse error. In practice, the algorithm does not require the evolution for long times, but instead a significant number of measurements in order to obtain sensible results. Our second algorithm is a quantum-assisted Monte Carlo sampling method to compute other quantities which approach the expectation values for the microcanonical and canonical ensembles. Using classical Monte Carlo techniques and the quantum computer as a resource, this method circumvents the sign problem that is plaguing classical Quantum Monte Carlo simulations, as long as one can prepare states with suitable energies. All algorithms can be used with small quantum computers and analog quantum simulators, as long as they can perform the interferometric measurements. We also show that this last task can be greatly simplified at the expense of performing more measurements.

quant-ph↗