Criteria for universality of quantum gates
arXiv:1610.00547 · doi:10.1103/PhysRevA.95.062303
Abstract
We consider the problem of deciding if a set of quantum one-qudit gates is universal. We provide the compact form criteria leading to a simple algorithm that allows deciding universality of any given set of gates in a finite number of steps. Moreover, for a non-universal our criteria indicate what type of gates can be added to to turn it into a universal set.
arXiv commentSignificantly improved universality criteria and the much simpler algorithm that allows deciding universality of an arbitrary set of gates
References in corpus (11)
- Silica-on-Silicon Waveguide Quantum Circuits
- Quantum and classical correlations in waveguide lattices
- Efficient Discrete Approximations of Quantum Gates
- Symmetry Principles in Quantum Systems Theory
- Random bosonic states for robust quantum metrology
- Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits
- Efficient Decomposition of Single-Qubit Gates into Basis Circuits
- Generation of Universal Linear Optics by Any Beamsplitter
- Symmetry criteria for quantum simulability of effective interactions
- Classical simulation of fermionic linear optics augmented with noisy ancillas
- On squares of representations of compact Lie algebras
Cited by in corpus (14)
- On the Universality of the Quantum Approximate Optimization Algorithm
- Universal quantum multi-qubit entangling gates with auxiliary spaces
- Universal extensions of restricted classes of quantum operations
- Fibonacci anyons versus Majorana fermions
- Circuit Complexity in Topological Quantum Field Theory
- How to check universality of quantum gates?
- A method to determine which quantum operations can be realized with linear optics with a constructive implementation recipe
- Designs from Local Random Quantum Circuits with SU(d) Symmetry
- Universal Barenco quantum gates via a tunable non-collinear interaction
- Toward Super-polynomial Quantum Speedup of Equivariant Quantum Algorithms with SU() Symmetry
- Calculable lower bounds on the efficiency of universal sets of quantum gates
- Matrix concentration inequalities and efficiency of random universal sets of quantum gates
- Quantum permutation puzzles with indistinguishable particles
- Products of finite order rotations and quantum gates universality