1 citations · 1 across the 7 of their papers we have counts for
9 papers
Quantum Fast-Forwarding Beyond Reversibility: The -Perturbed -Cycle
Avah Banerjee, Asim Sharma, Sooraj Soman
Quantum fast-forwarding (QFF) is usually formulated for reversible Markov chains, where the projected quantum walk evolution is exactly governed by Chebyshev polynomials of a Hermi…
Structured Clifford+T Circuits for Efficient Generation of Quantum Chaos
Asim Sharma, Avah Banerjee
We investigate the emergence of quantum chaos and unitary T-design behavior in derandomized Clifford+T circuits using causal cover architectures. Motivated by the need for determin…
Non-uniform Mixing of Quantum Walks on the Symmetric Group
Avah Banerjee
It is well-known that classical random walks on regular graphs converge to the uniform distribution. Quantum walks, in their various forms, are quantizations of their corresponding…
Locality-aware Qubit Routing for the Grid Architecture
Avah Banerjee, Xin Liang, Rod Tohid
Due to the short decohorence time of qubits available in the NISQ-era, it is essential to pack (minimize the size and or the depth of) a logical quantum circuit as efficiently as p…
Discrete Quantum Walks on the Symmetric Group
Avah Banerjee
The theory of random walks on finite graphs is well developed with numerous applications. In quantum walks, the propagation is governed by quantum mechanical rules; generalizing ra…
An adjacency labeling scheme based on a tree-decomposition
Avah Banerjee
In this paper we look at the problem of adjacency labeling of graphs. Given a family of undirected graphs the problem is to determine an encoding-decoding scheme for each member of…
Distributed Matrix Tiling Using A Hypergraph Labeling Formulation
Avah Banerjee, Guoli Ding, Maxwell Reeser
Partitioning large matrices is an important problem in distributed linear algebra computing (used in ML among others). Briefly, our goal is to perform a sequence of matrix algebra…
Online MinCut: Competitive and Regret Analysis
Avah Banerjee, Guoli Ding
In this paper we study the mincut problem in the online setting. We consider two distinct models: A) competitive analysis and B) regret analysis. In the competitive setting we cons…
Oblivious Set-maxima for Intersection of Convex Polygons
Avah Banerjee, Dana Richards
In this paper we revisit the well known set-maxima problem in the oblivious setting. Let be a set of elements with an underlying total order. Let $\math…