Probabilistic exact deletion and probabilistic no-signalling

2006/10/11 by Indranil Chakrabarty, Satyabrata Adhikari, Binayak S. Choudhury +1 · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Artificial intelligence #Computer science #Mathematics #Physics #Probabilistic analysis of algorithms #Probabilistic logic #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum mechanics #Signalling #State (computer science) #Statistical model #Theoretical computer science #quant-ph

paper · pdf · doi:10.1088/0031-8949/74/5/012

published in Physica Scripta 74(5), 555-557 (IOP Publishing) · 6 pages, Accepted in Physica Scripta

openalex publication_date 2006/10/11 · arxiv created 2006/10/20 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

In this study, we show that one cannot use non-local resources for probabilistic signalling even if one can delete a quantum state with the help of a probabilistic quantum deletion machine (PQDM). Here, we find that PQDM is not going to help us in identifying two statistical mixtures at a remote location. Also we derive the bound on deletion probability from a no-signalling condition.

Citations

• Bell’s theorem and the different concepts of locality
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• A single quantum cannot be cloned
• FLASH?A superluminal communicator based upon a new kind of quantum measurement
• Quantum copying: Beyond the no-cloning theorem