Dominic Williamson: Anyons and matrix product operator algebras

Subscribers:
351,000
Published on ● Video Link: https://www.youtube.com/watch?v=rmc8o56i_aQ



Duration: 37:45
1,692 views
37


Quantum tensor network states provide a natural framework for the representation of ground states of gapped, topologically ordered systems. From the technological point of view, such systems could be instrumental in creating fault tolerant architectures for quantum computation. From the theoretical point of view, such systems are fascinating due to the fact that all the relevant physics is encoded in the entanglement structure of the corresponding many body wavefunction. This is captured in the tensor network framework by a matrix product operator symmetry of the underlying tensors. In our work we present a systematic study of those matrix product operators, and show how this relates entanglement properties of projected entangled-pair states to the formalism of fusion tensor categories. From the matrix product operators we construct a C*-algebra and find that emergent topological superselection sectors can be identified with the central idempotents of this algebra. This allows us to construct projected entangled-pair states containing an arbitrary number of anyons. Physical properties such as topological spin, the S matrix, fusion and braiding relations are readily extracted from the idempotents. As the matrix product operator symmetries are acting purely on the virtual level of the tensor network, the ensuing Wilson loops are not fattened when perturbing the system. This opens up the possibility of simulating topological theories away from commuting projector fixed point Hamiltonians and studying topological phase transitions due to anyon condensation. We explicitly describe how discrete gauge theories and string-net models fit into the general formalism. Our approach leads to a new description of topological quantum computation where the relevant information is carried by virtual degrees of freedom in a tensor network, reminiscent of the PEPS description of measurement-based quantum computation.




Other Videos By Microsoft Research


2017-01-31David Gosset: Complexity of quantum impurity problems
2017-01-31Thomas Vidick: Rigorous RG algorithms and area laws for low energy eigenstates in 1D
2017-01-31Giulio Chiribella: Optimal compression for identically prepared qubit states
2017-01-31James Lee: Spectrahedral lifts and quantum learning
2017-01-31Optimal Hamiltonian simulation by quantum signal processing
2017-01-31Shalev Ben-David: Sculpting quantum speedups
2017-01-31David Sutter: Multivariate trace inequalities
2017-01-31Mischa Woods: Applications of recoverability in quantum information
2017-01-31Anand Natarajan: Limitations of semidefinite programs for separable states and entangled games
2017-01-31A parallel repetition theorem for all entangled games
2017-01-31Dominic Williamson: Anyons and matrix product operator algebras
2017-01-31Jonathan Oppenheim: From quantum thermodynamical identities to a second law equality
2017-01-31Operator scaling and applications
2017-01-31Xin Wang: Asymptotic entanglement manipulation under PPT operations: new SDP bounds&irreversibility
2017-01-31Srinivasan Arunachalam: Optimal quantum sample complexity of learning algorithms
2017-01-311. Catalytic Decoupling 2. Deconstruction and conditional erasure of quantum correlations
2017-01-31A complete characterization of unitary quantum space
2017-01-31David Reutter: Biunitary constructions in quantum information
2017-01-31Fernando Brandao: Quantum speed-ups for semidefinite programming
2017-01-31Joseph M. Renes: Belief propagation decoding of quantum channels by passing quantum messages
2017-01-31Anupam Prakash: Quantum recommendation systems



Tags:
microsoft research