Exploring a new post-selection condition for efficient linear optics computation

Ruben Coen Cagli, Paolo Aniello, Nicola Cesario, Francesco Foncellino

Research output: Contribution to journalArticle

Abstract

Recently, it has been shown that fundamental gates for theoretically efficient quantum information processing can be realized by using single photon sources, linear optics and photon counters. One of these fundamental gates is the NS-gate, that is, the one-mode non-linear sign shift. In this work, firstly, we prove by an elementary and rigorous proof that the upper bound of success probability of NS-gates with only one helper photon and an undefined number of ancillary modes is bounded by 0.25. Secondly, we explore the upper bound of the success probability of the NS-gate with a new post-selection measurement. The idea behind this new post-selection measurement is to condition the success of NS-gate transformation to the observation of only one helper photon in whichever of the output modes.

Original languageEnglish (US)
Pages (from-to)611-621
Number of pages11
JournalInternational Journal of Quantum Information
Volume3
Issue number4
DOIs
StatePublished - Dec 2005
Externally publishedYes

Fingerprint

optics
photons
counters
output
shift

Keywords

  • Efficient linear optical quantum computation (eLOQC)
  • Linear optical passive (LOP) transformations
  • Non-linear sign shifts

ASJC Scopus subject areas

  • Physics and Astronomy (miscellaneous)

Cite this

Exploring a new post-selection condition for efficient linear optics computation. / Coen Cagli, Ruben; Aniello, Paolo; Cesario, Nicola; Foncellino, Francesco.

In: International Journal of Quantum Information, Vol. 3, No. 4, 12.2005, p. 611-621.

Research output: Contribution to journalArticle

Coen Cagli, Ruben ; Aniello, Paolo ; Cesario, Nicola ; Foncellino, Francesco. / Exploring a new post-selection condition for efficient linear optics computation. In: International Journal of Quantum Information. 2005 ; Vol. 3, No. 4. pp. 611-621.
@article{0039c4fa4dbd468d82a3830970150bad,
title = "Exploring a new post-selection condition for efficient linear optics computation",
abstract = "Recently, it has been shown that fundamental gates for theoretically efficient quantum information processing can be realized by using single photon sources, linear optics and photon counters. One of these fundamental gates is the NS-gate, that is, the one-mode non-linear sign shift. In this work, firstly, we prove by an elementary and rigorous proof that the upper bound of success probability of NS-gates with only one helper photon and an undefined number of ancillary modes is bounded by 0.25. Secondly, we explore the upper bound of the success probability of the NS-gate with a new post-selection measurement. The idea behind this new post-selection measurement is to condition the success of NS-gate transformation to the observation of only one helper photon in whichever of the output modes.",
keywords = "Efficient linear optical quantum computation (eLOQC), Linear optical passive (LOP) transformations, Non-linear sign shifts",
author = "{Coen Cagli}, Ruben and Paolo Aniello and Nicola Cesario and Francesco Foncellino",
year = "2005",
month = "12",
doi = "10.1142/S021974990500147X",
language = "English (US)",
volume = "3",
pages = "611--621",
journal = "International Journal of Quantum Information",
issn = "0219-7499",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "4",

}

TY - JOUR

T1 - Exploring a new post-selection condition for efficient linear optics computation

AU - Coen Cagli, Ruben

AU - Aniello, Paolo

AU - Cesario, Nicola

AU - Foncellino, Francesco

PY - 2005/12

Y1 - 2005/12

N2 - Recently, it has been shown that fundamental gates for theoretically efficient quantum information processing can be realized by using single photon sources, linear optics and photon counters. One of these fundamental gates is the NS-gate, that is, the one-mode non-linear sign shift. In this work, firstly, we prove by an elementary and rigorous proof that the upper bound of success probability of NS-gates with only one helper photon and an undefined number of ancillary modes is bounded by 0.25. Secondly, we explore the upper bound of the success probability of the NS-gate with a new post-selection measurement. The idea behind this new post-selection measurement is to condition the success of NS-gate transformation to the observation of only one helper photon in whichever of the output modes.

AB - Recently, it has been shown that fundamental gates for theoretically efficient quantum information processing can be realized by using single photon sources, linear optics and photon counters. One of these fundamental gates is the NS-gate, that is, the one-mode non-linear sign shift. In this work, firstly, we prove by an elementary and rigorous proof that the upper bound of success probability of NS-gates with only one helper photon and an undefined number of ancillary modes is bounded by 0.25. Secondly, we explore the upper bound of the success probability of the NS-gate with a new post-selection measurement. The idea behind this new post-selection measurement is to condition the success of NS-gate transformation to the observation of only one helper photon in whichever of the output modes.

KW - Efficient linear optical quantum computation (eLOQC)

KW - Linear optical passive (LOP) transformations

KW - Non-linear sign shifts

UR - http://www.scopus.com/inward/record.url?scp=33746301948&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746301948&partnerID=8YFLogxK

U2 - 10.1142/S021974990500147X

DO - 10.1142/S021974990500147X

M3 - Article

AN - SCOPUS:33746301948

VL - 3

SP - 611

EP - 621

JO - International Journal of Quantum Information

JF - International Journal of Quantum Information

SN - 0219-7499

IS - 4

ER -