Dmitri Maslov

  1. Home
  2. Wiki
Dmitri Aleksandrovich Maslov
Born (1977-04-02) April 2, 1977 (age 48)[1]
Alma mater
Scientific career
FieldsComputer Science, Electrical Engineering, Optimization, Electronic Design Automation, Quantum Computing
InstitutionsNational Science Foundation, University of Maryland, IBM
Thesis Reversible Logic Synthesis  (2003)
Doctoral advisorGerhard W. Dueck

Dmitri Aleksandrovich Maslov (born April 2, 1977) is a Canadian-American computer scientist renowned for contributions to quantum circuit synthesis, optimization, and benchmarking. He has held senior research and leadership roles at IBM Quantum, the U.S. National Science Foundation, and (since July 2024) Google Quantum AI.”[2][3][4] In 2021, he was named a Fellow of the Institute of Electrical and Electronics Engineers.[5][6]

Biography

[edit]

Maslov was born on April 2, 1977. He earned an M.Sc. in mathematics from Moscow State University, Russia in 2000 and completed M.Sc. and Ph.D. degrees in computer science at the University of New Brunswick, Canada in 2003.[1][7]

Career

[edit]

Early career

[edit]

Following completion of his doctorate, Maslov held various postdoctoral fellow positions between 2003 and 2008, including those at the University of Victoria and the University of Waterloo's Institute for Quantum Computing (IQC). From 2008 to 2010, he served as Research Assistant Professor at IQC/UWaterloo in the Department of Physics and Astronomy, followed by an Adjunct Professor position from 2010 to 2013. From 2015 to 2016, he was a visiting fellow at the Joint Center for Quantum Information and Computer Science at the University of Maryland.[8]

Senior appointments

[edit]

From 2008 to 2018, Maslov was a Program Director with the Division of Computing and Communication Foundations and the Directorate for Computer and Information Science and Engineering, National Science Foundation,[9] where he managed multi-million-dollar awards and helped launch the “Connections in Quantum Information Science” meta-program.[10] From January 2019 to July 2024, Maslov served as Chief Software Architect at IBM Quantum, leading development of compilers, simulators, and verification tools for superconducting and trapped-ion architectures. In this role, he provided technical leadership and direction for the development of the software stack for quantum computers, while simultaneously conducting research in quantum compilation, quantum circuit design and optimization, quantum advantage, and quantum computer architectures.[11]

In 2024, Maslov joined Google (Quantum Artificial Intelligence Lab),[2][3] where he performs research in quantum computing and co-maintains the open-source software for Q#-compatible and OpenQASM compilers integrated into Google Quantum AI’s Cirq framework, enabling widespread access to advanced optimization algorithms in open-source quantum software libraries.[12]

Research contributions

[edit]

Maslov’s work spans theoretical and practical aspects of quantum‐circuit design, compilation, and optimization. Key contributions include:

  • Reversible circuit synthesis - Developed algorithms for synthesizing reversible Boolean functions using minimal numbers of Toffoli and CNOT gates, or alternatively circuit cost metrics (along with appropriate gate‐count lower bounds). These include a highly-cited simple, efficient, and high-performing MMD algorithm for reversible logic synthesis.[13] Maslov's 2007 framework for optimized reversible circuit synthesis reduced gate counts by up to 40% compared to prior methods.[14]
  • Frameworks for reversible and quantum circuit optimization - Introduced and developed two variants of the templates optimization technique for classes of circuits of interest,[15][16] as well as phase polynomial framework for quantum circuit optimization, now considered standard in the field.[17][18]
  • Clifford and Clifford+T circuit synthesis - Obtained multiple results on the synthesis and optimization of circuits with Clifford gates, including short layered decomposition of the form -X-Z-P-CX-CZ-H-CZ-H-P, exact (in the number of the degrees of freedom) parametrization of Clifford group elements by quantum circuits, and computational advantage by Clifford circuits over classical reversible CNOT circuits.[19] Developed optimal synthesis of Z-angle rotations over Clifford+T gate library.[20] Introduced techniques for minimizing the number of expensive T gates in Clifford+T circuits, including heuristics that exploit ancilla qubits and parallelization to reduce T-depth. His 2014 phase polynomial method achieved T-count reductions up to 50% on standard benchmarks.[21]
  • Synthesis and optimization for common operations and subcircuits - Developed depth optimal quantum circuit synthesis method for frequently used quantum logical operations.[17] Described optimization of multiple-control Toffoli-gate implementation using relative-phase Toffoli gates[26]
  • Estimation and benchmarking of quantum advantage - Led development of quantum-vs-classical benchmarking protocols, including the first resource-estimation study for demonstrating quantum advantage in space-limited scenarios, establishing benchmarks for near-term quantum devices.[27]
  • Low-overhead, fault-tolerant memory - Contributed to the design of bicycle bivariate quantum LDPC codes with the error threshold comparable to the industry-standard surface code yet a 10x reduction in the physical qubit count, leading to a high-threshold low-overhead fault-tolerant quantum memory.[28]

Awards and recognition

[edit]

In 2021, Maslov was named a Fellow of the Institute of Electrical and Electronics Engineers "for contributions to quantum circuit synthesis and optimization, and compiling for quantum computers".[5][6] He has been recognized as an Outstanding Reviewer for Quantum Science and Technology journal.[29]

Maslov's research work indexed by Google Scholar shows over 12,500 citations and h-index of 51.[30]

References

[edit]
  1. ^ a b Maslov, Dmitri. "Curriculum Vitae" (PDF). p. 1. Retrieved August 9, 2025.
  2. ^ a b "Dmitri Maslov". LinkedIn. Retrieved August 9, 2025.
  3. ^ a b Maslov, Dmitri (2025). "Recent developments in quantum circuit synthesis". Nature Reviews Physics.
  4. ^ "Staff Directory: Dmitri Maslov". National Science Foundation. Retrieved August 11, 2023.
  5. ^ a b "IEEE Fellows 2021 Class Announced". December 2, 2020.
  6. ^ a b "CEDA IEEE Fellows". Council for Electronic Design Automation. Retrieved August 11, 2023.
  7. ^ Maslov, Dmitri (2003). Reversible Logic Synthesis (PDF) (PhD thesis). Fredericton, Canada: University of New Brunswick. Retrieved 2025-08-09.
  8. ^ "Dmitri Maslov | QuICS". quics.umd.edu. Retrieved 2023-10-03.
  9. ^ "Dmitri Maslov biography". IEEE Explore. Retrieved 2023-10-03.
  10. ^ "Advancing Quantum Information Science (NSTC Report)" (PDF). National Science and Technology Council. Retrieved September 11, 2020.
  11. ^ "The Quantum Leap with Dmitri Maslov". Software Engineering Daily. 2022-10-17. Retrieved 2025-08-09.
  12. ^ "Cirq optimization module". Google Quantum AI. Retrieved August 8, 2025.
  13. ^ D. Michael Miller; Dmitri Maslov; Gerhard W. Dueck (2003). "A transformation based algorithm for reversible logic synthesis". Proceedings of the 40th annual Design Automation Conference. pp. 318–323. doi:10.1145/775832.775915. ISBN 1581136889. S2CID 322347.
  14. ^ Maslov, Dmitri; Dueck, Gerhard W.; Miller, D. Michael (2007). "Techniques for the synthesis of reversible Toffoli networks". ACM Transactions on Design Automation of Electronic Systems. 12 (4): 42:1–42:28. arXiv:quant-ph/0607166. doi:10.1145/1278349.1278355.
  15. ^ Maslov, D.; Dueck, G.W.; Miller, D.M. (2005). "Toffoli network synthesis with templates". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 24 (6): 807–817. Bibcode:2005ITCAD..24..807M. doi:10.1109/TCAD.2005.847911. Retrieved 2023-10-03.
  16. ^ Dmitri Maslov; Gerhard W. Dueck; D. Michael Miller; Camille Negrevergne (2008). "Quantum circuit simplification and level compaction". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 27 (3): 436–444. arXiv:quant-ph/0604001. Bibcode:2008ITCAD..27..436M. doi:10.1109/TCAD.2007.911334. S2CID 10269741.
  17. ^ a b Matthew Amy; Dmitri Maslov; Michele Mosca; Martin Roetteler (2013). "A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 32 (6): 818–830. arXiv:1206.0758. Bibcode:2013ITCAD..32..818A. doi:10.1109/TCAD.2013.2244643. S2CID 6879679.
  18. ^ Yunseong Nam; Neil J. Ross; Yuan Su; Andrew M. Childs; Dmitri Maslov (2018). "Automated optimization of large quantum circuits with continuous parameters". npj Quantum Information. 4 (23): 23. arXiv:1710.07345. Bibcode:2018npjQI...4...23N. doi:10.1038/s41534-018-0072-4.
  19. ^ Sergey Bravyi; Dmitri Maslov (2021). "Hadamard-free circuits expose the structure of the Clifford group". IEEE Transactions on Information Theory. 67 (7): 4546–4563. arXiv:2003.09412. Bibcode:2021ITIT...67.4546B. doi:10.1109/TIT.2021.3081415. S2CID 214605790.
  20. ^ Vadym Kliuchnikov; Dmitri Maslov; Michele Mosca (2013). "Fast and efficient exact synthesis of single-qubit unitaries generated by Clifford and T gates". Quantum Information and Computation. 12 (7–8): 607–630. arXiv:1206.5236.
  21. ^ Amy, Michał; Maslov, Dmitri; Mosca, Michele (2014). "Polynomial-time T-count optimization of Clifford+T circuits via matroid partitioning". Proceedings of the 46th ACM Symposium on Theory of Computing. pp. 363–372. doi:10.1145/2591796.2591848.
  22. ^ Maslov, Dmitri (2017). "Basic circuit compilation techniques for an ion-trap quantum machine". New Journal of Physics. 19: 023035. arXiv:1603.07678. doi:10.1088/1367-2630/aa5e47.
  23. ^ Figgatt, Caroline; Ostrander, Aaron; Linke, Norbert M.; Landsman, Kimberly A.; Zhu, Dian; Maslov, Dmitri; Monroe, Christopher (2019). "Parallel entangling operations on a universal ion-trap quantum computer". Nature. 572 (7769): 368–372. arXiv:1810.11948. doi:10.1038/s41586-019-1427-5. PMID 31341283.
  24. ^ Maslov, Dmitri; Nam, Yunseong (2018). "Use of global interactions in efficient quantum circuit constructions". New Journal of Physics. 20 (3): 033018. arXiv:1707.06356. doi:10.1088/1367-2630/aaa398.
  25. ^ Bravyi, Sergey; Maslov, Dmitri; Nam, Yunseong (2022). "Constant-cost implementations of Clifford operations and multiply-controlled gates using global interactions". Physical Review Letters. 129: 230501. arXiv:2207.08691. doi:10.1103/PhysRevLett.129.230501. PMID 36563200.
  26. ^ Maslov, Dmitri (2016-02-10). "Advantages of using relative-phase Toffoli gates with an application to multiple control Toffoli optimization". Physical Review A. 93 (2) 022311. arXiv:1508.03273. Bibcode:2016PhRvA..93b2311M. doi:10.1103/PhysRevA.93.022311.
  27. ^ Maslov, Dmitri (2020). "Quantum advantage for computations with limited space". Nature Physics. 17 (8): 894–897. arXiv:2008.06478. doi:10.1038/s41567-021-01271-7.
  28. ^ Bravyi, Sergey; Cross, Andrew W.; Gambetta, Jay M.; Maslov, Dmitri; Rall, Patrick; Yoder, Theodore J. (2024). "High-threshold and low-overhead fault-tolerant quantum memory". Nature. 627 (8005): 778–782. arXiv:2308.07915. doi:10.1038/s41586-024-07107-7. PMID 38538939.
  29. ^ "Quantum Science and Technology: 2021 Outstanding Reviewer Awards". IOPscience - Publishing Support. Retrieved 2025-08-09.
  30. ^ "Dmitri Maslov". Google Scholar. Retrieved 2025-08-09.
[edit]