The Solovay--Kitaev algorithm
From MaRDI portal
Recommendations
- An algorithmic construction of quantum circuits of high descriptive complexity
- Efficient discrete approximations of quantum gates
- Solovay-Kitaev approximations of special orthogonal matrices
- Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets
- Scalability of Shor’s algorithm with a limited set of rotation gates
Cited in
(78)- Decompositions of n-qubit Toffoli gates with linear circuit complexity
- Quantum algorithm design: techniques and applications
- Operator complexity: a journey to the edge of Krylov space
- Quantum random access stored-program machines
- Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\)
- Quantum security analysis of CSIDH
- Solovay-Kitaev approximations of special orthogonal matrices
- Error bounds for approximations with deep ReLU networks
- Canonical forms for single-qutrit Clifford+\(T\) operators
- [[:Publication:2355591|Syndrome measurement strategies for the \(7,1,3\) code]]
- On the spectral gap for finitely-generated subgroups of \(\text{SU}(2)\)
- New results on expanders
- Quantum QR decomposition in the computational basis
- Advanced exact synthesis of Clifford+T circuits
- Learning bounds for quantum circuits in the agnostic setting
- A normal form for single-qudit Clifford+\(T\) operators
- Large k topological quantum computer
- Quantum circuits synthesis using Householder transformations
- Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets
- PEET: a Matlab tool for estimating physical gate errors in quantum information processing systems
- Expansion in SL₂( R) and monotone expanders
- The Toffoli-Hadamard gate system: an algebraic approach
- Quantum simulation from the bottom up: the case of rebits
- Random walks in Euclidean space
- Efficient discrete approximations of quantum gates
- An algorithmic construction of quantum circuits of high descriptive complexity
- Sampling and Statistical Physics via Symmetry
- scientific article; zbMATH DE number 7250161 (Why is no real title available?)
- Survey of control performance in quantum information processing
- Topological quantum gate construction by iterative pseudogroup hashing
- Quantum-circuit design for efficient simulations of many-body quantum dynamics
- Faster quantum chemistry simulation on fault-tolerant quantum computers
- An introduction to quantum computing, without the physics
- Floating point representations in quantum circuit synthesis
- Quantum circuit design for accurate simulation of qudit channels
- Revisiting the simulation of quantum Turing machines by quantum circuits
- Navigating directed Cayley graphs of small diameter: a potent Solovay-Kitaev procedure
- On random walks in large compact Lie groups
- Product formulas for exponentials of commutators
- Bounding quantum gate error rate based on reported average fidelity
- The search for leakage-free entangling Fibonacci braiding gates
- Constructing approximately diagonal quantum gates
- On the Origins, Nature, and Impact of Bourgain’s Discretized Sum-Product Theorem
- Quantum Implementation of Numerical Methods for Convection-Diffusion Equations: Toward Computational Fluid Dynamics
- Trading inverses for an irrep in the Solovay-Kitaev theorem
- Approximate quantum gates compilation for superconducting transmon qubits with self-navigation algorithm
- Mathematical etudes on quantum computation
- A dynamic programming approach to multi-objective logic synthesis of quantum circuits
- Phase shift and multi-controlled \(Z\)-type gates
- Hay from the haystack: explicit examples of exponential quantum circuit complexity
- Quantum impossible differential attacks: applications to AES and SKINNY
- The SWITCH test for discriminating quantum evolutions
- Secure delegated quantum algorithms for solving Mahalanobis distance
- Instability of nondiscrete free subgroups in Lie groups
- A Theory of Cartesian Arrays (with Applications in Quantum Circuit Verification)
- Simultaneous linearization of diffeomorphisms of isotropic manifolds
- Quantum algorithms for matrix operations and linear systems of equations
- Topological quantum gates in homotopy type theory
- Interpolating parametrized quantum circuits using blackbox queries
- Quantum algorithms for longest common and palindromic substrings in the circuit model
- On the physical basis for the incomparability of NP and BQP
- On exact sizes of minimal CNOT circuits
- Universal graph theory operations for graph state preparation
- The quantum monadology
- Quantum computer formulation of the FKP-operator eigenvalue problem for probabilistic learning on manifolds
- A sufficient criterion for divisibility of quantum channels
- Extending the planar theory of anyons to quantum wire networks
- Extremal jumps of circuit complexity of unitary evolutions generated by random Hamiltonians
- Rewindable quantum computation and its equivalence to cloning and adaptive postselection
- Equivalence checking of quantum circuits by model counting
- A spectral gap theorem in SU(d)
- Quantum speedups for polynomial-time dynamic programming algorithms
- Quantum catalytic space
- High-fidelity universal quantum gate compilation for non-semisimple Ising anyons via genetic algorithm-optimized Solovay-Kitaev decomposition
- Uncloneable quantum advice
- How smooth is quantum complexity?
- Expansion and random walks in \(\text{SL}_d(\mathbb{Z}/p^n\mathbb{Z})\). II.
- Expansion and random walks in \(\text{SL}_d(\mathbb{Z}/p^n\mathbb{Z})\). I.
This page was built for publication: The Solovay--Kitaev algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522568)
