Unitary $k$-designs provide a resource-efficient framework for emulating Haar randomness up to the $k$-th 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 independent Hamiltonians 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). We find that the resulting frame potential approaches the Haar value at long times, with deviations suppressed by the inverse Hilbert-space dimension. We verify this for single realizations of Gaussian random matrices, the Majorana and Spin Sachdev-Ye-Kitaev models, and deterministic local quantum spin chains. Remarkably, in deterministic spin systems, the 2PK protocol generates approximate unitary designs in regimes where 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.
For every fixed design order $k$ and measurable-error tolerance, strong approximate unitary designs in optimal $\Theta(\log n)$ all-to-all circuit depth are constructed using only the original system qubits using a logarithmic-depth Pauli-mixing bound for the perfect-matching ensemble.
Teodor Parella-Dilmé, Júlia Barberà-Rodríguez, Salvatore F. E. Oliviero et al.· 3 citations
In the conventional theory of quantum computation, universality is discussed in terms of properties of unitary gate sets. In many experimental setups, however, we instead have access to a parametrized set of Hamiltonians, which can be exponentiated for any desired time. Accordingly, we formulate a continuous analogue o...
Random unitary operations are a fundamental resource for quantum information processing, yet provably generating them with experimentally available controls remains challenging. Existing approaches often require calculating higher-order operator expectation values, relying on statistical assumptions about the experimen...
Oscar Scholin, Apollonas S. Matsoukas-Roubeas, Sathyawageeswar Subramanian· 0 citations
Hamiltonian engineering (HE) simulates quantum dynamics under a target Hamiltonian using a native entangling system Hamiltonian and restricted control, with applications from quantum gate design to analog quantum simulation. Observing that, for many systems, formulating HE as a linear program only requires specific com...
Thomas Joachim Friese, Özgün Kum, A. Harrow et al.· 0 citations
We investigate multipartite entanglement in a particular family of pure $n$-qubit hypergraph states through a statistical-mechanics framework, where the average bipartite purity maps onto an effective Hamiltonian of $2^n$ classical binary spins. In this correspondence, each hypergraph state uniquely corresponds to a cl...
P. Scarafile, G. Trotta, P. Facchi et al.· 0 citations
Analogue and digital Hamiltonian simulation represent two distinct approaches to making one quantum system replicate the physical properties of another, with consequences ranging from practical applications to complexity theory and quantum gravity. They are rooted in two distinct regimes of quantum dynamics: time-indep...
Emilio Onorati, H. Apel, Michael M. Wolf et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.