A polynomial quantum algorithm for approximating the Jones polynomial
From MaRDI portal
Publication:5896964
DOI10.1007/s00453-008-9168-0zbMath1191.68313arXivquant-ph/0511096OpenAlexW2069525126WikidataQ56386247 ScholiaQ56386247MaRDI QIDQ5896964
Dorit Aharonov, Zeph A. Landau, Vaughan F. R. Jones
Publication date: 31 August 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0511096
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (26)
An Introduction to Khovanov Homology ⋮ Topological Quantum Computation ⋮ Models of random knots ⋮ Control aspects of quantum computing using pure and mixed states ⋮ Variational quantum algorithms for trace norms and their applications ⋮ Benchmarking quantum processors with a single qubit ⋮ Commuting quantum circuits and complexity of Ising partition functions ⋮ Finding broken gates in quantum circuits: exploiting hybrid machine learning ⋮ Doubled lattice Chern-Simons-Yang-Mills theories with discrete gauge group ⋮ A quantum algorithm to approximate the linear structures of Boolean functions ⋮ Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations ⋮ Non-Boolean quantum amplitude amplification and quantum mean estimation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Knottedness is in NP, modulo GRH ⋮ An Introduction to Quantum Computing, without the Physics ⋮ Computing the Tutte polynomial of lattice path matroids using determinantal circuits ⋮ Identifying lens spaces in polynomial time ⋮ Shaded tangles for the design and verification of quantum circuits ⋮ How to Verify a Quantum Computation ⋮ Quantum algorithms for algebraic problems ⋮ Sumcheck-based delegation of quantum computing to rational server ⋮ Quantum algorithms for the generalized eigenvalue problem ⋮ Combinatorial and rotational quantum abstract detecting systems ⋮ Quantum computations for disambiguation and question answering ⋮ Complexity classes as mathematical axioms. II
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Representation of links by braids: A new algorithm
- State models and the Jones polynomial
- Quantum field theory and the Jones polynomial
- Algebras associated to intermediate subfactors
- Index for subfactors
- Simulation of topological field theories by quantum computers
- A modular functor which is universal for quantum computation
- Theory of braids
- q-DEFORMED SPIN NETWORKS, KNOT POLYNOMIALS AND ANYONIC TOPOLOGICAL QUANTUM COMPUTATION
- Exponential algorithmic speedup by a quantum walk
- Topology and Quantum Computing
- A polynomial invariant for knots via von Neumann algebras
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- P/NP , and the quantum field computer
- Equilibrium distributions of topological states in circular DNA: Interplay of supercoiling and knotting
- On the computational complexity of the Jones and Tutte polynomials
- Topological quantum computation
- Quantum algorithms for solvable groups
- A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Approximate Counting and Quantum Computation
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
This page was built for publication: A polynomial quantum algorithm for approximating the Jones polynomial
