Average Entropy of a Subsystem

1996/01/24 by Siddhartha Sen · 6 citations
Computer Science · Physics and Astronomy · #Advanced Thermodynamics and Statistical Mechanics #Quantum Computing Algorithms and Architecture #Quantum many-body systems #hep-th

paper · pdf · doi:10.1103/physrevlett.77.1

published as Phys.Rev.Lett. 77 (1996) 1-3 · 2 pages, requires revtex

arxiv created 1996/01/24 · openalex publication_date 1996/07/01 · arxiv updated 2009/11/30 · openalex created_date 2020/05/13 · openalex updated_date 2026/08/04

Abstract

It was recently conjectured by D. Page that if a quantum system of Hilbert space dimension nm is in a random pure state then the average entropy of a subsystem of dimension m where m ≤ n is S_mn = ∑^mn_k=n+1(1/k) - (m-1)/2n. In this letter this conjecture is proved.

Cited by

• Optimal two-qubit gate for generation of random bipartite entanglement
• Asymptotics of Random Density Matrices
• Largest Schmidt eigenvalue of random pure states and conductance distribution in chaotic cavities
• Universality of entanglement and quantum-computation complexity
• Quantum Approach to a Derivation of the Second Law of Thermodynamics
• Average entropy of a subsystem from its average Tsallis entropy