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.Comment: 4 pages, 6 figures, 1 table. Revised version, with new diagrams and plots. The results on classical systems can now be found at arXiv:0711.396

Exploring corner transfer matrices and corner tensors for the classical simulation of quantum lattice systems

In this paper we explore the practical use of the corner transfer matrix and its higher-dimensional generalization, the corner tensor, to develop tensor network algorithms for the classical simulation of quantum lattice systems of infinite size. This exploration is done mainly in one and two spatial dimensions (1d and 2d). We describe a number of numerical algorithms based on corner matri- ces and tensors to approximate different ground state properties of these systems. The proposed methods make also use of matrix product operators and projected entangled pair operators, and naturally preserve spatial symmetries of the system such as translation invariance. In order to assess the validity of our algorithms, we provide preliminary benchmarking calculations for the spin-1/2 quantum Ising model in a transverse field in both 1d and 2d. Our methods are a plausible alternative to other well-established tensor network approaches such as iDMRG and iTEBD in 1d, and iPEPS and TERG in 2d. The computational complexity of the proposed algorithms is also considered and, in 2d, important differences are found depending on the chosen simulation scheme. We also discuss further possibilities, such as 3d quantum lattice systems, periodic boundary conditions, and real time evolution. This discussion leads us to reinterpret the standard iTEBD and iPEPS algorithms in terms of corner transfer matrices and corner tensors. Our paper also offers a perspective on many properties of the corner transfer matrix and its higher-dimensional generalizations in the light of novel tensor network methods.Comment: 25 pages, 32 figures, 2 tables. Revised version. Technical details on some of the algorithms have been moved to appendices. To appear in PR

Single-copy entanglement in a gapped quantum spin chain

The single-copy entanglement of a given many-body system is defined [J. Eisert and M. Cramer, Phys. Rev. A. 72, 042112 (2005)] as the maximal entanglement deterministically distillable from a bipartition of a single specimen of that system. For critical (gapless) spin chains, it was recently shown that this is exactly half the von Neumann entropy [R. Orus, J. I. Latorre, J. Eisert, and M. Cramer, Phys. Rev. A 73, 060303(R) (2006)], itself defined as the entanglement distillable in the asymptotic limit: i.e. given an infinite number of copies of the system. It is an open question as to what the equivalent behaviour for gapped systems is. In this paper, I show that for the paradigmatic spin-S Affleck-Kennedy-Lieb-Tasaki chain (the archetypal gapped chain), the single-copy entanglement is equal to the von Neumann entropy: i.e. all the entanglement present may be distilled from a single specimen.Comment: Typos corrected; accepted for publication in Phys. Rev. Lett.; comments welcom

The iTEBD algorithm beyond unitary evolution

The infinite time-evolving block decimation (iTEBD) algorithm [Phys. Rev. Lett. 98, 070201 (2007)] allows to simulate unitary evolution and to compute the ground state of one-dimensional quantum lattice systems in the thermodynamic limit. Here we extend the algorithm to tackle a much broader class of problems, namely the simulation of arbitrary one-dimensional evolution operators that can be expressed as a (translationally invariant) tensor network. Relatedly, we also address the problem of finding the dominant eigenvalue and eigenvector of a one-dimensional transfer matrix that can be expressed in the same way. New applications include the simulation, in the thermodynamic limit, of open (i.e. master equation) dynamics and thermal states in 1D quantum systems, as well as calculations with partition functions in 2D classical systems, on which we elaborate. The present extension of the algorithm also plays a prominent role in the infinite projected entangled-pair states (iPEPS) approach to infinite 2D quantum lattice systems.Comment: 11 pages, 16 figures, 1 appendix with algorithms for specific types of evolution. A typo in the appendix figures has been corrected. Accepted in PR

Ground state fidelity from tensor network representations

For any D-dimensional quantum lattice system, the fidelity between two ground state many-body wave functions is mapped onto the partition function of a D-dimensional classical statistical vertex lattice model with the same lattice geometry. The fidelity per lattice site, analogous to the free energy per site, is well-defined in the thermodynamic limit and can be used to characterize the phase diagram of the model. We explain how to compute the fidelity per site in the context of tensor network algorithms, and demonstrate the approach by analyzing the two-dimensional quantum Ising model with transverse and parallel magnetic fields.Comment: 4 pages, 2 figures. Published version in Physical Review Letter

Necessity of Superposition of Macroscopically Distinct States for Quantum Computational Speedup

For quantum computation, we investigate the conjecture that the superposition of macroscopically distinct states is necessary for a large quantum speedup. Although this conjecture was supported for a circuit-based quantum computer performing Shor's factoring algorithm [A. Ukena and A. Shimizu, Phys. Rev. A69 (2004) 022301], it needs to be generalized for it to be applicable to a large class of algorithms and/or other models such as measurement-based quantum computers. To treat such general cases, we first generalize the indices for the superposition of macroscopically distinct states. We then generalize the conjecture, using the generalized indices, in such a way that it is unambiguously applicable to general models if a quantum algorithm achieves exponential speedup. On the basis of this generalized conjecture, we further extend the conjecture to Grover's quantum search algorithm, whose speedup is large but quadratic. It is shown that this extended conjecture is also correct. Since Grover's algorithm is a representative algorithm for unstructured problems, the present result further supports the conjecture.Comment: 18 pages, 5 figures. Fixed typos throughout the manuscript. This version has been publishe

Geometric Entanglement of Symmetric States and the Majorana Representation

Permutation-symmetric quantum states appear in a variety of physical situations, and they have been proposed for quantum information tasks. This article builds upon the results of [New J. Phys. 12, 073025 (2010)], where the maximally entangled symmetric states of up to twelve qubits were explored, and their amount of geometric entanglement determined by numeric and analytic means. For this the Majorana representation, a generalization of the Bloch sphere representation, can be employed to represent symmetric n qubit states by n points on the surface of a unit sphere. Symmetries of this point distribution simplify the determination of the entanglement, and enable the study of quantum states in novel ways. Here it is shown that the duality relationship of Platonic solids has a counterpart in the Majorana representation, and that in general maximally entangled symmetric states neither correspond to anticoherent spin states nor to spherical designs. The usability of symmetric states as resources for measurement-based quantum computing is also discussed.Comment: 10 pages, 8 figures; submitted to Lecture Notes in Computer Science (LNCS

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.Comment: 27 pages, 10 figure

Tree Tensor Network State with Variable Tensor Order: An Efficient Multireference Method for Strongly Correlated Systems

[Image: see text] We study the tree-tensor-network-state (TTNS) method with variable tensor orders for quantum chemistry. TTNS is a variational method to efficiently approximate complete active space (CAS) configuration interaction (CI) wave functions in a tensor product form. TTNS can be considered as a higher order generalization of the matrix product state (MPS) method. The MPS wave function is formulated as products of matrices in a multiparticle basis spanning a truncated Hilbert space of the original CAS-CI problem. These matrices belong to active orbitals organized in a one-dimensional array, while tensors in TTNS are defined upon a tree-like arrangement of the same orbitals. The tree-structure is advantageous since the distance between two arbitrary orbitals in the tree scales only logarithmically with the number of orbitals N, whereas the scaling is linear in the MPS array. It is found to be beneficial from the computational costs point of view to keep strongly correlated orbitals in close vicinity in both arrangements; therefore, the TTNS ansatz is better suited for multireference problems with numerous highly correlated orbitals. To exploit the advantages of TTNS a novel algorithm is designed to optimize the tree tensor network topology based on quantum information theory and entanglement. The superior performance of the TTNS method is illustrated on the ionic-neutral avoided crossing of LiF. It is also shown that the avoided crossing of LiF can be localized using only ground state properties, namely one-orbital entanglement

Optimal free descriptions of many-body theories

Interacting bosons or fermions give rise to some of the most fascinating phases of matter, including high-temperature superconductivity, the fractional quantum Hall effect, quantum spin liquids and Mott insulators. Although these systems are promising for technological applications, they also present conceptual challenges, as they require approaches beyond mean-field and perturbation theory. Here we develop a general framework for identifying the free theory that is closest to a given interacting model in terms of their ground-state correlations. Moreover, we quantify the distance between them using the entanglement spectrum. When this interaction distance is small, the optimal free theory provides an effective description of the low-energy physics of the interacting model. Our construction of the optimal free model is non-perturbative in nature; thus, it offers a theoretical framework for investigating strongly correlated systems