Experimental Identification of Non-Abelian Topological Orders on a Quantum Simulator
Keren Li, Yidun Wan, Ling-Yan Hung, Tian Lan, Guilu Long, Dawei Lu,, Bei Zeng, and Raymond Laflamme

TL;DR
This paper demonstrates how to identify different topological orders, including non-Abelian Fibonacci order, using a nuclear magnetic resonance quantum simulator by measuring their modular matrices, advancing topological quantum computing research.
Contribution
The study introduces a method to identify topological orders via modular matrix measurements on a quantum simulator, including non-Abelian Fibonacci order, a key step toward topological quantum computing.
Findings
Successfully measured modular S and T matrices for three topological phases
Identified non-Abelian Fibonacci order as a candidate for universal quantum computing
Established a new approach for investigating topological orders with quantum simulators
Abstract
Topological orders can be used as media for topological quantum computing --- a promising quantum computation model due to its invulnerability against local errors. Conversely, a quantum simulator, often regarded as a quantum computing device for special purposes, also offers a way of characterizing topological orders. Here, we show how to identify distinct topological orders via measuring their modular and matrices. In particular, we employ a nuclear magnetic resonance quantum simulator to study the properties of three topologically ordered matter phases described by the string-net model with two string types, including the toric code, doubled semion, and doubled Fibonacci. The third one, non-Abelian Fibonacci order is notably expected to be the simplest candidate for universal topological quantum computing. Our experiment serves as the basic module, built on which one…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
