arXiv subjects

Debashis Saha

Publications and source records attributed to Debashis Saha.

At least 19 recordsLinked to original sources

arXiv2026

Semi-Device-Independent Quantum Key Distribution from Operational Assumptions

Semi-device-independent quantum key distribution leaves the measurement devices uncharacterized while placing a trusted assumption on Alice's source. We formulate this source assumption operationally on Alice's four-preparation ensemble as a scalar bound on one of four physically motivated source tasks: full-label guessing, parity guessing, or their normalized composites with label exclusion. For the two-bit random-access code, we derive the exact classical frontier for each of the four source assumptions. Numerically, the BB84 strategy attains the maximal quantum deviation from all four frontiers, while the preparation-depolarized BB84 family and the direct-sum label-leakage family trace complementary branches of the arbitrary-dimensional quantum boundary for the two exclusion-assisted assumptions. Because all four task values are monotone under input-independent quantum channels, the same scalar source bound constrains every Bob--Eve extension compatible with the complete observed behavior. Using a three-setting extension that separates RAC testing from key generation, we obtain two dimension-independent security certificates over this feasible set: lower bounds on the conditional min-entropy and conditional von Neumann entropy, obtained respectively by direct optimization of Eve's key-guessing probability and by prepare-and-measure semidefinite relaxations based on the Brown--Fawzi--Fawzi variational bound. The exclusion-assisted assumptions certify positive key rates down to nearly vanishing preparation visibility, far beyond full-label or parity guessing alone. Under direct-sum label leakage, all four independently optimized rate bounds remain positive at every sampled incomplete-leakage point and vanish only at complete label revelation. These results show that robust semi-device-independent security depends not only on what Eve can identify, but also on what she can exclude.

quant-ph↗

arXiv2026

Genuine certification of incompatible quantum instruments through sequential communication tasks

Quantum instruments constitute the general description of quantum dynamics, encompassing both quantum measurements and quantum channels as special cases. Consequently, the incompatibility of quantum instruments represents a fundamental manifestation of nonclassicality in quantum theory. Here, we establish the operational significance of this notion by demonstrating communication tasks with classical inputs and outputs that enable the semi-device-independent certification of incompatible quantum instruments. We introduce a class of three-party communication tasks involving a sender, a relayer, and a receiver, and derive the tight upper bounds of the figure of merits of these tasks achievable by all compatible instruments implemented by the relayer. Furthermore, we show that these bounds coincide with the optimal performance attainable in a classical communication subject to the same dimensional constraints. Violation of this bound certifies the incompatibility of the pair of quantum instruments implemented by the relayer. This identifies certification of incompatible instruments as a manifestation of quantum advantage in communication. This certification protocol is genuine as it is able to certify the incompatibility of a pair of instruments where the set of induced measurements and the set of induced channels are compatible and, therefore it does not depend on the incompability of measurements and channels induced by the instruments. Finally, we identify the simplest instance of our communication scenario that enable the certification of incompatible quantum instruments.

quant-ph↗

arXiv2026

Entanglement assisted communication complexity measured by distinguishability

We investigate the quantum advantage that can arise in typical two-party communication scenarios, where the sender and the receiver are allowed to share prior correlations. Focusing on communication tasks constrained by the distinguishability of the sender's inputs, we demonstrate that entanglement-assisted communication with both classical and quantum message can outperform classical communication supplemented with shared randomness. We begin by developing a general framework for communication tasks with pre-shared correlations. Within this framework, we establish an equivalence among entanglement-assisted classical communication, entanglement-assisted quantum communication, and quantum communication, showing that no hierarchy exists between these three paradigms. We then investigate the scenario where the receiver has no input and prove that no advantage can arise in this case. However, an advantage in the entanglement-assisted setting emerges once additional constraints are imposed on the dimension of the communicated message. This further highlights the superiority of entanglement-assisted classical communication over standard quantum communication. Then we demonstrate several tasks where the entanglement-assisted protocol using one-bit communication proves to be advantageous over classical communication. Finally, by constructing an explicit class of communication tasks, we show that a non-maximally entangled states outperform the maximally entangled state as a pre-shared resource between the communicating parties.

quant-ph↗

arXiv2025

Contextuality-based quantum key distribution with deterministic single-photon sources

Photons are central to quantum technologies, with photonic qubits offering a promising platform for quantum communication. Semiconductor quantum dots stand out for their ability to generate single photons on demand, a key capability for enabling long-distance quantum networks. In this work, we utilize high-purity single-photon sources based on self-assembled InAs(Ga)As quantum dots as quantum information carriers. We demonstrate that such on-demand single photons can generate quantum contextuality. This capability enables a novel protocol for semi-device-independent quantum key distribution over free-space channels. Crucially, our method does not require ideal or perfectly projective measurements, opening a new pathway for robust and practical quantum communication.

quant-ph↗

arXiv2025

Maximally $\psi-$epistemic models cannot explain gambling with two qubits

We investigate the minimal proof for ruling out maximally $\psi-$epistemic interpretations of quantum theory, in which the indistinguishable nature of two quantum states is fully explained by the epistemic overlap of their corresponding distributions over ontic states. To this end, we extend the standard notion of epistemic overlap by considering a penalized distinguishability game involving two states and three possible answers, named as Quantum Gambling. In this context, using only two pure states and their equal mixture, we present an experimentally robust no-go theorem for maximally $\psi-$epistemic models, showing that qubit states achieve the maximal difference between quantum and epistemic overlaps.

quant-ph↗

arXiv2025

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↗

arXiv2025

Communication scenario enables robust self-testing of n-party Greenberger-Horne-Zeilinger basis measurements

Entangled basis measurements play a crucial role in distributing quantum entanglement between parties across a quantum network. In this work, we adopt a semi-device-independent approach that enables the self-testing of n-qubit Greenberger-Horne-Zeilinger (GHZ) basis measurements without requiring shared entanglement between distant parties. Our method relies solely on input-output statistics from a communication scenario involving n spatially separated senders, each receiving two bits of input, and a single receiver with no input. We analyze the robustness of the proposed self-testing protocol. Additionally, we introduce a protocol for robust self-testing of the three-outcome partial Bell basis measurement that is easily implementable in an optical setup.

quant-ph↗

arXiv2025

Limits of Classical correlations and Quantum advantages under (Anti-)Distinguishability constraints in Multipartite Communication

We consider communication scenarios with multiple senders and a single receiver. Focusing on communication tasks where the distinguishability or antidistinguishability of the sender's input is bounded, we show that quantum strategies-without any shared entanglement-can outperform the classical ones. We introduce a systematic technique for deriving the facet inequalities that delineate the polytope of classical correlations in such scenarios. As a proof of principle, we recover the complete set of facet inequalities for some nontrivial scenarios involving two senders and a receiver with no input. Explicit quantum protocols are studied that violate these inequalities, demonstrating quantum advantage. We further investigate the task of antidistinguishing the joint input string held by the senders and derive upper bounds on the optimal classical success probability. Leveraging the Pusey-Barrett-Rudolph theorem, we prove that when each sender has a binary input, the quantum advantage grows with the number of senders. We also provide sufficient conditions for quantum advantage for arbitrary input sizes and illustrate them through several explicit examples.

quant-ph↗

arXiv2025

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↗

arXiv2025

Quantum-informed learning of genuine network nonlocality beyond idealized resources

We address the characterization of genuine network nonlocal correlations, which remain highly challenging due to the non-convex nature of local correlations even in the distinct triangle scenario with three sources and three observers implementing one four-outcome measurement. We introduce a scalable causally inferred Bayesian learning framework called the Layered Local Hidden Variable Neural Network (Layered LHV-Net) to learn the local statistics in network Bell tests. Using this framework, we identify a new class of measurement settings that exhibit the most robust nonlocality compared to previously known measurements. Remarkably, our study shows that the nonlocality measure becomes non-zero only when the visibility of the shared Bell state exceeds 0.94, surpassing previously reported noise robustness thresholds. Further, we examine correlations where shared states originate from dissimilar sources, finding that nonlocality is observed only if all the involved states are sufficiently entangled. Finally, we analyze a scenario in which the sources are allowed to share classical randomness. We find that nonlocal correlations persist even when the sources share up to 3 units of randomness, whereas a local model reproducing the quantum correlations only becomes possible when 4 units of shared randomness are available. Apart from the results, the work succeeds in showing that quantum-informed machine learning approaches as foundational frameworks can greatly benefit the field of quantum information.

quant-ph↗

arXiv2024

Supersinglets can be self-tested with perfect quantum strategies

Supersinglets are states of spin-zero of $d \ge 3$ particles of $d$ levels. They are invariant under unitary transformations of the form $U^{\otimes d}$ and have applications in metrology, error protection, and communication. They also violate some specific Bell inequalities. However, none any of these applications {\em require} supersinglets nor do any of these Bell inequality violations capture the unique properties of the supersinglets. This leads to two questions. Question 1 is whether there exists a task that can be solved only with supersinglets. Question 2 is whether supersinglets can produce a unique $d$-partite, $d$-dimensional nonlocal signature. We answer both questions affirmatively by presenting a protocol that self-test all supersinglets by producing $d$-partite, $d$-dimensional {\em perfect} quantum strategies for any $d \ge 3$.

quant-ph↗

arXiv2024

Single-shot Distinguishability and Anti-distinguishability of Quantum Measurements

Among the surprising features of quantum measurements, the problem of distinguishing and antidistinguishing general quantum measurements is fundamentally appealing. Unlike classical systems, quantum theory offers entangled states and peculiar state update rule of the post-measurement state, which gives rise to four distinct scenarios: (i) probing single systems and without access to the Post-measurement States (PMS), (ii) probing entangled systems and without access to the PMS, (iii) probing single systems with access to the PMS, and (iv) probing entangled systems with access to the PMS. We study the probability of distinguishing (and antidistinguishing) quantum measurements sampled from a given set in the single-shot regime. For some scenarios, we provide the analytical expressions of distinguishability (and antidistinguishability) for qubit projective measurements. We show that the distinguishability of any pair of qubit projective measurements in scenario (iii) is always greater than its value in scenario (ii). Interestingly, certain pairs of non-projective qubit measurements achieve optimal distinguishability in scenario (ii) with a non-maximally entangled state. In general, for any set of measurements, distinguishability (and antidistinguishability) in scenario (i) never exceeds that in any other scenario, while it reaches its highest possible value in scenario (iv). We establish that there is no hierarchical relation between scenarios (ii) and (iii). In particular, we introduce different variants of the well-known `trine' qubit measurement to construct pairs (and triples) of qubit quantum measurements such that they are perfectly distinguishable (and antidistinguishable) in scenario (ii) but not in scenario (iii), and vice versa. Additionally, we present qubit measurements that are perfectly distinguishable (and antidistinguishable) in scenario (iv) but not in any other scenarios.

quant-ph↗

arXiv2024

Efficient Computation of Generalized Noncontextual Polytopes and Quantum violation of their Facet Inequalities

Finding a set of empirical criteria fulfilled by any theory satisfying the generalized notion of noncontextuality is a challenging task of both operational and foundational importance. This work presents a methodology for constructing the noncontextual polytope while ensuring that the dimension of the polytope associated with the preparations remains constant regardless of the number of measurements and their outcome size. The facet inequalities of the noncontextual polytope can thus be obtained in a computationally efficient manner. We illustrate the efficacy of our methodology through several distinct contextuality scenarios. Our investigation uncovers several hitherto unexplored noncontextuality inequalities and demonstrates applications of quantum contextual correlations in certification of non-projective measurements, witnessing the dimension of quantum systems, and randomness certification.

quant-ph↗

arXiv2024

Single system based generation of certified randomness using Leggett-Garg inequality

We theoretically formulate and experimentally demonstrate a secure scheme for semi-device-independent quantum random number generation by utilizing Leggett-Garg inequality violations, within a loophole-free photonic architecture. The quantification of the generated randomness is rigorously estimated by analytical as well as numerical approaches, both of which are in perfect agreement. We securely generate $9,19,118$ truly unpredictable bits. This opens up an unexplored avenue towards an empirically convenient class of reliable random number generators harnessing the quantumness of single systems.

quant-ph↗

arXiv2024

Failure of epistemic models to explain the antidistinguishability of quantum mixed preparations

We investigate the limits of epistemic models in reproducing the empirical predictions of general quantum preparations. This involves comparing the common quantum overlap determined by the anti-distinguishability of a set of preparations with the common epistemic overlap of the probability distribution over the ontic states describing these preparations. We show that no epistemic model with non-zero common overlap can reproduce the predictions of quantum theory for mixed preparations, even for qubit systems. We explicitly provide sets of distinct mixed preparations, starting from qutrit systems, that give rise to identical quantum mixed states for which the common epistemic overlap must be zero. Finally, we demonstrate the strongest form of preparation contextuality by presenting pairs of mixed preparations that yield identical quantum mixed states while their epistemic overlap must vanish.

quant-ph↗

arXiv2024

Unbounded quantum advantage in communication complexity measured by distinguishability

Communication complexity is a fundamental aspect of information science, concerned with the amount of communication required to solve a problem distributed among multiple parties. The standard quantification of one-way communication complexity relies on the minimal dimension of the communicated systems. In this paper, we measure the communication complexity of a task by the minimal distinguishability required to accomplish it, while leaving the dimension of the communicated systems unconstrained. Distinguishability is defined as the maximum probability of correctly guessing the sender's input from the message, quantifying the message's distinctiveness relative to the sender's input. This measure becomes especially relevant when maintaining the confidentiality of the sender's input is essential. After establishing the generic framework, we focus on three relevant families of communication complexity tasks -- the random access codes, equality problems defined by graphs and the pair-distinguishability tasks. We derive general lower bounds on the minimal classical distinguishability as a function of the success metric of these tasks. We demonstrate that quantum communication outperforms classical communication, presenting explicit protocols and utilizing semi-definite programming methods. In particular, we demonstrate unbounded quantum advantage for random access codes and Hadamard graph-based equality problems. Specifically, we show that the classical-to-quantum ratio of minimal distinguishability required to achieve the same success metric escalates polynomially and exponentially with the complexity of these tasks, reaching arbitrarily large values.

quant-ph↗

arXiv2024

Classifying Measurement Incompatibility under Classical Pre- and Post-Processing Operations

Measurement incompatibility has proved to be an important resource for quantum information processing. In this work, we present an operational approach that leverages classical operations on the inputs (pre-processing) and outputs (post-processing) of measurement devices to explore different layers of incompatibility among the measurements performed by the device. We study classifications of measurement incompatibility with respect to these two types of classical operations, viz., post-processing or coarse-graining of measurement outcomes and pre-processing or convex-mixing of different measurements. We derive analytical criteria for determining when a set of projective measurements is fully incompatible with respect to coarse-graining or convex-mixing. Robustness against white noise for different layers of incompatibility for mutually unbiased bases is investigated. Furthermore, we study operational witnesses for incompatibility subject to these classical operations, using the input-output statistics of Bell-type experiments as well as experiments in the prepare-and-measure scenario.

quant-ph↗

arXiv2023

Relating CP divisibility of dynamical maps with compatibility of channels

The role of CP-indivisibility and incompatibility as valuable resources for various information-theoretic tasks is widely acknowledged. This study delves into the intricate relationship between CP-divisibility and channel compatibility. Our investigation focuses on the behaviour of incompatibility robustness of quantum channels for a pair of generic dynamical maps. We show that the incompatibility robustness of channels is monotonically non-increasing for a pair of generic CP-divisible dynamical maps. Further, our explicit study of the behaviour of incompatibility robustness with time for some specific dynamical maps reveals non-monotonic behaviour in the CP-indivisible regime. Additionally, we propose a measure of CP-indivisibility based on the incompatibility robustness of quantum channels. Our investigation provides valuable insights into the nature of quantum dynamical maps and their relevance in information-theoretic applications.

quant-ph↗