Ling Qian
Ling Qian has a total of 89 co-authors. Here are the top co-authors by number of shared publications:
Zhiguo Huang
China Mobile (Suzhou) Software Technology Co., Ltd., Suzhou, China
5 shared publications- Dunbo Cai
China Mobile (Suzhou) Software Technology Company Limited, Suzhou, China
4 shared publications Dunbo Cai
China Mobile (Suzhou) Software Technology Company Limited, Suzhou, China
3 shared publications- Dunbo Cai
Center for Technology Research and Innovation, China Mobile (Suzhou) Software Technology Company Ltd., Suzhou, China
3 shared publications - Jingwei Wen
China Mobile (Suzhou) Software Technology Company Limited, Suzhou, China
3 shared publications - Tie-Jun Wang
Beijing University of Posts and Telecommunications
3 shared publications
Latest Publications
- 16 July 2026
- Published by Springer Nature in Science China Information Sciences
- Vol. 69 (8) , 180509
Efficient self-consistent quantum comb tomography on the product Stiefel manifold
- 16 July 2026
- Published by Springer Nature in Science China Information Sciences
- Vol. 69 (8) , 180509
Efficient self-consistent quantum comb tomography on the product Stiefel manifold
- Open Access
- 31 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Scalable Hybrid Quantum-Classical Optimization for the Traveling Salesman Problem
- 31 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Open AccessScalable Hybrid Quantum-Classical Optimization for the Traveling Salesman Problem
- Open Access
- 25 July 2025
- Published by Elsevier in NeuroImage
- Vol. 318, 121400
Reproducibility assessment of magnetic resonance spectroscopy of pregenual anterior cingulate cortex across sessions and vendors via the cloud computing platform CloudBrain-MRS
- 25 July 2025
- Published by Elsevier in NeuroImage
- Vol. 318, 121400
Open AccessReproducibility assessment of magnetic resonance spectroscopy of pregenual anterior cingulate cortex across sessions and vendors via the cloud computing platform CloudBrain-MRS
- 15 May 2025
- Published by Springer Nature in The European Physical Journal D
- Vol. 79 (5) , 1-6
On time slices, time complexity, and energy increase in implementing quantum adiabatic evolution by circuit model
- 15 May 2025
- Published by Springer Nature in The European Physical Journal D
- Vol. 79 (5) , 1-6
On time slices, time complexity, and energy increase in implementing quantum adiabatic evolution by circuit model
- 1 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (7) , 9682-9692
Solving Vehicle Routing Problem Using Grover Adaptive Search Algorithm
Intelligent Transportation Systems (ITS) occupy a pivotal position in the contemporary societal landscape, with one of their widespread applications being the vehicle routing problem, renowned for its classification as an NP-hard challenge. Traditional algorithms often require considerable time to address such problems or can only provide approximate solutions. Recent progress in quantum computation, however, offer a promising alternative by utilizing the parallelism inherent in quantum mechanics. In this study, we propose to solve the vehicle routing problem using the Grover adaptive algorithm. Compared to classical algorithms and existing quantum methods, our innovative algorithm achieves a quadratic speedup, with a time complexity of $O(K\sqrt{\frac{N}{M}})$. Additionally, it is applicable to a broader range of real-world scenarios, as it can directly handle linear inequality constraints without introducing slack variables. Notably, the algorithm operates independently of classical optimizers and gradient-based methods, thereby circumventing potential challenges such as the “barren plateaus” phenomenon. Experimental results from four instances demonstrate the feasibility and correctness of the proposed approach, highlighting its capability to handle inequality constraints easily.
- 1 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (7) , 9682-9692
Solving Vehicle Routing Problem Using Grover Adaptive Search Algorithm
Intelligent Transportation Systems (ITS) occupy a pivotal position in the contemporary societal landscape, with one of their widespread applications being the vehicle routing problem, renowned for its classification as an NP-hard challenge. Traditional algorithms often require considerable time to address such problems or can only provide approximate solutions. Recent progress in quantum computation, however, offer a promising alternative by utilizing the parallelism inherent in quantum mechanics. In this study, we propose to solve the vehicle routing problem using the Grover adaptive algorithm. Compared to classical algorithms and existing quantum methods, our innovative algorithm achieves a quadratic speedup, with a time complexity of $O(K\sqrt{\frac{N}{M}})$. Additionally, it is applicable to a broader range of real-world scenarios, as it can directly handle linear inequality constraints without introducing slack variables. Notably, the algorithm operates independently of classical optimizers and gradient-based methods, thereby circumventing potential challenges such as the “barren plateaus” phenomenon. Experimental results from four instances demonstrate the feasibility and correctness of the proposed approach, highlighting its capability to handle inequality constraints easily.
- Open Access
Single-State Multi-Party Quantum Key Agreement with Single-Particle Measurement
In this study, we propose a single-state multi-party quantum key agreement (MQKA) protocol with single-particle measurement. Firstly, a single-state three-party quantum key agreement protocol with single-particle measurement is introduced, followed by a security analysis that validated its capability to resist potential internal and external attacks. Furthermore, we utilize multi-particle entangled states to present a multi-party version of the single-state multi-party quantum key agreement with single-particle measurement. In comparison to previous MQKA protocols, our approach presents the following advantages: it employs one kind of multi-particle entangled state as the quantum resource; eliminates the need for entanglement swapping techniques, unitary operations, or pre-shared keys between participants; uses only the X measurement basis and Z measurement basis; transmits fewer qubits; consumes fewer qubits; and has higher qubit efficiency.
Open AccessSingle-State Multi-Party Quantum Key Agreement with Single-Particle Measurement
In this study, we propose a single-state multi-party quantum key agreement (MQKA) protocol with single-particle measurement. Firstly, a single-state three-party quantum key agreement protocol with single-particle measurement is introduced, followed by a security analysis that validated its capability to resist potential internal and external attacks. Furthermore, we utilize multi-particle entangled states to present a multi-party version of the single-state multi-party quantum key agreement with single-particle measurement. In comparison to previous MQKA protocols, our approach presents the following advantages: it employs one kind of multi-particle entangled state as the quantum resource; eliminates the need for entanglement swapping techniques, unitary operations, or pre-shared keys between participants; uses only the X measurement basis and Z measurement basis; transmits fewer qubits; consumes fewer qubits; and has higher qubit efficiency.
- Open AccessDetermination of Landé $g_J$ factor and Zeeman coefficients in ground-state $^{171}$Yb$^+$ and their applications to quantum frequency standardsWe report the determination of the Landé $g_J$ factor and Zeeman coefficients for the ground-state of $^{171}$Yb$^+$, relevant to microwave quantum frequency standards (QFSs). The $g_J$ factor is obtained by using two independent methods: multiconfiguration Dirac-Hartree-Fock and multireference configuration interaction, yielding a consistent value of 2.002615(70). The first- and second-order Zeeman coefficients are determined as 14,010.78(49) Hz/$μ$T and 31.0869(22) mHz/$μ$T$^2$, respectively, based on the calculated $g_J$ factor. These coefficients enable reduced magnetic-field-induced uncertainties, improving the accuracy of the $^{171}$Yb$^+$ microwave QFSs. The results reported in this work also offer potential for improved constraints on variations in fundamental constants through frequency comparisons, and advancing trapped-ion quantum computers based on the ground-state hyperfine splitting of $^{171}$Yb$^+$.Open AccessDetermination of Landé $g_J$ factor and Zeeman coefficients in ground-state $^{171}$Yb$^+$ and their applications to quantum frequency standardsWe report the determination of the Landé $g_J$ factor and Zeeman coefficients for the ground-state of $^{171}$Yb$^+$, relevant to microwave quantum frequency standards (QFSs). The $g_J$ factor is obtained by using two independent methods: multiconfiguration Dirac-Hartree-Fock and multireference configuration interaction, yielding a consistent value of 2.002615(70). The first- and second-order Zeeman coefficients are determined as 14,010.78(49) Hz/$μ$T and 31.0869(22) mHz/$μ$T$^2$, respectively, based on the calculated $g_J$ factor. These coefficients enable reduced magnetic-field-induced uncertainties, improving the accuracy of the $^{171}$Yb$^+$ microwave QFSs. The results reported in this work also offer potential for improved constraints on variations in fundamental constants through frequency comparisons, and advancing trapped-ion quantum computers based on the ground-state hyperfine splitting of $^{171}$Yb$^+$.
- 6 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (10) , 14375-14385
Quantum Blockchain Relying on Quantum Secure Direct Communication Network
As a popular decentralized and distributed database exhibiting transparency and unforgeability, blockchain has received widespread attention. At the time of writing, its security hinges on classical cryptography, which maintains a high grade of security by exploiting the potentially excessive computational complexity of mathematical problems to be solved by state-of-the-art computers. However, as computational technology develops, this encryption philosophy is likely to be challenged and there is a risk of “store now and decrypt later” attacks. A compelling solution to this security threat is to intrinsically integrate blockchain with quantum technology. Against this background, we propose a quantum blockchain scheme relying on quantum secure direct communication (QSDC). Specifically, we conceive QSDC-based blockchain for identity verification, message encryption, and consensus. We also propose an optical network based realization of the proposed QSDC-aided blockchain using the present-day technology. Our simulations quantify the benefits of the scheme, especially in terms of its resource utilization. This work provides a new prospect for the intrinsic fusion of quantum information technology and blockchain technology, paving the way for its rapid commercialization.
- 6 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (10) , 14375-14385
Quantum Blockchain Relying on Quantum Secure Direct Communication Network
As a popular decentralized and distributed database exhibiting transparency and unforgeability, blockchain has received widespread attention. At the time of writing, its security hinges on classical cryptography, which maintains a high grade of security by exploiting the potentially excessive computational complexity of mathematical problems to be solved by state-of-the-art computers. However, as computational technology develops, this encryption philosophy is likely to be challenged and there is a risk of “store now and decrypt later” attacks. A compelling solution to this security threat is to intrinsically integrate blockchain with quantum technology. Against this background, we propose a quantum blockchain scheme relying on quantum secure direct communication (QSDC). Specifically, we conceive QSDC-based blockchain for identity verification, message encryption, and consensus. We also propose an optical network based realization of the proposed QSDC-aided blockchain using the present-day technology. Our simulations quantify the benefits of the scheme, especially in terms of its resource utilization. This work provides a new prospect for the intrinsic fusion of quantum information technology and blockchain technology, paving the way for its rapid commercialization.
- Open Access
Control Power in Continuous Variable Controlled Quantum Teleportation
Controlled quantum teleportation is an important extension of multipartite quantum teleportation, which plays an indispensable role in building quantum networks. Compared with discrete variable counterparts, continuous variable controlled quantum teleportation can generate entanglement deterministically and exhibit higher superiority of the supervisor’s authority. Here, we define a measure to quantify the control power in continuous variable controlled quantum teleportation via Greenberger–Horne–Zeilinger-type entangled coherent state channels. Our results show that control power in continuous variable controlled quantum teleportation increases with the mean photon number of coherent states. Its upper bound is 1/2, which exceeds the upper bound in discrete variable controlled quantum teleportation (1/3). The robustness of the protocol is analyzed with photon absorption. The results show that the improving ability of the control power will descend by the increasing photon loss, with the upper bound unchanged and robust. Our results illuminate the role of control power in multipartite continuous variable quantum information processing and provide a criterion for evaluating the quality of quantum communication networks.
Open AccessControl Power in Continuous Variable Controlled Quantum Teleportation
Controlled quantum teleportation is an important extension of multipartite quantum teleportation, which plays an indispensable role in building quantum networks. Compared with discrete variable counterparts, continuous variable controlled quantum teleportation can generate entanglement deterministically and exhibit higher superiority of the supervisor’s authority. Here, we define a measure to quantify the control power in continuous variable controlled quantum teleportation via Greenberger–Horne–Zeilinger-type entangled coherent state channels. Our results show that control power in continuous variable controlled quantum teleportation increases with the mean photon number of coherent states. Its upper bound is 1/2, which exceeds the upper bound in discrete variable controlled quantum teleportation (1/3). The robustness of the protocol is analyzed with photon absorption. The results show that the improving ability of the control power will descend by the increasing photon loss, with the upper bound unchanged and robust. Our results illuminate the role of control power in multipartite continuous variable quantum information processing and provide a criterion for evaluating the quality of quantum communication networks.
- 15 November 2024
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 22 (5)
Optimal quantum teleportation fidelity in arbitrary dimension
- 15 November 2024
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 22 (5)
Optimal quantum teleportation fidelity in arbitrary dimension