arXiv subjects

Kunika Agarwal

Publications and source records attributed to Kunika Agarwal.

7 recordsLinked to original sources

arXiv2026

On the Origin of Beyond-Classical Advantage in the Parity-Permutation Problem

We investigate the task of identifying the parity (odd vs even) of an unknown permutation applied to $n$ particles. Classically, using fewer than $n$ distinct labels per particle limits the success probability to random guessing, whereas quantum mechanics, exploiting entanglement in both preparation and measurement, accomplishes the task perfectly with as few as $\big\lceil \sqrt{n}\big\rceil$ levels per particle [\href{https://doi.org/10.1103/yhyv-xnwq}{PRL {\bf 135}, 260603 (2025)}]. We show that even without entangled preparation, quantum theory still offers a probabilistic advantage over classical strategies. Moreover, such product preparations yield perfect success in locally quantum theories, where elementary systems are quantum but their composition follows the minimal tensor product structure of generalized probabilistic theories (GPTs). We further identify GPT models that accomplish the task with certainty without requiring entanglement either at the preparation stage or at the measurement stage. Our central result establishes that the linear dimension of the elementary systems, rather than entanglement, is the fundamental resource governing the existence of probabilistic advantage in the permutation parity problem. In particular, below the required dimension threshold, no amount of entanglement can improve upon the random-guessing limit.

quant-ph↗

arXiv2026

No Absolute Hierarchy of Quantum Complementarity

Bohr's principle of complementarity, prohibiting simultaneous access to certain physical properties within a single experimental arrangement, is considered to be a defining feature of quantum mechanics. It is commonly viewed as inducing an intrinsic hierarchy among incompatible observables: some sets of quantum properties are fundamentally more incompatible than others, as quantified by the maximal sharpness permitting their joint measurement. We show that this hierarchy ceases to be absolute in the multi-copy regime. Analyzing qubit spin observables, we prove a No-Comparison Theorem establishing that no global ordering of incompatible observable sets is preserved across all finite-copy configurations. In particular, two sets of observables can exhibit reversed complementarity ordering depending solely on whether the available resources are arranged as identical copies or as parallel-antiparallel pairs. Thus, the degree of quantum incompatibility is not an intrinsic property of observables alone but depends on the global configuration of the prepared quantum probes. Our results uncover a configuration-dependent structure of complementarity, reveal a subtle role of entanglement in shaping the structure of measurement limitations, and call for a reassessment of quantum information protocols under finite resources.

quant-ph↗

arXiv2026

Quantum Incompatibility in Parallel vs Antiparallel Spins

We explore the joint measurability of incompatible qubit observables on ensembles of parallel and antiparallel spin-1/2 pairs. In parallel configuration, both spins are prepared in the same state, whereas in antiparallel case, each spin is paired with its flipped counterpart. We show that the antiparallel configuration uniquely enables exact simultaneous prediction of three mutually orthogonal spin components -- an advantage not achievable with parallel states. Extending beyond three observables, we examine joint measurability for larger sets of spin measurements and further generalize our analysis to state configurations beyond the parallel and antiparallel cases. As we show, our results reveal a deep connection to the 'mean King retrodiction task' proposed by Vaidman, Aharonov, and Albert, and have implications for a cryptographic protocol introduced by Jeffrey Bub. We further demonstrate how the enhanced compatibility in the antiparallel configuration can facilitate efficient estimation of unknown measurement devices. Finally, we discuss prospects for experimentally realizing the enhanced measurement compatibility in antiparallel configuration by analyzing the effect on finite sub-ensembles of states.

quant-ph↗

arXiv2026

Superadditivity of Zero-Error Capacity in Noisy Classical and Perfect Quantum Channel Pairs

We demonstrate superadditivity of one-shot zero-error classical capacity in an asymmetric communication setting where a noisy classical channel is used in parallel with a perfect quantum channel. Each channel individually supports only a fixed number of perfectly distinguishable messages. Their joint use enables transmission of strictly more messages than permitted by the product of the individual capacities. We present explicit constructions achieving this enhancement and establish that replacing the perfect quantum channel with a perfect classical channel eliminates the effect. Finally, we identify a structural criterion on the noisy channel governing this effect and show that the quantum advantage is rooted in Kochen-Specker contextuality.

quant-ph↗

arXiv2025

Nonlocality-Assisted Enhancement of Error-Free Communication in Noisy Classical Channels

The zero-error capacity of a noisy classical channel quantifies its ability to transmit information with absolute certainty, i.e., without any error. Unlike Shannon's standard channel capacity, which remains unaffected by pre-shared correlations, zero-error capacity can be enhanced through nonlocal correlations. In this work, we investigate zero-error communication utility of such correlations arising in the 2-2-m Bell scenario, where two parties have two inputs and m possible outcomes per input. For all m\geq2, we construct examples of noisy classical channels with zero zero-error capacity that, when assisted by extremal 2-2-m nonlocal correlations, can transmit one bit of information. While nonlocal correlations arising from quantum entangled states cannot achieve a positive zero-error capacity for these channels, they significantly enhance the probability of successfully transmitting a classical bit in a single use. Extending this analysis to the 2-m-2 Bell scenario, we identify channels with zero zero-error capacity that can nonetheless perfectly transmit log m bits of information when assisted by corresponding extremal nonlocal correlations. Our findings underscore the versatile utility of Bell nonlocal correlations in achieving zero-error communication.

quant-ph↗

arXiv2024

Stronger Nonlocality in GHZ States: A Step Beyond the Conventional GHZ Paradox

The Greenberger-Horne-Zeilinger (GHZ) paradox, involving quantum systems with three or more subsystems, offers an 'all-vs-nothing' test of quantum nonlocality. Unlike Bell tests for bipartite systems, which reveal statistical contradictions, the GHZ paradox demonstrates a definitive (i.e. 100%) conflict between local hidden variable theories and quantum mechanics. Given this, how can the claim made in the title be justified? The key lies in recognising that GHZ games are typically played under a predefined promise condition for input distribution. By altering this promise, different GHZ games can be constructed. Here, we introduce a randomized variant of GHZ game, where the promise condition is randomly selected from multiple possibilities and revealed to only one of the parties chosen randomly. We demonstrate that this randomized GHZ paradox can also be perfectly resolved using a GHZ state, revealing a potentially stronger form of nonlocality than the original paradox. The claim of enhanced nonlocality is supported by its operational implications: correlations yielding perfect success in the randomized game offer a greater communication advantage than traditional GHZ correlations in a distributed multi-party communication complexity task.

quant-ph↗

arXiv2024

Scalable & Noise-Robust Communication Advantage of Multipartite Quantum Entanglement

Distributed computing, involving multiple servers collaborating on designated computations, faces a critical challenge in optimizing inter-server communication -- an issue central to the study of communication complexity. Quantum resources offer advantages over classical methods in addressing this challenge. In this work, we investigate a distributed computing scenario with multiple senders and a single receiver, establishing a scalable advantage of multipartite quantum entanglement in mitigating communication complexity. Specifically, we demonstrate that when the receiver and the senders share a multi-qubit Greenberger-Horne-Zeilinger (GHZ) state -- a quintessential form of genuine multipartite entanglement -- certain global functions of the distributed inputs can be computed with only one bit of classical communication from each sender. In contrast, without entanglement, two bits of communication are required from all but one sender. Consequently, quantum entanglement reduces communication overhead by (n-1) bits for n senders, allowing for arbitrary scaling with an increasing number of senders. We also show that the entanglement-based protocol exhibits significant robustness under white noise, thereby establishing the potential for experimental realization of this novel quantum advantage.

quant-ph↗