|
| related topics |
| {spin, pulse, spins} |
| {qubit, qubits, gate} |
| {time, decoherence, evolution} |
| {state, algorithm, problem} |
| {trap, ion, state} |
| {algorithm, log, probability} |
|
Compiling gate networks on an Ising quantum computer
M. D. Bowdrey, J. A. Jones, E. Knill, R. Laflamme
abstract: Here we describe a simple mechanical procedure for compiling a quantum gate
network into the natural gates (pulses and delays) for an Ising quantum
computer. The aim is not necessarily to generate the most efficient pulse
sequence, but rather to develop an efficient compilation algorithm that can be
easily implemented in large spin systems. The key observation is that it is not
always necessary to refocus all the undesired couplings in a spin system.
Instead the coupling evolution can simply be tracked and then corrected at some
later time. Although described within the language of NMR the algorithm is
applicable to any design of quantum computer based on Ising couplings.
- oai_identifier:
- oai:arXiv.org:quant-ph/0506006
- categories:
- quant-ph
- comments:
- 5 pages RevTeX4 including 4 figures. Will submit to PRA
- doi:
- 10.1103/PhysRevA.72.032315
- arxiv_id:
- quant-ph/0506006
- journal_ref:
- Phys. Rev. A 72, 032315 (2005)
- created:
- 2005-06-01
Full article ▸
|
|
| related documents |
| 0508192v2 |
| 0511264v1 |
| 0603248v1 |
| 0307054v1 |
| 0307240v1 |
| 9903101v2 |
| 0007017v2 |
| 0202008v2 |
| 0405042v1 |
| 9807057v2 |
| 0409120v3 |
| 0511153v1 |
| 0507169v1 |
| 0306055v2 |
| 9805070v1 |
| 0311178v2 |
| 0511041v1 |
| 0509109v2 |
| 0512058v3 |
| 0610105v1 |
| 0610214v3 |
| 0608182v2 |
| 0601183v1 |
| 0608147v2 |
| 0506172v1 |
|