Approximate Counting and Quantum Computation

DOI10.1017/S0963548305007005zbMath1089.68040OpenAlexW1991632738MaRDI QIDQ5704387

Magnus Bordewich, Dominic J. A. Welsh, Michael Hartley Freedman

Publication date: 14 November 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548305007005

zbMATH Keywords

quantum complexity class

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Topological field theories in quantum mechanics (81T45) Topological quantum field theories (aspects of differential topology) (57R56) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (17)

The complexity of approximating the complex-valued Potts model ⋮ POST QUANTUM CRYPTOGRAPHY FROM MUTANT PRIME KNOTS ⋮ Computational Number Theory and Cryptography ⋮ The complexity of approximating complex-valued Ising and Tutte partition functions ⋮ Topology, formal languages and quantum information ⋮ AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS ⋮ The BQP-hardness of approximating the Jones polynomial ⋮ A polynomial quantum algorithm for approximating the Jones polynomial ⋮ Coloring invariants of knots and links are often intractable ⋮ QUANTUM DISCORD AND QUANTUM COMPUTING — AN APPRAISAL ⋮ Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups ⋮ ON THE QUANTUM COMPLEXITY OF EVALUATING THE TUTTE POLYNOMIAL ⋮ A permanent formula for the Jones polynomial ⋮ A new connection between quantum circuits, graphs and the Ising partition function ⋮ Quantum algorithms for algebraic problems ⋮ The complexity of approximating the complex-valued Potts model ⋮ Gröbner bases for finite-temperature quantum computing and their complexity

This page was built for publication: Approximate Counting and Quantum Computation