Igor L. Markov

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Family name hatnote Template:Infobox scientist Igor Leonidovich MarkovTemplate:Efn (born in 1973) is an American professor,[1] computer scientist and engineer. Markov is known for results in quantum computation, work on limits of computation, research on algorithms for optimizing integrated circuits and on electronic design automation, as well as artificial intelligence. Additionally, Markov is an American non-profit executive[2] responsible for aid to Ukraine worth over a hundred million dollars.[3][4][5]

Igor L. Markov has no known relation to the mathematician Andrey Markov.

Career

Markov obtained an M.A. degree in mathematics and a Doctor of Philosophy degree in Computer Science from UCLA in 2001.[6][7] From the early 2000s through 2018 he was a professor at University of Michigan,[1] where he supervised doctoral dissertations and degrees of 12 students in Electrical engineering and Computer science.[7] He worked as a principal engineer at Synopsys during a sabbatical leave.[8][9] In 2013-2014 he was a visiting professor at Stanford University.[10] Markov worked at Google on Search and Information Retrieval,[11] and at Meta on Machine Learning platforms.[12][13][14] As of 2024, he works at Synopsys.[15]

Markov is a member of the Board of Directors of Nova Ukraine, a California 501(c)(3) charity organization that provides humanitarian aid in Ukraine.[16] At Nova Ukraine, Markov leads government and media relations, as well as advocacy efforts. Markov curated publicity efforts, established and curated large medical and evacuation projects, and contributed to fundraising.

Markov is a member of the Board of Directors of the American Coalition for Ukraine, an umbrella organization that coordinates one hundred US-based nonprofits concerned about events in Ukraine.[17]

Awards and distinctions

The ACM Special Interest Group on Design Automation honored Markov with an Outstanding New Faculty Award in 2004.[18]

Markov was the 2009 recipient of IEEE CEDA Ernest S. Kuh Early Career Award "for outstanding contributions to algorithms, methodologies and software for the physical design of integrated circuits."[19][20] Markov became ACM Distinguished Scientist in 2011.[21][22] In 2013 he was named an IEEE fellow[23] "for contributions to optimization methods in electronic design automation".[24]

Award-winning publications

Markov's peer-reviewed scholarly work was recognized with five best-paper awards, including four at major conferences and a journal in the field of electronic design automation, and one in theoretical computer science:

Books and other publications

Markov co-authored over 200 peer-reviewed publications in journals and archival conference proceedings, and Google Scholar reported over 19,000 citations of his publications as of October 2023.

In a 2014 Nature article,[37] Markov surveyed known limits to computation, pointing out that many of them are fairly lose and do not restrict near-term technologies. When practical technologies encounter serious limits, understanding these limits can lead to workarounds. More often, what is practically achievable depends on technology-specific engineering limitations.

In 2024, Markov published a paper in Communications of the ACM critical of a prior Nature publication on chip design. [38] [39]

Markov co-edited the two-volume Electronic Design Automation handbook published in second edition by Taylor & Francis in 2016.[40] He also co-authored five scholarly books published by Springer, among them are two textbooks:

Markov's other books cover uncertainty in logic circuits,[44] dealing with functional design errors in digital circuits,[45] and physical synthesis of integrated circuits.[46]

Key technical contributions

Quantum computing

Markov’s contributions include results on quantum circuit synthesis (creating circuits from specifications) and simulation of quantum circuits on conventional computers (obtaining the output of a quantum computer without a quantum computer).

  • An algorithm for the synthesis of linear reversible circuits with at most O(n2/logn) CNOT gates (asymptotically optimal)[47] that was extended by Scott Aaronson and Daniel Gottesman to perform optimal synthesis of Clifford circuits,[48] with applications to quantum error correction.
  • Optimal synthesis of a two-qubit unitary that uses the minimal number of CNOT gates[49][50]
  • Asymptotically optimal synthesis of an n-qubit quantum circuit that (a) implements a given unitary matrix using no more than(23/48)×4n(3/2)×2n+4/3 CNOT gates (less than a factor of two away from the theoretical lower bound) and (b) induces an initial quantum state using no more than 2n+12n CNOT gates (less than a factor of four away from the theoretical lower bound).[49] IBM Qiskit uses Markov's circuit synthesis algorithm.[51]
  • Efficient simulation of quantum circuits with low tree-width using tensor-network contraction.[52] Follow-up works extended this technique with approximations, which allowed them to simulate quantum Fourier transform in poly time.[53][54] Markov's work was used in an essential way in the first proof (by Dorit Aharonov et al.) that quantum Fourier transform can be classically simulated.[53]

Physical design of integrated circuits

Markov's Capo placer[55] provided a baseline for comparisons used in the placement literature. The placer was commercialized and used to design industry chips.[56] Markov's contributions include algorithms, methodologies and software for

  • Circuit partitioning:[57][58] high-performance heuristic optimizations for hypergraph partitioning
  • Placement:[34][55] algorithms for finding (x,y) locations of circuit components that optimize interconnects between those components
  • Floorplanning:[59] algorithms and methodologies for chip planning in terms of locations of large components
  • Routing:[60] algorithms based on Lagrangian relaxation to construct global wire routs on a multilayer grid structure
  • Physical synthesis:[30] algorithms and methodologies for altering logic circuits to admit layouts with shorter interconnects or lower latency

Machine learning

Markov led the development of an end-to-end AI platform called Looper, which supports the full machine learning lifecycle from model training, deployment, and inference all the way to evaluation and tuning of products. Looper provides easy-to-use APIs for optimization, personalization, and feedback collection.[12][61][62]

Activity on social media

Markov was awarded a Top Writer status on Quora in 2018, 2017, 2016, 2015 and 2014, he has over 80,000 followers. His contributions were republished by Huffington Post, Slate, and Forbes.[63]

Markov is a moderator for the cs.ET (Emerging Technologies in Computing and Communications) subject area on arXiv.

Notes

Template:Notelist

References

  1. 1.0 1.1 Template:Cite web
  2. Template:Cite web
  3. Template:Cite web
  4. Template:Cite web
  5. Template:Cite web
  6. Template:Cite web
  7. 7.0 7.1 Template:Cite web
  8. Template:Cite patent
  9. Template:Cite patent
  10. Template:Cite web
  11. Template:Cite web
  12. 12.0 12.1 Template:Cite web
  13. Template:Cite web
  14. Template:Cite journal
  15. Template:Cite web
  16. Template:Cite web
  17. Template:Cite web
  18. Template:Cite web
  19. Template:Cite web
  20. Template:Cite news
  21. Template:Cite web
  22. Template:Cite web
  23. Template:Cite web
  24. Template:Cite web
  25. Template:Cite journal
  26. Template:Cite web
  27. Template:Cite journal
  28. Template:Cite web
  29. Template:Cite journal
  30. 30.0 30.1 Template:Cite journal
  31. Template:Cite web
  32. Template:Cite journal
  33. Template:Cite web
  34. 34.0 34.1 Template:Cite journal
  35. Template:Cite book
  36. Template:Cite web
  37. Template:Cite journal
  38. Template:Cite journal
  39. Template:Cite web
  40. Template:Cite book
  41. Template:Cite book
  42. Template:Cite book
  43. Template:Cite book
  44. Template:Cite book
  45. Template:Cite book
  46. Template:Cite book
  47. Template:Cite journal
  48. Template:Cite journal
  49. 49.0 49.1 Template:Cite journal
  50. Template:Cite journal
  51. Template:Cite journal
  52. Template:Cite journal
  53. 53.0 53.1 Template:Cite arXiv
  54. Template:Cite journal
  55. 55.0 55.1 Template:Cite book
  56. Template:Cite web
  57. Template:Cite journal
  58. Template:Cite journal
  59. Template:Cite journal
  60. Template:Cite journal
  61. Template:Cite book
  62. Template:Cite AV media
  63. Template:Cite web

Template:Authority control