Pages that link to "Item:Q3602386"
From MaRDI portal
The following pages link to Estimating Jones polynomials is a complete problem for one clean qubit (Q3602386):
Displayed 14 items.
- Complexity classes as mathematical axioms. II (Q259630) (← links)
- On upper bounds for toroidal mosaic numbers (Q370992) (← links)
- Quantum knots and mosaics (Q941708) (← links)
- Anyons in geometric models of matter (Q1696285) (← links)
- Quantum knots and the number of knot mosaics (Q2018200) (← links)
- Growth rate of quantum knot mosaics (Q2106017) (← links)
- Benchmarking quantum processors with a single qubit (Q2677203) (← links)
- Quantum circuits cannot control unknown operations (Q3386973) (← links)
- Approximating the Turaev-Viro Invariant of Mapping Tori is Complete for One Clean Qubit (Q3453312) (← links)
- The BQP-hardness of approximating the Jones polynomial (Q5135831) (← links)
- Period and toroidal knot mosaics (Q5269129) (← links)
- Enumeration on graph mosaics (Q5269130) (← links)
- (Q5889071) (← links)
- An improved method for quantum matrix multiplication (Q6171473) (← links)