Topological Quantum Computation from non-abelian ... - Paul Fendley
Topological Quantum Computation from non-abelian ... - Paul Fendley
Topological Quantum Computation from non-abelian ... - Paul Fendley
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
To realize this form of braiding, each loop in the ground state gets a weight d (= τ forFibonacci)i.e. the ground state is the sum over all loop configurations|g.s.〉 = ∑ Ld n L |L〉where n L is the number of loops in configuration L.31