Yunong Shi (石雨浓)

2024

1. ASPLOS

   Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding

   Yuhao Liu, Shize Che, Junyu Zhou, and 2 more authors

   ASPLOS, 2024

   Abs Bib PDF

   This paper introduces Fermihedral, a compiler framework focusing on discovering the optimal Fermion-to-qubit encoding for targeted Fermionic Hamiltonians. Fermion-to-qubit encoding is a crucial step in harnessing quantum computing for efficient simulation of Fermionic quantum systems. Utilizing Pauli algebra, Fermihedral redefines complex constraints and objectives of Fermion-to-qubit encoding into a Boolean Satisfiability problem which can then be solved with high-performance solvers. To accommodate larger-scale scenarios, this paper proposed two new strategies that yield approximate optimal solutions mitigating the overhead from the exponentially large number of clauses. Evaluation across diverse Fermionic systems highlights the superiority of Fermihedral, showcasing substantial reductions in implementation costs, gate counts, and circuit depth in the compiled circuits. Real-system experiments on IonQ’s device affirm its effectiveness, notably enhancing simulation accuracy.

   @article{fermihedral,
     author = {Liu, Yuhao and Che, Shize and Zhou, Junyu and Shi, Yunong and Li, Gushu},
     title = {Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding},
     year = {2024},
     isbn = {979-8-4007-0386},
     publisher = {Association for Computing Machinery},
     address = {La Jolla, CA, USA},
     url = {https://doi.org/10.1145/3620666.3651371},
     doi = {10.1145/3620666.3651371},
     journal = {ASPLOS},
     location = {La Jolla, CA, USA},
     series = {ASPLOS '24},
   }

2. ASPLOS

   Elivagar: Efficient Quantum Circuit Search for Classification

   Sashwat Anagolum, Narges Alavisamani, Poulami Das, and 3 more authors

   ASPLOS, 2024

   Bib PDF

   @article{elivagar,
     author = {Anagolum, Sashwat and Alavisamani, Narges and Das, Poulami and Qureshi, Moinuddin and Kessler, Eric and Shi, Yunong},
     title = {Elivagar: Efficient Quantum Circuit Search for Classification},
     year = {2024},
     publisher = {Association for Computing Machinery},
     address = {San Diego, CA, USA},
     journal = {ASPLOS},
     keywords = {quantum machine learning, compilation},
     location = {San Diego, CA, USA},
     series = {ASPLOS '24},
   }

2023

1. HPCA

   The Imitation Game: Leveraging CopyCats for Robust Native Gate Selection in NISQ Programs

   Poulami Das, Eric Kessler, and Yunong Shi

   HPCA, 2023

   Bib PDF

   @article{hpca23_imitation_game,
     author = {Das, Poulami and Kessler, Eric and Shi, Yunong},
     journal = {HPCA},
     title = {The Imitation Game: Leveraging CopyCats for Robust Native Gate Selection in NISQ Programs},
     year = {2023},
   }

2020

1. PIEEE

   Resource-Efficient Quantum Computing by Breaking Abstractions

   Yunong Shi, Pranav Gokhale, Prakash Murali, and 11 more authors

   Proceedings of the IEEE, 2020

   Abs Bib PDF

   Building a quantum computer that surpasses the computational power of its classical counterpart is a great engineering challenge. Quantum software optimizations can provide an accelerated pathway to the first generation of quantum computing applications that might save years of engineering effort. Current quantum software stacks follow a layered approach similar to the stack of classical computers, which was designed to manage the complexity. In this review, we point out that greater efficiency of quantum computing systems can be achieved by breaking the abstractions between these layers. We review several works along this line, including two hardware-aware compilation optimizations that break the quantum Instruction Set Architecture (ISA) abstraction and two error-correction/informationprocessing schemes that break the qubit abstraction. Last, we discuss several possible future directions.

   @article{9116963,
     author = {Shi, Yunong and Gokhale, Pranav and Murali, Prakash and Baker, Jonathan M. and Duckering, Casey and Ding, Yongshan and Brown, Natalie C. and Chamberland, Christopher and Javadi-Abhari, Ali and Cross, Andrew W. and Schuster, David I. and Brown, Kenneth R. and Martonosi, Margaret and Chong, Frederic T.},
     journal = {Proceedings of the IEEE},
     title = {Resource-Efficient Quantum Computing by Breaking Abstractions},
     year = {2020},
     volume = {108},
     number = {8},
     pages = {1353-1370},
     doi = {10.1109/JPROC.2020.2994765},
   }

2019

1. ASPLOS

   Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers

   Yunong Shi, Nelson Leung, Pranav Gokhale, and 4 more authors

   ASPLOS, 2019

   Abs Bib PDF

   Recent developments in engineering and algorithms have made real-world applications in quantum computing possible in the near future. Existing quantum programming languages and compilers use a quantum assembly language composed of 1- and 2-qubit (quantum bit) gates. Quantum compiler frameworks translate this quantum assembly to electric signals (called control pulses) that implement the specified computation on specific physical devices. However, there is a mismatch between the operations defined by the 1- and 2-qubit logical ISA and their underlying physical implementation, so the current practice of directly translating logical instructions into control pulses results in inefficient, high-latency programs. To address this inefficiency, we propose a universal quantum compilation methodology that aggregates multiple logical operations into larger units that manipulate up to 10 qubits at a time. Our methodology then optimizes these aggregates by (1) finding commutative intermediate operations that result in more efficient schedules and (2) creating custom control pulses optimized for the aggregate (instead of individual 1- and 2-qubit operations). Compared to the standard gate-based compilation, the proposed approach realizes a deeper vertical integration of high-level quantum software and low-level, physical quantum hardware. We evaluate our approach on important near-term quantum applications on simulations of superconducting quantum architectures. Our proposed approach provides a mean speedup of 5times, with a maximum of 10times. Because latency directly affects the feasibility of quantum computation, our results not only improve performance but also have the potential to enable quantum computation sooner than otherwise possible.

   @article{10.1145/3297858.3304018,
     author = {Shi, Yunong and Leung, Nelson and Gokhale, Pranav and Rossi, Zane and Schuster, David I. and Hoffmann, Henry and Chong, Frederic T.},
     title = {Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers},
     year = {2019},
     isbn = {9781450362405},
     publisher = {Association for Computing Machinery},
     address = {New York, NY, USA},
     url = {https://doi.org/10.1145/3297858.3304018},
     doi = {10.1145/3297858.3304018},
     journal = {ASPLOS},
     pages = {1031–1044},
     numpages = {14},
     keywords = {quantum optimal control, compiler optimization, quantum computing},
     location = {Providence, RI, USA},
     series = {ASPLOS '19},
   }

2. NJP

   Fault-tolerant preparation of approximate GKP states

   Yunong Shi, Christopher Chamberland, and Andrew Cross

   New Journal of Physics, Sep 2019

   Abs Bib PDF

   Gottesman–Kitaev–Preskill (GKP) states appear to be amongst the leading candidates for correcting errors when encoding qubits into oscillators. However the preparation of GKP states remains a significant theoretical and experimental challenge. Until now, no clear definitions for fault-tolerantly preparing GKP states have been provided. Without careful consideration, a small number of faults can lead to large uncorrectable shift errors. After proposing a metric to compare approximate GKP states, we provide rigorous definitions of fault-tolerance and introduce a fault-tolerant phase estimation protocol for preparing such states. The fault-tolerant protocol uses one flag qubit and accepts only a subset of states in order to prevent measurement readout errors from causing large shift errors. We then show how the protocol can be implemented using circuit QED. In doing so, we derive analytic expressions which describe the leading order effects of the nonlinear dispersive shift and Kerr nonlinearity. Using these expressions, we show that to mitigate the nonlinear dispersive shift and Kerr terms would require the protocol to be implemented on time scales four orders of magnitude longer than the time scales relevant to the protocol for physically motivated parameters. Despite these restrictions, we numerically show that a subset of the accepted states of the fault-tolerant phase estimation protocol maintain good error correcting capabilities even in the presence of noise.

   @article{Shi_2019,
     author = {Shi, Yunong and Chamberland, Christopher and Cross, Andrew},
     doi = {10.1088/1367-2630/ab3a62},
     journal = {New Journal of Physics},
     month = sep,
     number = {9},
     pages = {093007},
     publisher = {{IOP} Publishing},
     title = {Fault-tolerant preparation of approximate {GKP} states},
     url = {https://doi.org/10.1088/1367-2630/ab3a62},
     volume = {21},
     year = {2019},
     bdsk-url-1 = {https://doi.org/10.1088/1367-2630/ab3a62},
   }