arXiv subjects

Raman Choudhary

Publications and source records attributed to Raman Choudhary.

4 recordsLinked to original sources

arXiv2026

Exploring Bell Nonlocality with Extremal Non-Signaling Boxes

Extremal non-signaling (ENS) boxes are correlations that correspond to vertices of the non-signaling polytope of a Bell scenario. Neither quantum theory nor any theory for ideal measurements allows for ENS boxes. That is, according to quantum theory, ENS boxes are nonphysical. Still, ENS boxes are crucial for addressing a number of problems in Bell nonlocality. Here, we obtain ENS boxes in arbitrary bipartite Bell scenarios and present the complete list of ENS boxes for several unexplored scenarios. Equipped with the boxes, we revisit several foundational questions. We find that already two copies of any ENS box violate the exclusivity (or local orthogonality) and Specker's principles. We provide the minimal decomposition of the magic square correlation - the simplest known perfect correlation in nature - in terms of ENS boxes. We identify the minimal scenario in which a dit of communication (with d < 6) is insufficient to simulate ENS boxes. Our results show that the ENS boxes approach leads to new results and opens new avenues for research.

quant-ph↗

arXiv2025

Contextuality with Pauli observables in cycle scenarios

Contextuality is a fundamental marker of quantum non-classicality, which has emerged as a key resource for quantum computational advantage in multiple settings. Many such results hinge specifically on contextuality witnessed through Pauli measurements. In this work, we initiate a systematic study of (state-dependent) Pauli contextuality, focusing on cycle measurement scenarios, the simplest scenarios capable of exhibiting contextual behaviour. First, we study realizability of cycle scenarios with multi-qubit Pauli observables: we show that the maximum size of a cycle faithfully realizable by $m$-qubit Paulis is upper bounded by $3m$, while we construct explicit realizations of cycles of size $2m-1$ or $2m$, depending on whether $m \not\equiv 1 \pmod{3}$ or $m \equiv 1 \pmod{3}$. Then, we investigate the presence of contextuality: we prove that no $n$-cycle Pauli realization for $n > 4$ can witness contextuality (on any quantum state), whereas for $n = 4$ every Pauli realization exhibits contextuality, attaining the quantum bound for all noncontextuality inequalities on some pure state. Finally, we discuss arbitrary Pauli scenarios in light of Vorob'ev's theorem, and show that, contrary to what our cycle characterization might suggest, the presence of $4$-cycles is not necessary for witnessing contextuality in general Pauli scenarios.

quant-ph↗

arXiv2025

Exclusivity principle, Ramsey theory, and $n$-cycle PR boxes

The exclusivity principle (E-principle) states that the sum of probabilities of pairwise exclusive events cannot exceed 1. Unlike other principles proposed to characterize quantum correlations, its intrinsically non-bipartite formulation enables its application in more general contextuality scenarios. Although equivalent to the no-signalling condition for any bipartite Bell scenario, this equivalence breaks down for two independent copies of the same scenario. Such violation of the E-principle due to multiple copies, known as its activation effect, was studied in [Nat Commun 4, 2263 (2013)] for the nonlocal extremal boxes of $(2,m,2)$, $(2,2,d)$, and $(3,2,2)$ Bell scenarios. The authors mapped the problem of exhibiting activation effects to finding certain cliques inside joint exclusivity graphs. In this work, we refine the joint exclusivity structure to be an edge-colored exclusivity multigraph. This allows us to draw a novel connection to Ramsey theory, which guarantees the existence of certain monochromatic subgraphs in sufficiently large edge-colored cliques, providing a powerful tool for ruling out E-principle violations. We then exploit this connection, drawing on Ramsey-theoretic results to study violations of the E-principle by multiple copies of the contextual extremal boxes of $n$-cycle scenarios, called $n$-cycle PR boxes. For the usual ($n=4$) PR box we show that the known E-principle violation of $5/4$ is the maximal achievable using two copies, and that this same upper bound applies to two copies of the KCBS ($n = 5$) PR box. We then prove that $n \geq 6$-cycle PR boxes, unlike the extremal boxes of the aforementioned Bell scenarios, do not exhibit activation effects with two or three copies. Finally, for any number of independent copies $k$, we establish a lower bound on $n$ above which $n$-cycle PR boxes do not exhibit activation effects with $k$ copies.

quant-ph↗

arXiv2024

Lifting noncontextuality inequalities

Kochen-Specker contextuality is a fundamental feature of quantum mechanics and a crucial resource for quantum computational advantage and reduction of communication complexity. Its presence is witnessed in empirical data by the violation of noncontextuality inequalities. However, all known noncontextuality inequalities corresponding to facets of noncontextual polytopes are either Bell inequalities or refer to cyclic or state-independent contextuality scenarios. We introduce a general method for lifting noncontextuality inequalities, deriving facets of noncontextual polytopes for more complex scenarios from known facets of simpler subscenarios. Concretely, starting from an arbitrary scenario, the addition of a new measurement or a new outcome preserves the facet-defining nature of any noncontextuality inequality. This extends the results of Pironio [J. Math. Phys. 46, 062112 (2005)] from Bell nonlocality scenarios to contextuality scenarios, unifying liftings of Bell and noncontextuality inequalities. Our method produces facet-defining noncontextuality inequalities in all scenarios with contextual correlations, and we present examples of facet-defining noncontextuality inequalities for scenarios where no examples were known. Our results shed light on the structure of noncontextuality polytopes and the relationship between such polytopes across different scenarios.

quant-ph↗