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

The Misuse of the no-Communication Theorem by Ghirardi

Remi Cornwall

Published Oct 1, 2016• 0 citations
OpenAlex

Abstract

This paper is in response to a critique of the author’s earlier papers on the matter of a non-local communication system by Ghirardi. The setup has merit for not apparently falling for the usual pitfalls of putative communication schemes, as espoused by the No-communication theorem (NCT) - that of non-factorisability. The enquiry occurred from the investigation of two interferometer based communication systems: one two-photon entanglement, the other single-photon path entanglement. Both systems have two parties: a sender (“Alice”) who transmits or absorbs her particle and a receiver (“Bob”) who has an interferometer, which can discern a pure or mixed state, ahead of his detector. Ghirardi used the density matrix and found that the system wasn’t factorisable; this was seen as a fulfilment of the NCT. We revisit the analysis and say quite simply that Ghirardi is mistaken. The system is rendered factorisable by a Schmidt decomposition and entanglement swapping to “which path information” of the interferometer; also one must consider the joint evolution before taking the partial trace. Ghirardi’s misuse, by the inapplicability of the NCT in this situation, renders this general prohibitive bar incomplete or entirely wrong.

Related papers

The Misuse of the No-Communication Theorem by Ghirardi - In The Analysis of a Non-Local Communication SystemThat Effectively Swaps Distant Joint Entanglement to Local Path Entanglement of an Interferometer

Remi Cornwall

This paper is in response to a critique of the author’s earlier papers on the matter of a non-local communication system by Ghirardi. The setup has merit for not apparently falling for the usual pitfalls of putative communication schemes, as espoused by the No-communication theorem (NCT) - that of non-factorisability. The enquiry occurred from the investigation of two interferometer based communication systems: one two-photon entanglement, the other single-photon path entanglement. Both systems have two parties: a sender (“Alice”) who transmits or absorbs her particle and a receiver (“Bob”) who has an interferometer, which can discern a pure or mixed state, ahead of his detector. Ghirardi used the density matrix and found that the system wasn’t factorisable; this was seen as a fulfilment of the NCT. We revisit the analysis and say quite simply that Ghirardi is mistaken. The system is rendered factorisable by a Schmidt decomposition and entanglement swapping to “which path information” of the interferometer; also one must consider the joint evolution before taking the partial trace. Ghirardi’s misuse, by the inapplicability of the NCT in this situation, renders this general prohibitive bar incomplete or entirely wrong.

•Jan 9, 2019•0 citations

The misuse of the No-communication Theorem

Remi Cornwall

This short note seeks to draw together and clarify the author’s early papers on the matter of a communication system. The enquiry occurred from the investigation of two interferometer based communication systems: one two photon entanglement, the other single photon path entanglement. The state vector treatment confirmed the communication protocol but the No-communication theorem (NCT), couched in the density matrix treatment forbade it. Since both state vector and density matrix formalisms contain the same treatment of quantum mechanics, the only conclusion is the NCT is being cited inappropriately. Here we clarify that error cogently and with brevity. The NCT only applies to non-factorisable systems and the communication system surprisingly entails Schmidt decomposition and hence factorisability, yet keeps entanglement information by the “which path information” of the interferometer.

•Jan 1, 2016•1 citation

How the Quantum no-Communication Theorem Misuses the Formalism and Loses Phase Information

Remi Cornwall

This paper follows on from the author’s previous thoughts on the subject of the “No-communication Theorem” and Ghirardi’s critique of a communication scheme by the author and then his response to this. It is an addendum to lay bare the inadequate use of the formalism by Ghirardi, Hall et-al. To make our argument convincing, we find it necessary to explicitly lay out the machinery of the density matrix formulated argument, so that it can be seen by the incredulous, the gapping hole in the Ghirardi-Hall belief. We shall see that phase information, crucial to the interferometer setup in previous papers, is lost when: the joint evolution of the system is not considered, superposition is not explicitly brought in as an operation itself and finally, when the act of taking the reduced trace is taken too early (the act of exclusion of one system). This has lead to the limiting belief that components of entangled systems considered in isolation, are only ever in a mixed state. We shall see that when the reduced trace is taken at the right point in the analysis, phase information pertaining to the remote system is still present and this concurs with the state vector approach used to analyse the same problem.

•Mar 1, 2015•0 citations

Reply to Critique by Ghirardi of Entanglement Communication Scheme by Cornwall

Remi Cornwall

This short letter is a response to an analysis by Ghirardi of a supposed flaw in a communication scheme involving entangled state collapse. We find his analysis entirely correct but missing the point, which is subtle, the no communication theorem merely expresses the truth of the locality of quantum state information on measurement but surprisingly says nothing about the particle being present or not by dint of the communication scheme itself. Ghirardi’s analysis using the density matrix approach does not deal correctly with the analysis of superposition in the interferometer and as such, doesn’t even correctly replicate the case for non-entanglement, as did the state vector method used by Cornwall.

•Mar 1, 2015•1 citation

Disproof of the no-Communication Theorem by Decoherence Theory

Remi Cornwall

The No-communication Theorem has been seen as the bar to communication by quantum state collapse. The essence of this theory is the procedure of taking the partial trace on an entangled, hence inseparable multi-particle system. This mathematical procedure applied unthinkingly, strikes out the off-diagonal elements from the ensemble density matrix and renders the reduced trace matrix representative of a mixed state. Decoherence theory is able to justify this mathematical procedure and we review it to show: the partial trace results for both unitary and non-unitary processes (hence measurement) on one, several or all particles of the ensemble; and that a unitary process keeps interference terms in the trace reduced matrix.

•Jun 1, 2015•3 citations

Precoding-based protocols for entanglement assisted linear computation over a quantum many-to-one network

Ruoyu Meng, Aditya Ramamoorthy

In this work, we consider the problem of computing a linear combination over a noiseless quantum many-to-one network. There are $k$ senders, Alice$_1$, $\ldots$, Alice$_k$, and a single receiver, Bob. Each Alice$_i$ has a data vector $W_i \in \mathbb{F}^{m_i}$, where $\mathbb{F}$ is a finite field. Bob wants to compute the linear combination $Y = V_1 W_1 + V_2 W_2 + \cdots + V_k W_k \in \mathbb{F}^m$, where $V_i$ is an $m \times m_i$ matrix over $\mathbb{F}$. The senders transmit quantum states to Bob through a noiseless many-to-one quantum network, but they are not allowed to communicate with each other. The senders share entanglement among themselves, while Bob does not share this entanglement. They encode their classical information $W_i$, $i=1,\ldots,k$, into their local subsystems and transmit them to Bob so that he can recover $Y$ through a quantum measurement and subsequent post-processing. The N-Sum Box protocol proposed by Allaix et al. (2025) considers this problem under certain constraints on the linear combination and the distribution of the data vectors among the senders. We present protocols that support the computation of a more general class of linear transformations by giving the senders access to more qudits and allowing them to judiciously precode their input symbols. The communication cost of our schemes is at most that of the best-known prior results in this area and is strictly lower in certain cases. Finally, we demonstrate that the communication cost is subadditive across instances. Specifically, we identify two linear functions for which the total cost of computing them individually is strictly larger than the cost of computing them jointly.

cs.ITCross-listedarXiv:2607.13756•Jul 16, 2026•0 citations
This paper is in response to a critique of the author’s earlier papers on the matter of a non-local communication system by Ghirardi. The setup has merit for not apparently falling for the usual pitfalls of putative communication schemes, as espoused by the No-communication theorem (NCT) - that of non-factorisability. The enquiry occurred from the investigation of two interferometer based communication systems: one two-photon entanglement, the other single-photon path entanglement. Both systems have two parties: a sender (“Alice”) who transmits or absorbs her particle and a receiver (“Bob”) who has an interferometer, which can discern a pure or mixed state, ahead of his detector. Ghirardi used the density matrix and found that the system wasn’t factorisable; this was seen as a fulfilment of the NCT. We revisit the analysis and say quite simply that Ghirardi is mistaken. The system is rendered factorisable by a Schmidt decomposition and entanglement swapping to “which path information” of the interferometer; also one must consider the joint evolution before taking the partial trace. Ghirardi’s misuse, by the inapplicability of the NCT in this situation, renders this general prohibitive bar incomplete or entirely wrong.
This paper is in response to a critique of the author’s earlier papers on the matter of a non-local communication system by Ghirardi. The setup has merit for not apparently falling for the usual pitfalls of putative communication schemes, as espoused by the No-communication theorem (NCT) - that of non-factorisability. The enquiry occurred from the investigation of two interferometer based communication systems: one two-photon entanglement, the other single-photon path entanglement. Both systems have two parties: a sender (“Alice”) who transmits or absorbs her particle and a receiver (“Bob”) who has an interferometer, which can discern a pure or mixed state, ahead of his detector. Ghirardi used the density matrix and found that the system wasn’t factorisable; this was seen as a fulfilment of the NCT. We revisit the analysis and say quite simply that Ghirardi is mistaken. The system is rendered factorisable by a Schmidt decomposition and entanglement swapping to “which path information” of the interferometer; also one must consider the joint evolution before taking the partial trace. Ghirardi’s misuse, by the inapplicability of the NCT in this situation, renders this general prohibitive bar incomplete or entirely wrong.
This short note seeks to draw together and clarify the author’s early papers on the matter of a communication system. The enquiry occurred from the investigation of two interferometer based communication systems: one two photon entanglement, the other single photon path entanglement. The state vector treatment confirmed the communication protocol but the No-communication theorem (NCT), couched in the density matrix treatment forbade it. Since both state vector and density matrix formalisms contain the same treatment of quantum mechanics, the only conclusion is the NCT is being cited inappropriately. Here we clarify that error cogently and with brevity. The NCT only applies to non-factorisable systems and the communication system surprisingly entails Schmidt decomposition and hence factorisability, yet keeps entanglement information by the “which path information” of the interferometer.
This paper follows on from the author’s previous thoughts on the subject of the “No-communication Theorem” and Ghirardi’s critique of a communication scheme by the author and then his response to this. It is an addendum to lay bare the inadequate use of the formalism by Ghirardi, Hall et-al. To make our argument convincing, we find it necessary to explicitly lay out the machinery of the density matrix formulated argument, so that it can be seen by the incredulous, the gapping hole in the Ghirardi-Hall belief. We shall see that phase information, crucial to the interferometer setup in previous papers, is lost when: the joint evolution of the system is not considered, superposition is not explicitly brought in as an operation itself and finally, when the act of taking the reduced trace is taken too early (the act of exclusion of one system). This has lead to the limiting belief that components of entangled systems considered in isolation, are only ever in a mixed state. We shall see that when the reduced trace is taken at the right point in the analysis, phase information pertaining to the remote system is still present and this concurs with the state vector approach used to analyse the same problem.
This short letter is a response to an analysis by Ghirardi of a supposed flaw in a communication scheme involving entangled state collapse. We find his analysis entirely correct but missing the point, which is subtle, the no communication theorem merely expresses the truth of the locality of quantum state information on measurement but surprisingly says nothing about the particle being present or not by dint of the communication scheme itself. Ghirardi’s analysis using the density matrix approach does not deal correctly with the analysis of superposition in the interferometer and as such, doesn’t even correctly replicate the case for non-entanglement, as did the state vector method used by Cornwall.
The No-communication Theorem has been seen as the bar to communication by quantum state collapse. The essence of this theory is the procedure of taking the partial trace on an entangled, hence inseparable multi-particle system. This mathematical procedure applied unthinkingly, strikes out the off-diagonal elements from the ensemble density matrix and renders the reduced trace matrix representative of a mixed state. Decoherence theory is able to justify this mathematical procedure and we review it to show: the partial trace results for both unitary and non-unitary processes (hence measurement) on one, several or all particles of the ensemble; and that a unitary process keeps interference terms in the trace reduced matrix.
In this work, we consider the problem of computing a linear combination over a noiseless quantum many-to-one network. There are kkk senders, Alice1_11​, …\ldots…, Alicek_kk​, and a single receiver, Bob. Each Alicei_ii​ has a data vector Wi∈FmiW_i \in \mathbb{F}^{m_i}Wi​∈Fmi​, where F\mathbb{F}F is a finite field. Bob wants to compute the linear combination Y=V1W1+V2W2+⋯+VkWk∈FmY = V_1 W_1 + V_2 W_2 + \cdots + V_k W_k \in \mathbb{F}^mY=V1​W1​+V2​W2​+⋯+Vk​Wk​∈Fm, where ViV_iVi​ is an m×mim \times m_im×mi​ matrix over F\mathbb{F}F. The senders transmit quantum states to Bob through a noiseless many-to-one quantum network, but they are not allowed to communicate with each other. The senders share entanglement among themselves, while Bob does not share this entanglement. They encode their classical information WiW_iWi​, i=1,…,ki=1,\ldots,ki=1,…,k, into their local subsystems and transmit them to Bob so that he can recover YYY through a quantum measurement and subsequent post-processing. The N-Sum Box protocol proposed by Allaix et al. (2025) considers this problem under certain constraints on the linear combination and the distribution of the data vectors among the senders. We present protocols that support the computation of a more general class of linear transformations by giving the senders access to more qudits and allowing them to judiciously precode their input symbols. The communication cost of our schemes is at most that of the best-known prior results in this area and is strictly lower in certain cases. Finally, we demonstrate that the communication cost is subadditive across instances. Specifically, we identify two linear functions for which the total cost of computing them individually is strictly larger than the cost of computing them jointly.