Pages that link to "Item:Q5704387"
From MaRDI portal
The following pages link to Approximate Counting and Quantum Computation (Q5704387):
Displaying 20 items.
- Topology, formal languages and quantum information (Q627065) (← links)
- A permanent formula for the Jones polynomial (Q719783) (← links)
- A new connection between quantum circuits, graphs and the Ising partition function (Q1007123) (← links)
- The complexity of approximating complex-valued Ising and Tutte partition functions (Q1686832) (← links)
- Coloring invariants of knots and links are often intractable (Q1983547) (← links)
- The complexity of approximating the complex-valued Potts model (Q2125077) (← links)
- Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups (Q2258015) (← links)
- On the de-randomization of space-bounded approximate counting problems (Q2348703) (← links)
- Gröbner bases for finite-temperature quantum computing and their complexity (Q2851766) (← links)
- Post quantum cryptography from mutant prime knots (Q2893169) (← links)
- Computational Number Theory and Cryptography (Q2926150) (← links)
- How hard is it to approximate the Jones polynomial? (Q2941639) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS (Q3528503) (← links)
- ON THE QUANTUM COMPLEXITY OF EVALUATING THE TUTTE POLYNOMIAL (Q3581162) (← links)
- QUANTUM DISCORD AND QUANTUM COMPUTING — AN APPRAISAL (Q4904835) (← links)
- The complexity of approximating the complex-valued Potts model (Q5089203) (← links)
- The BQP-hardness of approximating the Jones polynomial (Q5135831) (← links)
- How fast can quantum annealers count? (Q5495127) (← links)
- A polynomial quantum algorithm for approximating the Jones polynomial (Q5896964) (← links)
