Quick Navigation
Topics
Quantum Algorithms
Three Hamiltonians are Sufficient for Unitary k-Design in Temporal Ensemble
arXiv
Authors: Yi-Neng Zhou, Tian-Gang Zhou, Julian Sonner
Year
2026
Paper ID
45335
Status
Preprint
Abstract Read
~2 min
Abstract Words
197
Citations
N/A
Abstract
Unitary k-designs are central to quantum information and quantum many-body physics as efficient proxies for Haar-random dynamics. We study how chaotic Hamiltonian evolution can generate unitary k-designs. Standard approaches typically rely on many independent Hamiltonian realizations or fine-tuning evolution times. Here we show that unitary designs can instead arise from a quenched temporal ensemble, where Hamiltonians are sampled once and held fixed, while randomness enters only through the evolution times. We analyze a two-step protocol (2SP), applying H1 for time t1 and H2 for time t2, and a three-step protocol (3SP) with an additional quench, with all times randomly drawn from a prescribed distribution. Time averaging imposes energy-index matching in the frame potential (FP), which quantifies the distance to Haar random. Analytically and numerically, we show that 2SP cannot realize a general unitary k-design, whereas 3SP can do so for arbitrary k. The advantage of 3SP is that the additional random phases impose stronger constraints, eliminating independent permutation degrees of freedom in the FP. For Gaussian unitary ensemble Hamiltonians, we prove these results rigorously and show that under imperfect time averaging, 3SP achieves the same accuracy as 2SP with a parametrically narrower time window.
Why This Paper Matters
- It adds a 2026 reference point for readers tracking recent quantum research.
- Unitary k-designs are central to quantum information and quantum many-body physics as efficient proxies for Haar-random dynamics.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.