Related papers: Pseudoentanglement from tensor networks
Entanglement is a quantum resource, in some ways analogous to randomness in classical computation. Inspired by recent work of Gheorghiu and Hoban, we define the notion of "pseudoentanglement'', a property exhibited by ensembles of…
An experimental verification of the maximally entangled state ensures that the constructed state is close to the maximally entangled state, but it does not guarantee that the state is exactly the same as the maximally entangled state.…
Pseudorandom states (PRS) are an important primitive in quantum cryptography. In this paper, we show that subset states can be used to construct PRSs. A subset state with respect to $S$, a subset of the computational basis, is \[…
We show that any pseudoentangled state ensemble with a gap of $t$ bits of entropy requires $\Omega(t)$ non-Clifford gates to prepare. This bound is tight up to polylogarithmic factors if linear-time quantum-secure pseudorandom functions…
Random tensor networks are a powerful toy model for understanding the entanglement structure of holographic quantum gravity. However, unlike holographic quantum gravity, their entanglement spectra are flat. It has therefore been argued that…
Tensor network states provide successful descriptions of strongly correlated quantum systems with applications ranging from condensed matter physics to cosmology. Any family of tensor network states possesses an underlying entanglement…
Conventional holographic tensor networks can be described as toy holographic maps constructed from many small linear maps acting in a spatially local way, all connected together with ``background entanglement'', i.e. links of a fixed state,…
We define a relational notion of a subsystem in theories of matrix quantum mechanics and show how the corresponding entanglement entropy can be given as a minimisation, exhibiting many similarities to the Ryu-Takayanagi formula. Our…
We show it is possible to obtain quantum pseudorandomness and pseudoentanglement from random subset states -- i.e. quantum states which are equal superpositions over (pseudo)random subsets of strings. This answers an open question of…
In tensor networks, a geometric operation of pushing a bond cut surface toward a minimal surface corresponds to entanglement distillation. Cutting bonds defines a reduced transition matrix on the bond cut surface and the associated quantum…
We present experimentally and numerically accessible quantities that can be used to differentiate among various families of random entangled states. To this end, we analyze the entanglement properties of bipartite reduced states of a…
We put forward a simple construction of genuinely entangled subspaces -- subspaces supporting only genuinely multipartite entangled states -- of any permissible dimensionality for any number of parties and local dimensions. The method uses…
For general random tensor network states at large bond dimension, we prove that the integer R\'enyi reflected entropies (away from phase transitions) are determined by minimal triway cuts through the network. This generalizes the minimal…
We introduce a method for extracting meaningful entanglement measures of tensor network states in general dimensions. Current methods require the explicit reconstruction of the density matrix, which is highly demanding, or the contraction…
In this article we present analytical results on the exact tensor network representations and correlation functions of the first examples of 2D ground states with quantum phase transitions between area law and extensive entanglement…
Quantum resources like entanglement and magic are essential for characterizing the complexity of quantum states. However, when the number of copies of quantum states and the computational time are limited by numbers polynomial in the system…
In this work, we construct small sets of bipartite orthogonal pure states that cannot be perfectly distinguished by local operations and classical communication (LOCC). We mention that not all the states within the constructed sets are…
We introduce a sequence of numerical tests that can determine the entanglement or separability of a state even when there is not enough information to completely determine its density matrix. Given partial information about the state in the…
Tensor networks are useful toy models for understanding the structure of entanglement in holographic states and reconstruction of bulk operators within the entanglement wedge. They are, however, constrained to only prepare so-called…
In a recent paper Sanpera et al. have shown, that for the simplest binary composite systems any density matrix can be described in terms of only product vectors. The purpose of this note is to show that posibillity of decomposing any state…