Optimizing compiler for Fermion simulation circuits

ORAL

Abstract

Jordan-Wigner and Bravyi-Kitaev transformations are the two widely known examples of the Fermion $\rightarrow$ qubit operator mappings. There exist however at least $O(2^{n^2})$ possible such mappings. Thus, an appropriate choice of the mapping can result in the reduction of quantum resource cost in practice, such as two-qubit gate counts in Fermion-simulation circuits. In this talk, I will present a methodology that may be used to optimize these simulation circuits, leveraging the vastly large space from which a suitable mapping may be drawn. A series of heuristics will be explored to arrive at the post-optimization quantum circuits.

*This work is supported by the IARPA LogiQ program, the ARO MURI on Modular Quantum Systems, the ARL Center for Distributed Quantum Information, the NSF QIS program, the NSF PFCQC Program, the DOE BES QIS Program, the DOE HEP QuantISED Program, and the NSF Physics Frontier Center at JQI.

–

Presenters

  • Qingfeng Wang

    • University of Maryland, College Park

Authors

  • Qingfeng Wang

    • University of Maryland, College Park

  • Yunseong Nam

    • IonQ
    • IONQ
    • IonQ, Inc

  • Christopher Roy Monroe

    • University of Maryland, College Park
    • University of Maryland Department of Physics and NIST
    • Physics, University of Maryland
    • University of Maryland
    • Joint Quantum Institute, University of Maryland
    • Department of Physics & Joint Quantum Institute, University of Maryland, College Park