Trading inverses for an irrep in the Solovay-Kitaev theorem
From MaRDI portal
Publication:5889073
Recommendations
Cites work
- scientific article; zbMATH DE number 6351479 (Why is no real title available?)
- scientific article; zbMATH DE number 1776257 (Why is no real title available?)
- A polynomial quantum algorithm for approximating the Jones polynomial
- Characterization of universal two-qubit Hamiltonians
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
- Complexity classification of two-qubit commuting Hamiltonians
- Efficient discrete approximations of quantum gates
- Fault-Tolerant Quantum Computation with Constant Error Rate
- How hard is it to approximate the Jones polynomial?
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits
- Quantum computation and quantum information. 10th anniversary edition
- Quantum computations: algorithms and error correction
- Random walks in compact groups
- Super-Golden-Gates for \(PU(2)\)
- The Solovay--Kitaev algorithm
- The complexity of translationally invariant low-dimensional spin lattices in 3D
- The complexity of translationally invariant spin chains with low local dimension
- The computational complexity of linear optics
Cited in
(2)
This page was built for publication: Trading inverses for an irrep in the Solovay-Kitaev theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889073)