The nature of quantum correlations in strongly correlated systems has been a subject of intense research. In particular, it has been realized that entanglement and quantum discord are present at quantum phase transitions and able to characterize it.
Surprisingly, it has been shown for a number of different systems that qubit pairwise states, even when highly entangled, do not violate Bells inequalities, being in this sense local. Here we show that such a local character of quantum correlations is in fact general for translation invariant systems and has its origins in the monogamy trade-off obeyed by tripartite Bell correlations. We illustrate this result in a quantum spin chain with a soft breaking of translation symmetry. In addition, we extend the monogamy inequality to the $N$-qubit scenario, showing that the bound increases with $N$ and providing examples of its saturation through uniformly generated random pure states.
We introduce an approach for quantum computing in continuous time based on the Lewis-Riesenfeld dynamic invariants. This approach allows, under certain conditions, for the design of quantum algorithms running on a nonadiabatic regime. We show that th
e relaxation of adiabaticity can be achieved by processing information in the eigenlevels of a time dependent observable, namely, the dynamic invariant operator. Moreover, we derive the conditions for which the computation can be implemented by time independent as well as by adiabatically varying Hamiltonians. We illustrate our results by providing the implementation of both Deutsch-Jozsa and Grover algorithms via dynamic invariants.
