Here is what I'd have to say based on previous discussion here.
Be very, very careful.
Remember that the idea of migration is for stuff that is
- explicitly off-topic here
- explicitly on-topic somewhere else, and
- is a good question.
So to answer your clarification:
By Indirectly I mean topics that have relevance to the field of quantum computing, but do not necessarily relate only to quantum computing.
That doesn't meet point #1. Now, the specific question you link too could very well be explicitly off-topic, and I'd agree that it meets points #2 and #3, so let's examine point #1.
The question states:
To be specific, imagine a one dimensional chain of qubits coupled by a Hamiltonian [insert Hamiltonian here; I don't think it bears repeating ...] Can you give a good (i.e. as tight as possible) upper bound for the Lieb-Robinson velocity v for the system?
and just how is the Lieb-Robinson velocity relevant?
The proofs of the Lieb Robinson bound typically show the existence of a velocity v (that depends on J). This is often really useful for bound properties in these sorts of systems. For example there were some really nice results here to do with, for example, how long it takes to generate a GHZ state using a nearest-neighbor Hamiltonian.
The article linked states:
We discuss several consequences of [the Lieb-Robinson velocity] in the context of quantum information theory. First, we show that the information that leaks out to spacelike separated regions is negligible and that there is a finite speed at which correlations and entanglement can be distributed. Second, we discuss how these ideas can be used to prove lower bounds on the time it takes to convert states without topological quantum order to states with that property. Finally, we show that the rate at which entropy can be created in a block of spins scales like the boundary of that block.
In other words, very much relevant to quantum computing. It meets #1.
Tl;dr: In my opinion the question is on-topic and we need to be a wee bit more careful about rejecting questions.