A A   
Connect with us:      

Estimating entanglement from only a few moments

Playing this video requires the latest flash player from Adobe.

Download link (right click and 'save-as') for playing in VLC or other compatible player.

Recording Details

Scientific Areas: 
PIRSA Number: 


How can we quantify the entanglement between subsystems when we only have access to incomplete information about them and their environment?‎ Existing approaches (such as Rényi entropies) can only detect the short-range entanglement across a boundary between a subsystem and its surroundings, and then only if the whole system is pure. These methods cannot detect the long-range entanglement between two subsystems embedded in a larger system. There is a natural choice of entanglement measure for this situation, called the entanglement negativity, which can do this and cope with mixed states as well. However it is defined in terms of the full density matrix, which we generally won't have access to.

I will begin this talk with a brief overview ‎of some replica trick-based eigenspectrum reconstruction methods, and their various strengths and limitations. Then I will show how to modify these to find the moments of the partially transposed density matrix. Once those numbers have been obtained, it is possible to modify the earlier eigenspectrum reconstruction methods to obtain lower and upper bounds for the entanglement negativity.

Addendum: An audience member pointed out that the adjective "quasi-topological" already has a meaning and it's something different from the subject of this talk. So with hindsight it should have been called `quasi-conformal quantum computing'