Quantum entanglement is a uniquely quantum link between particles that makes their properties inseparable. It underlies the power of many quantum technologies from secure communication to quantum computing, by enabling correlations impossible in classical physics.

Entanglement nevertheless remains poorly understood and is therefore the subject of a lot of research, both in the fields of quantum technologies as well as fundamental physics.

In this context, the idea of separability refers to a composite system that can be written as a simple product (or mixture of products) of the states of its individual parts. This implies there is no entanglement between them and to create entanglement, a global transformation is needed.

A system that remains completely free of entanglement, even after any possible global invertible transformation is applied, is called absolutely separable.  In other words, it can never become entangled under the action of quantum gates.

Necessary and sufficient conditions to ensure separability exist only in the simplest cases or for highly restricted families of states. In fact, entanglement verification and quantification is known to be generically an NP-hard problem.

Recent research published by a team of researchers from Spain and Poland has tackled this problem head-on. By introducing new analytical tools such as linear maps and their inverses, they were able to identify when a quantum state is guaranteed to be absolutely separable.

These tools work in any number of dimensions and allow the authors to pinpoint specific states that are on the border of being absolutely separable or not (mathematically speaking, ones that lie on the boundary of the set). They also show how different criteria for absolute separability, which may not always agree with each other, can be combined and refined using convex geometry optimisation.

Being able to more easily and accurately determine whether a quantum state is absolutely separable will be invaluable in quantum computation and communication.

The team’s results for multipartite systems (systems with more than two parts) also reveal how little we currently understand about the entanglement properties of mixed, noisy states. This knowledge gap suggests that much more research is needed in this area.

The post Quantum states that won’t entangle appeared first on Physics World.

When we interact with everyday objects, we take for granted that physical systems naturally settle into stable, predictable states. A cup of coffee cools down. A playground swing slows down after being pushed.  Quantum systems, however, behave very differently.

These systems can exist in multiple states at once, and their evolution is governed by probabilities rather than certainties. Nevertheless, even these strange systems do eventually relax and settle down, losing information about their earlier state. The speed at which this happens is called the relaxation rate.

Relaxation rates tell us how fast a quantum system forgets its past, how quickly it thermalises, reaches equilibrium, decoheres, or dissipates energy. These rates are important not just for theorists but also for experimentalists, who can measure them directly in the lab.

Recently, researchers discovered that these rates obey a surprisingly universal rule. For a broad class of quantum processes (those described by what physicists call Markovian semigroups) the fastest possible relaxation rate cannot exceed a certain limit. Specifically, it must be no larger than the sum of all relaxation rates divided by the system’s dimension. This constraint, originally a conjecture, was first proven using tools from classical mathematics known as Lyapunov theory.

In a new paper published recently, an international team of researchers provided a new, more direct algebraic proof of this universal bound. There are a number of advantages of the new proof compared to the older one, and it can be generalised more easily, but that’s not all.

The very surprising outcome of their work is that the rule doesn’t require complete positivity. Instead, a weaker condition – two‑positivity is enough. The distinction between these two requirements is crucial.

Essentially, both are measures of how well-behaved a quantum system is, how it is protected from providing nonsensical results. The difference is that two-positivity is slightly less stringent but far more general, and hence very useful for many real-world applications.

The fact that the new proof only requires two-positivity means that it this new universal relaxation rate can actually be applied to a lot more scenarios.

What’s more, even when weakened even further, a slightly softer version of the universal constraint still holds. This shows that the structure behind these bounds is richer and more subtle than previously understood.

The post The secret limits governing quantum relaxation appeared first on Physics World.