Rai, Ashutosh
- Parity Oblivious d-Level Random Access Codes and Class of Noncontextuality Inequalities
2016/07/19 by Andris Ambainis, Manik Banik, Ambainis, Andris +7 · 5 citations
Computer Science · Mathematics · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum-Dot Cellular Automata #cs.IT #math.IT #quant-ph
- Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem
2020/02/18 by Feldmann, Andreas Emil, Issac, Davis, Rai, Ashutosh · 1 citation
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
- Strong supremacy of quantum systems as communication resource
2017/03/06 by Maria Quadeer, Quadeer, Maria, Manik Banik +5 · 1 citation
Computer Science · #Computability, Logic, AI Algorithms #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph)
- Revealing Incommensurability between Device-Independent Randomness, Nonlocality, and Entanglement using Hardy and Hardy-type Relations
2020/11/25 by Souradeep Sasmal, Ashutosh Rai, Sasmal, Souradeep +7 · 1 citation
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
- Parameterized Inapproximability of Independent Set in H-Free Graphs
2020/06/18 by Pavel Dvořák, Dvořák, Pavel, Andreas Emil Feldmann +5 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #F.2 #FOS: Computer and information sciences #Limits and Structures in Graph Theory