Using level-2 fuzzy sets to combine uncertainty and imprecision in fuzzy regions

In many applications, spatial data need to be considered but are prone to uncertainty or imprecision. A fuzzy region - a fuzzy set over a two dimensional domain - allows the representation of such imperfect spatial data. In the original model, points of the fuzzy region where treated independently, making it impossible to model regions where groups of points should be considered as one basic element or subregion. A first extension overcame this, but required points within a group to have the same membership grade. In this contribution, we will extend this further, allowing a fuzzy region to contain subregions in which not all points have the same membership grades. The concept can be used as an underlying model in spatial applications, e.g. websites showing maps and requiring representation of imprecise features or websites with routing functions needing to handle concepts as walking distance or closeby

Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space

We consider the manifold of all quantum many-body states that can be generated by arbitrary time-dependent local Hamiltonians in a time that scales polynomially in the system size, and show that it occupies an exponentially small volume in Hilbert space. This implies that the overwhelming majority of states in Hilbert space are not physical as they can only be produced after an exponentially long time. We establish this fact by making use of a time-dependent generalization of the Suzuki-Trotter expansion, followed by a counting argument. This also demonstrates that a computational model based on arbitrarily rapidly changing Hamiltonians is no more powerful than the standard quantum circuit model.Comment: Presented at QIP 201

Asymptotic entanglement capacity of the Ising and anisotropic Heisenberg interactions

We compute the asymptotic entanglement capacity of the Ising interaction ZZ, the anisotropic Heisenberg interaction XX + YY, and more generally, any two-qubit Hamiltonian with canonical form K = a XX + b YY. We also describe an entanglement assisted classical communication protocol using the Hamiltonian K with rate equal to the asymptotic entanglement capacity.Comment: 5 pages, 1 figure; minor corrections, conjecture adde

Matrix Product Density Operators: Renormalization Fixed Points and Boundary Theories

We consider the tensors generating matrix product states and density operators in a spin chain. For pure states, we revise the renormalization procedure introduced by F. Verstraete et al. in 2005 and characterize the tensors corresponding to the fixed points. We relate them to the states possessing zero correlation length, saturation of the area law, as well as to those which generate ground states of local and commuting Hamiltonians. For mixed states, we introduce the concept of renormalization fixed points and characterize the corresponding tensors. We also relate them to concepts like finite correlation length, saturation of the area law, as well as to those which generate Gibbs states of local and commuting Hamiltonians. One of the main result of this work is that the resulting fixed points can be associated to the boundary theories of two-dimensional topological states, through the bulk-boundary correspondence introduced by Cirac et al. in 2011.Comment: 63 pages, Annals of Physics (2016). Accepted versio

Matrix Product State Representations

This work gives a detailed investigation of matrix product state (MPS) representations for pure multipartite quantum states. We determine the freedom in representations with and without translation symmetry, derive respective canonical forms and provide efficient methods for obtaining them. Results on frustration free Hamiltonians and the generation of MPS are extended, and the use of the MPS-representation for classical simulations of quantum systems is discussed.Comment: Minor changes. To appear in QI

Quantum Metropolis Sampling

The original motivation to build a quantum computer came from Feynman who envisaged a machine capable of simulating generic quantum mechanical systems, a task that is believed to be intractable for classical computers. Such a machine would have a wide range of applications in the simulation of many-body quantum physics, including condensed matter physics, chemistry, and high energy physics. Part of Feynman's challenge was met by Lloyd who showed how to approximately decompose the time-evolution operator of interacting quantum particles into a short sequence of elementary gates, suitable for operation on a quantum computer. However, this left open the problem of how to simulate the equilibrium and static properties of quantum systems. This requires the preparation of ground and Gibbs states on a quantum computer. For classical systems, this problem is solved by the ubiquitous Metropolis algorithm, a method that basically acquired a monopoly for the simulation of interacting particles. Here, we demonstrate how to implement a quantum version of the Metropolis algorithm on a quantum computer. This algorithm permits to sample directly from the eigenstates of the Hamiltonian and thus evades the sign problem present in classical simulations. A small scale implementation of this algorithm can already be achieved with today's technologyComment: revised versio

Preparing projected entangled pair states on a quantum computer

We present a quantum algorithm to prepare injective PEPS on a quantum computer, a class of open tensor networks representing quantum states. The run-time of our algorithm scales polynomially with the inverse of the minimum condition number of the PEPS projectors and, essentially, with the inverse of the spectral gap of the PEPS' parent Hamiltonian.Comment: 5 pages, 1 figure. To be published in Physical Review Letters. Removed heuristics, refined run-time boun

Strings, Projected Entangled Pair States, and variational Monte Carlo methods

We introduce string-bond states, a class of states obtained by placing strings of operators on a lattice, which encompasses the relevant states in Quantum Information. For string-bond states, expectation values of local observables can be computed efficiently using Monte Carlo sampling, making them suitable for a variational abgorithm which extends DMRG to higher dimensional and irregular systems. Numerical results demonstrate the applicability of these states to the simulation of many-body sytems.Comment: 4 pages. v2: Submitted version, containing more numerical data. Changed title and renamed "string states" to "string-bond states" to comply with PRL conventions. v3: Accepted version, Journal-Ref. added (title differs from journal

Local permutations of products of Bell states and entanglement distillation

We present new algorithms for mixed-state multi-copy entanglement distillation for pairs of qubits. Our algorithms perform significantly better than the best known algorithms. Better algorithms can be derived that are tuned for specific initial states. The new algorithms are based on a characterization of the group of all locally realizable permutations of the 4^n possible tensor products of n Bell states.Comment: 6 pages, 1 figur

Valence Bond Solids for Quantum Computation

Cluster states are entangled multipartite states which enable to do universal quantum computation with local measurements only. We show that these states have a very simple interpretation in terms of valence bond solids, which allows to understand their entanglement properties in a transparent way. This allows to bridge the gap between the differences of the measurement-based proposals for quantum computing, and we will discuss several features and possible extensions