Yanzhu Chen

Yanzhu Chen

Auto-generated profile, based on publicly available information

Yanzhu Chen

Department of Physics Virginia Tech 24061 Blacksburg VA

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
10 November 2021 in PRX Quantum
Verified
Journal Article
Open access
PDF file
ASArmands Strikis
Armands Strikis
DQDayue Qin
Dayue Qin
YCYanzhu Chen
Yanzhu Chen
SBSimon C. Benjamin
Simon C. Benjamin
YLYing Li
Ying Li
If noisy-intermediate-scale-quantum-era quantum computers are to perform useful tasks, they will need to employ powerful error mitigation techniques. Quasiprobability methods can permit perfect error compensation at the cost of additional circuit executions, provided that the nature of the error model is fully understood and sufficiently local both spatially and temporally. Unfortunately, these conditions are challenging to satisfy. Here we present a method by which the proper compensation strategy can instead be learned ab initio. Our training process uses multiple variants of the primary circuit where all non-Clifford gates are substituted with gates that are efficient to simulate classically. The process yields a configuration that is near optimal versus noise in the real system with its non-Clifford gate set. Having presented a range of learning strategies, we demonstrate the power of the technique both with real quantum hardware (IBM devices) and exactly emulated imperfect quantum computers. The systems suffer a range of noise severities and types, including spatially and temporally correlated variants. In all cases the protocol successfully adapts to the noise and mitigates it to a high degree.

13 November 2019 in Physical Review A
Verified
Journal Article
Closed access
PDF file
YCYanzhu Chen
Yanzhu Chen
MFMaziar Farahzad
Maziar Farahzad
SYShinjae Yoo
Shinjae Yoo
TWTzu-Chieh Wei
Tzu-Chieh Wei
We use quantum detector tomography to characterize the qubit readout in terms of measurement positive operator-valued measures (POVMs) on IBM quantum computers IBM Q 5 Tenerife and IBM Q 5 Yorktown. Our results suggest that the characterized detector model deviates from the ideal projectors, ranging from 10 to 40%. This is mostly dominated by classical errors, evident from the shrinkage of arrows from the poles in the corresponding Bloch-vector representations. There are also small deviations that are not “classical,” of order 3% or less, represented by the tilt of the arrows from the z axis. Further improvement on this characterization can be made by adopting two- or more-qubit detector models instead of independent single-qubit detectors for all the qubits in one device. We also find evidence indicating correlations in the detector behavior, i.e., the detector characterization is slightly altered (to a few percent) when other qubits and their detectors are in operation. Such peculiar behavior is consistent with characterization from the more sophisticated approach of the gate set tomography. We also discuss how the characterized detectors' POVMs, despite deviation from the ideal projectors, can be used to estimate the ideal detection distribution.

7 March 2024 in Physical Review Research
Verified
Journal Article
Open access
PDF file
PAPanagiotis G. Anastasiou
Panagiotis G. Anastasiou
YCYanzhu Chen
Yanzhu Chen
NMNicholas J. Mayhall
Nicholas J. Mayhall
EBEdwin Barnes
Edwin Barnes
SESophia E. Economou
Sophia E. Economou
Adaptive quantum variational algorithms are particularly promising for simulating strongly correlated systems on near-term quantum hardware, but they are not yet viable due, in large part, to the severe coherence time limitations on current devices. In this paper, we introduce an algorithm called TETRIS-ADAPT-VQE (tiling efficient trial circuits with rotations implemented simultaneously adaptive derivative-assembled problem-tailored Ansatz variational quantum eigensolver), which iteratively builds up variational Ansätze a few operators at a time in a way dictated by the problem being simulated. This algorithm is a modified version of the ADAPT-VQE algorithm, in which the one-operator-at-a-time rule is lifted to allow for the addition of multiple operators with disjoint supports in each iteration. TETRIS-ADAPT-VQE results in denser but significantly shallower circuits, without increasing the number of controlled-not gates or variational parameters. Its advantage over the original algorithm in terms of circuit depths increases with the system size. Moreover, the expensive step of measuring the energy gradient with respect to each candidate unitary at each iteration is performed only a fraction of the time compared with ADAPT-VQE. These improvements bring us closer to the goal of demonstrating a practical quantum advantage on quantum hardware.

19 September 2024 in ACM Transactions on Quantum Computing
Verified
Journal Article
Open access
JAJames Ang
James Ang
GCGabriella Carini
Gabriella Carini
YCYanzhu Chen
Yanzhu Chen
ICIsaac Chuang
Isaac Chuang
MDMichael Demarco
Michael Demarco
YZYiyu Zhou
Yiyu Zhou
Many proposals to scale quantum technology rely on modular or distributed designs wherein individual quantum processors, called nodes, are linked together to form one large multinode quantum computer (MNQC). One scalable method to construct an MNQC is using superconducting quantum systems with optical interconnects. However, internode gates in these systems may be two to three orders of magnitude noisier and slower than local operations. Surmounting the limitations of internode gates will require improvements in entanglement generation, use of entanglement distillation, and optimized software and compilers. Still, it remains unclear what performance is possible with current hardware and what performance algorithms require. In this article, we employ a systems analysis approach to quantify overall MNQC performance in terms of hardware models of internode links, entanglement distillation, and local architecture. We show how to navigate tradeoffs in entanglement generation and distillation in the context of algorithm performance, lay out how compilers and software should balance between local and internode gates, and discuss when noisy quantum internode links have an advantage over purely classical links. We find that a factor of 10–100× better link performance is required and introduce a research roadmap for the co-design of hardware and software towards the realization of early MNQCs. While we focus on superconducting devices with optical interconnects, our approach is general across MNQC implementations.

11 April 2023 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
DQDayue Qin
Dayue Qin
YCYanzhu Chen
Yanzhu Chen
YLYing Li
Ying Li
Quantum computing promises advantages over classical computing in many problems. Nevertheless, noise in quantum devices prevents most quantum algorithms from achieving the quantum advantage. Quantum error mitigation provides a variety of protocols to handle such noise using minimal qubit resources. While some of those protocols have been implemented in experiments for a few qubits, it remains unclear whether error mitigation will be effective in quantum circuits with tens to hundreds of qubits. In this paper, we apply statistics principles to quantum error mitigation and analyse the scaling behaviour of its intrinsic error. We find that the error increases linearly O(ϵN) with the gate number N before mitigation and sublinearly $$O({\epsilon }^{{\prime} }{N}^{\gamma })$$ O ( ϵ ′ N γ ) after mitigation, where γ ≈ 0.5, ϵ is the error rate of a quantum gate, and $${\epsilon }^{{\prime} }$$ ϵ ′ is a protocol-dependent factor. The $$\sqrt{N}$$ N scaling is a consequence of the law of large numbers, and it indicates that error mitigation can suppress the error by a larger factor in larger circuits. We propose the importance Clifford sampling as a key technique for error mitigation in large circuits to obtain this result.

1 January 2022
Verified
Conference Paper
Closed access
PDF file
YCYanzhu Chen
Yanzhu Chen
LZLinghua Zhu
Linghua Zhu
NMNicholas J. Mayhall
Nicholas J. Mayhall
EBEdwin Barnes
Edwin Barnes
SESophia E. Economou
Sophia E. Economou
ADAPT-QAOA, a novel problem-tailored version of quantum approximate optimization algorithm, speeds up convergence using entangling operators while reducing the total number of CNOTs. We explore how much entanglement is required to speed up optimization algorithms.