Deciding universality of quantum gates
| dc.creator | Ivanyos, Gabor | |
| dc.date | 2006-03-01 | |
| dc.date | 2006-09-08 | |
| dc.date.accessioned | 2026-07-07T07:07:56Z | |
| dc.date.available | 2026-07-07T07:07:56Z | |
| dc.description | We say that collection of $n$-qudit gates is universal if there exists $N_0\geq n$ such that for every $N\geq 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. | |
| dc.description | 8 pages, minor corrections | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0603009 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0603009 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/110573 | |
| dc.subject | Quantum Physics | |
| dc.title | Deciding universality of quantum gates | |
| dc.type | text |