Frobenius light-cone conjecture for the shift unitary
Frobenius light-cone conjecture for the shift unitary
Let be a 2-local Hamiltonian on a ring with power-law decaying interactions of exponent , and let be the unitary it generates in time , while is the shift unitary. The currently established bound requires
Frobenius light-cone conjecture. The bound above can be replaced by
for arbitrarily small and constants independent of . This conjecture would give a qualitatively tighter lower bound on the time required to implement the shift unitary, and asserts that the Frobenius light cone controls the hardness of implementing the shift for all power-law exponents in the stated range.
Sources & referencesView supporting material
Primary source
Chao Yin, Andrew Lucas and David T. Stephen, “Frobenius light cone and the shift unitary”, arXiv:2402.07990 (2024).
Progress summary
The conjecture remains open: a 2024 paper proves weaker bounds but gives no proof or counterexample for the proposed improvement.
The conjecture asks whether the Frobenius light cone determines the difficulty of implementing the shift unitary for every power-law exponent . The directly relevant 2024 paper presents this as Conjecture 1.2, not as an established theorem.
Known results
- The 2024 paper proves only the stated weaker, piecewise time bounds and shows under those restrictions.
- Chen and Lucas (2021) established an optimal Frobenius light-cone scaling, up to logarithmic factors, with time scale for .
- Related Lieb-Robinson work compares information-propagation bounds but does not address the conjecture directly.
2024 conjecture statement
The published and arXiv versions explicitly leave Conjecture 1.2 open. The retrieved sources report no claimed proof, counterexample, verification, withdrawal, or retraction.
Current status (as of August 2026): The conjecture is open; the weaker piecewise bounds are proved, but no source reports progress establishing or refuting the proposed all- improvement.
Sources
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.