Jingwei Wen
Research Subjects
Jingwei Wen has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
Zhiguo Huang
7 shared publications- Chao Zheng
School of Energy Storage Science and Engineering, North China University of Technology, Beijing, China
6 shared publications - Gui-Lu Long
Beijing Academy of Quantum Information Sciences, Beijing, China.
4 shared publications Ling Qian
China Mobile (Suzhou) Software Technology Company Limited, Suzhou, China
4 shared publicationsDunbo Cai
China Mobile (Suzhou) Software Technology Company Limited, Suzhou, China
3 shared publications- Ling Qian
China Mobile (Suzhou) Software Technology Company Limited, Suzhou, China
3 shared publications
Latest Publications
- Open Access
- 23 September 2026
- Published by Springer Nature in npj Quantum Information
Complex-valued Quantum Neural Networks
- 23 September 2026
- Published by Springer Nature in npj Quantum Information
Open AccessComplex-valued Quantum Neural Networks
- 22 September 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (3) , 032617
Device-independent quantum digital signatures under realistic conditions
Quantum digital signatures (QDS) provide information-theoretic security for data integrity, authenticity, and nonrepudiation by exploiting the laws of quantum mechanics. While existing QDS protocols have achieved significant efficiency improvements via one-time universal hashing, they rely on trusted quantum devices, requiring precise characterization and stable calibration of state preparation and measurement processes, which in practice cannot be fully guaranteed. Here, we propose a device-independent QDS protocol based on the violation of Bell inequalities and the entropy accumulation theorem, thereby ensuring information-theoretic security against general coherent attacks without assumptions on the internal functioning of the devices. We analyze the protocol performance under realistic noise and loss models and show that it is feasible with current experimental technology over multikilometer distances. Furthermore, by leveraging state-of-the-art single-photon sources, the achievable distance can be extended to several tens of kilometers. Our results establish device-independent QDS as a practical and scalable cryptographic primitive for secure applications in quantum networks with untrusted devices.
- 22 September 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (3) , 032617
Device-independent quantum digital signatures under realistic conditions
Quantum digital signatures (QDS) provide information-theoretic security for data integrity, authenticity, and nonrepudiation by exploiting the laws of quantum mechanics. While existing QDS protocols have achieved significant efficiency improvements via one-time universal hashing, they rely on trusted quantum devices, requiring precise characterization and stable calibration of state preparation and measurement processes, which in practice cannot be fully guaranteed. Here, we propose a device-independent QDS protocol based on the violation of Bell inequalities and the entropy accumulation theorem, thereby ensuring information-theoretic security against general coherent attacks without assumptions on the internal functioning of the devices. We analyze the protocol performance under realistic noise and loss models and show that it is feasible with current experimental technology over multikilometer distances. Furthermore, by leveraging state-of-the-art single-photon sources, the achievable distance can be extended to several tens of kilometers. Our results establish device-independent QDS as a practical and scalable cryptographic primitive for secure applications in quantum networks with untrusted devices.
- 5 November 2025
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 202
Quantum dynamics of qutrit systems driven by the local non-Hermitian Hamiltonian
- 5 November 2025
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 202
Quantum dynamics of qutrit systems driven by the local non-Hermitian Hamiltonian
- Open Access
A Guiding Principle for Quantum State Discrimination in the Real-Spectrum Phase of P-Pseudo-Hermitian Systems
Quantum state discrimination (QSD) is a fundamental task in quantum information processing, improving the computation efficiency and communication security. Non-Hermitian (NH) PT-symmetric systems were found to be able to discriminate two quantum states better than the Hermitian strategy. In this work, we propose a QSD approach based on P-pseudo-Hermitian systems with real spectra. We theoretically prove the feasibility of realizing QSD in the real-spectrum phase of a P-pseudo-Hermitian system, i.e., two arbitrary non-orthogonal quantum states can be discriminated by a suitable P-pseudo-Hermitian Hamiltonian. In detail, we decide the minimal angular separation between two non-orthogonal quantum states for a fixed P-pseudo-Hermitian Hamiltonian, and we find the orthogonal evolution time is able to approach zero under suitable conditions, while both the trace distance and the quantum relative entropy are employed to judge their orthogonality. We give a criterion to choose the parameters of a P-pseudo-Hermitian Hamiltonian that evolves the two initial orthogonal states faster than a fixed arbitrary PT-symmetric one with an identical energy difference. Our work expands the NH family for QSD, and can be used to explore real quantum systems in the future.
Open AccessA Guiding Principle for Quantum State Discrimination in the Real-Spectrum Phase of P-Pseudo-Hermitian Systems
Quantum state discrimination (QSD) is a fundamental task in quantum information processing, improving the computation efficiency and communication security. Non-Hermitian (NH) PT-symmetric systems were found to be able to discriminate two quantum states better than the Hermitian strategy. In this work, we propose a QSD approach based on P-pseudo-Hermitian systems with real spectra. We theoretically prove the feasibility of realizing QSD in the real-spectrum phase of a P-pseudo-Hermitian system, i.e., two arbitrary non-orthogonal quantum states can be discriminated by a suitable P-pseudo-Hermitian Hamiltonian. In detail, we decide the minimal angular separation between two non-orthogonal quantum states for a fixed P-pseudo-Hermitian Hamiltonian, and we find the orthogonal evolution time is able to approach zero under suitable conditions, while both the trace distance and the quantum relative entropy are employed to judge their orthogonality. We give a criterion to choose the parameters of a P-pseudo-Hermitian Hamiltonian that evolves the two initial orthogonal states faster than a fixed arbitrary PT-symmetric one with an identical energy difference. Our work expands the NH family for QSD, and can be used to explore real quantum systems in the future.
- 22 January 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (1)
Quantum state engineering in three-level systems via Lewis-Riesenfeld invariants
- 22 January 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (1)
Quantum state engineering in three-level systems via Lewis-Riesenfeld invariants
- Open Access
- 6 July 2024
- Published by Springer Nature in Communications Physics
- Vol. 7 (1) , 1-10
Enhancing the expressivity of quantum neural networks with residual connections
In noisy intermediate-scale quantum era, the research on the combination of artificial intelligence and quantum computing has been greatly developed. Here we propose a quantum circuit-based algorithm to implement quantum residual neural networks, where the residual connection channels are constructed by introducing auxiliary qubits to data-encoding and trainable blocks in quantum neural networks. We prove that when this particular network architecture is applied to a l-layer data-encoding, the number of frequency generation forms extends from one, namely the difference of the sum of generator eigenvalues, to $${{{{{{{\mathcal{O}}}}}}}}({l}^{2})$$ , and the flexibility in adjusting Fourier coefficients can also be improved. It indicates that residual encoding can achieve better spectral richness and enhance the expressivity of various parameterized quantum circuits. Extensive numerical demonstrations in regression tasks and image classification are offered. Our work lays foundation for the complete quantum implementation of classical residual neural networks and offers a quantum feature map strategy for quantum machine learning.- 6 July 2024
- Published by Springer Nature in Communications Physics
- Vol. 7 (1) , 1-10
Open AccessEnhancing the expressivity of quantum neural networks with residual connections
In noisy intermediate-scale quantum era, the research on the combination of artificial intelligence and quantum computing has been greatly developed. Here we propose a quantum circuit-based algorithm to implement quantum residual neural networks, where the residual connection channels are constructed by introducing auxiliary qubits to data-encoding and trainable blocks in quantum neural networks. We prove that when this particular network architecture is applied to a l-layer data-encoding, the number of frequency generation forms extends from one, namely the difference of the sum of generator eigenvalues, to $${{{{{{{\mathcal{O}}}}}}}}({l}^{2})$$ , and the flexibility in adjusting Fourier coefficients can also be improved. It indicates that residual encoding can achieve better spectral richness and enhance the expressivity of various parameterized quantum circuits. Extensive numerical demonstrations in regression tasks and image classification are offered. Our work lays foundation for the complete quantum implementation of classical residual neural networks and offers a quantum feature map strategy for quantum machine learning. - Open Access
Enhancing the expressivity of quantum neural networks with residual connections
In the recent noisy intermediate-scale quantum era, the research on the combination of artificial intelligence and quantum computing has been greatly developed. Inspired by neural networks, developing quantum neural networks with specific structures is one of the most promising directions for improving network performance. In this work, we propose a quantum circuit-based algorithm to implement quantum residual neural networks (QResNets), where the residual connection channels are constructed by introducing auxiliary qubits to the data-encoding and trainable blocks of the quantum neural networks. Importantly, we prove that when this particular network architecture is applied to a $l$-layer data-encoding, the number of frequency generation forms can be extended from one, namely the difference of the sum of generator eigenvalues, to $\mathcal{O}(l^2)$. And the flexibility in adjusting the corresponding Fourier coefficients can also be improved due to the diversity of spectrum construction methods and the additional optimization degrees of freedom in the generalized residual operators. These results indicate that the residual encoding scheme can achieve better spectral richness and enhance the expressivity of various parameterized quantum circuits. Extensive numerical demonstrations in regression tasks of fitting various functions and applications in image classification with MNIST datasets are offered to present the expressivity enhancement. Our work lays the foundation for a complete quantum implementation of the classical residual neural networks and explores a new strategy for quantum feature map in quantum machine learning.Open AccessEnhancing the expressivity of quantum neural networks with residual connections
In the recent noisy intermediate-scale quantum era, the research on the combination of artificial intelligence and quantum computing has been greatly developed. Inspired by neural networks, developing quantum neural networks with specific structures is one of the most promising directions for improving network performance. In this work, we propose a quantum circuit-based algorithm to implement quantum residual neural networks (QResNets), where the residual connection channels are constructed by introducing auxiliary qubits to the data-encoding and trainable blocks of the quantum neural networks. Importantly, we prove that when this particular network architecture is applied to a $l$-layer data-encoding, the number of frequency generation forms can be extended from one, namely the difference of the sum of generator eigenvalues, to $\mathcal{O}(l^2)$. And the flexibility in adjusting the corresponding Fourier coefficients can also be improved due to the diversity of spectrum construction methods and the additional optimization degrees of freedom in the generalized residual operators. These results indicate that the residual encoding scheme can achieve better spectral richness and enhance the expressivity of various parameterized quantum circuits. Extensive numerical demonstrations in regression tasks of fitting various functions and applications in image classification with MNIST datasets are offered to present the expressivity enhancement. Our work lays the foundation for a complete quantum implementation of the classical residual neural networks and explores a new strategy for quantum feature map in quantum machine learning. - Open Access
- 4 January 2024
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 8, 1219
A full circuit-based quantum algorithm for excited-states in quantum chemistry
Utilizing quantum computer to investigate quantum chemistry is an important research field nowadays. In addition to the ground-state problems that have been widely studied, the determination of excited-states plays a crucial role in the prediction and modeling of chemical reactions and other physical processes. Here, we propose a non-variational full circuit-based quantum algorithm for obtaining the excited-state spectrum of a quantum chemistry Hamiltonian. Compared with previous classical-quantum hybrid variational algorithms, our method eliminates the classical optimization process, reduces the resource cost caused by the interaction between different systems, and achieves faster convergence rate and stronger robustness against noise without barren plateau. The parameter updating for determining the next energy-level is naturally dependent on the energy measurement outputs of the previous energy-level and can be realized by only modifying the state preparation process of ancillary system, introducing little additional resource overhead. Numerical simulations of the algorithm with hydrogen, LiH, H2O and NH3 molecules are presented. Furthermore, we offer an experimental demonstration of the algorithm on a superconducting quantum computing platform, and the results show a good agreement with theoretical expectations. The algorithm can be widely applied to various Hamiltonian spectrum determination problems on the fault-tolerant quantum computers.
- 4 January 2024
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 8, 1219
Open AccessA full circuit-based quantum algorithm for excited-states in quantum chemistry
Utilizing quantum computer to investigate quantum chemistry is an important research field nowadays. In addition to the ground-state problems that have been widely studied, the determination of excited-states plays a crucial role in the prediction and modeling of chemical reactions and other physical processes. Here, we propose a non-variational full circuit-based quantum algorithm for obtaining the excited-state spectrum of a quantum chemistry Hamiltonian. Compared with previous classical-quantum hybrid variational algorithms, our method eliminates the classical optimization process, reduces the resource cost caused by the interaction between different systems, and achieves faster convergence rate and stronger robustness against noise without barren plateau. The parameter updating for determining the next energy-level is naturally dependent on the energy measurement outputs of the previous energy-level and can be realized by only modifying the state preparation process of ancillary system, introducing little additional resource overhead. Numerical simulations of the algorithm with hydrogen, LiH, H2O and NH3 molecules are presented. Furthermore, we offer an experimental demonstration of the algorithm on a superconducting quantum computing platform, and the results show a good agreement with theoretical expectations. The algorithm can be widely applied to various Hamiltonian spectrum determination problems on the fault-tolerant quantum computers.
- Open Access
A full circuit-based quantum algorithm for excited-states in quantum chemistry
Utilizing quantum computer to investigate quantum chemistry is an important research field nowadays. In addition to the ground-state problems that have been widely studied, the determination of excited-states plays a crucial role in the prediction and modeling of chemical reactions and other physical processes. Here, we propose a non-variational full circuit-based quantum algorithm for obtaining the excited-state spectrum of a quantum chemistry Hamiltonian. Compared with previous classical-quantum hybrid variational algorithms, our method eliminates the classical optimization process, reduces the resource cost caused by the interaction between different systems, and achieves faster convergence rate and stronger robustness against noise without barren plateau. The parameter updating for determining the next energy-level is naturally dependent on the energy measurement outputs of the previous energy-level and can be realized by only modifying the state preparation process of ancillary system, introducing little additional resource overhead. Numerical simulations of the algorithm with hydrogen, LiH, H2O and NH3 molecules are presented. Furthermore, we offer an experimental demonstration of the algorithm on a superconducting quantum computing platform, and the results show a good agreement with theoretical expectations. The algorithm can be widely applied to various Hamiltonian spectrum determination problems on the fault-tolerant quantum computers.
Open AccessA full circuit-based quantum algorithm for excited-states in quantum chemistry
Utilizing quantum computer to investigate quantum chemistry is an important research field nowadays. In addition to the ground-state problems that have been widely studied, the determination of excited-states plays a crucial role in the prediction and modeling of chemical reactions and other physical processes. Here, we propose a non-variational full circuit-based quantum algorithm for obtaining the excited-state spectrum of a quantum chemistry Hamiltonian. Compared with previous classical-quantum hybrid variational algorithms, our method eliminates the classical optimization process, reduces the resource cost caused by the interaction between different systems, and achieves faster convergence rate and stronger robustness against noise without barren plateau. The parameter updating for determining the next energy-level is naturally dependent on the energy measurement outputs of the previous energy-level and can be realized by only modifying the state preparation process of ancillary system, introducing little additional resource overhead. Numerical simulations of the algorithm with hydrogen, LiH, H2O and NH3 molecules are presented. Furthermore, we offer an experimental demonstration of the algorithm on a superconducting quantum computing platform, and the results show a good agreement with theoretical expectations. The algorithm can be widely applied to various Hamiltonian spectrum determination problems on the fault-tolerant quantum computers.
- 3 August 2023
- Published by Springer Nature in Science China Physics, Mechanics & Astronomy
- Vol. 66 (9) , 1-8
Optical experimental solution for the multiway number partitioning problem and its application to computing power scheduling
- 3 August 2023
- Published by Springer Nature in Science China Physics, Mechanics & Astronomy
- Vol. 66 (9) , 1-8
Optical experimental solution for the multiway number partitioning problem and its application to computing power scheduling