|
| related topics |
| {let, theorem, proof} |
| {qubit, qubits, gate} |
| {states, state, optimal} |
| {cos, sin, state} |
| {state, algorithm, problem} |
| {equation, function, exp} |
| {group, space, representation} |
| {time, decoherence, evolution} |
| {operator, operators, space} |
| {algorithm, log, probability} |
|
Qubiter Algorithm Modification, Expressing Unstructured Unitary Matrices
with Fewer CNOTs
Robert R. Tucci
abstract: A quantum compiler is a software program for decomposing ("compiling") an
arbitrary unitary matrix into a sequence of elementary operations (SEO). The
author of this paper is also the author of a quantum compiler called Qubiter.
Qubiter uses a matrix decomposition called the Cosine-Sine Decomposition (CSD)
that is well known in the field of Computational Linear Algebra. One way of
measuring the efficiency of a quantum compiler is to measure the number of
CNOTs it uses to express an unstructured unitary matrix (a unitary matrix with
no special symmetries). We will henceforth refer to this number as $\epsilon$.
In this paper, we show how to improve $\epsilon$ for Qubiter so that it matches
the current world record for $\epsilon$, which is held by another quantum
compiling algorithm based on CSD.
- oai_identifier:
- oai:arXiv.org:quant-ph/0411027
- categories:
- quant-ph
- comments:
- 20 pages (files: 1 .tex, 2 .sty, 3 .eps)
- arxiv_id:
- quant-ph/0411027
- created:
- 2004-11-03
Full article ▸
|
|
| related documents |
| 0208130v1 |
| 0606077v1 |
| 0002058v1 |
| 0406226v1 |
| 0305005v1 |
| 0107111v2 |
| 0512100v1 |
| 0703061v1 |
| 9611001v2 |
| 0603206v1 |
| 0504169v1 |
| 0611058v2 |
| 0612123v2 |
| 0608156v1 |
| 0605132v1 |
| 0702033v1 |
| 0210091v1 |
| 0701079v1 |
| 0503094v2 |
| 9908050v1 |
| 0610258v1 |
| 0501093v1 |
| 0603155v1 |
| 0507262v1 |
| 0703193v2 |
|