activity
20152026
most citedFaster Lattice Enumeration

1 citations · 2 across the 12 of their papers we have counts for

collaborators

14 papers

quant-ph2026

Dealing with locality in QAOA

Mithilesh Kumar, Yusuf Tahir

Shallow-depth QAOA on sparse, high-diameter MaxCut instances faces a locality bottleneck: at depth \(p\), local observables can depend only on a bounded neighborhood of the circuit…

quant-ph2026

Assisted quantum teleportation

Mithilesh Kumar, Kaavya Iyer

Teleportation through a non-maximally entangled pair, e.g., , induces a noisy channel and cannot achieve deterministic unit-fidelity tr…

quant-ph2026

Congestion-free routing on quantum chips

Mithilesh Kumar, Yusuf Tahir, Varun Daiya +2

Limited connectivity makes nonlocal quantum gates expensive on near-neighbor hardware, where compilation typically relies on SWAP transport, inheriting both depth overhead and path…

quant-ph2024

Local Operations in Multiparty Quantum Systems

Mithilesh Kumar

In a multipartite systems, local operations are conducted by one party and the results are communicated to the other parties. Such models have been studied under the framework of L…

quant-ph2024

On properties of Schmidt Decomposition

Mithilesh Kumar

Schmidt decomposition is a powerful tool in quantum information. While Schmidt decomposition is universal for bipartite states, its not for multipartite states. In this article, we…

cs.DS2024

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments

Mithilesh Kumar, Daniel Lokshtanov

A {\em bipartite tournament} is a directed graph such that every pair of vertices are connected by an arc, and no arc connects two vertice…