Approximate Counting and Quantum Computation
From MaRDI portal
Topological quantum field theories (aspects of differential topology) (57R56) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum computation (81P68) Topological field theories in quantum mechanics (81T45)
Recommendations
- How hard is it to approximate the Jones polynomial?
- A polynomial quantum algorithm for approximating the Jones polynomial
- A polynomial quantum algorithm for approximating the Jones polynomial
- The Jones polynomial: quantum algorithms and applications in quantum complexity theory
- Estimating Jones polynomials is a complete problem for one clean qubit
Cited in
(23)- A new connection between quantum circuits, graphs and the Ising partition function
- The complexity of approximating complex-valued Ising and Tutte partition functions
- Coloring invariants of knots and links are often intractable
- The complexity of approximating the complex-valued Potts model
- Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups
- On the de-randomization of space-bounded approximate counting problems
- Gröbner bases for finite-temperature quantum computing and their complexity
- Post quantum cryptography from mutant prime knots
- Computational Number Theory and Cryptography
- How hard is it to approximate the Jones polynomial?
- Quantum algorithms for algebraic problems
- AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS
- On the quantum complexity of evaluating the Tutte polynomial
- scientific article; zbMATH DE number 1796836 (Why is no real title available?)
- Quantum discord and quantum computing -- an appraisal
- The complexity of approximating the complex-valued Potts model
- Quantum lower bounds for approximate counting via Laurent polynomials
- The BQP-hardness of approximating the Jones polynomial
- How fast can quantum annealers count?
- A polynomial quantum algorithm for approximating the Jones polynomial
- Topology, formal languages and quantum information
- Dominic Welsh: his work and influence
- A permanent formula for the Jones polynomial
This page was built for publication: Approximate Counting and Quantum Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704387)
