|
| related topics |
| {qubit, qubits, gate} |
| {state, algorithm, problem} |
| {photon, photons, single} |
| {state, phys, rev} |
| {measurement, state, measurements} |
| {bell, inequality, local} |
| {cos, sin, state} |
|
Resource-efficient linear optical quantum computation
Daniel E. Browne, Terry Rudolph
abstract: We introduce a scheme for linear optics quantum computation, that makes no
use of teleported gates, and requires stable interferometry over only the
coherence length of the photons. We achieve a much greater degree of efficiency
and a simpler implementation than previous proposals. We follow the "cluster
state" measurement based quantum computational approach, and show how cluster
states may be efficiently generated from pairs of maximally polarization
entangled photons using linear optical elements. We demonstrate the
universality and usefulness of generic parity measurements, as well as
introducing the use of redundant encoding of qubits to enable utilization of
destructive measurements - both features of use in a more general context.
- oai_identifier:
- oai:arXiv.org:quant-ph/0405157
- categories:
- quant-ph
- comments:
- 5 pages, 6 figures. In this new version we have corrected typos and
minor errors, emphasised the scheme's robustness against phase-instability
and improved readability by restructuring the introduction
- doi:
- 10.1103/PhysRevLett.95.010501
- arxiv_id:
- quant-ph/0405157
- journal_ref:
- Physical Review Letters 95, 010501 (2005)
- created:
- 2004-05-26
- updated:
- 2005-02-09
Full article ▸
|
|
| related documents |
| 0610105v1 |
| 0411058v1 |
| 0511041v1 |
| 0304078v1 |
| 0505122v2 |
| 0512058v3 |
| 0504197v1 |
| 9505011v1 |
| 0305134v1 |
| 0601183v1 |
| 0308167v1 |
| 0610214v3 |
| 9908041v1 |
| 9605013v1 |
| 0211085v2 |
| 0109016v2 |
| 0408064v1 |
| 0505009v4 |
| 0408081v5 |
| 0507036v3 |
| 0410145v2 |
| 0304054v2 |
| 0012067v1 |
| 0506062v2 |
| 0303070v1 |
|