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

arXiv:0903.0248 · Quantum Information Processing

Deletion, Bell’s inequality, teleportation

Indranil Chakrabarty, Nirman Ganguly, Binayak Samadder Choudhury

Published Mar 12, 2010• 12 citations
arXivHTMLPDF
DOI
10.1007/s11128-010-0167-0

Related papers

Teleportation, Bell's inequalities and inseparability

Ryszard Horodecki, Michał Horodecki, Paweł Horodecki

arXiv:quant-ph/9606027•Physics Letters A•Oct 1, 1996•281 citations

Teleportation, Superdense Coding and Bell’s Inequality

Jack D. Hidary

Springer eBooks•Jan 1, 2019•0 citations

Teleportation, Superdense Coding and Bell’s Inequality

Jack D. Hidary

Springer eBooks•Jan 1, 2021•0 citations

Maximal secret reconstruction, teleportation and Bell’s inequality

Pratishtha Abrol, Pahulpreet Singh, Indranil Chakrabarty

arXiv:2404.01212•The European Physical Journal D•Feb 1, 2025•4 citations

Concatenated deleting machines and their characteristics

A. Nancy, S. Balakrishnan

Abstract In this work, we study the performance of one shot and concatenated deleting machines (DMs). We show that the output state of one shot DMs are mixed inseparable, and do not violate Bell’s inequality but can be used as a teleportation channel for all values of the input state parameters. On the other hand, we observe in the concatenation of different DMs that the output states are mixed inseparable and do not violate Bell’s inequality, and cannot be used as a teleportation channel. Further, some important attributes such as inseparability, violation of Bell’s inequality, and teleportation fidelity of the DMs remain unchanged under the order of concatenation. In this context of a teleportation channel, one shot DMs are useful when compared to concatenated DMs.

Communications in Theoretical Physics•Mar 1, 2023•2 citations

The Role of Error in Enhancing Probabilistic Quantum Deletion

A. Nancy, S. Balakrishnan

In this paper, the probabilistic quantum deletion machine constructed from the NB-deletion machine, controlled by the deletion probability p and the error probability q. It is observed that, under specific conditions, controlled errors can enhance the deletion process: when p is minimal and q is maximal, both deletion and retention fidelities reach their optimal values. Compared to the original NB-machine, this probabilistic machine performs better in both deleting and preserving states. Although the output states do not violate Bell’s inequalities, they still achieve teleportation fidelities above the classical limit. The entanglement of machine’s output state appears only when p > 0, and the mixedness increases with p. Altogether, these results indicate that controlled error can enhance certain non-local features of a probabilistic deletion machine.

International Conference on Next-Gen Quantum and Advanced Computing: Algorithms, Security, and Beyond (NQComp)•Mar 5, 2026•0 citations
Abstract In this work, we study the performance of one shot and concatenated deleting machines (DMs). We show that the output state of one shot DMs are mixed inseparable, and do not violate Bell’s inequality but can be used as a teleportation channel for all values of the input state parameters. On the other hand, we observe in the concatenation of different DMs that the output states are mixed inseparable and do not violate Bell’s inequality, and cannot be used as a teleportation channel. Further, some important attributes such as inseparability, violation of Bell’s inequality, and teleportation fidelity of the DMs remain unchanged under the order of concatenation. In this context of a teleportation channel, one shot DMs are useful when compared to concatenated DMs.
In this paper, the probabilistic quantum deletion machine constructed from the NB-deletion machine, controlled by the deletion probability p and the error probability q. It is observed that, under specific conditions, controlled errors can enhance the deletion process: when p is minimal and q is maximal, both deletion and retention fidelities reach their optimal values. Compared to the original NB-machine, this probabilistic machine performs better in both deleting and preserving states. Although the output states do not violate Bell’s inequalities, they still achieve teleportation fidelities above the classical limit. The entanglement of machine’s output state appears only when p > 0, and the mixedness increases with p. Altogether, these results indicate that controlled error can enhance certain non-local features of a probabilistic deletion machine.