Probabilistic exact deletion and probabilistic no-signalling
Indranil Chakrabarty, Satyabrata Adhikari, Binayak S. Choudhury
Abstract
Open-access reader
Indranil Chakrabarty, Satyabrata Adhikari, Binayak S. Choudhury
Abstract
Open-access reader
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.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Probabilistic logic, Signalling, Statistical model, Computer science, Quantum, Probabilistic analysis of algorithms, State (computer science), Theoretical computer science