Quantum
Fast Hamiltonian engineering from cut polytope geometry
Publication: quant-ph updates on arXiv.org
Author: Thomas Joachim Friese, \"Ozg\"un Kum, Aram W. Harrow, Martin Kliesch
Source published: 30/09/2026, 04:00:00 UTC
Briefing created: 01/10/2026, 03:06:41 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 01/10/2026, 02:58:25 UTC.
Briefings
A new framework transforms Hamiltonian engineering into a complex k-cut polytope problem, proving it NP-complete for any finite k. By relaxing this to an elliptope and applying Krivine-type rounding, the authors derive informed pulses for 2-local qubit, qudit, and fermionic systems. Benchmarks on Ising models, qudit clocks, and the fermionic Harper-Hofstadter model show near-optimal run times, achieving O(sqrt(m)) approximation ratios and saturating with lattice size in fermionic cases.
Key points
- The authors reformulate time-optimal Hamiltonian engineering as a complex k-cut polytope problem, where k represents the number of distinct phases in commutation relations between control pulses and system Hamiltonians.
- The problem is proven NP-complete for every finite k, necessitating the relaxation to the elliptope combined with Krivine-type rounding to generate informed pulses.
Context and limitations
Results are limited to 2-local qubit, qudit, and fermionic systems; benchmarks include Ising models, qudit clocks, and the fermionic Harper-Hofstadter model; run times saturate with lattice size in fermionic cases.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 01/10/2026, 03:06:41 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeibvtohzjeipmb3z4o3bedq3y5r26ssiafnhopg5i46lbbxc2f6toi