A polynomial quantum algorithm for approximating the Jones polynomial (Q5896964): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Theory of braids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebras associated to intermediate subfactors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Counting and Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential algorithmic speedup by a quantum walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>P/NP</i> , and the quantum field computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of topological field theories by quantum computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modular functor which is universal for quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the Jones and Tutte polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial invariant for knots via von Neumann algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index for subfactors / rank
 
Normal rank
Property / cites work
 
Property / cites work: State models and the Jones polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: q-DEFORMED SPIN NETWORKS, KNOT POLYNOMIALS AND ANYONIC TOPOLOGICAL QUANTUM COMPUTATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology and Quantum Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium distributions of topological states in circular DNA: Interplay of supercoiling and knotting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of links by braids: A new algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithms for solvable groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum field theory and the Jones polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3540809 / rank
 
Normal rank

Latest revision as of 21:55, 1 July 2024

scientific article; zbMATH DE number 5600040
Language Label Description Also known as
English
A polynomial quantum algorithm for approximating the Jones polynomial
scientific article; zbMATH DE number 5600040

    Statements

    A polynomial quantum algorithm for approximating the Jones polynomial (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 August 2009
    0 references
    topological quantum field theory
    0 references
    quantum computer
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references