arXiv subjects

Guifré Vidal

Publications and source records attributed to Guifré Vidal.

6 recordsLinked to original sources

arXiv2025

Multi-Target Density Matrix Renormalization Group X algorithm and its application to circuit quantum electrodynamics

Obtaining accurate representations of the eigenstates of an array of coupled superconducting qubits is a crucial step in the design of circuit quantum electrodynamics (QED)-based quantum processors. However, exact diagonalization of the device Hamiltonian is challenging for system sizes beyond tens of qubits. Here, we employ a variant of the density matrix renormalization group (DMRG) algorithm, DMRG-X, to efficiently obtain localized eigenstates of a 2D transmon array without the need to first compute lower-energy states. We also introduce MTDMRG-X, a new algorithm that combines DMRG-X with multi-target DMRG to efficiently compute excited states even in regimes with strong eigenstate hybridization. We showcase the use of these methods for the analysis of long-range couplings in a multi-transmon Hamiltonian including qubits and couplers, and we discuss eigenstate localization. These developments facilitate the design and parameter optimization of large-scale superconducting quantum processors.

quant-ph↗

arXiv2020

Classical Simulations of Quantum Field Theory in Curved Spacetime I: Fermionic Hawking-Hartle Vacua from a Staggered Lattice Scheme

We numerically compute renormalized expectation values of quadratic operators in a quantum field theory (QFT) of free Dirac fermions in curved two-dimensional (Lorentzian) spacetime. First, we use a staggered-fermion discretization to generate a sequence of lattice theories yielding the desired QFT in the continuum limit. Numerically-computed lattice correlators are then used to approximate, through extrapolation, those in the continuum. Finally, we use so-called point-splitting regularization and Hadamard renormalization to remove divergences, and thus obtain finite, renormalized expectation values of quadratic operators in the continuum. As illustrative applications, we show how to recover the Unruh effect in flat spacetime and how to compute renormalized expectation values in the Hawking-Hartle vacuum of a Schwarzschild black hole and in the Bunch-Davies vacuum of an expanding universe described by de Sitter spacetime. Although here we address a non-interacting QFT using free fermion techniques, the framework described in this paper lays the groundwork for a series of subsequent studies involving simulation of interacting QFTs in curved spacetime by tensor network techniques.

gr-qc↗

arXiv2015

Fast convergence of imaginary time evolution tensor network algorithms by recycling the environment

We propose an environment recycling scheme to speed up a class of tensor network algorithms that produce an approximation to the ground state of a local Hamiltonian by simulating an evolution in imaginary time. Specifically, we consider the time-evolving block decimation (TEBD) algorithm applied to infinite systems in 1D and 2D, where the ground state is encoded, respectively, in a matrix product state (MPS) and in a projected entangled-pair state (PEPS). An important ingredient of the TEBD algorithm (and a main computational bottleneck, especially with PEPS in 2D) is the computation of the so-called environment, which is used to determine how to optimally truncate the bond indices of the tensor network so that their dimension is kept constant. In current algorithms, the environment is computed at each step of the imaginary time evolution, to account for the changes that the time evolution introduces in the many-body state represented by the tensor network. Our key insight is that close to convergence, most of the changes in the environment are due to a change in the choice of gauge in the bond indices of the tensor network, and not in the many-body state. Indeed, a consistent choice of gauge in the bond indices confirms that the environment is essentially the same over many time steps and can thus be re-used, leading to very substantial computational savings. We demonstrate the resulting approach in 1D and 2D by computing the ground state of the quantum Ising model in a transverse magnetic field.

quant-ph↗

arXiv2012

Dynamical windows for real-time evolution with matrix product states

We propose the use of a dynamical window to investigate the real-time evolution of quantum many-body systems in a one-dimensional lattice. In a recent paper [H. Phien et al, arxiv:????.????], we introduced infinite boundary conditions (IBC) in order to investigate real-time evolution of an infinite system under a local perturbation. This was accomplished by restricting the update of the tensors in the matrix product state to a finite window, with left and right boundaries held at fixed positions. Here we consider instead the use of a dynamical window, namely a window where the positions of left and right boundaries are allowed to change in time. In this way, all simulation efforts can be devoted to the space-time region of interest, which leads to a remarkable reduction in computational costs. For illustrative purposes, we consider two applications in the context of the spin-1 antiferromagnetic Heisenberg model in an infinite spin chain: one is an expanding window, with boundaries that are adjusted to capture the expansion in time of a local perturbation of the system; the other is a moving window of fixed size, where the position of the window follows the front of a propagating wave.

quant-ph↗

arXiv2000

Optimal local preparation of an arbitrary mixed state of two qubits. Closed expression for the single copy case

In this note we consider the problem of preparing a {\em single} copy of an arbitrary two-qubit mixed state $ρ$ starting from an entangled pure state $ψ$ and using only local operations assisted with classical communication. We present an analytical expression for the minimal amount of pure state entanglement required, and describe the corresponding local strategy. We also examine optimal probabilistic generalizations of the previous process.

quant-ph↗

arXiv2000

Operational criterion and constructive checks for the separability of low rank density matrices

We consider low rank density operators $\varrho$ supported on a $M\times N$ Hilbert space for arbitrary $M$ and $N$ ($M\leq N$) and with a positive partial transpose (PPT) $\varrho^{T_A}\ge 0$. For rank $r(\varrho) \leq N$ we prove that having a PPT is necessary and sufficient for $\varrho$ to be separable; in this case we also provide its minimal decomposition in terms of pure product states. It follows from this result that there is no rank 3 bound entangled states having a PPT. We also present a necessary and sufficient condition for the separability of generic density matrices for which the sum of the ranks of $\varrho$ and $\varrho^{T_A}$ satisfies $r(\varrho)+r(\varrho^{T_A}) \le 2MN-M-N+2$. This separability condition has the form of a constructive check, providing thus also a pure product state decomposition for separable states, and it works in those cases where a system of couple polynomial equations has a finite number of solutions, as expected in most cases.

quant-ph↗