Fibonacci Anyons and String-Net Condensation; Entanglement-Enhanced Learning of Quantum Processes at Scale

A research talk linking graph coloring, topological matter and quantum computing. The chromatic polynomial (#P-hard to compute) appears in the amplitudes of the Fibonacci string-net condensate, which is prepared on an IBM device with a dynamic string-net preparation circuit; the deck shows sampled string-net configurations, creation and charge measurement of Fibonacci anyon pairs, and a braiding experiment realizing a non-Clifford logical gate. Opening and closing slides also introduce a second project on entanglement-enhanced learning of quantum processes.

• Chromatic polynomials and their classical hardness (#P-hard; additive approximation is BQP-complete)
• From the toric code to Levin-Wen string nets; the Fibonacci string-net vacuum amplitudes encode the chromatic polynomial at the golden ratio plus 2
• Dynamic string-net preparation of a four-plaquette Fib-SNC on 11 qubits, with sampled data vs. ideal
• Creating and braiding Fibonacci anyons for a non-Clifford gate, measured with error mitigation

Summary and key points drafted by a language model from the slides, not yet reviewed by me. The slides are the source.

Cite

@misc{minev2024fibonaccianyons,
  author = {Zlatko K. Minev},
  title = {{Fibonacci Anyons and String-Net Condensation; Entanglement-Enhanced Learning of Quantum Processes at Scale}},
  howpublished = {Talk, CIFAR},
  year = {2024},
  url = {https://zlatko-minev.github.io/zlatko-minev-quantum-repository/items/2024-fibonacci-anyons-and-string-net-condensation/},
  note = {Slides}
}

Copy BibTeX

Reuse