Pseudoentanglement Ain't Cheap
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911530603249664 |
|---|---|
| author | Grewal, Sabee Iyer, Vishnu Kretschmer, William Liang, Daniel |
| author_facet | Grewal, Sabee Iyer, Vishnu Kretschmer, William Liang, Daniel |
| contents | We show that any pseudoentangled state ensemble with a gap of $t$ bits of entropy requires $Ω(t)$ non-Clifford gates to prepare. This bound is tight up to polylogarithmic factors if linear-time quantum-secure pseudorandom functions exist. Our result follows from a polynomial-time algorithm to estimate the entanglement entropy of a quantum state across any cut of qubits. When run on an $n$-qubit state that is stabilized by at least $2^{n-t}$ Pauli operators, our algorithm produces an estimate that is within an additive factor of $\frac{t}{2}$ bits of the true entanglement entropy. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_00126 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Pseudoentanglement Ain't Cheap Grewal, Sabee Iyer, Vishnu Kretschmer, William Liang, Daniel Quantum Physics Computational Complexity We show that any pseudoentangled state ensemble with a gap of $t$ bits of entropy requires $Ω(t)$ non-Clifford gates to prepare. This bound is tight up to polylogarithmic factors if linear-time quantum-secure pseudorandom functions exist. Our result follows from a polynomial-time algorithm to estimate the entanglement entropy of a quantum state across any cut of qubits. When run on an $n$-qubit state that is stabilized by at least $2^{n-t}$ Pauli operators, our algorithm produces an estimate that is within an additive factor of $\frac{t}{2}$ bits of the true entanglement entropy. |
| title | Pseudoentanglement Ain't Cheap |
| topic | Quantum Physics Computational Complexity |
| url | https://arxiv.org/abs/2404.00126 |