Less Quantum, More Advantage: An End-to-End Quantum Algorithm for the Jones Polynomial
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917947864252416 |
|---|---|
| author | Laakkonen, Tuomas Rinaldi, Enrico Self, Chris N. Chertkov, Eli DeCross, Matthew Hayes, David Neyenhuis, Brian Benedetti, Marcello Meichanetzidis, Konstantinos |
| author_facet | Laakkonen, Tuomas Rinaldi, Enrico Self, Chris N. Chertkov, Eli DeCross, Matthew Hayes, David Neyenhuis, Brian Benedetti, Marcello Meichanetzidis, Konstantinos |
| contents | We present an end-to-end reconfigurable algorithmic pipeline for solving a famous problem in knot theory using a noisy digital quantum computer, namely computing the value of the Jones polynomial at the fifth root of unity within additive error for any input link, i.e. a closed braid. This problem is DQC1-complete for Markov-closed braids and BQP-complete for Plat-closed braids, and we accommodate both versions of the problem. Even though it is widely believed that DQC1 is strictly contained in BQP, and so is 'less quantum', the resource requirements of classical algorithms for the DQC1 version are at least as high as for the BQP version, and so we potentially gain 'more advantage' by focusing on Markov-closed braids in our exposition. We demonstrate our quantum algorithm on Quantinuum's H2-2 quantum computer and show the effect of problem-tailored error-mitigation techniques. Further, leveraging that the Jones polynomial is a link invariant, we construct an efficiently verifiable benchmark to characterise the effect of noise present in a given quantum processor. In parallel, we implement and benchmark the state-of-the-art tensor-network-based classical algorithms for computing the Jones polynomial. The practical tools provided in this work allow for precise resource estimation to identify near-term quantum advantage for a meaningful quantum-native problem in knot theory. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_05625 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Less Quantum, More Advantage: An End-to-End Quantum Algorithm for the Jones Polynomial Laakkonen, Tuomas Rinaldi, Enrico Self, Chris N. Chertkov, Eli DeCross, Matthew Hayes, David Neyenhuis, Brian Benedetti, Marcello Meichanetzidis, Konstantinos Quantum Physics 68Q12 (Primary), 57M27 (Secondary) We present an end-to-end reconfigurable algorithmic pipeline for solving a famous problem in knot theory using a noisy digital quantum computer, namely computing the value of the Jones polynomial at the fifth root of unity within additive error for any input link, i.e. a closed braid. This problem is DQC1-complete for Markov-closed braids and BQP-complete for Plat-closed braids, and we accommodate both versions of the problem. Even though it is widely believed that DQC1 is strictly contained in BQP, and so is 'less quantum', the resource requirements of classical algorithms for the DQC1 version are at least as high as for the BQP version, and so we potentially gain 'more advantage' by focusing on Markov-closed braids in our exposition. We demonstrate our quantum algorithm on Quantinuum's H2-2 quantum computer and show the effect of problem-tailored error-mitigation techniques. Further, leveraging that the Jones polynomial is a link invariant, we construct an efficiently verifiable benchmark to characterise the effect of noise present in a given quantum processor. In parallel, we implement and benchmark the state-of-the-art tensor-network-based classical algorithms for computing the Jones polynomial. The practical tools provided in this work allow for precise resource estimation to identify near-term quantum advantage for a meaningful quantum-native problem in knot theory. |
| title | Less Quantum, More Advantage: An End-to-End Quantum Algorithm for the Jones Polynomial |
| topic | Quantum Physics 68Q12 (Primary), 57M27 (Secondary) |
| url | https://arxiv.org/abs/2503.05625 |