Yongshan Ding

Yongshan Ding

Auto-generated profile, based on publicly available information

Yongshan Ding

Yale University, New Haven, Connecticut, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 November 2020 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
PGPranav Gokhale
Pranav Gokhale
OAOlivia Angiuli
Olivia Angiuli
YDYongshan Ding
Yongshan Ding
KGKaiwen Gui
Kaiwen Gui
TTTeague Tomesh
Teague Tomesh
FCFred Chong
Fred Chong
Variational quantum eigensolver (VQE) is a promising algorithm for near-term quantum machines. It can be used to estimate the ground state energy of a molecule by performing separate measurements of O(N 4 ) terms. This quartic scaling appears to be a significant obstacle to practical applications. However, we note that it empirically reduces to O(N 3 ) when we partition the terms into linear-sized commuting families that can be measured simultaneously. We confirm these empirical observations by studying the MIN-COMMUTING-PARTITION problem at the level of the fermionic Hamiltonian and its encoding into qubits. Moreover, we provide a fast, precomputable procedure for creating linearly sized commuting partitions by solving a round-robin scheduling problem via flow networks. In addition, we demonstrate how to construct the quantum circuits necessary for simultaneous measurement, and we discuss the statistical implication of simultaneous measurement. Our results are experimentally validated by a ground state estimation of deuteron with low shot budget on a 20-qubit IBM machine.

15 June 2020 in Proceedings of the IEEE
Verified
Journal Article
Closed access
YSYunong Shi
Yunong Shi
PGPranav Gokhale
Pranav Gokhale
PMPrakash Murali
Prakash Murali
JBJonathan M. Baker
Jonathan M. Baker
CDCasey Duckering
Casey Duckering
FCFred Chong
Fred Chong
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 (QC) 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 QC 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/information-processing schemes that break the qubit abstraction. Last, we discuss several possible future directions.

17 January 2024 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
ZLZhiding Liang
Zhiding Liang
JCJinglei Cheng
Jinglei Cheng
HRHang Ren
Hang Ren
HWHanrui Wang
Hanrui Wang
FHFei Hua
Fei Hua
YSYiyu Shi
Yiyu Shi
Variational quantum algorithms (VQAs) have demonstrated great potentials in the noisy intermediate scale quantum (NISQ) era. In the workflow of VQA, the parameters of ansatz are iteratively updated to approximate the desired quantum states. We have seen various efforts to draft better ansatz with less gates. Some works consider the physical meaning of the underlying circuits, while others adopt the ideas of neural architecture search (NAS) for ansatz generator. However, these designs do not exploit the full advantages of VQAs. Because most techniques target gate ansatz, and the parameters are usually rotation angles of the gates. In quantum computers, the gate ansatz will eventually be transformed into control signals such as microwave pulses on superconducting qubits. These control pulses need elaborate calibrations to minimize the errors, such as over-rotation and under-rotation. In the case of VQAs, this procedure will introduce redundancy, but the variational properties of VQAs can naturally handle problems of over-rotation and under-rotation by updating the amplitude and frequency parameters. Therefore, we propose NAPA , a native-pulse ansatz generator framework for VQAs. We generate native-pulse ansatz with trainable parameters for amplitudes and frequencies. In our proposed NAPA , we are tuning parametric pulses, which are natively supported on NISQ computers. Given the limited availability of gradient-based optimizers for pulse-level quantum programs, we choose to deploy nongradient optimizers in our framework. To constrain the number of parameters sent to the optimizer, we adopt a progressive way to generate our native-pulse ansatz. Experiments are conducted on both simulators and quantum devices for variational quantum eigensolver (VQE) tasks to envaluate our methods. When adopted on NISQ machines, NAPA obtained improved the performance with decreased latency by an average of 86%. NAPA is able to achieve 96.482% and 99.336% accuracy for VQE tasks on H2 and HeH+, respectively. An average accuracy of 97.27% is achieved for medium-size quantum chemistry tasks on CO2, H2O, and NaH. NAPA also demonstrates advantages on quantum optimization tasks even with considerable noises in NISQ machines.

28 October 2023
Verified
Conference Paper
Open access
SXShifan Xu
Shifan Xu
CHConnor T. Hann
Connor T. Hann
BFBen Foxman
Ben Foxman
SGSteven M. Girvin
Steven M. Girvin
YDYongshan Ding
Yongshan Ding
Operating on the principles of quantum mechanics, quantum algorithms hold the promise for solving problems that are beyond the reach of the best-available classical algorithms. An integral part of realizing such speedup is the implementation of quantum queries, which read data into forms that quantum computers can process. Quantum random access memory (QRAM) is a promising architecture for realizing quantum queries. However, implementing QRAM in practice poses significant challenges, including query latency, memory capacity and fault-tolerance. In this paper, we propose the first end-to-end system architecture for QRAM. First, we introduce a novel QRAM that hybridizes two existing implementations and achieves asymptotically superior scaling in space (qubit number) and time (circuit depth). Like in classical virtual memory, our construction enables queries to a virtual address space larger than what is actually available in hardware. Second, we present a compilation framework to synthesize, map, and schedule QRAM circuits on realistic hardware. For the first time, we demonstrate how to embed large-scale QRAM on a 2D Euclidean space, such as a 2D square grid layout, with minimal routing overhead. Third, we show how to leverage the intrinsic biased-noise resilience of the proposed QRAM for implementation on either Noisy Intermediate-Scale Quantum (NISQ) or Fault-Tolerant Quantum Computing (FTQC) hardware. Finally, we validate these results numerically via both classical simulation and quantum hardware experimentation. Our novel Feynman-path-based simulator allows for efficient simulation of noisy QRAM circuits at a larger scale than previously possible. Collectively, our results outline the set of software and hardware controls needed to implement practical QRAM.

30 March 2025
Verified
Conference Paper
Open access
SSSamuel Stein
Samuel Stein
SXShifan Xu
Shifan Xu
ACAndrew W. Cross
Andrew W. Cross
TYTheodore J. Yoder
Theodore J. Yoder
AJAli Javadi-Abhari
Ali Javadi-Abhari
ALAng Li
Ang Li

6 January 2023 in Computer
Verified
Journal Article
Closed access
GBGregory T. Byrd
Gregory T. Byrd
YDYongshan Ding
Yongshan Ding
The field of quantum computers has reached the point of having real systems available for experimentation to a broad community. In this article, we review recent developments in hardware technology, outline challenges and innovations in quantum systems, and discuss efforts to cultivate and educate a quantum-ready community.