Efficient discrete approximations of quantum gates
From MaRDI portal
Abstract: Quantum compiling addresses the problem of approximating an arbitrary quantum gate with a string of gates drawn from a particular finite set. It has been shown that this is possible for almost all choices of base sets and furthermore that the number of gates required for precision epsilon is only polynomial in log 1/epsilon. Here we prove that using certain sets of base gates quantum compiling requires a string length that is linear in log 1/epsilon, a result which matches the lower bound from counting volume up to constant factor.
Recommendations
Cites work
- Bounds for Kac's master equation
- Hecke operators and distributing points on S2. II
- Hecke operators and distributing points on the sphere I
- Quantum Complexity Theory
- Quantum computations: algorithms and error correction
- Quantum information and computation
- Quantum information theory
- Reliable quantum computers
- Universality in quantum computation
Cited in
(27)- Quantum lattice enumeration and tweaking discrete pruning
- Universality of single-qudit gates
- Quantum branching programs and space-bounded nonuniform quantum complexity
- Martin-Löf randomness, invariant measures and countable homogeneous structures
- Solovay-Kitaev approximations of special orthogonal matrices
- On the spectral gap for finitely-generated subgroups of \(\text{SU}(2)\)
- Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets
- Quantum algorithms for algebraic problems
- Efficient algebraic representation of quantum circuits
- Optimal ancilla-free Pauli+V circuits for axial rotations
- The Solovay--Kitaev algorithm
- AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS
- ACCELERATION OF QUANTUM ALGORITHMS USING THREE-QUBIT GATES
- scientific article; zbMATH DE number 1839460 (Why is no real title available?)
- Efficient quantum algorithms to construct arbitrary Dicke states
- An algorithmic construction of quantum circuits of high descriptive complexity
- Floating point representations in quantum circuit synthesis
- Constructing approximately diagonal quantum gates
- Calculable lower bounds on the efficiency of universal sets of quantum gates
- On the Origins, Nature, and Impact of Bourgain’s Discretized Sum-Product Theorem
- Trading inverses for an irrep in the Solovay-Kitaev theorem
- Mathematical etudes on quantum computation
- Hay from the haystack: explicit examples of exponential quantum circuit complexity
- Groups of diagonal gates in the Clifford hierarchy
- Fundamental solutions of the heat equation on unitary groups establish an improved relation between -nets and approximate unitary t-designs
- Extremal jumps of circuit complexity of unitary evolutions generated by random Hamiltonians
- How smooth is quantum complexity?
This page was built for publication: Efficient discrete approximations of quantum gates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4832734)
