arXiv subjects

Anandamay Das Bhowmik

Publications and source records attributed to Anandamay Das Bhowmik.

15 recordsLinked to original sources

arXiv2026

All-vs-Nothing Operational Manifestation of Preparation Contextuality

Preparation contextuality is often manifested operationally through a quantitative advantage over preparation-noncontextual models in information-processing tasks, yet quantum theory typically falls short of perfect success. Here we introduce a parity-oblivious Hidden Matching task that instead yields an all-vs-nothing manifestation of preparation contextuality. Alice encodes an $n$-bit string so that her message reveals no information about any input parity other than the two-bit parities. Bob, given a perfect matching on the input positions, must output an edge of the matching together with the parity of its two bits. A quantum protocol using a single $\lceil\log_2 n\rceil$-qubit message satisfies the parity-obliviousness constraint and succeeds with certainty. We prove that no preparation-noncontextual model achieves perfect success for any even $n\ge6$. The result holds for arbitrary ontic state spaces and assumes neither outcome determinism nor measurement noncontextuality. For $n=6$ and $n=8$, the optimal noncontextual success probabilities are $4/5$ and $3/4$, respectively, while asymptotically the optimal noncontextual success probability is $1/2+Θ(1/\sqrt n)$. Our asymptotic upper bound follows from a Fourier-analytic sum rule derived via hypercontractivity on the Boolean hypercube. The resulting separation is qualitative rather than merely quantitative: quantum theory achieves perfect success, whereas preparation-noncontextual models cannot. We aslo show that at $n=8$ the noncontextual bound remains $3/4$ even when Bob is restricted to just suitable $4$ of the $105$ possible perfect matchings, bringing the effect within experimental reach.

quant-ph↗

arXiv2026

Antidistinguishability of states in General Probabilistic Theories

We investigate antidistinguishability of states within the framework of general probabilistic theories (GPTs). We formulate antidistinguishability, strong and equal antidistinguishability as refined notions that imposed additional constraint on the measurement effects. We establish general results relating these notions of antidistinguishability and derive an upper bound on the cardinality of equally antidistinguishable sets in terms of the affine dimension of the state space. We then study antidistinguishability in polygonal theories, obtaining conditions for antidistinguishability of a set of states. In consequence, we show that the set of all pure states in a polygon model is antidistinguishable. Additionally, we identify broad families of strongly and equally antidistinguishable states. Finally, using Random Exclusion Codes, whose success probability is governed by the antidistinguishability of different sets of encoding states, we probe the nonclassicality of polygon theories. We find that certain polygon models can outperform the optimal quantum value, while their optimal performance converges to the quantum limit in the large-polygon limit.

quant-ph↗

arXiv2026

Nonlocality without entanglement in exclusion of quantum states

We study the task of quantum state exclusion, focusing on antidistinguishability and its generalization to $x$-antidistinguishability, under global measurements and local operations with classical communication (LOCC). We also introduce weak and strong notions of antidistinguiahbaility ($x$-antidistinguishability) depending on whether all states or all $x$-tuples are exhaustively eliminated. Our results reveal striking differences between state exclusion and the more familiar task of state discrimination. In particular, we show that LOCC antidistinguishability of multipartite product states is symmetric with respect to the initiating party but this symmetry breaks down for higher-order $x$-antidistinguishability. Most notably, we establish a manifestation of \emph{nonlocality without entanglement} in the context of state exclusion: we prove that three bipartite product states can be globally antidistinguishable while failing to be LOCC antidistinguishable, demonstrating that three is the minimal number of states required for this phenomenon. We further extend this separation to $2$-antidistinguishability and present example exhibiting the same type of nonlocality. At last, we provide an antidistinguishable tripartite product states that are not LOCC antidistinguishable across any bipartition, which ensures the phenomenon of \emph{genuine nonlocality without entanglement} in this framework.

quant-ph↗

arXiv2026

Limitation of maximally entangled probes for single-shot distinguishability of unitaries

There have been many instances where the maximally entangled state as a probe acts better than the product and the non-maximally entangled states in the task of distinguishing quantum channels. We provide a proof that for single-shot discrimination of two unitary channels, entangled and product states are operationally equivalent. But we identify pairs of unitaries that are perfectly distinguishable using a non-maximally entangled state, but not with a maximally entangled one. This contrast becomes more pronounced when the number of unitaries exceeds two. In every dimension $\geqslant 3$, we show that there exists a class of unitaries that are indistinguishable under maximally entangled probes, yet perfectly distinguishable using product or non-maximally entangled inputs. Another interesting set of unitaries in every dimension $\geqslant 3$ has been presented where only non-maximally entangled state acts as the successful probe, while product states and maximally entangled states cannot.

quant-ph↗

arXiv2026

Global versus Local Discrimination of Locally Implementable Multipartite Unitaries

We study single-shot distinguishability of locally implementable multipartite unitaries under Local Operations and Classical Communication (LOCC) and global operations. As unitary discrimination depends on both the choice of probing states and the measurements on the evolved states, we classify LOCC and global distinguishability into two categories: adaptive strategies, where probing states are chosen based on measurement outcomes from other subsystems, and restricted strategies, where probing states remain fixed. Our findings uncover three surprising features in the bipartite setting and establish new structural limits for unitary discrimination: (i) Certain pairs of unitaries are globally distinguishable with restricted strategies but indistinguishable under LOCC, even with adaptive strategies. (ii) There exist sets of four unitaries that are distinguishable via LOCC, yet remain globally indistinguishable with restricted strategies. (iii) Some sets of unitaries are globally indistinguishable under adaptive strategies, when probed with separable states, but become distinguishable via LOCC.

quant-ph↗

arXiv2026

Single-shot antidistinguishability of unitary operations

The notion of antidistinguishability captures the possibility of ruling out certain alternatives in a quantum experiment without identifying the actual outcome. Although extensively studied for quantum states, the antidistinguishability of quantum channels remains largely unexplored. In this work, we investigate the single-shot antidistinguishability of unitary operations. We analyse two scenarios: antidistinguishability with single-system probes and with entangled probes. For sets of three unitaries, we first prove that all maximally entangled states are equivalent in their performance as probe. In the qubit case, we further establish that maximally entangled probes are always sufficient: if a set of three qubit unitaries is antidistinguishable with either a single-system or non-maximally entangled probe, then it is also antidistinguishable with a maximally entangled one. However, in higher dimension, this equivalence fails. In \textit{dimension 3}, there exists a set of unitaries that are antidistinguishable with non-maximally entangled probe or single-system probe but not with maximally entangled probe. We also establish that union of two antidistinguishable sets of three qubit unitaries also forms a set of antidistinguishable unitaries. Lastly, we provide methods to construct antidistinguishable unitaries from non-antidistinguishable ones.

quant-ph↗

arXiv2025

Local Inaccessibility of Random Classical Information and Their Implications in the Change Point Problem

Discrimination of quantum states under local operations and classical communication (LOCC) is an intriguing question in the context of local retrieval of classical information, encoded in the multipartite quantum systems. All the local quantum state discrimination premises, considered so far, mimic a basic communication set-up, where the spatially separated decoding devices are independent of any additional input. Here, exploring a generalized communication scenario, we introduce a framework for input-dependent local quantum state discrimination, which we call local random authentication (LRA). We report that impossibility of LRA certifies the presence of entangled states in the ensemble, a feature absent from erstwhile nonlocality arguments based on local state discrimination. Additionally, we explore the salient features of this state discrimination prototype for arbitrary set of orthogonal quantum states and compare them with the traditional notion of local quantum state discrimination. Finally, our results reveal a fundamental information-theoretic implications in the local estimation of quantum change point problems.

quant-ph↗

arXiv2025

Zero-Error Nash Equilibrium: Harnessing Nonlocal Correlation in Incomplete Information Games

Claude Shannon's zero-error communication paradigm reshaped our understanding of fault-tolerant information transfer. Here, we adapt this notion into game theory with incomplete information. We ask: can players with private information coordinate on a Nash equilibrium with zero probability of error? We identify Bayesian games in which such coordination is impossible classically, yet achievable by harnessing Bell nonlocal correlations. We formalize this requirement as zero-error Nash equilibrium coordination, establishing a new bridge between information theory, game theory, and quantum nonlocality. Furthermore, we construct a tripartite Bayesian game that admits zero-error Nash equilibrium coordination with genuine entanglement, and a two-player game where a stronger notion of coordination can be achieved using every two-qubit pure entangled state except the maximally one. Crucially, the advantage persists under experimentally relevant noise, demonstrating nonlocality as a robust resource for near-zero error decision-making under uncertainty.

quant-ph↗

arXiv2022

Reversible computation and the causal structure of space-time

Reversible algorithms play a crucial role both in classical and quantum computation. While for a classical bit the only nontrivial reversible operation is the bit-flip, nature is far more versatile in what it allows to do to a quantum bit. The reversible operations that a quantum computer can perform on a qubit are group of linear unitary transformations. However, laws of quantum mechanics prohibit implementation of anti-linear anti-unitary gates, even though they are perfectly reversible. Here we show that such a restriction on possible set of reversible operations is, remarkably, a fundamental constraint of spacetime structure. In particular, it will be shown that construction of any anti-linear anti-unitary gate will lead to violation of a fundamental causal primitive which, as we shall argue, is fundamentally different from the principle of relativistic causality.

quant-ph↗

arXiv2022

Timelike correlations and quantum tensor product structure

The state space structure for a composite quantum system is postulated among several mathematically consistent possibilities that are compatible with local quantum description. For instance, unentangled Gleason's theorem allows a state space that includes density operators as a proper subset among all possible composite states. However, bipartite correlations obtained in Bell type experiments from this broader state space are in-fact quantum simulable, and hence such spacelike correlations are no good to make distinction among different compositions. In this work we analyze communication utilities of these different composite models and show that they can lead to distinct utilities in a simple communication game involving two players. Our analysis, thus, establishes that beyond quantum composite structure can lead to beyond quantum correlations in timelike scenario and hence welcomes new principles to isolate the quantum correlations from the beyond quantum ones. We also prove a no-go that the classical information carrying capacity of different such compositions cannot be more than the corresponding quantum composite systems.

quant-ph↗

arXiv2022

On the Interpretation of Quantum Indistinguishability : a No-Go Theorem

Despite being the most fundamental object in quantum theory, physicists are yet to reach a consensus on the interpretation of a quantum wavefunction. In the broad class of realist approaches, quantum states are viewed as Liouville-like probability distributions over some space of physical variables where indistinguishabity of non-orthogonal states is attributed to overlaps between these distributions. Here we argue that such an interpretation of quantum indistinguishability is wrong. In particular, we show that quantum mechanical prediction of maximal violation of Mermin inequality in certain thought experiment is incompatible with all ontological interpretations for quantum theory where indistinguishability of non-orthonal quantum states is explained, even partially, in terms of overlap of their Liouville distributions.

quant-ph↗

arXiv2022

Genuine Activation of Quantum Nonlocality: Stronger Than Local Indistinguishability

The structure of quantum theory assures the discrimination of any possible orthogonal set of states. However, the scenario becomes highly nontrivial in the limited measurement setting and leads to different classes of impossibility, viz., indistinguishability, unmarkability, irreducibility etc. These phenomena, often referred to as other nonlocal aspects of quantum theory, have utmost importance in the domain of secret sharing etc. It, therefore, becomes a pertinent question to distill/activate such behaviours from a set, apparently devoid of these nonlocal features and free from local redundancy. While the activation of local indisitinguishability in the sets of entangled states has recently been reported, other stronger notion of quantum nonlocality has yet not been inspected in the parlance of activation. Here, we explored all such stronger versions of nonlocality and affirmatively answered to activate each of them. We also find a locally distinguishable set of multipartite entangled states which can be converted with certainty to a nontrivial set of locally irreducible genuinely entangled states.

quant-ph↗

arXiv2022

Activating Strongest Possible Nonlocality from Local Sets: An Elimination Paradigm

Apart from the Bell nonlocality, which deals with the correlations generated from the local input-output statistics, quantum theory exhibits another kind of nonlocality that involves the indistiguishability of the locally preparable set of multipartite states. While Bell-type nonlocality cannot be distilled from a given local correlation, it is already reported that the latter kind of nonlocality can be activated from a "local", i.e., locally distinguishable set of states. Although, recently it is shown that a stronger notion of such a nonlocality, which deals with elimination instead of discrimination, can be activated from locally preparable bipartite states of dimension 7 $\times$ 8, the present work observes that the same notion can be demonstrated even in lower dimensional multipartite systems. Importantly,the strongest possible version of such an activation is further depicted here, where none of the transformed product states can be eliminated, even if all but one of the parties come together.

quant-ph↗

arXiv2021

From no causal loop to absoluteness of cause: discarding the quantum NOT logic

The principle of `absoluteness of cause' (AC) assumes the cause-effect relation to be observer independent and is a distinct assertion than prohibiting occurrence of any causal loop. Here, we study implication of this novel principle to derive a fundamental no-go result in quantum world. AC principle restrains the `time order' of two spacelike separated events/processes to be a potential cause of another event in their common future, and in turn negates existence of a quantum device that transforms an arbitrary pure state to its orthogonal one. The present {\it no-go} result is quite general as its domain of applicability stretches out from the standard linear quantum theory to any of its generalizations allowing deterministic or stochastic nonlinear evolution. We also analyze different possibilities of violating the AC principle in generalized probability theory framework. A strong form of violation enables instantaneous signaling, whereas a weak form of violation forbids the theory to be locally tomographic. On the other hand, impossibility of an intermediate violation suffices to discard the universal quantum NOT logic.

quant-ph↗

arXiv2021

Bell Nonlocality and the Reality of Quantum Wavefunction

Status of quantum wavefunction is one of the most debated issues in quantum foundations -- whether it corresponds directly to the reality or just represents knowledge or information about some aspect of reality. In this letter we propose a {\it $ψ$-ontology} theorem that excludes a class of ontological explanations where quantum wavefunction is treated as mere information. Our result, unlike the acclaimed Pusey-Barrett-Rudolph's theorem, does not presume the absence of holistic ontological properties for product quantum preparations. At the core of our derivation we utilize the seminal no-go result by John S. Bell that rules out any local realistic world view for quantum theory. We show that the observed phenomenon of quantum nonlocality cannot be incorporated in a class of $ψ$-epistemic models. Using the well known Clauser-Horne-Shimony-Holt inequality we obtain a threshold bound on the degree of epistemicity above which the ontological models are not compatible with quantum statistics.

quant-ph↗