Reply to "Counterfactual communication not achieved yet -- A Comment on Salih et al. (2022)"
- URL: http://arxiv.org/abs/2507.19563v1
- Date: Fri, 25 Jul 2025 15:16:13 GMT
- Title: Reply to "Counterfactual communication not achieved yet -- A Comment on Salih et al. (2022)"
- Authors: Hatim Salih, Jonte R. Hance, Will McCutcheon, John Rarity,
- Abstract summary: Popescu argues that the claims of the paper are invalid.<n>We refute his argument, showing that it is based on ignoring the specifics of what we set out to prove.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In his Comment on our recent paper ``The laws of physics do not prohibit counterfactual communication'', \textit{npj Quantum Information} (2022) 8:60, Popescu argues that the claims of the paper are invalid. Here, we refute his argument, showing that it is based on ignoring the specifics of what we set out to prove (that counterfactual communication is possible \emph{for post-selected particles}, and more specifically in these cases is not prohibited by the weak trace or consistent histories criteria for particle path), followed by an unwarranted simplification of the protocol. Moreover, the Comment's excursion into interpretation is misplaced. Our communication protocol is a precisely defined one that allows two remote parties, albeit rarely, to communicate an arbitrarily long binary message, with arbitrarily high accuracy. This is not a matter of interpretation -- as the concrete example given in our paper in question illustrates. As for our overarching claim that no particles are exchanged in the course of this communication, we have already demonstrated this both theoretically and experimentally, in the postselected case we consider, as per the weak trace and consistent histories criteria for path of a quantum particle.
Related papers
- A computational test of quantum contextuality, and even simpler proofs of quantumness [43.25018099464869]
We show that an arbitrary contextuality game can be compiled into an operational "test of contextuality" involving a single quantum device.
Our work can be seen as using cryptography to enforce spatial separation within subsystems of a single quantum device.
arXiv Detail & Related papers (2024-05-10T19:30:23Z) - Comment on "Multitime quantum communication: Interesting but not
counterfactual" [0.0]
I argue that the original interaction-free measurement protocol which triggered the definition of the concept of counterfactuality is not counterfactual according to this measure.
arXiv Detail & Related papers (2023-06-29T07:53:57Z) - Unconditionally secure quantum bit commitment using modified double-slit
and unstable particles [0.0]
We show that the proof of the no-go theorem of unconditionally secure quantum bit commitment is based on a model not universal.
Using unstable particles and a modified double-slit setup, we construct such a protocol and show that it is unconditionally secure.
arXiv Detail & Related papers (2023-05-22T10:36:25Z) - Counterportation and the two-state vector formalism [0.0]
We argue, however, that there is an error in this paper.
The analysis of a simplified protocol, which questions the validity of the two-state vector formalism description of the photon presence in the communication channel, is incorrect.
arXiv Detail & Related papers (2023-03-15T22:18:19Z) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - Multitime Quantum Communication: Interesting But Not Counterfactual [3.8073142980733]
Protocol for transmission of information between two parties introduced by Salih et al., Phys. Rev. Lett. 110 (2013) 170502 (hereafter SLAZ), involves sending quantum amplitude back and forth through a quantum channel in a series of steps.
Authors claimed that their protocol was counterfactual'' in the sense that while a quantum channel is needed to connect the parties, its actual usage becomes vanishingly small in the limit as the number of steps tends to infinity.
Here we show that this claim is incorrect because it uses probabilistic reasoning that is not valid at intermediate times in the presence of quantum interference
arXiv Detail & Related papers (2023-01-04T17:55:09Z) - Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover.
In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z) - Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier [73.70426431502803]
We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model.
This yields the first post-quantum succinct argument system from any falsifiable assumption.
arXiv Detail & Related papers (2021-03-15T05:09:17Z) - Observers of quantum systems cannot agree to disagree [55.41644538483948]
We ask whether agreement between observers can serve as a physical principle that must hold for any theory of the world.
We construct examples of (postquantum) no-signaling boxes where observers can agree to disagree.
arXiv Detail & Related papers (2021-02-17T19:00:04Z) - Contextual inferences, nonlocality, and the incompleteness of quantum
mechanics [0.0]
We show that quantum mechanics violates predictive completeness, allowing to make contextual inferences.
We give here a set of new arguments to show that $psi$ should be completed indeed, not by looking for any "hidden variables"
arXiv Detail & Related papers (2020-12-17T16:54:54Z) - Escape from the Quantum Pigeon Conundrum [52.77024349608834]
The Pigeon Counting Principle (PCP) states that if one distributes three pigeons among two boxes there must be at least two pigeons in one of the boxes.
Here we prove via a set of operator identities that the PCP is not violated within quantum mechanics, regardless of interpretation.
arXiv Detail & Related papers (2020-02-05T17:30:19Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.