Unitary $k$-designs without Hamiltonian quenches
- URL: http://arxiv.org/abs/2607.20640v2
- Date: Thu, 30 Jul 2026 07:46:27 GMT
- Title: Unitary $k$-designs without Hamiltonian quenches
- Abstract summary: Unitary designs provide a resource-efficient framework for emulating Haar randomness up to a desired order.<n>We introduce a two-Pauli-kick (2PK) protocol, in which unitary evolution under a fixed Hamiltonian is interspersed with two Pauli operator insertions.<n>We verify this protocol for single realizations of Gaussian random matrices, the Majorana and Spin Sachdev-Ye-Kitaev models, and deterministic local quantum spin chains.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Unitary designs provide a resource-efficient framework for emulating Haar randomness up to a desired order. Quench-based protocols have recently been shown to generate such designs, but achieving this typically requires multiple Hamiltonian realizations, even when using temporal ensembles. Here, we show that no Hamiltonian quenches are required: a single chaotic Hamiltonian is sufficient to generate approximate unitary $k$-designs, even when that Hamiltonian is spatially local. We introduce a two-Pauli-kick (2PK) protocol, in which unitary evolution under a fixed Hamiltonian is interspersed with two Pauli operator insertions (kicks). By evaluating the frame potential, we demonstrate that the resulting ensemble approaches the Haar value. We verify this protocol for single realizations of Gaussian random matrices, the Majorana and Spin Sachdev-Ye-Kitaev models, and deterministic local quantum spin chains. Remarkably, in these deterministic spin systems, the 2PK protocol generates approximate unitary designs in regimes where conventional quench-based protocols are either inapplicable or fail to converge. Furthermore, our protocol provides a finite-temperature extension of the frame potential and establishes an analytic bound in terms of the equilibrium partition function. We discuss a holographic perspective on this mechanism.
Related papers
- Spin-coherent quantum designs [0.0]
We show that the canonical finite coherent-state formula reconstructs every operator in the rank-$S$ sector exactly if and only if the sampling points form a spherical $(2J+S)$-design.<n>We derive practical protocols for estimating moments of spin operators from these constructions, with direct applications to polarimetry, magnetometry, and quantum state tomography.
arXiv Detail & Related papers (2026-08-11T18:00:06Z) - Unitary designs from perturbed time evolutions of a chaotic Hamiltonian [2.8651557030899144]
Unitary designs provide efficient substitutes for Haar-random unitaries in quantum information processing.<n>We propose a protocol based on time evolutions of a single chaotic Hamiltonian with intermediate unitary perturbations to generate unitary designs.
arXiv Detail & Related papers (2026-07-25T08:44:01Z) - The log log jam in Gaussian state tomography [30.395638404311537]
We show that any protocol that uses Gaussian measurements, even entangled or adaptively chosen ones, must incur a $log log E$ dependence.<n>With highly entangled, non-Gaussian measurements, one can learn $n$-mode pure Gaussian states with $O(n2 / 2)$ samples, independent of $E$.<n>Our results shed new light on the intriguing interplay between adaptivity, entanglement, and magic in quantum learning.
arXiv Detail & Related papers (2026-07-14T17:25:43Z) - Attention-based optimizer for symmetry finding [32.58639026625496]
We present an optimization framework that searches Pauli symmetries of Hamiltonians.<n>Our framework uses self-attention to encode the pairwise and higher-order correlations among the Pauli-Strings.<n>We show that our framework succeeds with near-deterministic probability while providing substantial advantage compared to state-of-the-art strategies.
arXiv Detail & Related papers (2026-05-28T18:00:13Z) - On the Approximation Complexity of Matrix Product Operator Born Machines [27.03788036535737]
Matrix product operator Born machines (MPO-BMs) are tractable tensor-network models for probabilistic modeling.<n>We prove that KL approximation is NP-hard for MPO-BMs in the continuous setting.<n>We also show that, under a locality and spectral-gap conditions on the loss-induced Hamiltonian, structured targets admit MPO-BM approximations with bond and provable KL guarantees.
arXiv Detail & Related papers (2026-05-12T03:38:49Z) - Unitary Designs from Two Chaotic Hamiltonians and a Random Pauli Operation [11.426625530759457]
unitary designs are of fundamental interest in quantum science.<n>Recent developments have explored the possibility of generating unitary designs using only a small number of quantum quenches.<n>We propose the emergence of unitary designs in the temporal ensemble of qubit systems evolved under two distinct chaotic Hamiltonians.
arXiv Detail & Related papers (2026-04-11T09:35:45Z) - Quantum Scrambling Born Machine [0.0]
Quantum generative modeling, where the Born rule naturally defines probability distributions, is a promising near-term application of quantum computing.<n>We propose a Quantum Scrambling Born Machine in which a fixed entangling unitary provides multi-qubit entanglement, while only single-qubit rotations are optimized.<n>We show that, for the benchmark distributions and system sizes considered, once the entangler produces near-Haar-typical entanglement the model learns the target distribution with weak sensitivity to the scrambler's microscopic origin.
arXiv Detail & Related papers (2026-02-19T11:33:56Z) - Random unitaries from Hamiltonian dynamics [37.08488662212577]
We study the indistinguishability of time-independent Hamiltonian dynamics from truly random unitaries.<n>We prove that there exist ensembles of random polylog-local Hamiltonians in one-dimension such that under constant evolution time, the resulting time-evolution unitary is indistinguishable from Haar-random.
arXiv Detail & Related papers (2025-10-09T16:46:55Z) - A non-Hermitian Su-Schrieffer-Heeger model with the energy levels of free parafermions [0.0]
We generate non-Hermitian models for free fermions with $p$ orbitals per unit cell.<n>We also apply our approach to graphene, and show that $AA$-stacked bilayer graphene evolves into a square root Hamiltonian of monolayer graphene.
arXiv Detail & Related papers (2025-08-15T17:11:24Z) - Qubit encodings for lattices of dipolar planar rotors [39.58317527488534]
We investigate two qubit representations of the planar rotor lattice Hamiltonian.<n>The first representation is realized by decomposing the rotor Hamiltonian projectors in binary and mapping them to spin-1/2 projectors.<n>The second approach relies on embedding the planar rotor lattice Hilbert space in a larger space and recovering the relevant qubit encoded system as a quotient space projecting down to the physical degrees of freedom.
arXiv Detail & Related papers (2025-07-23T21:48:20Z) - Zero-Fluctuation Quantum Work Extraction [0.7252027234425332]
We study the possibility of deterministic protocols for extracting work from quantum systems.
We prove that, with enough copies of the system, such zero-fluctuation protocols always exist if the Hamiltonian has a rational spectrum.
arXiv Detail & Related papers (2024-02-26T19:01:42Z) - An efficient and exact noncommutative quantum Gibbs sampler [1.9218741065333018]
We construct the first efficiently implementable and exactly detailed-balanced Lindbladian for Gibbs states of arbitrary noncommutative Hamiltonians.<n>Our construction can also be regarded as a continuous-time quantum analog of the Metropolis-Hastings algorithm.
arXiv Detail & Related papers (2023-11-15T18:51:24Z) - A hybrid quantum algorithm to detect conical intersections [39.58317527488534]
We show that for real molecular Hamiltonians, the Berry phase can be obtained by tracing a local optimum of a variational ansatz along the chosen path.
We demonstrate numerically the application of our algorithm on small toy models of the formaldimine molecule.
arXiv Detail & Related papers (2023-04-12T18:00:01Z) - Sparse random Hamiltonians are quantumly easy [105.6788971265845]
A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems.
This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state.
Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
arXiv Detail & Related papers (2023-02-07T10:57:36Z) - Topological study of a Bogoliubov-de Gennes system of pseudo spin-$1/2$
bosons with conserved magnetization in a honeycomb lattice [0.0]
We consider a non-Hermitian Hamiltonian with pseudo-Hermiticity for a system of bosons in a honeycomb lattice.
Such a system is capable of acting as a topological amplifier, under time-reversal symmetry.
We construct a convenient analytical description for the edge modes of the Haldane model in semi-infinite planes.
arXiv Detail & Related papers (2021-10-07T02:00:12Z) - Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric
Perceptron [21.356438315715888]
We consider the symmetric binary perceptron model, a simple model of neural networks.
We establish several conjectures for this model.
Our proof technique relies on a dense counter-part of the small graph conditioning method.
arXiv Detail & Related papers (2021-02-25T18:39:08Z) - State preparation and measurement in a quantum simulation of the O(3)
sigma model [65.01359242860215]
We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site.
We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes.
We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
arXiv Detail & Related papers (2020-06-28T23:44:12Z) - Proposal to measure out-of-time-ordered correlations using Bell states [0.0]
We present a protocol to experimentally measure the infinite-temperature out-of-time-ordered correlation (OTOC)
OTOC is a probe of quantum information scrambling in a system.
We show that the OTOC can be obtained by preparing two entangled systems.
arXiv Detail & Related papers (2020-06-26T16:51:32Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.