The conjecture that breaking all non-trivial graph automorphisms suffices for universality in globally controlled qubit systems is disproved by connected graphs with trivial automorphism groups whose generated Lie algebras are nonetheless non-universal.
Programmable Fermionic Quantum Processors with Globally Controlled Lattices
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We introduce a framework for realizing universal fermionic quantum processing with globally controlled itinerant fermionic particles. Our approach is tailored to the example of neutral atoms in optical lattices, but transposes to other setups with similar capabilities. We give constructive protocols to realize arbitrary fermionic processes, with time-dependent control over global parameters of the experimental setup, such as tunneling and interaction in a Fermi-Hubbard type model. We first prove the universality of our framework and then discuss implementation variants, such as hybrid analog-digital simulation of extended Fermi-Hubbard models, e.g., with long-range couplings.
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Obstructions to universality in globally controlled qubit graphs
The conjecture that breaking all non-trivial graph automorphisms suffices for universality in globally controlled qubit systems is disproved by connected graphs with trivial automorphism groups whose generated Lie algebras are nonetheless non-universal.