Deciding universality of quantum gates

DOI10.1016/J.JALGEBRA.2006.09.013zbMATH Open1110.81045arXivquant-ph/0603009OpenAlexW2024507123MaRDI QIDQ876334FDOQ876334

Authors: Gábor Ivanyos 

Publication date: 18 April 2007

Published in: Journal of Algebra (Search for Journal in Brave)

Abstract: We say that collection of $n$-qudit gates is universal if there exists $N_{0}geqn$ such that for every $Ngeq{N}_0$ every $N$-qudit unitary operation can be approximated with arbitrary precision by a circuit built from gates of the collection. Our main result is an upper bound on the smallest $N_0$ with the above property. The bound is roughly $d^{8}n$, where $d$ is the number of levels of the base system (the '$d$' in the term qu$d$it.) The proof is based on a recent result on invariants of (finite) linear groups.

Full work available at URL: https://arxiv.org/abs/quant-ph/0603009

Recommendations

• scientific article; zbMATH DE number 1796832
• Universality of single-qudit gates
• Automata, Languages and Programming
• On the universality and membership problems for quantum gates
• Exact universality from any entangling gate without inverses

zbMATH Keywords

quantum computinggroup representations

Mathematics Subject Classification ID

Quantum computation (81P68) Applications of Lie groups to the sciences; explicit representations (22E70)

Cites Work

• Title not available (Why is that?)
• Multilinear algebra. 2nd ed
• Résolution des systèmes d'équations algébriques
• Title not available (Why is that?)
• Title not available (Why is that?)
• Quantum automata and algebraic groups
• Automata, Languages and Programming

Cited In (11)

• Title not available (Why is that?)
• Noncommutative tori and universal sets of nonbinary quantum gates
• Comment on: ``On the universality of almost every quantum logic gate.
• ON THE NON-EXISTENCE OF A UNIVERSAL HADAMARD GATE
• On the universality of almost every quantum logic gate.
• Universality of single-qudit gates
• Calculable lower bounds on the efficiency of universal sets of quantum gates
• Exact universality from any entangling gate without inverses
• Explicit construction of controlled-\(U\) gates and unitary operators in two-qudit
• On the universality and membership problems for quantum gates
• Automata, Languages and Programming

This page was built for publication: Deciding universality of quantum gates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876334)