Quantum Pseudoentanglement

by   Adam Bouland, et al.

Quantum pseudorandom states are efficiently constructable states which nevertheless masquerade as Haar-random states to poly-time observers. First defined by Ji, Liu and Song, such states have found a number of applications ranging from cryptography to the AdS/CFT correspondence. A fundamental question is exactly how much entanglement is required to create such states. Haar-random states, as well as t-designs for t≥ 2, exhibit near-maximal entanglement. Here we provide the first construction of pseudorandom states with only polylogarithmic entanglement entropy across an equipartition of the qubits, which is the minimum possible. Our construction can be based on any one-way function secure against quantum attack. We additionally show that the entanglement in our construction is fully "tunable", in the sense that one can have pseudorandom states with entanglement Θ(f(n)) for any desired function ω(log n) ≤ f(n) ≤ O(n). More fundamentally, our work calls into question to what extent entanglement is a "feelable" quantity of quantum systems. Inspired by recent work of Gheorghiu and Hoban, we define a new notion which we call "pseudoentanglement", which are ensembles of efficiently constructable quantum states which hide their entanglement entropy. We show such states exist in the strongest form possible while simultaneously being pseudorandom states. We also describe diverse applications of our result from entanglement distillation to property testing to quantum gravity.


page 1

page 2

page 3

page 4


A Computational Separation Between Quantum No-cloning and No-teleportation

Two of the fundamental no-go theorems of quantum information are the no-...

A Boolean Functions Theoretic Approach to Quantum Hypergraph States and Entanglement

We establish an one-to-one correspondence between the Boolean functions ...

From communication complexity to an entanglement spread area law in the ground state of gapped local Hamiltonians

In this work, we make a connection between two seemingly different probl...

Maximizing the geometric measure of entanglement

The characterization of the maximally achievable entanglement in a given...

(Causal)-Activation of Complex Entanglement Structures in Quantum Networks

Entanglement represents "the" key resource for several applications of q...

A monogamy-of-entanglement game for subspace coset states

We establish a strong monogamy-of-entanglement property for subspace cos...

Ubiquitous Complexity of Entanglement Spectra

In recent years, the entanglement spectra of quantum states have been id...

Please sign up or login with your details

Forgot password? Click here to reset