Ensembles of physical states and random quantum circuits on graphs
Alioscia Hamma, Siddhartha Santra, Paolo Zanardi

TL;DR
This paper investigates the entanglement properties of random quantum states generated by local quantum circuits on graph structures, showing that area law and volume law behaviors emerge depending on evolution time scales.
Contribution
It extends previous work by analyzing typical entanglement in ensembles of states generated by finite-time random quantum circuits on graphs, highlighting conditions for area and volume law behaviors.
Findings
Area law holds on average for short evolution times.
Volume law is typical for longer evolution times proportional to system size.
Entanglement properties depend on circuit length and graph structure.
Abstract
In this paper we continue and extend the investigations of the ensembles of random physical states introduced in A. Hamma et al. [ http://prl.aps.org/abstract/PRL/v109/i4/e040502 Phys. Rev. Lett. 109, 040502 (2012)]. These ensembles are constructed by finite-length random quantum circuits (RQC) acting on the (hyper)edges of an underlying (hyper)graph structure. The latter encodes for the locality structure associated with finite-time quantum evolutions generated by physical i.e., local, Hamiltonians. Our goal is to analyze physical properties of typical states in these ensembles, in particular here we focus on proxies of quantum entanglement as purity and -Renyi entropies. The problem is formulated in terms of matrix elements of superoperators which depend on the graph structure, choice of probability measure over the local unitaries and circuit length. In the case…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
