scientific article; zbMATH DE number 7679310
From MaRDI portal
Publication:5889073
DOI10.4230/LIPIcs.TQC.2018.6MaRDI QIDQ5889073
Publication date: 26 April 2023
Full work available at URL: https://arxiv.org/abs/1712.09798
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random walks in compact groups
- The complexity of translationally invariant spin chains with low local dimension
- Super-Golden-Gates for \(PU(2)\)
- Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits
- Quantum Computation and Quantum Information
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Fault-Tolerant Quantum Computation with Constant Error Rate
- Quantum computations: algorithms and error correction
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- The complexity of translationally invariant low-dimensional spin lattices in 3D
- Efficient discrete approximations of quantum gates
- Complexity classification of two-qubit commuting Hamiltonians
- The computational complexity of linear optics
- A polynomial quantum algorithm for approximating the Jones polynomial
This page was built for publication: