Skip to content
Preprint

Universal computation with magic Hamiltonians

Sep 2026 · 0 citations · 29 references
Physics Mathematics

Abstract

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 of universality, where adding one expensive Hamiltonian control to a cheap set of local control operators allows for universal computation. We find several concrete sets of 1- or 2-local Pauli generators $S$ and $n$-qubit ``magic"Hamiltonians $H$ that together generate the full Lie algebra $\mathfrak{su}(2^n)$, with a special focus on the Ising Hamiltonian $J$. We propose a method to directly implement any unitary by exponentiating these generator sets, and give bounds on the needed time of application of the magic Hamiltonian $H$. We find that the number of applications of $H$ needed to approximate any unitary up to accuracy $\epsilon$ scales exponentially in the number of qubits as expected from the standard application of the Solovay-Kitaev theorem. We also find phase transitions in the size of the generated Lie algebras as the parameters of the Ising Hamiltonian are varied. We find an algorithmic application of the Chow/Rashevskii technique to implement unitaries corresponding to iterated commutators.

View source

Similar papers

Preprint Oct 2026

On The Complexity of Redundancy-Free Quantum Hamiltonians

We consider a class of redudancy-free Hamiltonians, which are those where the trace vanishes for any product of Hamiltonian terms in which at least one term appears an odd number of times. This includes Hamiltonians which are sums of products of Paulis with no relations between them. These Hamiltonians arise naturally...

Matthew B. Hastings, Alexander Schmidhuber · 0 citations
Preprint Oct 2026

Avoiding Exponentially Large Groups with Open Quantum System Technology

We propose a novel approach to state preparation by embracing the full power of open quantum systems. Instead of working with the whole unitary group in $n$ qubits, we identify a small Lie group $G$ in $(n+3)$ qubits. The dimension of its Lie algebra is $\text{poly}(n)$. Every state can be approximated starting from an...

Ji-Hong Cai, Advith Govindarajan, M. Junge · 0 citations
Preprint Aug 2026

Contextuality in the $n$-qubit Pauli group

The $n$-qubit Pauli group is an essential ingredient to most quantum applications, from computing and error correction to benchmarking and simulation. Despite comprising merely a discrete set of operators, it exhibits many quintessential features of quantum theory, including contextuality, which has been identified as...

Markus Frembs · 2 citations
Preprint Oct 2026

An efficient Hamiltonian-based quantum algorithm for characters of the symmetric group

Consider a quantum state vector proportional to any given column of the character table of the symmetric group ($S_n$), corresponding to a superposition over the irreps weighted by the character values. It was recently argued that sampling from this state is classically hard under reasonable complexity-theoretic assump...

Dikshant Rathore, Leo Zhou · 1 citation
Preprint Sep 2026

Classical and Quantum Simulation of All-to-All Quantum Dynamics in Logarithmic Space

We study both the classical and the quantum complexity of the problem of estimating disorder-averaged quench dynamics for all-to-all spin Hamiltonians such as quantum Hopfield, Sherrington--Kirkpatrick (SK) or Dicke-type models. Disorder averaging restores permutation invariance in this setting, so states of $N$ spins...

M. Lutz, R. Trivedi, J. Cirac · 0 citations
Preprint Oct 2026

Random Quantum Circuits Beyond Moment Matching

Random quantum circuits aim to efficiently reproduce the statistical properties of ideal random quantum evolution. One approach is to construct approximate unitary designs, which match the moments of Haar-random unitaries up to a prescribed order with controlled error. In this work, we establish quantitative guarantees...

Shih-Han Hung · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.