I
Igor L. Markov
Researcher at University of Michigan
Publications - 331
Citations - 15880
Igor L. Markov is an academic researcher from University of Michigan. The author has contributed to research in topics: Quantum computer & Quantum algorithm. The author has an hindex of 65, co-authored 327 publications receiving 14400 citations. Previous affiliations of Igor L. Markov include Synopsys & Google.
Papers
More filters
Journal Article
Hypergraph Partitioning With Fixed Vertices
TL;DR: It is found that the presence of fixed terminals can make a partitioning instance considerably easier (possibly to the point of being "trivial"): much less effort is needed to stably reach solution qualities that are near best-achievable.
Journal ArticleDOI
Simulating quantum computation by contracting tensor networks
Igor L. Markov,Yaoyun Shi +1 more
TL;DR: In this article, it was shown that a quantum circuit with log-depth gates whose underlying graph has treewidth $d$ can be simulated deterministically in O(1)exp[O(d)]$ time, which is polynomial in the size of the graph.
Journal ArticleDOI
Solution and Optimization of Systems of Pseudo-Boolean Constraints
TL;DR: The experimental results show that specialized 0-1 techniques implemented in PBS tend to outperform generic ILP techniques on Boolean optimization problems, as well as on general EDA SAT problems.
Book ChapterDOI
Automatically exploiting symmetries in constraint programming
Arathi Ramani,Igor L. Markov +1 more
TL;DR: This work introduces a framework for studying and solving a class of CSP formulations that generalizes earlier work on symmetries in SAT and 0-1 ILP problems, and shows substantial speedups with symmetry-breaking, especially on unsatisfiable instances.
Posted Content
Efficient Synthesis of Linear Reversible Circuits
TL;DR: In this paper, the authors presented an algorithm that is optimal up to a multiplicative constant, as well as Theta(log n) times faster than previous methods, which can be interpreted as a matrix decomposition algorithm, yielding an asymptotically efficient decomposition of a binary matrix into a product of elementary matrices.