|
| related topics |
| {photon, photons, single} |
| {state, phys, rev} |
| {states, state, optimal} |
| {qubit, qubits, gate} |
| {equation, function, exp} |
| {let, theorem, proof} |
| {state, states, coherent} |
| {error, code, errors} |
| {measurement, state, measurements} |
| {group, space, representation} |
| {energy, gaussian, time} |
| {cos, sin, state} |
| {information, entropy, channel} |
| {state, states, entangled} |
| {algorithm, log, probability} |
| {state, algorithm, problem} |
| {vol, operators, histories} |
| {operator, operators, space} |
|
Upper bounds on success probabilities in linear optics
Stefan Scheel, Norbert Luetkenhaus
abstract: We develop an abstract way of defining linear-optics networks designed to
perform quantum information tasks such as quantum gates. We will be mainly
concerned with the nonlinear sign shift gate, but it will become obvious that
all other gates can be treated in a similar manner. The abstract scheme is
extremely well suited for analytical as well as numerical investigations since
it reduces the number of parameters for a general setting. With that we show
numerically and partially analytically for a wide class of states that the
success probability of generating a nonlinear sign shift gate does not exceed
1/4 which to our knowledge is the strongest bound to date.
- oai_identifier:
- oai:arXiv.org:quant-ph/0403103
- categories:
- quant-ph
- comments:
- 8 pages, typeset using RevTex4, 5 EPS figures
- doi:
- 10.1088/1367-2630/6/1/051
- arxiv_id:
- quant-ph/0403103
- created:
- 2004-03-15
Full article ▸
|
|
| related documents |
| 0308095v2 |
| 0607189v3 |
| 0102141v1 |
| 0609005v1 |
| 0312048v1 |
| 0408011v2 |
| 0206198v2 |
| 0105098v1 |
| 0502003v1 |
| 0605002v1 |
| 0503050v1 |
| 0601091v2 |
| 0101127v1 |
| 0203134v1 |
| 0305019v1 |
| 0606086v2 |
| 0306114v1 |
| 0603285v1 |
| 0508012v2 |
| 0408064v1 |
| 0610096v2 |
| 0406138v1 |
| 0607105v2 |
| 0112088v1 |
| 0608113v3 |
|