arXiv subjects

Rajdeep Paul

Publications and source records attributed to Rajdeep Paul.

6 recordsLinked to original sources

arXiv2026

Certified quantum supremacy in entanglement-assisted prepare-measure random-access-code

We develop a family of semi-device-independent (SDI) entanglement-assisted prepare-measure (PM) communication games involving two parties, within the $n\rightarrow l$ random-access code (RAC) framework where the sender Alice holds a n-bit string and communicates $l<n$ bits or qubits to the receiver Bob. In contrast to the standard quantum PMRAC, here the parties share a prior entanglement, and Alice applies quantum operations on her sub-system to encode her inputs and sends to Bob. We first consider the $4\rightarrow l$ entanglement-assisted PMRAC with $l=1$ and $2$ and derive the optimal quantum success probabilities using an elegant analytical technique. We demonstrate quantum supremacy over both classical RACs and conventional quantum PMRACs. Moreover, we exhibit that the optimal quantum advantage allows one to certify Alice's unitary operations. We then derive an upper bound on the quantum success probabilities for $5\rightarrow l$ entanglement-assisted PMRAC with $l=1,2$ and $3$. Further, we extend the demonstration of quantum advantage for $n\rightarrow n-2$ case where n is arbitrary.

quant-ph↗

arXiv2026

Genuine Multipartite Nonlocality for Arbitrary Input: Maximal Randomness Generation and Robust Self-Testing

Bell nonlocality provides the foundation for device-independent (DI) certification of quantum devices. We introduce a Bell inequality capable of identifying genuine multipartite nonlocality (GMNL) in an arbitrary m-partite scenario with an arbitrary odd number of measurements per party. Since the multi-setting nature of this inequality precludes the use of Jordan's Lemma, we construct an analytical sum-of-squares (SOS) decomposition to obtain the optimal quantum violation without assuming any bound on the Hilbert space dimension. This, in turn, enables self-testing of the shared entangled state and the corresponding measurement observables, up to local isometries, whose existence we confirm using a swap-based certification scheme. In addition, we show that our framework enables the extraction of maximal global DI randomness (m bits) at the optimal quantum violation, thereby exceeding previous limitations in the GMNL regime. Finally, we demonstrate that the architecture of our inequality yields improved robustness to noise as the number of measurement settings grows, ensuring experimental feasibility.

quant-ph↗

arXiv2026

Robust self-testing based on Gisin's arbitrary-input Bell inequality

Self-testing refers to the strongest device-independent (DI) certification method that validates the nature of a quantum system and devices solely based on the observed statistics. We demonstrate the self-testing of state and measurements based on the Gisin Bell inequality (GBI) featuring arbitrary inputs for both parties. We introduce a systematic and elegant sum-of-squares (SOS) approach that enables the dimension-independent derivation of the optimal quantum violation of GBI. We derive the state and the interrelation between the local observables directly from the optimization condition. Since the practical experimental scenario involves inevitable noise and imperfection, we present a comprehensive strategy for robust self-testing.

quant-ph↗

arXiv2026

Semi-device-independent self-testing of unitary operations

We present a hitherto unexplored semi-device-independent (SDI) self-testing protocol designed to certify unitary operations within a variant of prepare-measure framework. We consider a communication game which we refer to as a variant of $3$-bit prepare-measure random access code (PMRAC) involving two parties, Alice and Bob, who share a prior two-qubit quantum state. Alice encodes her message by applying unitary operations on her subsystem and sends it to Bob. To decode the message, Bob performs a measurement on the whole system. We demonstrate that the optimal quantum advantage of the variant of $3$-bit PMRAC over the classical bound enables the self-testing of Alice's unitary operations and Bob's measurements. The derivation of the optimal quantum success probability is fully analytical. The approach is so elegant that it can be generalized for any arbitrary $n$-bit PMRAC and may also be extended to other prepare-measure communication games.

quant-ph↗

arXiv2025

Robust self-testing and certified randomness based on chained Bell inequality

Self-testing is the strongest certification procedure that uniquely characterizes the physical system based on the observed statistics, without any knowledge of the inner workings of the devices. The optimal quantum violation of a Bell inequality enables such a device-independent (DI) self-testing of the source and the measurement devices. In this work, we demonstrate the DI self-testing based on the arbitrary-input chained Bell inequality. We devise a systematic and elegant sum-of-squares (SOS) technique enabling dimension-independent optimization of the quantum violation. Our approach enables the derivation of the state along with the relationship between the local observables directly from the optimization condition. One significant aspect is the robustness of such self-testing in real experimental situations involving noise and imperfection, leading to deviation from the optimal quantum violation. We provide an analytical technique for robust self-testing in the presence of noise. As an application of our scheme, we demonstrate the generation of two bit DI randomness and analyze the robustness of such randomness. Our optimization method is both simple and elegant, making it suitable for deriving the optimal quantum violation of various arbitrary-input Bell inequalities.

quant-ph↗

arXiv2024

Self-testing of multiple unsharpness parameters through sequential violations of non-contextual inequality

The self-testing protocols refer to novel device-independent certification schemes wherein the devices are uncharacterised, and the dimension of the system remains unspecified. The optimal quantum violation of a Bell's inequality facilitates such self-testing. In this work, we put forth a protocol for self-testing of noisy quantum instruments, specifically, the unsharpness parameter of smeared projective measurements in any arbitrary dimension. Our protocol hinges on the sequential quantum violations of a bipartite Bell-type preparation non-contextual inequality, involving three measurement settings per party. First, we demonstrate that at most three sequential independent Bobs manifest simultaneous preparation contextuality with a single Alice through the violation of this inequality. Subsequently, we show that the sub-optimal sequential quantum violations of the non-contextual inequality form an optimal set, eventually enabling the self-testing of shared state, local measurements and unsharpness parameters of one party. Notably, we derive the optimal set of quantum violations without specifying the dimension of the quantum system, thereby circumventing the constraint that may arise due to Naimark's theorem. Furthermore, we extend our investigation to quantify the degree of incompatible measurements pertaining to the sequential observers, exploring how variations in the degree of incompatibility impact the values of unsharp parameters necessary for sequential quantum violation.

quant-ph↗