activity
20202025
most citedOn Actual Preparation of Dicke State on a Quantum Computer

6 citations · 17 across the 10 of their papers we have counts for

collaborators
Showing 2021Show all

2 papers · 1 filter

cs.CC2021

On Boolean Functions with Low Polynomial Degree and Higher Order Sensitivity

Subhamoy Maitra, Chandra Sekhar Mukherjee, Pantelimon Stanica +1

Boolean functions are important primitives in different domains of cryptology, complexity and coding theory. In this paper, we connect the tools from cryptology and complexity theo…

quant-ph2021★ 4 cited

Following Forrelation -- Quantum Algorithms in Exploring Boolean Functions' Spectra

Suman Dutta, Subhamoy Maitra, Chandra Sekhar Mukherjee

Here we revisit the quantum algorithms for obtaining Forrelation [Aaronson et al, 2015] values to evaluate some of the well-known cryptographically significant spectra of Boolean f…