Zobrazeno 1 - 10
of 413
pro vyhledávání: '"KUMAR, MITHILESH"'
Autor:
Kumar, Mithilesh
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 review properties of bipartite Schmidt decompositions and study which
Externí odkaz:
http://arxiv.org/abs/2411.05703
Autor:
Kumar, Mithilesh, Lokshtanov, Daniel
A {\em bipartite tournament} is a directed graph $T:=(A \cup B, E)$ such that every pair of vertices $(a,b), a\in A,b\in B$ are connected by an arc, and no arc connects two vertices of $A$ or two vertices of $B$. A {\em feedback vertex set} is a set
Externí odkaz:
http://arxiv.org/abs/2411.02821
Autor:
Kumar, Mithilesh
Quantum states can be written in infinitely many ways depending on the choices of basis. Schmidt decomposition of a quantum state has a lot of properties useful in the study of entanglement. All bipartite states admit Schmidt decomposition, but this
Externí odkaz:
http://arxiv.org/abs/2411.02473
Autor:
Kumar, Mithilesh, author, Samaddar, Ranabir, author
Publikováno v:
The Class Strikes Back: Self-Organised Workers’ Struggles in the Twenty-First Century. 150:19-36
Autor:
Yao, Xiaomei, Kumar, Mithilesh V., Su, Esther, Flores Miranda, Athena, Saha, Ashirbani, Sussman, Jonathan
Publikováno v:
In Cancer Epidemiology February 2024 88
A lattice reduction is an algorithm that transforms the given basis of the lattice to another lattice basis such that problems like finding a shortest vector and closest vector become easier to solve. We define a class of bases called obtuse bases an
Externí odkaz:
http://arxiv.org/abs/2009.00384
Autor:
Kumar, Akash, Kumar, Mithilesh
In the DELETION TO INDUCED MATCHING problem, we are given a graph $G$ on $n$ vertices, $m$ edges and a non-negative integer $k$ and asks whether there exists a set of vertices $S \subseteq V(G) $ such that $|S|\le k$ and the size of any connected com
Externí odkaz:
http://arxiv.org/abs/2008.09660
Autor:
Kumar, Mithilesh
A lattice reduction is an algorithm that transforms the given basis of the lattice to another lattice basis such that problems like finding a shortest vector and closest vector become easier to solve. Some of the famous lattice reduction algorithms a
Externí odkaz:
http://arxiv.org/abs/1912.01781
Autor:
Kumar, Mithilesh
We show that 2-CLUB is NP-hard for distance to 2-club cluster graphs.
Externí odkaz:
http://arxiv.org/abs/1903.05425
Publikováno v:
In Annals of Nuclear Energy 1 June 2023 185