15 citations · 21 across the 14 of their papers we have counts for
22 papers
Quantum Fire with Delegated Cloning
Rohit Chatterjee, Ananta Mukherjee, Vir Pathak +1
Quantum fire is a recently introduced cryptographic primitive consisting of efficiently preparable quantum states, called \emph{flames}, that admit efficient cloning but resist eff…
Learning and interpreting policies for simultaneous entanglement requests in quantum networks
Leon Rode, Sumeet Khatri, Supartha Podder
Future quantum networks will make use of entanglement to perform numerous tasks, such as sending quantum information over long distances, distributed quantum computing, and quantum…
A General Composition Theorem for Approximate Degree
Samruddhi Pednekar, Supartha Podder
A longstanding open question in Boolean function complexity asks whether approximate degree composes multiplicatively under block composition. Although a general multiplicative upp…
Hardness of Pathfinding in a Welded Tree
David Miloschewsky, Supartha Podder
Starting from the entrance of a welded tree, a quantum walk algorithm can find its exit vertex exponentially faster than any classical algorithm. However, it has been an open quest…
Promises should be taken seriously: On relativization with promise problems
David Miloschewsky, Supartha Podder, Dorian Rudolph
Relativization is concerned with comparing computational models with black-box access to an oracle. For promise problems, black-box access is not canonical due to inputs outside of…
On the Approximate Non-Deterministic Degree of Total Boolean Functions
Samruddhi Pednekar, Supartha Podder
The approximate non-deterministic degree of a Boolean function , denoted (written for brevity), is the minimum degree of a real polynomial…