相关论文: The computational complexity of PEPS

It is well known that the kind of P systems involved in the definition of the P conjecture is able to solve problems in the complexity class $\mathbf{P}$ by leveraging the uniformity condition. Here we show that these systems are indeed…

We show how to design families of operational criteria that distinguish entangled from separable quantum states. The simplest of these tests corresponds to the well-known Peres-Horodecki positive partial transpose (PPT) criterion, and the…

We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and Graph Theory. In these setups, the paths of photons are identified such that the photon-source information is never created.…

The semi-empirical Pariser-Parr-Pople (PPP) Hamiltonian is reviewed for its ability to provide a minimal model of the chemistry of conjugated $\pi$-electron systems, and its current applications and limitations are discussed. From its…

Calculation of observables with three-dimensional projected entangled pair states is generally hard, as it requires a contraction of complex multi-layer tensor networks. We utilize the multi-layer structure of these tensor networks to…

We present a method of extracting information about the topological order from the ground state of a strongly correlated two-dimensional system computed with the infinite projected entangled pair state (iPEPS). For topologically ordered…

Recently it has been shown that projected entangled-pair states can be considered as a (physically motivated) resource state for measurement-based quantum computation. Here we elaborate on how to construct a deterministic measurement-based…

We characterize entanglement subject to its definition over real and complex, composite quantum systems. In particular, a method is established to assess quantum correlations with respect to a selected number system, illuminating the deeply…

The use of combinatorial optimization algorithms has contributed substantially to the major progress that has occurred in recent years in the understanding of the physics of disordered systems, such as the random-field Ising model. While…

Construction of genuinely entangled multipartite subspaces with certain characteristics has become a relevant task in various branches of quantum information. Here we show that such subspaces can be obtained from an arbitrary collection of…

The study of quantum circuit simulation using classical computers is a key research topic that helps define the boundary of verifiable quantum advantage, solve quantum many-body problems, and inform development of quantum hardware and…

Gauged fermionic projected entangled pair states (GFPEPS) and their Gaussian counterpart (GGFPEPS) are a novel type of lattice gauge theory Ansatz state that combine ideas from the Monte Carlo and tensor network communities. In particular,…

While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact computational complexity of these problems has not been established…

Tensor network states and parton wave functions are two pivotal methods for studying quantum many-body systems. This work connects these two subjects as we demonstrate that a variety of parton wave functions, such as projected Fermi sea and…

An important class of model Hamiltonians for investigation of topological phases of matter consists of mobile, interacting particles on a lattice subject to a semi-classical gauge field, as exemplified by the bosonic Harper-Hofstadter…

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…

Tensor networks are a powerful modeling framework developed for computational many-body physics, which have only recently been applied within machine learning. In this work we utilize a uniform matrix product state (u-MPS) model for…

We investigate how to generate maximally entangled states in systems characterized by the Hamiltonian of the XXZ model with defects. Some proposed quantum computers are described by such model. We show how the defects can be used to obtain…

Product states, unentangled tensor products of single qubits, are a ubiquitous ansatz in quantum computation, including for state-of-the-art Hamiltonian approximation algorithms. A natural question is whether we should expect to efficiently…

Entanglement assistance is known to reduce the quantum communication complexity of evaluating functions with distributed inputs. But does the type of entanglement matter, or are EPR pairs always sufficient? This is a natural question…