Characterization of randomness in quantum circuits of continuous gate sets
Yosuke Mitsuhashi, Ryotaro Suzuki, Tomohiro Soejima, and Nobuyuki Yoshioka

TL;DR
This paper extends the characterization of randomness in quantum circuits with continuous symmetries, providing detailed derivations and a general framework for symmetric local random circuits and their asymptotic properties.
Contribution
It offers a comprehensive derivation of theorems for general symmetries and introduces a framework for analyzing symmetric local unitary gate sets in quantum circuits.
Findings
Explicit characterization of asymptotic unitary designs for various symmetries
Derivation of main theorems for general symmetry groups
Framework for analyzing finite sets of connected compact subgroups
Abstract
In the accompanying paper of arXiv:2408.13472, we have established the method of characterizing the maximal order of asymptotic unitary designs generated by symmetric local random circuits, and have explicitly specified the order in the cases of , U(1), and SU(2) symmetries. Here, we provide full details on the derivation of the main theorems for general symmetry and for concrete symmetries. Furthermore, we consider a general framework where we have access to a finite set of connected compact unitary subgroups, which includes symmetric local unitary gate sets.
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Low-power high-performance VLSI design · Quantum and electron transport phenomena
