arXiv subjects

J. Ignacio Cirac

Publications and source records attributed to J. Ignacio Cirac.

At least 55 records · Page 3Linked to original sources

arXiv2025

Pauli path simulations of noisy quantum circuits beyond average case

For random quantum circuits on $n$ qubits of depth $Θ(\log n)$ with depolarizing noise, the task of sampling from the output state can be efficiently performed classically using a Pauli path method [Aharonov et al. Proceedings of the 55th Annual ACM Symposium on Theory of Computing. 2023] . This paper aims to study the performance of this method beyond random circuits. We first consider the classical simulation of local observables in circuits composed of Clifford and T gates $\unicode{x2013}$ going beyond the average case analysis, we derive sufficient conditions for simulatability in terms of the noise rate and the fraction of gates that are T gates, and show that if noise is introduced at a faster rate than T gates, the simulation becomes classically easy. As an application of this result, we study 2D QAOA circuits that attempt to find low-energy states of classical Ising models on general graphs. There, our results shows that for hard instances of the problem, which correspond to Ising model's graph being geometrically non-local, a QAOA algorithm mapped to a geometrically local circuit architecture using SWAP gates does not have any asymptotic advantage over classical algorithms if depolarized at a constant rate. Finally, we illustrate instances where the Pauli path method fails to give the correct result, and also initiate a study of the trade-off between fragility to noise and classical complexity of simulating a given quantum circuit.

quant-ph↗

arXiv2025

Matrix-product unitaries: Beyond quantum cellular automata

Matrix-product unitaries (MPU) are 1D tensor networks describing time evolution and unitary symmetries of quantum systems, while their action on states by construction preserves the entanglement area law. MPU which are formed by a single repeated tensor are known to coincide with 1D quantum cellular automata (QCA), i.e., unitaries with an exact light cone. However, this correspondence breaks down for MPU with open boundary conditions, even if the resulting operator is translation-invariant. Such unitaries can turn short- to long-range correlations and thus alter the underlying phase of matter. Here we make the first steps towards a theory of MPU with uniform bulk but arbitrary boundary. In particular, we study the structure of a subclass with a direct-sum form which maximally violates the QCA property. We also consider the general case of MPU formed by site-dependent (nonuniform) tensors and show a correspondence between MPU and locally maximally entanglable states.

quant-ph↗

arXiv2025

Efficient simulation of quantum chemistry problems in an enlarged basis set

We propose a quantum algorithm to simulate the dynamics in quantum chemistry problems. It is based on adding fresh qubits at each Trotter step, which enables a simpler implementation of the dynamics in the extended system. After each step, the extra qubits are recycled, so that the whole process accurately approximates the correct unitary evolution. A key ingredient of the approach is an isometry that maps a simple, diagonal Hamiltonian in the extended system to the original one, and we give a procedure to compute this isometry. We estimate the error at each time step, as well as the number of gates, which scales as $O(N^2)$, where $N$ is the number of orbitals. We illustrate our results with three examples: the Hydrogen chain, small molecules, and the FeMoco molecule. In the Hydrogen chain and the Hydrogen molecule we observe that the error scales in the same way as the Trotter error. For FeMoco, we estimate the number of gates in a fault-tolerant setup.

quant-ph↗

arXiv2025

Variational Neural and Tensor Network Approximations of Thermal States

We introduce a variational Monte Carlo algorithm for approximating finite-temperature quantum many-body systems, based on the minimization of a modified free energy. This approach directly approximates the state at a fixed temperature, allowing for systematic improvement of the ansatz expressiveness without accumulating errors from iterative imaginary time evolution. We employ a variety of trial states -- both tensor networks as well as neural networks -- as variational Ansätze for our numerical optimization. We benchmark and compare different constructions in the above classes, both for one- and two-dimensional problems, with systems made of up to $N=100$ spins. Our results demonstrate that while restricted Boltzmann machines show limitations, string bond tensor network states exhibit systematic improvements with increasing bond dimensions and the number of strings.

quant-ph↗

arXiv2025

Kondo impurity in an attractive Fermi-Hubbard bath: Equilibrium and dynamics

We investigate theoretically equilibrium and dynamical properties of a Kondo impurity coupled to either 1D or 2D superconductors, modeled by the attractive Fermi-Hubbard model. By employing a non-Gaussian variational approach, we go beyond the approximation of a constant superconducting (SC) gap. We show that dynamical properties of the system can be modified qualitatively, when space and time dependent renormalization of the SC gap and electron-impurity hybridization are included. For the ground state, we find the singlet-doublet phase transition and $π$-phase shifts of the SC order parameter. For dynamics, first we consider spin dynamics following an abrupt connection of the polarized impurity to the 2D bath. We find rapid relaxation of impurity polarization and directional emission of a magnetization pulse, which becomes damped as it propagates into the bulk. Then we analyze transport between two SC leads coupled through the impurity at finite bias voltage. Here we go beyond analysis of the steady state to investigate full-time dynamics following an abrupt application of the bias voltage. We uncover four distinct regimes in the transient dynamics and transport properties: (I) the AC Josephson effect regime; (II) dynamical competition between charge-density-wave (CDW) and SC orders with transient Kondo correlations; (III) the coexistence of AC and DC currents facilitated by partial Kondo screening and dynamical stabilization of the SC order; (IV) DC Kondo transport regime modified by the SC order. Regime II exhibits a dynamical transition from SC to CDW order that locally restores the U(1) symmetry. We argue that our findings for regime IV provide a theoretical explanation for the experimentally observed anomalous enhancement of DC conductance and suppression of the AC Josephson current. Finally, we discuss the potential experimental realization with ultracold atoms.

cond-mat.str-el↗

arXiv2024

Approximating many-body quantum states with quantum circuits and measurements

We introduce protocols to prepare many-body quantum states with quantum circuits assisted by local operations and classical communication. We show that by lifting the requirement of exact preparation, one can substantially save resources. In particular, the so-called $W$ and, more generally, Dicke states require a circuit depth and number of ancillas per site that are independent of the system size. As a byproduct of our work, we introduce an efficient scheme to implement certain non-local, non-Clifford unitary operators. We also discuss how similar ideas may be applied in the preparation of eigenstates of well-known spin models, both free and interacting.

quant-ph↗

arXiv2024

Tensor networks and efficient descriptions of classical data

We investigate the potential of tensor network based machine learning methods to scale to large image and text data sets. For that, we study how the mutual information between a subregion and its complement scales with the subsystem size $L$, similarly to how it is done in quantum many-body physics. We find that for text, the mutual information scales as a power law $L^ν$ with a close to volume law exponent, indicating that text cannot be efficiently described by 1D tensor networks. For images, the scaling is close to an area law, hinting at 2D tensor networks such as PEPS could have an adequate expressibility. For the numerical analysis, we introduce a mutual information estimator based on autoregressive networks, and we also use convolutional neural networks in a neural estimator method.

quant-ph↗

arXiv2024

Dual-isometric Projected Entangled Pair States

Efficient characterization of higher dimensional many-body physical states presents significant challenges. In this paper, we propose a new class of Project Entangled Pair State (PEPS) that incorporates two isometric conditions. This new class facilitates the efficient calculation of general local observables and certain two-point correlation functions, which have been previously shown to be intractable for general PEPS, or PEPS with only a single isometric constraint. Despite incorporating two isometric conditions, our class preserves the rich physical structure while enhancing the analytical capabilities. It features a large set of tunable parameters, with only a subleading correction compared to that of general PEPS. Furthermore, we analytically demonstrate that this class can encode universal quantum computations and can represent a transition from topological to trivial order.

quant-ph↗

arXiv2024

Cavity Quantum Electrodynamics with Atom Arrays in Free Space

Cavity quantum electrodynamics (cavity QED) enables the control of light-matter interactions at the single-photon level, rendering it a key component of many quantum technologies. Its practical realization, however, is complex since it involves placing individual quantum emitters close to mirror surfaces within a high-finesse cavity. In this work, we propose a cavity QED architecture fully based on atoms trapped in free space. In particular, we show that a pair of two-dimensional, ordered arrays of atoms can be described by conventional cavity QED parameters. Such an atom-array cavity exhibits the same cooperativity as a conventional counterpart with matching mirror specifications even though the cavity coupling strength and decay rate are modified by the narrow bandwidth of the atoms. We estimate that an array cavity composed of $^{87}\mathrm{Rb}$ atoms in an optical lattice can reach a cooperativity of about $10$. This value can be increased suppressing atomic motion with larger trap depths and may exceed $10^4$ with an ideal placement of the atoms. To reduce the experimental complexity of our scheme, we propose a spatially dependent AC Stark shift as an alternative to curving the arrays, which may be of independent interest. In addition to presenting a promising platform for cavity QED, our work creates opportunities for exploring novel phenomena based on the intrinsic nonlinearity of atom arrays and the possibility to dynamically control them.

quant-ph↗

arXiv2024

Matrix product state approximations to quantum states of low energy variance

We show how to efficiently simulate pure quantum states in one dimensional systems that have both finite energy density and vanishingly small energy fluctuations. We do so by studying the performance of a tensor network algorithm that produces matrix product states whose energy variance decreases as the bond dimension increases. Our results imply that variances as small as $\propto 1/\log N$ can be achieved with polynomial bond dimension. With this, we prove that there exist states with a very narrow support in the bulk of the spectrum that still have moderate entanglement entropy, in contrast with typical eigenstates that display a volume law. Our main technical tool is the Berry-Esseen theorem for spin systems, a strengthening of the central limit theorem for the energy distribution of product states. We also give a simpler proof of that theorem, together with slight improvements in the error scaling, which should be of independent interest.

quant-ph↗

arXiv2024

Many-body entropies and entanglement from polynomially-many local measurements

Estimating global properties of many-body quantum systems such as entropy or bipartite entanglement is a notoriously difficult task, typically requiring a number of measurements or classical post-processing resources growing exponentially in the system size. In this work, we address the problem of estimating global entropies and mixed-state entanglement via partial-transposed (PT) moments, and show that efficient estimation strategies exist under the assumption that all the spatial correlation lengths are finite. Focusing on one-dimensional systems, we identify a set of approximate factorization conditions (AFCs) on the system density matrix which allow us to reconstruct entropies and PT moments from information on local subsystems. This yields a simple and efficient strategy for entropy and entanglement estimation. Our method could be implemented in different ways, depending on how information on local subsystems is extracted. Focusing on randomized measurements (RMs), providing a practical and common measurement scheme, we prove that our protocol only requires polynomially-many measurements and post-processing operations, assuming that the state to be measured satisfies the AFCs. We prove that the AFCs hold for finite-depth quantum-circuit states and translation-invariant matrix-product density operators, and provide numerical evidence that they are satisfied in more general, physically-interesting cases, including thermal states of local Hamiltonians. We argue that our method could be practically useful to detect bipartite mixed-state entanglement for large numbers of qubits available in today's quantum platforms.

quant-ph↗

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

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

The quantum adiabatic algorithm suppresses the proliferation of errors

The propagation of errors severely compromises the reliability of quantum computations. The quantum adiabatic algorithm is a physically motivated method to prepare ground states of classical and quantum Hamiltonians. Here, we analyze the proliferation of a single error event in the adiabatic algorithm. We give numerical evidence using tensor network methods that the intrinsic properties of adiabatic processes effectively constrain the amplification of errors during the evolution for geometrically local Hamiltonians. Our findings indicate that low energy states could remain attainable even in the presence of a single error event, which contrasts with results for error propagation in typical quantum circuits.

quant-ph↗

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↗

arXiv2024

Preparation of matrix product states with log-depth quantum circuits

We consider the preparation of matrix product states (MPS) on quantum devices via quantum circuits of local gates. We first prove that faithfully preparing translation-invariant normal MPS of $N$ sites requires a circuit depth $T=Ω(\log N)$. We then introduce an algorithm based on the renormalization-group transformation to prepare normal MPS with an error $ε$ in depth $T=O(\log (N/ε))$, which is optimal. We also show that measurement and feedback leads to an exponential speedup of the algorithm, to $T=O(\log\log (N/ε))$. Measurements also allow one to prepare arbitrary translation-invariant MPS, including long-range non-normal ones, in the same depth. Finally, the algorithm naturally extends to inhomogeneous MPS.

quant-ph↗

arXiv2024

Phase diagram for strong-coupling Bose polarons

Important properties of complex quantum many-body systems and their phase diagrams can often already be inferred from the impurity limit. The Bose polaron problem describing an impurity atom immersed in a Bose-Einstein condensate is a paradigmatic example. One of the most interesting features of this model is the competition between the emergent impurity-mediated attraction between the bosons and their intrinsic repulsion. The arising higher-order correlations make the physics rich and interesting, but also complex to describe theoretically. To tackle this challenge, we develop a quantum chemistry-inspired computational technique and compare two state-of-the-art variational methods that fully include both the boson-impurity and boson-boson interactions on a non-perturbative level. For a sweep of the boson-impurity interaction strength, we find two regimes of qualitatively different behaviour. If the impurity-mediated interactions overcome the repulsion between the bosons, the polaron becomes unstable due to the formation of large bound clusters. If instead the interboson interactions dominate, the impurity will experience a crossover from a polaron into a small molecule. We achieve a unified understanding incorporating both of these regimes and the transition between them. We show that both the instability and crossover regime can be studied in realistic cold-atom experiments. Moreover, we develop a simple analytical model that allows us to interpret these phenomena in the typical Landau framework of first-order phase transitions that turn second-order at a critical endpoint, revealing a deep connection of the Bose polaron model to both few- and many-body physics.

cond-mat.quant-gas↗

arXiv2023

Quantum advantage and stability to errors in analogue quantum simulators

Several quantum hardware platforms, while being unable to perform fully fault-tolerant quantum computation, can still be operated as analogue quantum simulators for addressing many-body problems. However, due to the presence of errors, it is not clear to what extent those devices can provide us with an advantage with respect to classical computers. In this work we consider the use of noisy analogue quantum simulators for computing physically relevant properties of many-body systems both in equilibrium and undergoing dynamics. We first formulate a system-size independent notion of stability against extensive errors, which we prove for Gaussian fermion models, as well as for a restricted class of spin systems. Remarkably, for the Gaussian fermion models, our analysis shows the stability of critical models which have long-range correlations. Furthermore, we analyze how this stability may lead to a quantum advantage, for the problem of computing the thermodynamic limit of many-body models, in the presence of a constant error rate and without any explicit error correction.

quant-ph↗