Lab Home | Phone | Search
Center for Nonlinear Studies  Center for Nonlinear Studies
 Home 
 People 
 Current 
 Affiliates 
 Visitors 
 Students 
 Research 
 ICAM-LANL 
 Publications 
 Conferences 
 Workshops 
 Sponsorship 
 Talks 
 Colloquia 
 Colloquia Archive 
 Seminars 
 Postdoc Seminars Archive 
 Quantum Lunch 
 Quantum Lunch Archive 
 CMS Colloquia 
 Q-Mat Seminars 
 Q-Mat Seminars Archive 
 P/T Colloquia 
 Archive 
 Kac Lectures 
 Kac Fellows 
 Dist. Quant. Lecture 
 Ulam Scholar 
 Colloquia 
 
 Jobs 
 Postdocs 
 CNLS Fellowship Application 
 Students 
 Student Program 
 Visitors 
 Description 
 Past Visitors 
 Services 
 General 
 
 History of CNLS 
 
 Maps, Directions 
 CNLS Office 
 T-Division 
 LANL 
 
Wednesday, December 19, 2012
1:00 PM - 2:00 PM
CNLS Conference Room (TA-3, Bldg 1690)

Seminar

TOPOLOGICAL QUANTUM COMPUTATION RANK FINITENESS AND LOW-RANK CLASSIFICATION

Paul Bruillard
Department of Mathematics, Texas A&M University, College Station, TX

A physical system is said to be in topological phase if it is invariant under smooth local perturbations. These physical systems have applications in a wide range of disciplines, especially in quantum information science. Quantum computers based on such systems are topologically protected from decoherence. This fault-tolerance removes the need for the expensive error-correcting codes required by the qubit model. These topological phases of matter can be studied through their algebraic avatars, modular categories. Thus, a complete classification of these categories would provide a taxonomy of admissible topological phases. In this talk, we will discuss two paradigms for quantum computation: the qubit model and the topological model. Modular categories will be introduced and the connections between these mathematical constructs and the physical systems that they describe will be explained. We will examine the classification problem for these categories and present a recent solution of a foundational finiteness problem (Wang's Conjecture). Finally, we will discuss the algorithm suggested by this proof and its applications to low-rank classification.

Host: Kevin Buescher XCP-8. 667-1356