Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEICE Transactions on Information and Systems

A Proper Phase Shift in Multiple Linear Optical Teleportation

Kazuto Oshima

Published Jan 1, 2013• 0 citations
Publisher

Abstract

In the Knill-Laflamme-Milburn (KLM) scheme, quantum teleportation is nearly deterministically carried out with linear optics. To reconstruct an original quantum state, however, a phase shift is required for an output state. We exhibit a proper phase shift to complete quantum teleportation.
DOI
10.1587/transinf.e96.d.2266

Related papers

Adaptive quantum teleportation

Joanna Modławska, Andrzej Grudka

We consider multiple teleportation in the Knill-Laflamme-Milburn (KLM) scheme. We introduce adaptive teleportation, i.e., such that the choice of entangled state used in the next teleportation depends on the results of the measurements performed during the previous teleportations. We show that adaptive teleportation enables an increase in the probability of faithful multiple teleportation in the KLM scheme. In particular if a qubit is to be teleported more than once then it is better to use nonmaximally entangled states than maximally entangled ones in order to achieve the highest probability of faithful teleportation.

arXiv:0810.2943•Physical Review A•Jun 5, 2009•24 citations

Efficient parity-encoded optical quantum computing

Alexei Gilchrist, Anthony Hayes, Timothy C. Ralph

We present a linear optics quantum computation scheme with a greatly reduced cost in resources compared to that proposed by Knill, Laflamme, and Milburn (KLM). The scheme makes use of elements from cluster state computation but retains the circuit based approach of KLM.

arXiv:quant-ph/0505125•Physical Review A•May 22, 2007•26 citations

Optimal state in the Knill-Laflamme-Milburn scheme of linear optical teleportation

Andrzej Grudka, Joanna Modławska

We discuss some properties of the Knill-Laflamme-Milburn scheme for quantum teleportation with both maximally and nonmaximally entangled states. We derive the error correction scheme when one performs teleportation with nonmaximally entangled states and we find the probability for perfect teleportation. We show that the maximally entangled state is optimal in such a case. We also show how the error correction scheme can be implemented experimentally when one uses polarization encoding.

arXiv:0707.0759•Physical Review A•Jan 14, 2008•13 citations

Teleportation implementation of nondeterministic quantum logic operations by using linear optical elements

Xu‐Bo Zou, K. Pahlke, Wolfgang M. Mathis

We present a feasible scheme to implement the nondeterministic quantum logic operation of Knill, Laflamme, and Milburn [Nature 409, 46 (2001)] by a teleportation technique. An entangled photon channel is generated by emitting two single photons into an asymmetric beam splitter. In order to generate the classical channel signal, two-photon detectors are needed.

arXiv:quant-ph/0110177•Physical Review A•Jun 13, 2002•47 citations

Unity fidelity multiple teleportation using partially entangled states

Gustavo Rigolin

We show that the multiple teleportation protocol (MTP) given in reference (J Modławska and A Grudka 2008 Phys. Rev. Lett. 100 110503) is not restricted to the Knill–Laflamme–Milburn (KLM) framework. Rather, we show that MTP can be implemented using any teleportation scheme. We also present two new MTPs which, under certain situations, are more efficient than the original one, requiring half of the number of its teleportations to achieve at least the same probability of success ( ). One of the protocols, however, uses less entanglement than the others yielding, surprisingly, the greatest .

arXiv:0807.3549•Journal of Physics B Atomic Molecular and Optical Physics•Nov 23, 2009•18 citations

Deterministic Linear Optics Quantum Computation with Single Photon Qubits

Nadav Yoran, Benni Reznik

We suggest an efficient scheme for quantum computation with linear optical elements, where the qubits are encoded in single photon states. The scheme reduces the resources required per logical gate by several orders of magnitude, compared to an earlier proposal of Knill, Laflamme, and Milburn, while the resource overhead per gate is independent of the length of the computation. A central feature of the scheme, enabling these improvements, is the prior construction of a "linked" photon state designed according to the particular quantum circuit one wishes to process. Once this state has been successfully prepared, the computation is pursued deterministically by a sequence of teleportation steps.

arXiv:quant-ph/0303008•Physical Review Letters•Jul 17, 2003•138 citations
We consider multiple teleportation in the Knill-Laflamme-Milburn (KLM) scheme. We introduce adaptive teleportation, i.e., such that the choice of entangled state used in the next teleportation depends on the results of the measurements performed during the previous teleportations. We show that adaptive teleportation enables an increase in the probability of faithful multiple teleportation in the KLM scheme. In particular if a qubit is to be teleported more than once then it is better to use nonmaximally entangled states than maximally entangled ones in order to achieve the highest probability of faithful teleportation.
We show that the multiple teleportation protocol (MTP) given in reference (J Modławska and A Grudka 2008 Phys. Rev. Lett. 100 110503) is not restricted to the Knill–Laflamme–Milburn (KLM) framework. Rather, we show that MTP can be implemented using any teleportation scheme. We also present two new MTPs which, under certain situations, are more efficient than the original one, requiring half of the number of its teleportations to achieve at least the same probability of success ( ). One of the protocols, however, uses less entanglement than the others yielding, surprisingly, the greatest .
We suggest an efficient scheme for quantum computation with linear optical elements, where the qubits are encoded in single photon states. The scheme reduces the resources required per logical gate by several orders of magnitude, compared to an earlier proposal of Knill, Laflamme, and Milburn, while the resource overhead per gate is independent of the length of the computation. A central feature of the scheme, enabling these improvements, is the prior construction of a "linked" photon state designed according to the particular quantum circuit one wishes to process. Once this state has been successfully prepared, the computation is pursued deterministically by a sequence of teleportation steps.