Zhenyu Du
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Zhenyu Du has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Xiongfeng Ma
Tsinghua University
4 shared publications - Guoding Liu
Tsinghua University
2 shared publications - Zi-Wen Liu
Tsinghua University
2 shared publications - Andreas Elben
Paul Scherrer Institute
1 shared publication - Elias X. Huber
Peking University
1 shared publication Ingo Roth
Technology Innovation Institute
1 shared publication
Latest Publications
- Open Access
- 27 October 2026
- Published by American Physical Society (APS) in Physical Review X
- Vol. 16 (4) , 041027
Certifying Localizable Quantum Properties with Constant Sample Complexity
Characterizing increasingly complex quantum systems is a central task in quantum information science, yet experimental costs often scale prohibitively with system size. Certifying key properties using simple local measurements is highly desirable but challenging. In this work, we introduce a highly general certification framework based on a physical phenomenon that we call localizable quantumness: for generic many-body states, essential quantum properties are robustly preserved within the projected ensembles on small subsystems after performing local projective measurements on the rest of the system. Leveraging this insight, we develop protocols to certify global properties—including multipartite entanglement, circuit complexity, and quantum magic—by witnessing them on a small, accessible subsystem. Remarkably, randomizing the local measurement bases extends this capability to certify state fidelity. Relying solely on local Pauli measurements, these protocols achieve constant sample complexity and robustness for almost all quantum states, including a wide range of physically relevant states. For certifying the fidelity of n -qubit states, this O ( 1 ) scaling dramatically improves upon state-of-the-art protocols requiring O ( n 4 ) samples. Our unified framework provides both a practical toolkit for large-scale quantum certification and a novel lens into complex many-body systems.
- 27 October 2026
- Published by American Physical Society (APS) in Physical Review X
- Vol. 16 (4) , 041027
Open AccessCertifying Localizable Quantum Properties with Constant Sample Complexity
Characterizing increasingly complex quantum systems is a central task in quantum information science, yet experimental costs often scale prohibitively with system size. Certifying key properties using simple local measurements is highly desirable but challenging. In this work, we introduce a highly general certification framework based on a physical phenomenon that we call localizable quantumness: for generic many-body states, essential quantum properties are robustly preserved within the projected ensembles on small subsystems after performing local projective measurements on the rest of the system. Leveraging this insight, we develop protocols to certify global properties—including multipartite entanglement, circuit complexity, and quantum magic—by witnessing them on a small, accessible subsystem. Remarkably, randomizing the local measurement bases extends this capability to certify state fidelity. Relying solely on local Pauli measurements, these protocols achieve constant sample complexity and robustness for almost all quantum states, including a wide range of physically relevant states. For certifying the fidelity of n -qubit states, this O ( 1 ) scaling dramatically improves upon state-of-the-art protocols requiring O ( n 4 ) samples. Our unified framework provides both a practical toolkit for large-scale quantum certification and a novel lens into complex many-body systems.
- Open Access
- 27 June 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
No cloning of quantum ensembles
Modern quantum physics now enables control of quantum systems at the level of individual trajectories, opening a new frontier that links quantum information theory, quantum many-body physics, and quantum thermodynamics, and uncovers novel non-equilibrium phenomena such as deep thermalization and measurement-induced entanglement. However, a central challenge remains: their characterization relies on measuring nonlinear properties of individual quantum states, a task tantamount to fine-grained cloning of a quantum ensemble. Here, the fundamental laws governing the cloning of quantum ensembles are investigated. First, a general no-cloning theorem for arbitrary ensembles is established from an information-theoretic perspective, even assuming multiple copies of the ensemble's purification. It is then shown that this barrier can be unexpectedly circumvented for physical ensembles generated by finite-time evolutions. Nevertheless, these tasks are proven to remain computationally intractable, even when the full circuit description of state preparation is known. This stands in sharp contrast to the conventional no-cloning theorem, which relies on the state being unknown. Together, these results establish new fundamental principles of quantum mechanics, reveal intrinsic trade-offs among sample complexity, computational complexity, and quantum measurements, and highlight the necessity of problem-specific strategies for probing measurement-induced quantum phenomena.
- 27 June 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
Open AccessNo cloning of quantum ensembles
Modern quantum physics now enables control of quantum systems at the level of individual trajectories, opening a new frontier that links quantum information theory, quantum many-body physics, and quantum thermodynamics, and uncovers novel non-equilibrium phenomena such as deep thermalization and measurement-induced entanglement. However, a central challenge remains: their characterization relies on measuring nonlinear properties of individual quantum states, a task tantamount to fine-grained cloning of a quantum ensemble. Here, the fundamental laws governing the cloning of quantum ensembles are investigated. First, a general no-cloning theorem for arbitrary ensembles is established from an information-theoretic perspective, even assuming multiple copies of the ensemble's purification. It is then shown that this barrier can be unexpectedly circumvented for physical ensembles generated by finite-time evolutions. Nevertheless, these tasks are proven to remain computationally intractable, even when the full circuit description of state preparation is known. This stands in sharp contrast to the conventional no-cloning theorem, which relies on the state being unknown. Together, these results establish new fundamental principles of quantum mechanics, reveal intrinsic trade-offs among sample complexity, computational complexity, and quantum measurements, and highlight the necessity of problem-specific strategies for probing measurement-induced quantum phenomena.
- Open Access
- 26 March 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (1)
Optimal Randomized Measurements for a Family of Nonlinear Quantum Properties
Quantum learning encounters fundamental challenges when estimating nonlinear properties, owing to the inherent linearity of quantum mechanics. Although recent advances in single-copy randomized measurement protocols have achieved optimal sample complexity for specific tasks like state purity estimation, generalizing these protocols to estimate broader classes of nonlinear properties without sacrificing optimality remains an open problem. In this work, we introduce the observable-driven randomized measurement (ORM) protocol enabling the estimation of Tr ( O ρ 2 ) for an arbitrary observable O —an essential quantity in quantum computing and many-body physics. We establish an upper bound for ORM’s sample complexity and show its optimality for observables with a large trace-norm, including Pauli and local observables, closing a gap in the literature. For these observables, ORM admits an efficient implementation with Clifford circuits. Numerical experiments validate that ORM requires substantially fewer state samples to achieve the same precision compared to classical shadows. Additionally, we introduce a braiding randomized measurement protocol for multiple low-rank nonlinear observables, reducing circuit complexities in practical applications.
- 26 March 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (1)
Open AccessOptimal Randomized Measurements for a Family of Nonlinear Quantum Properties
Quantum learning encounters fundamental challenges when estimating nonlinear properties, owing to the inherent linearity of quantum mechanics. Although recent advances in single-copy randomized measurement protocols have achieved optimal sample complexity for specific tasks like state purity estimation, generalizing these protocols to estimate broader classes of nonlinear properties without sacrificing optimality remains an open problem. In this work, we introduce the observable-driven randomized measurement (ORM) protocol enabling the estimation of Tr ( O ρ 2 ) for an arbitrary observable O —an essential quantity in quantum computing and many-body physics. We establish an upper bound for ORM’s sample complexity and show its optimality for observables with a large trace-norm, including Pauli and local observables, closing a gap in the literature. For these observables, ORM admits an efficient implementation with Clifford circuits. Numerical experiments validate that ORM requires substantially fewer state samples to achieve the same precision compared to classical shadows. Additionally, we introduce a braiding randomized measurement protocol for multiple low-rank nonlinear observables, reducing circuit complexities in practical applications.
- Top Cited PapersOpen Access
- 13 February 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (1)
Approximate Quantum Error Correction with 1D Log-Depth Circuits
Efficient and high-performance quantum error correction is essential for achieving fault-tolerant quantum computing. Low-depth random circuits offer a promising approach to identifying effective and practical encoding strategies. In this work, we rigorously prove through information-theoretic analysis that one-dimensional logarithmic-depth random Clifford encoding circuits can achieve high quantum error correction performance. We demonstrate that these random codes typically exhibit good approximate quantum error correction capability by proving that their encoding rate achieves the hashing bound for Pauli noise and the channel capacity for erasure errors. We show that the error correction inaccuracy decays once a threshold of logarithmic depth is exceeded, resulting in negligible recovery errors. This threshold is shown to be lower than that of the simple separate block encoding, and the decay rate is higher. We further establish that these codes are optimal by proving that logarithmic depth is necessary to maintain a constant encoding rate and high error correction performance. To prove our results, we propose decoupling theorems tailored for one-dimensional low-depth circuits. These results also imply strong decoupling and rapid thermalization properties in low-depth random circuits and have potential applications in quantum information science and physics.
- 13 February 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (1)
Top Cited PapersOpen AccessApproximate Quantum Error Correction with 1D Log-Depth Circuits
Efficient and high-performance quantum error correction is essential for achieving fault-tolerant quantum computing. Low-depth random circuits offer a promising approach to identifying effective and practical encoding strategies. In this work, we rigorously prove through information-theoretic analysis that one-dimensional logarithmic-depth random Clifford encoding circuits can achieve high quantum error correction performance. We demonstrate that these random codes typically exhibit good approximate quantum error correction capability by proving that their encoding rate achieves the hashing bound for Pauli noise and the channel capacity for erasure errors. We show that the error correction inaccuracy decays once a threshold of logarithmic depth is exceeded, resulting in negligible recovery errors. This threshold is shown to be lower than that of the simple separate block encoding, and the decay rate is higher. We further establish that these codes are optimal by proving that logarithmic depth is necessary to maintain a constant encoding rate and high error correction performance. To prove our results, we propose decoupling theorems tailored for one-dimensional low-depth circuits. These results also imply strong decoupling and rapid thermalization properties in low-depth random circuits and have potential applications in quantum information science and physics.
- Open Access
- 20 December 2024
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 10 (1) , 015050
Advantage distillation for quantum key distribution
Quantum key distribution promises information-theoretically secure communication, with data post-processing playing a vital role in extracting secure keys from raw data. While hardware advancements have significantly improved practical implementations, optimizing post-processing techniques offers a cost-effective avenue to enhance performance. Advantage distillation, which extends beyond standard information reconciliation and privacy amplification, has proven instrumental in various post-processing methods. However, the optimal post-processing remains an open question. Therefore, it is important to develop a comprehensive framework to encapsulate and enhance these existing methods. In this work, we propose an advantage distillation framework for quantum key distribution, generalizing and unifying existing key distillation protocols. Inspired by entanglement distillation, our framework not only integrates current techniques but also improves upon them. Notably, by employing classical linear codes, we achieve higher key rates, particularly in scenarios where one-time pad encryption is not used for post-processing. Our approach provides insights into existing protocols and offers a systematic way for further enhancements in quantum key distribution.
- 20 December 2024
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 10 (1) , 015050
Open AccessAdvantage distillation for quantum key distribution
Quantum key distribution promises information-theoretically secure communication, with data post-processing playing a vital role in extracting secure keys from raw data. While hardware advancements have significantly improved practical implementations, optimizing post-processing techniques offers a cost-effective avenue to enhance performance. Advantage distillation, which extends beyond standard information reconciliation and privacy amplification, has proven instrumental in various post-processing methods. However, the optimal post-processing remains an open question. Therefore, it is important to develop a comprehensive framework to encapsulate and enhance these existing methods. In this work, we propose an advantage distillation framework for quantum key distribution, generalizing and unifying existing key distillation protocols. Inspired by entanglement distillation, our framework not only integrates current techniques but also improves upon them. Notably, by employing classical linear codes, we achieve higher key rates, particularly in scenarios where one-time pad encryption is not used for post-processing. Our approach provides insights into existing protocols and offers a systematic way for further enhancements in quantum key distribution.