Related papers: Preparing projected entangled pair states on a qua…
Quantum Computing allows, in principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register, offering a promising solution to overcome the limitations of traditional quantum chemistry…
Quantum state preparation is an important subroutine in many quantum algorithms. The goal is to encode classical information directly to the quantum state so that it is possible to leverage quantum algorithms for data processing. However,…
We propose an efficient algorithm for simulating quantum many-body systems in two spatial dimensions using projected entangled pair states. This is done by approximating the environment, arising in the context of updating tensors in the…
An important problem in quantum information theory is to understand what makes entangled quantum systems non-local or hard to simulate efficiently. In this work we consider situations in which various parties have access to a restricted set…
Simulating strongly-correlated quantum many-body systems at finite temperatures is a significant challenge in computational physics. In this work, we present a scalable finite-temperature tensor network algorithm for two-dimensional quantum…
We argue and demonstrate that projected entangled-pair states (PEPS) outperform matrix product states significantly for the task of generative modeling of datasets with an intrinsic two-dimensional structure such as images. Our approach…
Many-body ground state preparation is an important subroutine used in the simulation of physical systems. In this paper, we introduce a flexible and efficient framework for obtaining a state preparation circuit for a large class of…
We construct parent Hamiltonians involving only local 2-body interactions for a broad class of Projected Entangled Pair States (PEPS). Making use of perturbation gadget techniques, we define a perturbative Hamiltonian acting on the virtual…
Recent advances on quantum computing hardware have pushed quantum computing to the verge of quantum supremacy. Random quantum circuits are outstanding candidates to demonstrate quantum supremacy, which could be implemented on a quantum…
Distributed quantum computing offers a promising approach to scaling quantum devices by networking multiple quantum processors. We present a quantum state tomography protocol tailored for distributed quantum computers that avoids assuming…
We revisit gradient-based optimization for infinite projected entangled pair states (iPEPS), a tensor network ansatz for simulating many-body quantum systems. This approach is hindered by two major challenges: the high computational cost of…
The preparation of tensor network states is a fundamental prerequisite for a wide range of quantum simulation tasks. While many unitary protocols for preparing these states have been investigated, dissipative state preparation provides a…
In recent years, the variational Monte Carlo (VMC) calculations of projected entangled pair states (PEPS) has emerged as a competitive method for computing the ground states of many-body quantum systems. This method is particularly…
We present a continuous tensor-network construction for the states of quantum fields called cPEPS (continuous projected entangled pair state), which enjoys the same spatial and global symmetries of ground-states of relativistic field…
An extension of the projected entangled-pair states (PEPS) algorithm to infinite systems, known as the iPEPS algorithm, was recently proposed to compute the ground state of quantum systems on an infinite two-dimensional lattice. Here we…
We propose a quantum inverse iteration algorithm which can be used to estimate the ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the…
Ubiquitous in quantum computing is the step to encode data into a quantum state. This process is called quantum state preparation, and its complexity for non-structured data is exponential on the number of qubits. Several works address this…
We provide explicit circuits implementing the Kitaev-Webb algorithm for the preparation of multi-dimensional Gaussian states on quantum computers. While asymptotically efficient due to its polynomial scaling, we find that the circuits…
The Hamiltonian for a system of itinerant particles on a two-dimensional lattice in a uniform magnetic field reduces the translational symmetry to a magnetic translation group, because of the need to choose a particular gauge for the vector…
We present a general graph-based Projected Entangled-Pair State (gPEPS) algorithm to approximate ground states of nearest-neighbor local Hamiltonians on any lattice or graph of infinite size. By introducing the structural-matrix which…