Junyu Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Recognitions
Junyu Liu has a total of 197 co-authors. Here are the top co-authors by number of shared publications:
- Liang Jiang
University of Chicago
17 shared publications - Yehao Zhou
Kavli Institute for the Physics and Mathematics of the Universe (WPI), University of Tokyo, Kashiwa, Japan
7 shared publications - Zimu Li
Yau Mathematical Sciences Center, Tsinghua University, Beijing, China
7 shared publications - David Simmons-Duffin
Caltech
5 shared publications Han Zheng
University of Chicago
5 shared publications- Han Zheng
The University of Chicago
5 shared publications
Latest Publications
- Open Access
- 27 January 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 7 (2) , 1-26
qSIEVE: Efficient qLDPC Memory via Systolic Movement in Atom Arrays
As quantum machines have scaled up in their number of qubits, significant research has turned towards increasing their fidelity with quantum error correction codes. Although promising results have been shown with the surface code, which only requires near-neighbor connections between qubits, the high qubit overhead of such local codes promises to be problematic. Consequently, recent work has explored non-local quantum LDPC (qLDPC) codes, which have good asymptotic encoding rates. Despite theoretical progress, hardware implementations of these codes have been a longstanding challenge. At the experimental level, demonstrations of movement based communication on atom arrays suggest this is a powerful new primitive to achieve non-local connectivity. Leveraging this, we present a protocol for implementing non-local qLDPC codes in hardware. Our protocol, qSIEVE, is a co-design of such codes with movement in atom arrays. qSIEVE defines a restricted family of qLDPC codes that can be implemented efficiently with systolic movement. We then quantify the utility of qSIEVE in the context of a complete fault tolerant architecture. We compare the cost of implementing benchmark programs in a standard, surface code only architecture and a mixed architecture where data is stored in qLDPC memory with qSIEVE and loaded to surface codes for computation.
- 27 January 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 7 (2) , 1-26
Open AccessqSIEVE: Efficient qLDPC Memory via Systolic Movement in Atom Arrays
As quantum machines have scaled up in their number of qubits, significant research has turned towards increasing their fidelity with quantum error correction codes. Although promising results have been shown with the surface code, which only requires near-neighbor connections between qubits, the high qubit overhead of such local codes promises to be problematic. Consequently, recent work has explored non-local quantum LDPC (qLDPC) codes, which have good asymptotic encoding rates. Despite theoretical progress, hardware implementations of these codes have been a longstanding challenge. At the experimental level, demonstrations of movement based communication on atom arrays suggest this is a powerful new primitive to achieve non-local connectivity. Leveraging this, we present a protocol for implementing non-local qLDPC codes in hardware. Our protocol, qSIEVE, is a co-design of such codes with movement in atom arrays. qSIEVE defines a restricted family of qLDPC codes that can be implemented efficiently with systolic movement. We then quantify the utility of qSIEVE in the context of a complete fault tolerant architecture. We compare the cost of implementing benchmark programs in a standard, surface code only architecture and a mixed architecture where data is stored in qLDPC memory with qSIEVE and loaded to surface codes for computation.
- Open Access
- 7 January 2026
- Published by Springer Nature in npj Drug Discovery
- Vol. 3 (1)
Quantum-machine-assisted drug discovery
Drug discovery is lengthy and expensive, with traditional computer-aided design facing limits. This paper examines integrating quantum computing across the drug development cycle to accelerate and enhance workflows and rigorous decision-making. It highlights quantum approaches for molecular simulation, drug-target interaction prediction, and optimizing clinical trials. Leveraging quantum capabilities could accelerate timelines and costs for bringing therapies to market, improving efficiency and ultimately benefiting public health.
- 7 January 2026
- Published by Springer Nature in npj Drug Discovery
- Vol. 3 (1)
Open AccessQuantum-machine-assisted drug discovery
Drug discovery is lengthy and expensive, with traditional computer-aided design facing limits. This paper examines integrating quantum computing across the drug development cycle to accelerate and enhance workflows and rigorous decision-making. It highlights quantum approaches for molecular simulation, drug-target interaction prediction, and optimizing clinical trials. Leveraging quantum capabilities could accelerate timelines and costs for bringing therapies to market, improving efficiency and ultimately benefiting public health.
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44, 5955-5969
A Linear Secret Sharing Framework for Hybrid Quantum and Post-Quantum Cryptography
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44, 5955-5969
Open AccessA Linear Secret Sharing Framework for Hybrid Quantum and Post-Quantum Cryptography
- 19 November 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (5)
Toward superpolynomial quantum speedup of equivariant quantum algorithms with SU ( d ) symmetry
- 19 November 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (5)
Toward superpolynomial quantum speedup of equivariant quantum algorithms with SU ( d ) symmetry
- Open Access
- 8 October 2025
- Published by Springer Nature in npj Quantum Information
- Vol. 11 (1) , 1-10
SU(d)-symmetric random unitaries: quantum scrambling, error correction, and machine learning
- 8 October 2025
- Published by Springer Nature in npj Quantum Information
- Vol. 11 (1) , 1-10
Open AccessSU(d)-symmetric random unitaries: quantum scrambling, error correction, and machine learning
- Open Access
Towards efficient and secure quantum-classical communication networks
The rapid advancement of quantum technologies calls for the design and deployment of quantum-safe cryptographic protocols and communication networks. There are two primary approaches to achieving quantum-resistant security: quantum key distribution (QKD) and post-quantum cryptography (PQC). While each offers unique advantages, both have drawbacks in practical implementation. In this work, we introduce the pros and cons of these protocols and explore how they can be combined to achieve a higher level of security and/or improved performance in key distribution. We hope our discussion inspires further research into the design of hybrid cryptographic protocols for quantum-classical communication networks.
Open AccessTowards efficient and secure quantum-classical communication networks
The rapid advancement of quantum technologies calls for the design and deployment of quantum-safe cryptographic protocols and communication networks. There are two primary approaches to achieving quantum-resistant security: quantum key distribution (QKD) and post-quantum cryptography (PQC). While each offers unique advantages, both have drawbacks in practical implementation. In this work, we introduce the pros and cons of these protocols and explore how they can be combined to achieve a higher level of security and/or improved performance in key distribution. We hope our discussion inspires further research into the design of hybrid cryptographic protocols for quantum-classical communication networks.
- Open Access
- 29 October 2024
- Published by Springer Nature in Nature Communications
- Vol. 15 (1) , 1-12
Dynamical transition in controllable quantum neural networks with large depth
Understanding the training dynamics of quantum neural networks is a fundamental task in quantum information science with wide impact in physics, chemistry and machine learning. In this work, we show that the late-time training dynamics of quantum neural networks with a quadratic loss function can be described by the generalized Lotka-Volterra equations, leading to a transcritical bifurcation transition in the dynamics. When the targeted value of loss function crosses the minimum achievable value from above to below, the dynamics evolve from a frozen-kernel dynamics to a frozen-error dynamics, showing a duality between the quantum neural tangent kernel and the total error. In both regions, the convergence towards the fixed point is exponential, while at the critical point becomes polynomial. We provide a non-perturbative analytical theory to explain the transition via a restricted Haar ensemble at late time, when the output state approaches the steady state. Via mapping the Hessian to an effective Hamiltonian, we also identify a linearly vanishing gap at the transition point. Compared with the linear loss function, we show that a quadratic loss function within the frozen-error dynamics enables a speedup in the training convergence. The theory findings are verified experimentally on IBM quantum devices.
- 29 October 2024
- Published by Springer Nature in Nature Communications
- Vol. 15 (1) , 1-12
Open AccessDynamical transition in controllable quantum neural networks with large depth
Understanding the training dynamics of quantum neural networks is a fundamental task in quantum information science with wide impact in physics, chemistry and machine learning. In this work, we show that the late-time training dynamics of quantum neural networks with a quadratic loss function can be described by the generalized Lotka-Volterra equations, leading to a transcritical bifurcation transition in the dynamics. When the targeted value of loss function crosses the minimum achievable value from above to below, the dynamics evolve from a frozen-kernel dynamics to a frozen-error dynamics, showing a duality between the quantum neural tangent kernel and the total error. In both regions, the convergence towards the fixed point is exponential, while at the critical point becomes polynomial. We provide a non-perturbative analytical theory to explain the transition via a restricted Haar ensemble at late time, when the output state approaches the steady state. Via mapping the Hessian to an effective Hamiltonian, we also identify a linearly vanishing gap at the transition point. Compared with the linear loss function, we show that a quadratic loss function within the frozen-error dynamics enables a speedup in the training convergence. The theory findings are verified experimentally on IBM quantum devices.
- Top Cited Papers
- 15 October 2024
- Published by IOP Publishing in Reports on Progress in Physics
- Vol. 87 (11) , 116402
A comprehensive review of quantum machine learning: from NISQ to fault tolerance
Quantum machine learning, which involves running machine learning algorithms on quantum devices, has garnered significant attention in both academic and business circles. In this paper, we offer a comprehensive and unbiased review of the various concepts that have emerged in the field of quantum machine learning. This includes techniques used in Noisy Intermediate-Scale Quantum (NISQ) technologies and approaches for algorithms compatible with fault-tolerant quantum computing hardware. Our review covers fundamental concepts, algorithms, and the statistical learning theory pertinent to quantum machine learning.
- 15 October 2024
- Published by IOP Publishing in Reports on Progress in Physics
- Vol. 87 (11) , 116402
Top Cited PapersA comprehensive review of quantum machine learning: from NISQ to fault tolerance
Quantum machine learning, which involves running machine learning algorithms on quantum devices, has garnered significant attention in both academic and business circles. In this paper, we offer a comprehensive and unbiased review of the various concepts that have emerged in the field of quantum machine learning. This includes techniques used in Noisy Intermediate-Scale Quantum (NISQ) technologies and approaches for algorithms compatible with fault-tolerant quantum computing hardware. Our review covers fundamental concepts, algorithms, and the statistical learning theory pertinent to quantum machine learning.
- 5 September 2024
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 6 (2) , 1-15
Quantum power flows: from theory to practice
- 5 September 2024
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 6 (2) , 1-15
Quantum power flows: from theory to practice
- Open Access
- 27 August 2024
- Published by MDPI AG in Preprints.org
Quantum-Machine-Assisted Drug Discovery: Survey and Perspective
Drug discovery and development is a highly complex and costly endeavor, typically requiring over a decade and substantial financial investment to bring a new drug to market. Traditional computer-aided drug design (CADD) has made significant progress in accelerating this process, but the development of quantum computing offers potential due to its unique capabilities. This paper discusses the integration of quantum computing into drug discovery and development, focusing on how quantum technologies might accelerate and enhance various stages of the drug development cycle. Specifically, we explore the application of quantum computing in addressing challenges related to drug discovery, such as molecular simulation and the prediction of drug-target interactions, as well as the optimization of clinical trial outcomes. By leveraging the inherent capabilities of quantum computing, we might be able to reduce the time and cost associated with bringing new drugs to market, ultimately benefiting public health.
- 27 August 2024
- Published by MDPI AG in Preprints.org
Open AccessQuantum-Machine-Assisted Drug Discovery: Survey and Perspective
Drug discovery and development is a highly complex and costly endeavor, typically requiring over a decade and substantial financial investment to bring a new drug to market. Traditional computer-aided drug design (CADD) has made significant progress in accelerating this process, but the development of quantum computing offers potential due to its unique capabilities. This paper discusses the integration of quantum computing into drug discovery and development, focusing on how quantum technologies might accelerate and enhance various stages of the drug development cycle. Specifically, we explore the application of quantum computing in addressing challenges related to drug discovery, such as molecular simulation and the prediction of drug-target interactions, as well as the optimization of clinical trial outcomes. By leveraging the inherent capabilities of quantum computing, we might be able to reduce the time and cost associated with bringing new drugs to market, ultimately benefiting public health.