Zhaoqi Wu
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
Zhaoqi Wu has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
Shao-Ming Fei
School of Mathematical Sciences, Capital Normal University, Beijing 100048, China
16 shared publications- Chuanxi Zhu
Department of Mathematics, Nanchang University, Nanchang, China
14 shared publications Linlin Ye
8 shared publicationsChuanxi Zhu
Department of Mathematics, Nanchang University, Nanchang, People’s Republic of China
5 shared publicationsCong Xu
School of Mathematical Sciences, Capital Normal University, Beijing 100048, China
5 shared publications- Lin Zhang
Hangzhou Dianzi University
4 shared publications
Latest Publications
- 20 August 2026
- Published by Elsevier in Physics Letters A
- Vol. 595
Average metric adjusted skew information of coherence under conical 2-designs generalized equiangular measurements
- 20 August 2026
- Published by Elsevier in Physics Letters A
- Vol. 595
Average metric adjusted skew information of coherence under conical 2-designs generalized equiangular measurements
- 20 August 2026
- Published by IOP Publishing in Laser Physics
- Vol. 36 (8) , 085202
Quantifying imaginarity via quantum α – z Jensen-Tsallis divergence
Quantum imaginarity is one of the core quantum resources in the field of quantum information science. In this work, we define the quantum α – z Jensen-Tsallis divergence, and construct three kinds of imaginarity quantifiers based on it, by considering the distance from a quantum state to its conjugate state, real part, and the set of free states, respectively. We systematically investigate the fundamental properties of the above imaginarity quantifiers, and prove that the first and second kinds of divergences are well-defined quantum imaginarity measures, while the third one is an imaginarity monotone. Meanwhile, we investigate the intrinsic connections between them and the existing relative entropy-induced imaginarity measures. We discuss the evolutionary behavior of our imaginarity quantifiers with different parameters by typical examples.
- 20 August 2026
- Published by IOP Publishing in Laser Physics
- Vol. 36 (8) , 085202
Quantifying imaginarity via quantum α – z Jensen-Tsallis divergence
Quantum imaginarity is one of the core quantum resources in the field of quantum information science. In this work, we define the quantum α – z Jensen-Tsallis divergence, and construct three kinds of imaginarity quantifiers based on it, by considering the distance from a quantum state to its conjugate state, real part, and the set of free states, respectively. We systematically investigate the fundamental properties of the above imaginarity quantifiers, and prove that the first and second kinds of divergences are well-defined quantum imaginarity measures, while the third one is an imaginarity monotone. Meanwhile, we investigate the intrinsic connections between them and the existing relative entropy-induced imaginarity measures. We discuss the evolutionary behavior of our imaginarity quantifiers with different parameters by typical examples.
- 15 June 2026
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (24) , 245303
Uncertainty and complementarity relations for two classes of generalized quantum relative entropies of coherence
Quantum coherence is an important quantum resource in the field of quantum information. We establish the uncertainty relations for the unified ( α , β )-relative entropy of coherence (UREOC) and the sandwiched Rényi α -relative entropy of coherence (SRREOC) under two and three orthonormal bases in qubit systems. We then prove that UREOC can be upper bounded by the purity in arbitrary finite dimensional spaces, from which a complementarity relation between UREOC and the mixedness is obtained. Finally, we show that the minimum error probability of quantum state discrimination and asymptotic exact coherence distillation rate can be upper bounded by UREOC, and can thus be easily estimated with the purity/mixedness of the state.
- 15 June 2026
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (24) , 245303
Uncertainty and complementarity relations for two classes of generalized quantum relative entropies of coherence
Quantum coherence is an important quantum resource in the field of quantum information. We establish the uncertainty relations for the unified ( α , β )-relative entropy of coherence (UREOC) and the sandwiched Rényi α -relative entropy of coherence (SRREOC) under two and three orthonormal bases in qubit systems. We then prove that UREOC can be upper bounded by the purity in arbitrary finite dimensional spaces, from which a complementarity relation between UREOC and the mixedness is obtained. Finally, we show that the minimum error probability of quantum state discrimination and asymptotic exact coherence distillation rate can be upper bounded by UREOC, and can thus be easily estimated with the purity/mixedness of the state.
- 3 April 2026
- Published by Wiley in Advanced Quantum Technologies
- Vol. 9 (4)
Coherence and Imaginarity as Resources in Quantum Circuit Complexity
Quantum circuit complexity quantifies the minimal number of gates needed to realize a unitary transformation and plays a central role in quantum computation. In this work, we investigate the complexity of quantum circuits through coherence and imaginarity resources. We establish a lower bound on the circuit cost by the Tsallis relative entropy of cohering power, which is shown to be tighter than the one presented by Bu et al. [ Communications in Mathematical Physics 405, no. 7 (2024): 161] under restrictive conditions. As a consequence, we obtain the relationships between the circuit cost and the coherence generating power via probabilistic average in terms of skew information/relative entropy, and present explicit bounds of the circuit cost for typical quantum gates. Moreover, we derive lower bounds on the circuit cost via the imaginaring power of the circuit, induced by the Tsallis relative entropy and relative entropy. We demonstrate that imaginarity can yield nontrivial constraints on the circuit cost even when coherence‐based lower bounds are zero (e.g., for the gate), which implies that imaginarity may provide advantages under certain circumstances compared with coherence. Our results may help better understand the connections between quantum resources and circuit complexity.
- 3 April 2026
- Published by Wiley in Advanced Quantum Technologies
- Vol. 9 (4)
Coherence and Imaginarity as Resources in Quantum Circuit Complexity
Quantum circuit complexity quantifies the minimal number of gates needed to realize a unitary transformation and plays a central role in quantum computation. In this work, we investigate the complexity of quantum circuits through coherence and imaginarity resources. We establish a lower bound on the circuit cost by the Tsallis relative entropy of cohering power, which is shown to be tighter than the one presented by Bu et al. [ Communications in Mathematical Physics 405, no. 7 (2024): 161] under restrictive conditions. As a consequence, we obtain the relationships between the circuit cost and the coherence generating power via probabilistic average in terms of skew information/relative entropy, and present explicit bounds of the circuit cost for typical quantum gates. Moreover, we derive lower bounds on the circuit cost via the imaginaring power of the circuit, induced by the Tsallis relative entropy and relative entropy. We demonstrate that imaginarity can yield nontrivial constraints on the circuit cost even when coherence‐based lower bounds are zero (e.g., for the gate), which implies that imaginarity may provide advantages under certain circumstances compared with coherence. Our results may help better understand the connections between quantum resources and circuit complexity.
- 4 March 2026
- Published by IOP Publishing in Communications in Theoretical Physics
- Vol. 78 (5) , 055103
Quantifying magic via quantum ( α , β ) Jensen–Shannon divergence
Magic states play an important role in fault-tolerant quantum computation, and so the quantification of magic for quantum states is of great significance. In this work, we propose two new magic quantifiers by introducing two versions of quantum ( α , β ) Jensen–Shannon divergence, based on the quantum ( α , β ) entropy and the quantum ( α , β )-relative entropy, respectively. We derive many desirable properties for our magic quantifiers, and find that they are efficiently computable in low-dimensional Hilbert spaces. We also show that the initial nonstabilizerness of the input state can boost the magic-generating power for our magic quantifiers with appropriate parameter ranges for a certain class of quantum gates. Our magic quantifiers may provide new tools for addressing some specific problems in magic resource theory.
- 4 March 2026
- Published by IOP Publishing in Communications in Theoretical Physics
- Vol. 78 (5) , 055103
Quantifying magic via quantum ( α , β ) Jensen–Shannon divergence
Magic states play an important role in fault-tolerant quantum computation, and so the quantification of magic for quantum states is of great significance. In this work, we propose two new magic quantifiers by introducing two versions of quantum ( α , β ) Jensen–Shannon divergence, based on the quantum ( α , β ) entropy and the quantum ( α , β )-relative entropy, respectively. We derive many desirable properties for our magic quantifiers, and find that they are efficiently computable in low-dimensional Hilbert spaces. We also show that the initial nonstabilizerness of the input state can boost the magic-generating power for our magic quantifiers with appropriate parameter ranges for a certain class of quantum gates. Our magic quantifiers may provide new tools for addressing some specific problems in magic resource theory.
- 11 February 2026
- Published by IOP Publishing in Chinese Physics B
- Vol. 35 (6)
Coherence and decoherence in generalized Shor’s algorithm
Quantum coherence constitutes a fundamental physical mechanism essential to the study of quantum algorithms. We study the coherence and decoherence in generalized Shor’s algorithm where the register A is initialized in an arbitrary pure state, or the combined register AB is initialized in a pseudo-pure state, which encompasses the standard Shor’s algorithm as a special case. We derive both the lower and upper bounds on the performance of the generalized Shor’s algorithm, and establish the relation between the probability of calculating the order r when the register AB is initialized in a pseudo-pure state and the one when the register A is initialized in an arbitrary pure state. Moreover, we study the coherence and decoherence in noisy Shor’s algorithm and give the lower bound of the probability that we can calculate the order r .
- 11 February 2026
- Published by IOP Publishing in Chinese Physics B
- Vol. 35 (6)
Coherence and decoherence in generalized Shor’s algorithm
Quantum coherence constitutes a fundamental physical mechanism essential to the study of quantum algorithms. We study the coherence and decoherence in generalized Shor’s algorithm where the register A is initialized in an arbitrary pure state, or the combined register AB is initialized in a pseudo-pure state, which encompasses the standard Shor’s algorithm as a special case. We derive both the lower and upper bounds on the performance of the generalized Shor’s algorithm, and establish the relation between the probability of calculating the order r when the register AB is initialized in a pseudo-pure state and the one when the register A is initialized in an arbitrary pure state. Moreover, we study the coherence and decoherence in noisy Shor’s algorithm and give the lower bound of the probability that we can calculate the order r .
- 4 January 2026
- Published by Springer Nature in Science China Physics, Mechanics & Astronomy
- Vol. 69 (3) , 230316
Quantifying imaginarity of quantum operations
- 4 January 2026
- Published by Springer Nature in Science China Physics, Mechanics & Astronomy
- Vol. 69 (3) , 230316
Quantifying imaginarity of quantum operations
- 12 September 2025
- Published by Springer Nature in International Journal of Theoretical Physics
- Vol. 64 (9) , 1-22
Uncertainty Relations for Unified ($\alpha$,$\beta$)-relative Entropy of Coherence Under Mutually Unbiased Equiangular Tight Frames- 12 September 2025
- Published by Springer Nature in International Journal of Theoretical Physics
- Vol. 64 (9) , 1-22
Uncertainty Relations for Unified ($\alpha$,$\beta$)-relative Entropy of Coherence Under Mutually Unbiased Equiangular Tight Frames- 12 September 2025
- Published by IOP Publishing in Communications in Theoretical Physics
- Vol. 78 (1) , 015102
Coherence and entanglement dynamics in Shor’s algorithm
Shor’s algorithm outperforms its classical counterpart in efficient prime factorization. We explore the coherence and entanglement dynamics of the evolved states within Shor’s algorithm, showing that the coherence in each step relies on the dimension of register or the order, and discuss the relations between geometric coherence and geometric entanglement. We investigate how unitary operators induce variations in coherence and entanglement, and analyze the variations of coherence and entanglement within the entire algorithm, demonstrating that the overall effect of Shor’s algorithm tends to deplete coherence and produce entanglement. Our research not only deepens the understanding of this algorithm but also provides methodological references for studying resource dynamics in other quantum algorithms.
- 12 September 2025
- Published by IOP Publishing in Communications in Theoretical Physics
- Vol. 78 (1) , 015102
Coherence and entanglement dynamics in Shor’s algorithm
Shor’s algorithm outperforms its classical counterpart in efficient prime factorization. We explore the coherence and entanglement dynamics of the evolved states within Shor’s algorithm, showing that the coherence in each step relies on the dimension of register or the order, and discuss the relations between geometric coherence and geometric entanglement. We investigate how unitary operators induce variations in coherence and entanglement, and analyze the variations of coherence and entanglement within the entire algorithm, demonstrating that the overall effect of Shor’s algorithm tends to deplete coherence and produce entanglement. Our research not only deepens the understanding of this algorithm but also provides methodological references for studying resource dynamics in other quantum algorithms.
- 3 January 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (1)
Feedback-driven quantum Otto-like engines
An analytical study of a feedback-driven quantum engine based on a two-level system is presented. This engine is similar to a quantum Otto engine but substitutes the quantum isochoric process with a feedback-driven operation based on a measured observable $A(\ensuremath{\theta})$, whose eigenstates are coherent superpositions of energy eigenstates. Projective measurements control the feedback operations, while work extraction or heat absorption occurs during driven operations. We derive the general time-dependent efficiency, power, and power fluctuations. Quantum coherence is examined through three mechanisms: (i) coherence associated with $\ensuremath{\theta}\ensuremath{\ne}0$, (ii) residual coherence after incomplete thermalization, and (iii) coherence generated by the interaction between the system and a coherent laser pulse on resonance. We investigate how the parameter $\ensuremath{\theta}$, quantum coherence, and timing of unitary and feedback-driven strokes influence engine performance. We demonstrate that quantum coherence can significantly enhance power output and efficiency while reducing fluctuations through optimal cycle parameter adjustments.- 3 January 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (1)
Feedback-driven quantum Otto-like engines
An analytical study of a feedback-driven quantum engine based on a two-level system is presented. This engine is similar to a quantum Otto engine but substitutes the quantum isochoric process with a feedback-driven operation based on a measured observable $A(\ensuremath{\theta})$, whose eigenstates are coherent superpositions of energy eigenstates. Projective measurements control the feedback operations, while work extraction or heat absorption occurs during driven operations. We derive the general time-dependent efficiency, power, and power fluctuations. Quantum coherence is examined through three mechanisms: (i) coherence associated with $\ensuremath{\theta}\ensuremath{\ne}0$, (ii) residual coherence after incomplete thermalization, and (iii) coherence generated by the interaction between the system and a coherent laser pulse on resonance. We investigate how the parameter $\ensuremath{\theta}$, quantum coherence, and timing of unitary and feedback-driven strokes influence engine performance. We demonstrate that quantum coherence can significantly enhance power output and efficiency while reducing fluctuations through optimal cycle parameter adjustments.