5 citations · 13 across the 14 of their papers we have counts for
17 papers
Genuine Multipartite Nonlocality for Arbitrary Input: Maximal Randomness Generation and Robust Self-Testing
Rajdeep Paul, Ranendu Adhikary, Alok Kumar Pan
Bell nonlocality provides the foundation for device-independent (DI) certification of quantum devices. We introduce a Bell inequality capable of identifying genuine multipartite no…
Exclusion reshapes the operational manifestation of preparation contextuality
Pritam Roy, Thansingh Jankawat, Ranendu Adhikary +1
Replacing the task of retrieval with exclusion changes how preparation contextuality manifests operationally under parity-oblivious constraints, with exclusion showing a quantum ad…
Hardy-type self-testing and exposedness of tripartite GHZ correlations
Smritikana Patra, Soumyajit Pal, Ranendu Adhikary
Nonlocality can be witnessed either through Bell-inequality violations or through logical contradictions such as Hardy's paradox. In the bipartite two input two outcome scenario, t…
Minimal Help, Maximal Gain: Environmental Assistance Unlocks Encoding Strength
Snehasish Roy Chowdhury, Sutapa Saha, Subhendu B. Ghosh +2
For any quantum transmission line, with smaller output dimension than its input, the number of classical symbols that can be reliably encoded is strictly suboptimal. In other words…
Multipartite Hardy paradox unlocks device-independent key sharing
Ranendu Adhikary, Mriganka Mandal
We introduce a device-independent quantum key distribution protocol for N parties, using the multipartite Hardy paradox to certify genuine multipartite nonlocality. Unlike traditio…
Self-testing of Nonmaximal Genuine Entangled States using Tripartite Hardy Relations
Ranendu Adhikary, Souradeep Sasmal, Arup Roy
We demonstrate that, in the tripartite scenario with all parties' local events being space-like separated, Hardy-type nonlocality constitutes a stronger manifestation of nonlocal c…
Self-testing of genuine multipartite non-local and non-maximally entangled states
Ranendu Adhikary
Self-testing enables the characterization of quantum systems with minimal assumptions on their internal working as such it represents the strongest form of certification for quantu…
Minimum Detection Efficiencies for Loophole-free Genuine Nonlocality Tests
Subhendu B. Ghosh, Snehasish Roy Chowdhury, Ranendu Adhikary +2
The certification of quantum nonlocality, which has immense significance in architecting device-independent technologies, confronts severe experimental challenges. Detection loopho…
Network-assist free self-testing of genuine multipartite entangled states
Ranendu Adhikary, Abhishek Mishra, Ramij Rahaman
Self-testing is a method to certify quantum states and measurements in a device-independent way. The device-independent certification of quantum properties is purely based on input…
Distributed Localization of Wireless Sensor Network Using Communication Wheel
Kaustav Bose, Manash Kumar Kundu, Ranendu Adhikary +1
We study the network localization problem, i.e., the problem of determining node positions of a wireless sensor network modeled as a unit disk graph. In an arbitrarily deployed net…
Complexity of Maximum Cut on Interval Graphs
Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee +1
We resolve the longstanding open problem concerning the computational complexity of Max Cut on interval graphs by showing that it is NP-complete.
Arbitrary Pattern Formation by Opaque Fat Robots with Lights
Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu +1
Arbitrary Pattern Formation is a widely studied problem in autonomous robot systems. The problem asks to design a distributed algorithm that moves a team of autonomous, anonymous a…
Positional Encoding by Robots with Non-Rigid Movements
Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu +1
Consider a set of autonomous computational entities, called \emph{robots}, operating inside a polygonal enclosure (possibly with holes), that have to perform some collaborative tas…
Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights
Kaustav Bose, Manash Kumar Kundu, Ranendu Adhikary +1
The Arbitrary Pattern Formation problem asks for a distributed algorithm that moves a set of autonomous mobile robots to form any arbitrary pattern given as input. The robots are a…
Arbitrary Pattern Formation on Infinite Grid by Asynchronous Oblivious Robots
Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu +1
The Arbitrary Pattern Formation problem asks to design a distributed algorithm that allows a set of autonomous mobile robots to form any specific but arbitrary geometric pattern gi…
Crash tolerant gathering on grid by asynchronous oblivious robots
Kaustav Bose, Ranendu Adhikary, Sruti Gan Chaudhuri +1
Consider a system of autonomous mobile robots initially randomly deployed on the nodes of an anonymous finite grid. A gathering algorithm is a sequence of moves to be executed inde…
Euclidean 1-center of a set of static and mobile points
Kaustav Bose, Ranendu Adhikary, Sruti Gan Chaudhuri +1
In this paper, we consider the problem of computing the algebraic parametric equation of the Euclidean 1-center function in , , for a system of static p…