arXiv subjects

R. Orus

Publications and source records attributed to R. Orus.

14 recordsLinked to original sources

arXiv2018

A tensor network annealing algorithm for two-dimensional thermal states

Tensor network methods have become a powerful class of tools to capture strongly correlated matter, but methods to capture the experimentally ubiquitous family of models at finite temperature beyond one spatial dimension are largely lacking. We introduce a tensor network algorithm able to simulate thermal states of two-dimensional quantum lattice systems in the thermodynamic limit. The method develops instances of projected entangled pair states and projected entangled pair operators for this purpose. It is the key feature of this algorithm to resemble the cooling down of the system from an infinite temperature state until it reaches the desired finite-temperature regime. As a benchmark we study the finite-temperature phase transition of the Ising model on an infinite square lattice, for which we obtain remarkable agreement with the exact solution. We then turn to study the finite-temperature Bose-Hubbard model in the limits of two (hard-core) and three bosonic modes per site. Our technique can be used to support the experimental study of actual effectively two-dimensional materials in the laboratory, as well as to benchmark optical lattice quantum simulators with ultra-cold atoms.

quant-ph↗

arXiv2016

Entanglement Continuous Unitary Transformations

Continuous unitary transformations are a powerful tool to extract valuable information out of quantum many-body Hamiltonians, in which the so-called flow equation transforms the Hamiltonian to a diagonal or block-diagonal form in second quantization. Yet, one of their main challenges is how to approximate the infinitely-many coupled differential equations that are produced throughout this flow. Here we show that tensor networks offer a natural and non-perturbative truncation scheme in terms of entanglement. The corresponding scheme is called "entanglement-CUT" or eCUT. It can be used to extract the low-energy physics of quantum many-body Hamiltonians, including quasiparticle energy gaps. We provide the general idea behind eCUT and explain its implementation for finite 1d systems using the formalism of matrix product operators. We also present proof-of-principle results for the spin-1/2 1d quantum Ising model and the 3-state quantum Potts model in a transverse field. Entanglement-CUTs can also be generalized to higher dimensions and to the thermodynamic limit.

cond-mat.str-el↗

arXiv2012

Bounds on universal quantum computation with perturbed 2d cluster states

Motivated by the possibility of universal quantum computation under noise perturbations, we compute the phase diagram of the 2d cluster state Hamiltonian in the presence of Ising terms and magnetic fields. Unlike in previous analysis of perturbed 2d cluster states, we find strong evidence of a very well defined cluster phase, separated from a polarized phase by a line of 1st and 2nd order transitions compatible with the 3d Ising universality class and a tricritical end point. The phase boundary sets an upper bound for the amount of perturbation in the system so that its ground state is still useful for measurement-based quantum computation purposes. Moreover, we also compute the local fidelity with the unperturbed 2d cluster state. Besides a classical approximation, we determine the phase diagram by combining series expansions and variational infinite Projected entangled-Pair States (iPEPS) methods. Our work constitutes the first analysis of the non-trivial effect of few-body perturbations in the 2d cluster state, which is of relevance for experimental proposals.

cond-mat.str-el↗

arXiv2012

Fate of the cluster state on the square lattice in a magnetic field

The cluster state represents a highly entangled state which is one central object for measurement-based quantum computing. Here we study the robustness of the cluster state on the two-dimensional square lattice at zero temperature in the presence of external magnetic fields by means of different types of high-order series expansions and variational techniques using infinite Projected Entangled Pair States (iPEPS). The phase diagram displays a first-order phase transition line ending in two critical end points. Furthermore, it contains a characteristic self-dual line in parameter space allowing many precise statements. The self-duality is shown to exist on any lattice topology.

quant-ph↗

arXiv2011

Breakdown of a perturbed Z_N topological phase

We study the robustness of a generalized Kitaev's toric code with Z_N degrees of freedom in the presence of local perturbations. For N=2, this model reduces to the conventional toric code in a uniform magnetic field. A quantitative analysis is performed for the perturbed Z_3 toric code by applying a combination of high-order series expansions and variational techniques. We provide strong evidences for first- and second-order phase transitions between topologically-ordered and polarized phases. Most interestingly, our results also indicate the existence of topological multi-critical points in the phase diagram.

cond-mat.stat-mech↗

arXiv2010

Robustness of a perturbed topological phase

We investigate the stability of the topological phase of the toric code model in the presence of a uniform magnetic field by means of variational and high-order series expansion approaches. We find that when this perturbation is strong enough, the system undergoes a topological phase transition whose first- or second-order nature depends on the field orientation. When this transition is of second order, it is in the Ising universality class except for a special line on which the critical exponent driving the closure of the gap varies continuously, unveiling a new topological universality class.

cond-mat.stat-mech↗

arXiv2010

Implementing global Abelian symmetries in projected entangled-pair state algorithms

Due to the unfavorable scaling of tensor network methods with the refinement parameter M, new approaches are necessary to improve the efficiency of numerical simulations based on such states in particular for gapless, strongly entangled systems. In one-dimensional DMRG, the use of Abelian symmetries has lead to large computational gain. In higher-dimensional tensor networks, this is associated with significant technical efforts and additional approximations. We explain a formalism to implement such symmetries in two-dimensional tensor network states and present benchmark results that confirm the validity of these approximations in the context of projected entangled-pair state algorithms.

cond-mat.str-el↗

arXiv2008

Classical simulation of infinite-size quantum lattice systems in two spatial dimensions

We present an algorithm to simulate two-dimensional quantum lattice systems in the thermodynamic limit. Our approach builds on the {\em projected entangled-pair state} algorithm for finite lattice systems [F. Verstraete and J.I. Cirac, cond-mat/0407066] and the infinite {\em time-evolving block decimation} algorithm for infinite one-dimensional lattice systems [G. Vidal, Phys. Rev. Lett. 98, 070201 (2007)]. The present algorithm allows for the computation of the ground state and the simulation of time evolution in infinite two-dimensional systems that are invariant under translations. We demonstrate its performance by obtaining the ground state of the quantum Ising model and analysing its second order quantum phase transition.

cond-mat.str-el↗

arXiv2008

Equivalence of critical scaling laws for many-body entanglement in the Lipkin-Meshkov-Glick model

We establish a relation between several entanglement properties in the Lipkin-Meshkov-Glick model, which is a system of mutually interacting spins embedded in a magnetic field. We provide analytical proofs that the single-copy entanglement and the global geometric entanglement of the ground state close to and at criticality behave as the entanglement entropy. These results are in deep contrast to what is found in one- dimensional spin systems where these three entanglement measures behave differently.

cond-mat.other↗

arXiv2006

Matrix Product States Algorithms and Continuous Systems

A generic method to investigate many-body continuous-variable systems is pedagogically presented. It is based on the notion of matrix product states (so-called MPS) and the algorithms thereof. The method is quite versatile and can be applied to a wide variety of situations. As a first test, we show how it provides reliable results in the computation of fundamental properties of a chain of quantum harmonic oscillators achieving off-critical and critical relative errors of the order of 10^(-8) and 10^(-4) respectively. Next, we use it to study the ground state properties of the quantum rotor model in one spatial dimension, a model that can be mapped to the Mott insulator limit of the 1-dimensional Bose-Hubbard model. At the quantum critical point, the central charge associated to the underlying conformal field theory can be computed with good accuracy by measuring the finite-size corrections of the ground state energy. Examples of MPS-computations both in the finite-size regime and in the thermodynamic limit are given. The precision of our results are found to be comparable to those previously encountered in the MPS studies of, for instance, quantum spin chains. Finally, we present a spin-off application: an iterative technique to efficiently get numerical solutions of partial differential equations of many variables. We illustrate this technique by solving Poisson-like equations with precisions of the order of 10^(-7).

cond-mat.str-el↗

arXiv2006

Entropy and Exact Matrix Product Representation of the Laughlin Wave Function

An analytical expression for the von Neumann entropy of the Laughlin wave function is obtained for any possible bipartition between the particles described by this wave function, for filling fraction nu=1. Also, for filling fraction nu=1/m, where m is an odd integer, an upper bound on this entropy is exhibited. These results yield a bound on the smallest possible size of the matrices for an exact representation of the Laughlin ansatz in terms of a matrix product state. An analytical matrix product state representation of this state is proposed in terms of representations of the Clifford algebra. For nu=1, this representation is shown to be asymptotically optimal in the limit of a large number of particles.

cond-mat.mes-hall↗

arXiv2006

Half the entanglement in critical systems is distillable from a single specimen

We establish that the leading critical scaling of the single-copy entanglement is exactly one half of the entropy of entanglement of a block in critical infinite spin chains in a general setting, using methods of conformal field theory. Conformal symmetry imposes that the single-copy entanglement for critical many-body systems scales as E_1(ρ_L)=(c/6) \log L- (c/6) (π^2/\log L) + O(1/L), where L is the number of constituents in a block of an infinite chain and c corresponds to the central charge. This proves that from a single specimen of a critical chain, already half the entanglement can be distilled compared to the rate that is asymptotically available. The result is substantiated by a quantitative analysis for all translationally invariant quantum spin chains corresponding to general isotropic quasi-free fermionic models. An analytic example of the XY model shows that away from criticality the above simple relation is only maintained near the quantum phase transition point.

quant-ph↗

arXiv2006

Simulation of many-qubit quantum computation with matrix product states

Matrix product states provide a natural entanglement basis to represent a quantum register and operate quantum gates on it. This scheme can be materialized to simulate a quantum adiabatic algorithm solving hard instances of a NP-Complete problem. Errors inherent to truncations of the exact action of interacting gates are controlled by the size of the matrices in the representation. The property of finding the right solution for an instance and the expected value of the energy are found to be remarkably robust against these errors. As a symbolic example, we simulate the algorithm solving a 100-qubit hard instance, that is, finding the correct product state out of ~ 10^30 possibilities. Accumulated statistics for up to 60 qubits point at a slow growth of the average minimum time to solve hard instances with highly-truncated simulations of adiabatic quantum evolution.

quant-ph↗

arXiv2005

Entanglement entropy in the Lipkin-Meshkov-Glick model

We analyze the entanglement entropy in the Lipkin-Meshkov-Glick model, which describes mutually interacting spins half embedded in a magnetic field. This entropy displays a singularity at the critical point that we study as a function of the interaction anisotropy, the magnetic field, and the system size. Results emerging from our analysis are surprisingly similar to those found for the one-dimensional XY chain.

cond-mat.stat-mech↗