|
| related topics |
| {let, theorem, proof} |
| {algorithm, log, probability} |
| {state, algorithm, problem} |
| {qubit, qubits, gate} |
| {group, space, representation} |
| {equation, function, exp} |
| {operator, operators, space} |
|
On an implementation of the Solovay-Kitaev algorithm
Attila B. Nagy
abstract: In quantum computation we are given a finite set of gates and we have to
perform a desired operation as a product of them. The corresponding
computational problem is approximating an arbitrary unitary as a product in a
topological generating set of $SU(d)$. The problem is known to be solvable in
time $polylog(1/\epsilon)$ with product length $polylog(1/\epsilon)$, where the
implicit constants depend on the given generators. The existing algorithms
solve the problem but they need a very slow and space consuming preparatory
stage. This stage runs in time exponential in $d^2$ and requires memory of size
exponential in $d^2$. In this paper we present methods which make the
implementation of the existing algorithms easier. We present heuristic methods
which make a time-length trade-off in the preparatory step. We decrease the
running time and the used memory to polynomial in $d$ but the length of the
products approximating the desired operations will increase (by a factor which
depends on $d$). We also present a simple method which can be used for
decomposing a unitary into a product of group commutators for $2
- oai_identifier:
- oai:arXiv.org:quant-ph/0606077
- categories:
- quant-ph
- comments:
- 10 pages, published on the 10th Rhine Workshop on Computer Algebra
- arxiv_id:
- quant-ph/0606077
- created:
- 2006-06-08
Full article ▸
|
|
| related documents |
| 0208130v1 |
| 0304013v1 |
| 0002058v1 |
| 0406226v1 |
| 0211034v2 |
| 0411027v1 |
| 0107111v2 |
| 0512100v1 |
| 0608156v1 |
| 0703061v1 |
| 0504169v1 |
| 0612052v2 |
| 0404051v4 |
| 0508156v3 |
| 0605132v1 |
| 9611001v2 |
| 0305031v1 |
| 0603155v1 |
| 0609160v1 |
| 0507194v1 |
| 0612033v1 |
| 0606242v3 |
| 0703193v2 |
| 0701198v1 |
| 0507218v1 |
|