|
| related topics |
| {qubit, qubits, gate} |
| {equation, function, exp} |
| {observables, space, algebra} |
| {algorithm, log, probability} |
|
Representation of Boolean Quantum Circuits as Reed-Muller Expansions
Ahmed Younes, Julian Miller
abstract: In this paper we show that there is a direct correspondence between quantum
Boolean operations and certain forms of classical (non-quantum) logic known as
Reed-Muller expansions. This allows us to readily convert Boolean circuits into
their quantum equivalents. A direct result of this is that the problem of
synthesis and optimization of quantum Boolean logic can be tackled within the
field of Reed-Muller logic.
- oai_identifier:
- oai:arXiv.org:quant-ph/0305134
- categories:
- quant-ph
- comments:
- 12 pages
- arxiv_id:
- quant-ph/0305134
- journal_ref:
- International Journal of Electronics. Vol.(No.7)pp. 431-444 (2004)
- report_no:
- CSR-03-5
- created:
- 2003-05-22
Full article ▸
|
|
| related documents |
| 0304078v1 |
| 0511041v1 |
| 0411058v1 |
| 0504197v1 |
| 0308167v1 |
| 0610105v1 |
| 9605013v1 |
| 0505122v2 |
| 0512058v3 |
| 9505011v1 |
| 0109016v2 |
| 9511007v1 |
| 0211085v2 |
| 0012067v1 |
| 0610214v3 |
| 0601183v1 |
| 9908074v5 |
| 9903101v2 |
| 0005116v2 |
| 0408081v5 |
| 0304054v2 |
| 0506062v2 |
| 0405157v2 |
| 0305038v2 |
| 0505009v4 |
|