pith. machine review for the scientific record. sign in

arxiv: 1609.07021 · v3 · submitted 2016-09-22 · 🪐 quant-ph · cond-mat.stat-mech· hep-th

Recognition: unknown

Efficient unitary designs with nearly time-independent Hamiltonian dynamics

Authors on Pith no claims yet
classification 🪐 quant-ph cond-mat.stat-mechhep-th
keywords unitarydesigndesignshamiltonianbasesconstructionsdynamicsforms
0
0 comments X
read the original abstract

We provide new constructions of unitary $t$-designs for general $t$ on one qudit and $N$ qubits, and propose a design Hamiltonian, a random Hamiltonian of which dynamics always forms a unitary design after a threshold time, as a basic framework to investigate randomising time evolution in quantum many-body systems. The new constructions are based on recently proposed schemes of repeating random unitaires diagonal in mutually unbiased bases. We first show that, if a pair of the bases satisfies a certain condition, the process on one qudit approximately forms a unitary $t$-design after $O(t)$ repetitions. We then construct quantum circuits on $N$ qubits that achieve unitary $t$-designs for $t = o(N^{1/2})$ using $O(t N^2)$ gates, improving the previous result using $O(t^{10}N^2)$ gates in terms of $t$. Based on these results, we present a design Hamiltonian with periodically changing two-local spin-glass-type interactions, leading to fast and relatively natural realisations of unitary designs in complex many-body systems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Arts & crafts: Strong random unitaries and geometric locality

    quant-ph 2026-05 unverdicted novelty 7.0

    Two constructions yield strong unitary k-designs and pseudorandom unitaries on D-dimensional grids with provably optimal depth.

  2. Computational and physical complexity of synthesizing random multi-qudit quantum states and unitary operators

    quant-ph 2026-05 unverdicted novelty 5.0

    Computational complexity of random multi-qudit states and unitaries scales exponentially with qudit number, while physical complexity scales more slowly.