4 citations · 9 across the 3 of their papers we have counts for
3 papers
quant-ph2007★ 4 cited
On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels
Salman Beigi, Peter W. Shor
One of the main problems in quantum complexity theory is that our understanding of the theory of QMA-completeness is not as rich as its classical analogue, the NP- completeness. In…
math.CO2007★ 2 cited
Enumerating the Classes of Local Equivalency in Graphs
Mohsen Bahramgiri, Salman Beigi
There are local operators on (labeled) graphs with labels coming from a finite field. If the filed is binary, in other words, if the graph is ordinary, the operation…
cs.DS2007★ 3 cited
An Efficient Algorithm to Recognize Locally Equivalent Graphs in Non-Binary Case
Mohsen Bahramgiri, Salman Beigi
Let be a vertex of a graph . By the local complementation of at we mean to complement the subgraph induced by the neighbors of . This operator can be generalized…