Trading inverses for an irrep in the Solovay-Kitaev theorem
From MaRDI portal
Publication:5889073
DOI10.4230/LIPICS.TQC.2018.6MaRDI QIDQ5889073FDOQ5889073
Authors: Adam Bouland, Maris Ozols
Publication date: 26 April 2023
Full work available at URL: https://arxiv.org/abs/1712.09798
Recommendations
Cites Work
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- How hard is it to approximate the Jones polynomial?
- Quantum computation and quantum information. 10th anniversary edition
- Quantum computations: algorithms and error correction
- Title not available (Why is that?)
- A polynomial quantum algorithm for approximating the Jones polynomial
- Random walks in compact groups
- Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits
- The computational complexity of linear optics
- Fault-Tolerant Quantum Computation with Constant Error Rate
- The Solovay--Kitaev algorithm
- Characterization of universal two-qubit Hamiltonians
- Efficient discrete approximations of quantum gates
- Super-Golden-Gates for \(PU(2)\)
- The complexity of translationally invariant low-dimensional spin lattices in 3D
- The complexity of translationally invariant spin chains with low local dimension
- Title not available (Why is that?)
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
- Complexity classification of two-qubit commuting Hamiltonians
Cited In (1)
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)