{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,5]],"date-time":"2026-11-05T06:23:49Z","timestamp":1793859829146,"version":"4.6.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T00:00:00Z","timestamp":1751760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T00:00:00Z","timestamp":1751760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Commun"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>The remarkable complexity of a topologically ordered many-body quantum system is encoded in the characteristics of its anyons. Quintessential predictions emanating from this complexity employ the Fibonacci string net condensate (Fib SNC) and its anyons: sampling Fib-SNC would estimate chromatic polynomials while exchanging its anyons would implement universal quantum computation. However, physical realizations remained elusive. We introduce a scalable dynamical string net preparation (DSNP) that constructs Fib SNC and its anyons on reconfigurable graphs suitable for near-term superconducting processors. Coupling the DSNP approach with composite error-mitigation on deep circuits, we create, measure, and braids Fibonacci anyons; charge measurements show 94% accuracy, and exchanging the anyons yields the expected golden ratio <jats:italic>\u03d5<\/jats:italic> with 98% average accuracy. We then sample the Fib SNC to estimate chromatic polynomial at <jats:italic>\u03d5<\/jats:italic>\u00a0+\u00a02 for several graphs. Our results establish the proof of principle for using Fib-SNC and its anyons for fault-tolerant universal quantum computation and aim at a classically hard problem.<\/jats:p>","DOI":"10.1038\/s41467-025-61493-8","type":"journal-article","created":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T23:31:09Z","timestamp":1751758269000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Realizing string-net condensation: Fibonacci anyon braiding for universal gates and sampling chromatic polynomials"],"prefix":"10.1038","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3759-1847","authenticated-orcid":false,"given":"Zlatko K.","family":"Minev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Khadijeh","family":"Najafi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Swarnadeep","family":"Majumder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9396-9010","authenticated-orcid":false,"given":"Juven","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9493-268X","authenticated-orcid":false,"given":"Ady","family":"Stern","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9554-4443","authenticated-orcid":false,"given":"Eun-Ah","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4876-8417","authenticated-orcid":false,"given":"Chao-Ming","family":"Jian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guanyu","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,6]]},"reference":[{"key":"61493_CR1","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1038\/s41567-018-0124-x","volume":"14","author":"S Boixo","year":"2018","unstructured":"Boixo, S. et al. Characterizing quantum supremacy in near-term devices. Nat. Phys. 14, 595 (2018).","journal-title":"Nat. Phys."},{"key":"61493_CR2","doi-asserted-by":"publisher","first-page":"045110","DOI":"10.1103\/PhysRevB.71.045110","volume":"71","author":"MA Levin","year":"2005","unstructured":"Levin, M. A. & Wen, X.-G. String-net condensation: A physical mechanism for topological phases. Phys. Rev. B 71, 045110 (2005).","journal-title":"Phys. Rev. B"},{"key":"61493_CR3","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1103\/RevModPhys.77.871","volume":"77","author":"M Levin","year":"2005","unstructured":"Levin, M. & Wen, X.-G. Colloquium: Photons and electrons as emergent phenomena. Rev. Mod. Phys. 77, 871 (2005).","journal-title":"Rev. Mod. Phys."},{"key":"61493_CR4","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s00220-009-0757-9","volume":"287","author":"L Fidkowski","year":"2009","unstructured":"Fidkowski, L., Freedman, M., Nayak, C., Walker, K. & Wang, Z. From String Nets to Nonabelions. Commun. Math. Phys. 287, 805 (2009).","journal-title":"Commun. Math. Phys."},{"key":"61493_CR5","doi-asserted-by":"publisher","first-page":"024412","DOI":"10.1103\/PhysRevB.72.024412","volume":"72","author":"P Fendley","year":"2005","unstructured":"Fendley, P. & Fradkin, E. Realizing non-Abelian statistics in time-reversal-invariant systems. Phys. Rev. B 72, 024412 (2005).","journal-title":"Phys. Rev. B"},{"key":"61493_CR6","doi-asserted-by":"publisher","first-page":"709","DOI":"10.2140\/gt.2009.13.709","volume":"13","author":"P Fendley","year":"2009","unstructured":"Fendley, P. & Krushkal, V. Tutte chromatic identities from the Temperley\u2013Lieb algebra. Geom. Topol. 13, 709 (2009).","journal-title":"Geom. Topol."},{"key":"61493_CR7","doi-asserted-by":"publisher","first-page":"507","DOI":"10.4310\/ATMP.2010.v14.n2.a4","volume":"14","author":"P Fendley","year":"2010","unstructured":"Fendley, P. & Krushkal, V. Link invariants, the chromatic polynomial and the Potts model. Adv. Theor. Math. Phys. 14, 507 (2010).","journal-title":"Adv. Theor. Math. Phys."},{"key":"61493_CR8","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/S0021-9800(68)80087-0","volume":"4","author":"RC Read","year":"1968","unstructured":"Read, R. C. An introduction to chromatic polynomials. J. Combin. Theory 4, 52 (1968).","journal-title":"J. Combin. Theory"},{"key":"61493_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1017\/S0305004100068936","volume":"108","author":"F Jaeger","year":"1990","unstructured":"Jaeger, F., Vertigan, D. L. & Welsh, D. J. A. On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Camb. Philos. Soc. 108, 35 (1990).","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"61493_CR10","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1137\/S0097539704446797","volume":"35","author":"D Vertigan","year":"2005","unstructured":"Vertigan, D. The computational complexity of Tutte invariants for planar graphs. SIAM J. Comput. 35, 690 (2005).","journal-title":"SIAM J. Comput."},{"key":"61493_CR11","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1016\/j.ic.2008.04.003","volume":"206","author":"LA Goldberg","year":"2008","unstructured":"Goldberg, L. A. & Jerrum, M. Inapproximability of the Tutte polynomial. Inf. Comput. 206, 908 (2008).","journal-title":"Inf. Comput."},{"key":"61493_CR12","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/s00037-012-0046-4","volume":"21","author":"LA Goldberg","year":"2012","unstructured":"Goldberg, L. A. & Jerrum, M. Inapproximability of the tutte polynomial of a planar graph. Comput. Complex. 21, 605 (2012).","journal-title":"Comput. Complex."},{"key":"61493_CR13","doi-asserted-by":"publisher","first-page":"1921","DOI":"10.1137\/12088330X","volume":"43","author":"LA Goldberg","year":"2014","unstructured":"Goldberg, L. A. & Jerrum, M. The complexity of computing the sign of the Tutte polynomial. SIAM J. Comput. 43, 1921 (2014).","journal-title":"SIAM J. Comput."},{"key":"61493_CR14","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/BF01217730","volume":"121","author":"E Witten","year":"1989","unstructured":"Witten, E. Quantum field theory and the Jones polynomial. Commun. Math. Phys. 121, 351 (1989).","journal-title":"Commun. Math. Phys."},{"key":"61493_CR15","doi-asserted-by":"publisher","first-page":"2709","DOI":"10.1016\/j.aop.2008.01.012","volume":"323","author":"P Bonderson","year":"2008","unstructured":"Bonderson, P., Shtengel, K. & Slingerland, J. K. Interferometry of non-Abelian anyons. Annal. Phys. 323, 2709 (2008).","journal-title":"Annal. Phys."},{"key":"61493_CR16","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1103\/RevModPhys.80.1083","volume":"80","author":"C Nayak","year":"2008","unstructured":"Nayak, C., Simon, S. H., Stern, A., Freedman, M. & Das Sarma, S. Non-abelian anyons and topological quantum computation. Rev. Mod. Phys. 80, 1083 (2008).","journal-title":"Rev. Mod. Phys."},{"key":"61493_CR17","doi-asserted-by":"publisher","first-page":"140503","DOI":"10.1103\/PhysRevLett.95.140503","volume":"95","author":"NE Bonesteel","year":"2005","unstructured":"Bonesteel, N. E., Hormozi, L., Zikos, G. & Simon, S. H. Braid topologies for quantum computation. Phys. Rev. Lett. 95, 140503 (2005).","journal-title":"Phys. Rev. Lett."},{"key":"61493_CR18","doi-asserted-by":"publisher","first-page":"8084","DOI":"10.1103\/PhysRevB.59.8084","volume":"59","author":"N Read","year":"1999","unstructured":"Read, N. & Rezayi, E. Beyond paired quantum Hall states: Parafermions and incompressible states in the first excited Landau level. Phys. Rev. B 59, 8084 (1999).","journal-title":"Phys. Rev. B"},{"key":"61493_CR19","doi-asserted-by":"publisher","first-page":"2707","DOI":"10.1016\/j.aop.2010.08.001","volume":"325","author":"R Koenig","year":"2010","unstructured":"Koenig, R., Kuperberg, G. & Reichardt, B. W. Quantum computation with Turaev\u2013Viro codes. Annal. Phys. 325, 2707 (2010).","journal-title":"Annal. Phys."},{"key":"61493_CR20","first-page":"021012","volume":"12","author":"A Schotte","year":"2022","unstructured":"Schotte, A., Zhu, G., Burgelman, L. & Verstraete, F. Quantum error correction thresholds for the universal Fibonacci Turaev-Viro code. Phys. Rev. X 12, 021012 (2022).","journal-title":"Phys. Rev. X"},{"key":"61493_CR21","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1126\/science.abi8378","volume":"374","author":"KJ Satzinger","year":"2021","unstructured":"Satzinger, K. J. et al. Realizing topologically ordered states on a quantum processor. Science 374, 1237 (2021).","journal-title":"Science"},{"key":"61493_CR22","doi-asserted-by":"publisher","first-page":"1242","DOI":"10.1126\/science.abi8794","volume":"374","author":"G Semeghini","year":"2021","unstructured":"Semeghini, G. et al. Probing topological spin liquids on a programmable quantum simulator. Science 374, 1242 (2021).","journal-title":"Science"},{"key":"61493_CR23","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1038\/s41586-023-05954-4","volume":"618","author":"TI Andersen","year":"2023","unstructured":"Andersen, T. I. et al. Non-Abelian braiding of graph vertices in a superconducting processor. Nature 618, 264 (2023).","journal-title":"Nature"},{"key":"61493_CR24","doi-asserted-by":"publisher","first-page":"060301","DOI":"10.1088\/0256-307X\/40\/6\/060301","volume":"40","author":"S Xu","year":"2023","unstructured":"Xu, S. et al. Digital simulation of projective non-abelian anyons with 68 superconducting qubits. Chin. Phys. Lett. 40, 060301 (2023).","journal-title":"Chin. Phys. Lett."},{"key":"61493_CR25","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-023-06934-4","volume":"626","author":"M Iqbal","year":"2024","unstructured":"Iqbal, M. et al. Non-Abelian topological order and anyons on a trapped-ion processor. Nature 626, 505 (2024).","journal-title":"Nature"},{"key":"61493_CR26","doi-asserted-by":"crossref","unstructured":"Xu, S. et al. Non-Abelian braiding of Fibonacci anyons with a superconducting processor. Nat. Phys. 20, 1469\u20131475 (2024).","DOI":"10.1038\/s41567-024-02529-6"},{"key":"61493_CR27","doi-asserted-by":"publisher","first-page":"040315","DOI":"10.1103\/PRXQuantum.3.040315","volume":"3","author":"Y-J Liu","year":"2022","unstructured":"Liu, Y.-J., Shtengel, K., Smith, A. & Pollmann, F. Methods for simulating string-net states and anyons on a digital quantum computer. PRX Quantum 3, 040315 (2022).","journal-title":"PRX Quantum"},{"key":"61493_CR28","doi-asserted-by":"publisher","first-page":"169286","DOI":"10.1016\/j.aop.2023.169286","volume":"452","author":"YD Lensky","year":"2023","unstructured":"Lensky, Y. D., Kechedzhi, K., Aleiner, I. & Kim, E.-A. Graph gauge theory of mobile non-Abelian anyons in a qubit stabilizer code. Annal. Phys. 452, 169286 (2023).","journal-title":"Annal. Phys."},{"key":"61493_CR29","doi-asserted-by":"publisher","first-page":"050401","DOI":"10.1103\/PhysRevLett.97.050401","volume":"97","author":"S Bravyi","year":"2006","unstructured":"Bravyi, S., Hastings, M. B. & Verstraete, F. Lieb-robinson bounds and the generation of correlations and topological quantum order. Phys. Rev. Lett. 97, 050401 (2006).","journal-title":"Phys. Rev. Lett."},{"key":"61493_CR30","doi-asserted-by":"publisher","first-page":"032620","DOI":"10.1103\/PhysRevA.105.032620","volume":"105","author":"E van den Berg","year":"2022","unstructured":"van den Berg, E., Minev, Z. K. & Temme, K. Model-free readout-error mitigation for quantum expectation values. Phys. Rev. A 105, 032620 (2022).","journal-title":"Phys. Rev. A"},{"key":"61493_CR31","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1103\/PhysRevLett.76.722","volume":"76","author":"CH Bennett","year":"1995","unstructured":"Bennett, C. H. et al. Purification of noisy entanglement and faithful teleportation via noisy channels. Phys. Rev. Lett. 76, 722 (1995).","journal-title":"Phys. Rev. Lett."},{"key":"61493_CR32","doi-asserted-by":"publisher","unstructured":"Knill, E. Fault-tolerant postselected quantum computation: Threshold analysis. Preprint at https:\/\/doi.org\/10.48550\/arXiv.quant-ph\/0404104 (2004).","DOI":"10.48550\/arXiv.quant-ph\/0404104"},{"key":"61493_CR33","doi-asserted-by":"publisher","unstructured":"Temme, K., Bravyi, S. & Gambetta, J. M. Error mitigation for short-depth quantum circuits. Phys. Rev. Lett. 119, https:\/\/doi.org\/10.1103\/PhysRevLett.119.180509 (2016).","DOI":"10.1103\/PhysRevLett.119.180509"},{"key":"61493_CR34","first-page":"021050","volume":"7","author":"Y Li","year":"2017","unstructured":"Li, Y. & Benjamin, S. C. Efficient variational quantum simulator incorporating active error minimization. Phys. Rev. X 7, 021050 (2017).","journal-title":"Phys. Rev. X"},{"key":"61493_CR35","doi-asserted-by":"publisher","first-page":"045005","DOI":"10.1103\/RevModPhys.95.045005","volume":"95","author":"Z Cai","year":"2023","unstructured":"Cai, Z. et al. Quantum error mitigation. Rev. Mod. Phys. 95, 045005 (2023).","journal-title":"Rev. Mod. Phys."}],"container-title":["Nature Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41467-025-61493-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41467-025-61493-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41467-025-61493-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T23:31:13Z","timestamp":1751758273000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41467-025-61493-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,6]]},"references-count":35,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["61493"],"URL":"https:\/\/doi.org\/10.1038\/s41467-025-61493-8","relation":{},"ISSN":["2041-1723"],"issn-type":[{"value":"2041-1723","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,6]]},"assertion":[{"value":"15 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"6225"}}