Yuxuan Yan
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
Research Interests
Yuxuan Yan has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Muzhou Ma
Tsinghua University
1 shared publication - Sitian Qian
Peking University
1 shared publication Tianyi Yang
School of Physics, Peking University, Beijing 100871, China
1 shared publication- Xiongfeng Ma
Tsinghua University
1 shared publication - Yixuan Wang
California Institute of Technology
1 shared publication - You Zhou
Fudan University
1 shared publication
Latest Publications
- 30 April 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 134 (17) , 170601
Variational LOCC-Assisted Quantum Circuits for Long-Range Entangled States
Long-range entanglement is an important quantum resource, particularly for topological orders and quantum error correction. In reality, preparing long-range entangled states requires a deep unitary circuit, which poses significant experimental challenges. A promising avenue is offered by replacing some quantum resources with local operations and classical communication (LOCC). With these classical components, one can communicate outcomes of midcircuit measurements in distant subsystems, substantially reducing circuit depth in many important cases. However, to prepare general long-range entangled states, finding LOCC-assisted circuits of a short depth remains an open question. Here, to address this challenge, we propose a quantum-classical hybrid algorithm to find optimal LOCC protocols for preparing ground states of given Hamiltonians. In our algorithm, we introduce an efficient way to estimate parameter gradients and use such gradients for variational optimization. Theoretically, we establish the conditions for the absence of barren plateaus, ensuring trainability at a large system size. Numerically, the algorithm accurately solves the ground state of long-range entangled models, such as the perturbed Greenberger-Horne-Zeilinger state and surface code. Our results demonstrate the advantage of our method over conventional unitary variational circuits: the practical advantage in the accuracy of estimated ground-state energy and the theoretical advantage in creating long-range entanglement.
- 30 April 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 134 (17) , 170601
Variational LOCC-Assisted Quantum Circuits for Long-Range Entangled States
Long-range entanglement is an important quantum resource, particularly for topological orders and quantum error correction. In reality, preparing long-range entangled states requires a deep unitary circuit, which poses significant experimental challenges. A promising avenue is offered by replacing some quantum resources with local operations and classical communication (LOCC). With these classical components, one can communicate outcomes of midcircuit measurements in distant subsystems, substantially reducing circuit depth in many important cases. However, to prepare general long-range entangled states, finding LOCC-assisted circuits of a short depth remains an open question. Here, to address this challenge, we propose a quantum-classical hybrid algorithm to find optimal LOCC protocols for preparing ground states of given Hamiltonians. In our algorithm, we introduce an efficient way to estimate parameter gradients and use such gradients for variational optimization. Theoretically, we establish the conditions for the absence of barren plateaus, ensuring trainability at a large system size. Numerically, the algorithm accurately solves the ground state of long-range entangled models, such as the perturbed Greenberger-Horne-Zeilinger state and surface code. Our results demonstrate the advantage of our method over conventional unitary variational circuits: the practical advantage in the accuracy of estimated ground-state energy and the theoretical advantage in creating long-range entanglement.
- 20 August 2021
- Published by American Physical Society (APS) in Physical Review E
- Vol. 104 (2) , 025307
Schrödinger principal-component analysis: On the duality between principal-component analysis and the Schrödinger equation
Principal component analysis (PCA) has been applied to analyze random fields in various scientific disciplines. However, the explainability of PCA remains elusive unless strong domain-specific knowledge is available. This paper provides a theoretical framework that builds a duality between the PCA eigenmodes of a random field and eigenstates of a Schrödinger equation. Based on the duality we propose the Schrödinger PCA algorithm to replace the expensive PCA solver with a more sample-efficient Schrödinger equation solver. We verify the validity of the theory and the effectiveness of the algorithm with numerical experiments.
- 20 August 2021
- Published by American Physical Society (APS) in Physical Review E
- Vol. 104 (2) , 025307
Schrödinger principal-component analysis: On the duality between principal-component analysis and the Schrödinger equation
Principal component analysis (PCA) has been applied to analyze random fields in various scientific disciplines. However, the explainability of PCA remains elusive unless strong domain-specific knowledge is available. This paper provides a theoretical framework that builds a duality between the PCA eigenmodes of a random field and eigenstates of a Schrödinger equation. Based on the duality we propose the Schrödinger PCA algorithm to replace the expensive PCA solver with a more sample-efficient Schrödinger equation solver. We verify the validity of the theory and the effectiveness of the algorithm with numerical experiments.