66 citations · 332 across the 27 of their papers we have counts for
31 papers
Nonlocal and quantum advantages in network coding for multiple access channels
Jiyoung Yun, Seung-Hyun Nam, Hyun-Young Park +3
In this work, we consider two-sender, one-receiver communication over a discrete memoryless multiple-access channel without feedback, where two senders may cooperate on channel cod…
Distilling Nonlocality in Quantum Correlations
Sahil Gopalkrishna Naik, Govind Lal Sidhardh, Samrat Sen +3
Nonlocality, as established by seminal Bell's theorem, is considered to be the most striking feature of correlations present in space like separated events. Its practical applicati…
Parameterized and Exact Algorithms for Class Domination Coloring
R. Krithika, Ashutosh Rai, Saket Saurabh +1
A class domination coloring (also called cd-Coloring or dominated coloring) of a graph is a proper coloring in which every color class is contained in the neighbourhood of some ver…
Parameterized complexity of untangling knots
Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer
Deciding whether a diagram of a knot can be untangled with a given number of moves (as a part of the input) is known to be NP-complete. In this paper we determine the parameterized…
Device-independent bounds from Cabello's nonlocality argument
Ashutosh Rai, Matej Pivoluska, Martin Plesch +3
Hardy-type arguments manifest Bell nonlocality in one of the simplest possible ways. Except for demonstrating nonclassical signature of entangled states in question, they can also…
Revealing Incommensurability between Device-Independent Randomness, Nonlocality, and Entanglement using Hardy and Hardy-type Relations
Souradeep Sasmal, Ashutosh Rai, Sayan Gangopadhyay +2
A comprehensive treatment of the quantification of randomness certified device-independently by using the Hardy and Cabello-Liang-Li (CLL) nonlocality relations is provided in the…
Parameterized Inapproximability of Independent Set in -Free Graphs
Pavel Dvořák, Andreas Emil Feldmann, Ashutosh Rai +1
We study the Independent Set (IS) problem in -free graphs, i.e., graphs excluding some fixed graph as an induced subgraph. We prove several inapproximability results both fo…
Non-Local Network Coding in Interference Channels
Jiyoung Yun, Ashutosh Rai, Joonwoo Bae
In a network, a channel introduces correlations to the parties that aim to establish a communication protocol. In this work, we present a framework of non-local network coding by e…
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem
Andreas Emil Feldmann, Davis Issac, Ashutosh Rai
We develop an FPT algorithm and a bi-kernel for the Weighted Edge Clique Partition (WECP) problem, where a graph with vertices and integer edge weights is given together with a…
Geometry of the quantum set on no-signaling faces
Ashutosh Rai, Cristhiano Duarte, Samurai Brito +1
Since Bell's theorem we know that quantum mechanics is incompatible with local hidden-variable models, the phenomenon known as quantum nonlocality. However, despite steady progress…
A Polynomial Kernel for Diamond-Free Editing
Yixin Cao, Ashutosh Rai, R. B. Sandeep +1
An -free editing problem asks whether we can edit at most edges to make a graph contain no induced copy of the fixed graph . We obtain a polynomial kernel for this proble…
Strong Quantum Solutions in Conflicting Interest Bayesian Games
Ashutosh Rai, Goutam Paul
Quantum entanglement has been recently demonstrated as a useful resource in conflicting interest games of incomplete information between two players, Alice and Bob [Pappa et al., P…
Strong supremacy of quantum systems as communication resource
Maria Quadeer, Manik Banik, Andris Ambainis +1
We investigate the task of -level random access codes (-RACs) and consider the possibility of encoding classical strings of -level symbols (dits) into a quantum system of…
Two-Qubit Pure Entanglement as Optimal Social Welfare Resource in Bayesian Game
Manik Banik, Some Sankar Bhattacharya, Nirman Ganguly +4
Entanglement is of paramount importance in quantum information theory. Its supremacy over classical correlations has been demonstrated in numerous information theoretic protocols.…
Parity Oblivious d-Level Random Access Codes and Class of Noncontextuality Inequalities
Andris Ambainis, Manik Banik, Anubhav Chaturvedi +2
One of the fundamental results in quantum foundations is the Kochen-Specker no-go theorem. For the quantum theory, the no-go theorem excludes the possibility of a class of hidden v…
Commutative algebra: Constructive methods. Finite projective modules
Henri Lombardi, Claude Quitté
This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules. We adopt the constructive point of view, with…
Quantum Advantages in (n,d)->1 Random Access Codes
Andris Ambainis, Dmitry Kravchenko, Sk Sazim +2
A random access code (RAC), corresponding to a communication primitive with various applications in quantum information theory, is an instance of a preparation-and-measurement scen…
A Parameterized Algorithm for Mixed Cut
Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
The classical Menger's theorem states that in any undirected (or directed) graph , given a pair of vertices and , the maximum number of vertex (edge) disjoint paths is eq…
Limited preparation contextuality in quantum theory and its relation to the Cirel'son bound
Manik Banik, Some Sankar Bhattacharya, Amit Mukherjee +3
Kochen-Specker (KS) theorem lies at the heart of the foundations of quantum mechanics. It establishes impossibility of explaining predictions of quantum theory by any noncontextual…
Local Orthogonality provides better upper bound for Hardy's nonlocality
Subhadipa Das, Manik Banik, Md. Rajjak Gazi +2
The amount of nonlocality in quantum theory is limited compared to that allowed in generalized no-signaling theory [Found. Phys. 24, 379 (1994)]. This feature, for example, gets ma…
Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound
Robert Crowston, Mark Jones, Gabriele Muciaccia +3
Poljak and Turzik (Discrete Mathematics 1986) introduced the notion of λ-extendible properties of graphs as a generalization of the property of being bipartite. They showed that fo…
Macroscopic locality with equal bias reproduces with high fidelity a quantum distribution achieving the Tsirelson's bound
Md. Rajjak Gazi, Manik Banik, Subhadipa Das +2
Two physical principles, Macroscopic Locality (ML) and Information Causality (IC), so far, have been most successful in distinguishing quantum correlations from post-quantum correl…
A testable prediction of the no-signalling condition using a variant of the EPR-Bohm example
Dipankar Home, Ashutosh Rai, A. S. Majumdar
Predictive power of the no-signalling condition (NSC) is demonstrated in a testable situation involving a non-ideal Stern-Gerlach (SG) device in one of the two wings of the EPR-Boh…
Maximum tri-partite Hardy's nonlocality respecting all bi-partite principles
Subhadipa Das, Manik Banik, M. D. Rajjak Gazi +3
The set of multiparty correlations that respect all bi-partite principles has been conjectured to be same as the set of time-ordered-bi-local correlations. Based on this conjunctur…