The BQP-hardness of approximating the Jones polynomial (Q5135831): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Quantum computing, postselection, and probabilistic polynomial-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Quantum Computation with Constant Error Rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computation and the Evaluation of Tensor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Counting and Quantum Computation / 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: 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: Topological quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of the Tutte polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756812 / 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 invariant for knots via von Neumann algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3808703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: State models and the Jones polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3523611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4544834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating Jones polynomials is a complete problem for one clean qubit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum field theory and the Jones polynomial / rank
 
Normal rank

Latest revision as of 01:47, 24 July 2024

scientific article; zbMATH DE number 7277120
Language Label Description Also known as
English
The BQP-hardness of approximating the Jones polynomial
scientific article; zbMATH DE number 7277120

    Statements

    The BQP-hardness of approximating the Jones polynomial (English)
    0 references
    0 references
    0 references
    24 November 2020
    0 references

    Identifiers

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