activity
20142026
most citedQuantum superposition of causal structures as a universal resource for local implementation of nonlocal quantum operations

8 citations · 32 across the 12 of their papers we have counts for

collaborators

14 papers

cs.DM2026

Eternal Vertex Cover Problem on Halin Graphs

Jasine Babu, Pratik Ghosal, Cipriyano Simoes

Eternal vertex cover problem is a graph protection problem which is a dynamic two player game variant of the classical vertex cover problem. In this game, the minimum number of gua…

cs.GT2024★ 2 cited

EFX Exists for Three Types of Agents

Vishwa Prakash HV, Pratik Ghosal, Prajakta Nimbhorkar +1

We study the problem of finding an envy-free allocation of indivisible goods among agents with additive valuations. We focus on the fairness notion of envy-freeness up to any good…

quant-ph2023★ 3 cited

Distribution of quantum gravity induced entanglement in many-body systems

Pratik Ghosal, Arkaprabha Ghosal, Somshubhro Bandyopadhyay

Recently, it was shown that if two distant test masses, each in a spatially superposed quantum state, become entangled due to their mutual gravitational interaction, then this enta…

cs.MA2023

Fair Healthcare Rationing to Maximize Dynamic Utilities

Aadityan Ganesh, Prajakta Nimbhorkar, Pratik Ghosal +1

Allocation of scarce healthcare resources under limited logistic and infrastructural facilities is a major issue in the modern society. We consider the problem of allocation of hea…

cs.GT2023★ 1 cited

(Almost Full) EFX for Three (and More) Types of Agents

Pratik Ghosal, Vishwa Prakash HV, Prajakta Nimbhorkar +1

We study the problem of determining an envy-free allocation of indivisible goods among multiple agents with additive valuations. EFX, which stands for envy-freeness up to any good,…

quant-ph2022★ 8 cited

Quantum superposition of causal structures as a universal resource for local implementation of nonlocal quantum operations

Pratik Ghosal, Arkaprabha Ghosal, Debarshi Das +1

Spatial separation restricts the set of locally implementable quantum operations on distributed multipartite quantum systems. We propose that indefinite causal structure arising du…

quant-ph2022★ 6 cited

Locally unidentifiable subset of quantum states and its resourcefulness in secret password distribution

Pratik Ghosal, Arkaprabha Ghosal, Subhendu B. Ghosh +1

We introduce a hitherto unexplored form of quantum nonlocality, termed local subset unidentifiability, that arises from the limitation of spatially separated parties to perfectly i…

gr-qc2022★ 6 cited

Probability distribution for black hole evaporation

Pratik Ghosal, Rajarshi Ray

Non-thermal correction to the emission probability of particles from black holes can be obtained if the backreaction or self-gravitational effects of the emitted particles on the b…

quant-ph2020★ 2 cited

Thermalization of isolated quantum many-body system and the role of entanglement

Tanmay Saha, Pratik Ghosal, Pratapaditya Bej +2

Thermalization of an isolated quantum system has been a nontrivial problem since the early days of quantum mechanics. In generic isolated quantum systems, nonequilibrium dynamics i…

cs.CG2020

Rectangle Tiling Binary Arrays

Pratik Ghosal, Syed Mohammad Meesum, Katarzyna Paluch

The problem of rectangle tiling binary arrays is defined as follows. Given an array of zeros and ones and a natural number , our task is to partition into a…

cs.DS2017

Manipulation Strategies for the Rank Maximal Matching Problem

Pratik Ghosal, Katarzyna Paluch

We consider manipulation strategies for the rank-maximal matching problem. In the rank-maximal matching problem we are given a bipartite graph such that den…

cs.DS2017★ 2 cited

The Dynamics of Rank-Maximal and Popular Matchings

Pratik Ghosal, Adam Kunysz, Katarzyna Paluch

Given a bipartite graph, where the two sets of vertices are applicants and posts and ranks on the edges represent preferences of applicants over posts, a {\em rank-maximal} matchin…

cs.DS2015

Characterisation of Strongly Stable Matchings

Pratik Ghosal, Adam Kunysz, Katarzyna Paluch

An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph , with an adjacency list of each vertex being a linearly ordered list of…

cs.DS2014★ 2 cited

Rank Maximal Matchings -- Structure and Algorithms

Pratik Ghoshal, Meghana Nasre, Prajakta Nimbhorkar

Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and ranks on the edges denote preferences of the agents over posts. A matching M i…