Pages that link to "Item:Q5891928"
From MaRDI portal
The following pages link to A polynomial quantum algorithm for approximating the Jones polynomial (Q5891928):
Displayed 19 items.
- Low depth quantum circuits for Ising models (Q339445) (← links)
- On upper bounds for toroidal mosaic numbers (Q370992) (← links)
- On the degeneracy of \(SU(3)_k\) topological phases (Q455604) (← links)
- Topological aspects of quantum entanglement (Q669980) (← links)
- A permanent formula for the Jones polynomial (Q719783) (← links)
- On the exact evaluation of certain instances of the Potts partition function by quantum computers (Q926258) (← links)
- Quantum knots and mosaics (Q941708) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Braiding, Majorana fermions, Fibonacci particles and topological quantum computing (Q1993849) (← links)
- Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups (Q2258015) (← links)
- Verification of quantum computation and the price of trust (Q2399359) (← links)
- Control aspects of quantum computing using pure and mixed states (Q2941614) (← links)
- Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$ (Q2969880) (← links)
- Optimised resource construction for verifiable quantum computation (Q2988006) (← links)
- Measurement-Based and Universal Blind Quantum Computation (Q3575028) (← links)
- Hamming Distance Kernelisation via Topological Quantum Computation (Q5055989) (← links)
- Sized Types for Low-Level Quantum Metaprogramming (Q5237215) (← links)
- (Q5889071) (← links)
- The SWITCH test for discriminating quantum evolutions (Q6137662) (← links)