Ming-Qiang Bai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ming-Qiang Bai has a total of 75 co-authors. Here are the top co-authors by number of shared publications:
Zhi-Wen Mo
School of Mathematical Sciences, Sichuan Normal University, Chengdu, 610068, People's Republic of China
26 shared publicationsLiang Tang
School of Science, Xihua University, Chengdu, 610039, People's Republic of China
17 shared publicationsJia-Yin Peng
School of Mathematics and Statistics, Yili Normal University, Xinjiang Yili, China
11 shared publicationsFan Wu
School of Mathematical Sciences, Sichuan Normal University, Chengdu, 610066, People's Republic of China
10 shared publicationsZhen Yang
Institute of Intelligent Information and Quantum Information, Sichuan Normal University, Chengdu 610068, People’s Republic of China
9 shared publications- Zhi-Wen Mo
School of Mathematical Sciences, Sichuan Normal University, Chengdu, China
7 shared publications
Latest Publications
- 17 June 2026
- Published by Elsevier in Discrete Mathematics
- Vol. 349 (11)
Construction of some quantum MDS codes with larger minimum distances from GRS codes
- 17 June 2026
- Published by Elsevier in Discrete Mathematics
- Vol. 349 (11)
Construction of some quantum MDS codes with larger minimum distances from GRS codes
- 25 May 2026
- Published by World Scientific Pub Co Pte Ltd in Modern Physics Letters A
- Vol. 41 (19)
Design of novel multi-valued quantum adder circuit
Multi-valued quantum logic presents significant advantages over conventional binary logic, including enhanced information processing capacity and reduced circuit complexity. As a fundamental component of quantum arithmetic units, the efficiency of multi-valued quantum adders is critical to overall system performance. In this paper, a universal construction scheme for multi-valued quantum half adders, full adders, and parallel adders is introduced based on 1-qudit gates and Muthukrishnan–Stroud gates. The proposed design optimizes the carry propagation mechanism from a one-to-one to a one-to-many architecture, thereby reducing the quantum gate count. A key advantage of this approach is the linear scaling of quantum gate size with the system dimension d. The constructed d-valued quantum adder maintains an optimal number of constant inputs and garbage outputs. For dimensions [ ], the proposed design demonstrates significant improvements in quantum cost and hardware complexity compared to existing methods.
- 25 May 2026
- Published by World Scientific Pub Co Pte Ltd in Modern Physics Letters A
- Vol. 41 (19)
Design of novel multi-valued quantum adder circuit
Multi-valued quantum logic presents significant advantages over conventional binary logic, including enhanced information processing capacity and reduced circuit complexity. As a fundamental component of quantum arithmetic units, the efficiency of multi-valued quantum adders is critical to overall system performance. In this paper, a universal construction scheme for multi-valued quantum half adders, full adders, and parallel adders is introduced based on 1-qudit gates and Muthukrishnan–Stroud gates. The proposed design optimizes the carry propagation mechanism from a one-to-one to a one-to-many architecture, thereby reducing the quantum gate count. A key advantage of this approach is the linear scaling of quantum gate size with the system dimension d. The constructed d-valued quantum adder maintains an optimal number of constant inputs and garbage outputs. For dimensions [ ], the proposed design demonstrates significant improvements in quantum cost and hardware complexity compared to existing methods.
- 12 January 2026
- Published by Springer Nature in Quantum Information Processing
- Vol. 25 (1) , 20
Multi-party verifiable blind quantum computation protocol with mutual authentication
- 12 January 2026
- Published by Springer Nature in Quantum Information Processing
- Vol. 25 (1) , 20
Multi-party verifiable blind quantum computation protocol with mutual authentication
- 10 November 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (5) , 052420
Entropic uncertainty relations for mutually unbiased equiangular tight frames assigned to quantum t -designs
Building on recent significant interest in entropic uncertainty relations for quantum measurements, this work explores the entropic uncertainty relation for the mutually unbiased equiangular tight frame assigned to quantum $t$-designs. Combining the mathematical structures of quantum measurements with those of quantum designs, uncertainty relations are derived in terms of Tsallis and R\'enyi $\ensuremath{\alpha}$ entropies, and rigorous theoretical analysis demonstrates the tightness of the derived entropic lower bounds. Furthermore, a specific relation between quantum design and the index of coincidence is inferred from the information diagrams, which is crucial for deriving the novel entropic uncertainty relation. The results reveal that the entropic lower bounds can be optimized by adjusting the parameters of the quantum $t$-design, broadening the theoretical framework of the entropic uncertainty relation and providing a practical tool for quantum information tasks.- 10 November 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (5) , 052420
Entropic uncertainty relations for mutually unbiased equiangular tight frames assigned to quantum t -designs
Building on recent significant interest in entropic uncertainty relations for quantum measurements, this work explores the entropic uncertainty relation for the mutually unbiased equiangular tight frame assigned to quantum $t$-designs. Combining the mathematical structures of quantum measurements with those of quantum designs, uncertainty relations are derived in terms of Tsallis and R\'enyi $\ensuremath{\alpha}$ entropies, and rigorous theoretical analysis demonstrates the tightness of the derived entropic lower bounds. Furthermore, a specific relation between quantum design and the index of coincidence is inferred from the information diagrams, which is crucial for deriving the novel entropic uncertainty relation. The results reveal that the entropic lower bounds can be optimized by adjusting the parameters of the quantum $t$-design, broadening the theoretical framework of the entropic uncertainty relation and providing a practical tool for quantum information tasks.- 14 October 2025
- Published by IOP Publishing in Communications in Theoretical Physics
- Vol. 78 (2) , 025103
Designs of four universal architectures for multi-valued quantum adders
Multi-valued quantum adder circuits, based on multi-valued logic, are significant components in numerous quantum algorithms. Their low-cost implementations can enhance the efficiency of these algorithms. In this paper, innovative universal architectures for d(d>3)-level quantum half-adder, full-adder, parallel adder, and parallel adder/subtractor circuits are designed using d-level 1-qudit (quantum digit) and M–S gates. To demonstrate the effectiveness of these architectures, quaternary adder circuits derived from them are displayed and compared with several existing counterparts. Judging by the results, these circuits exhibit reductions in quantum cost (QC), hardware complexity (HC), number of constant inputs (NCIs), and number of garbage outputs (NGOs).
- 14 October 2025
- Published by IOP Publishing in Communications in Theoretical Physics
- Vol. 78 (2) , 025103
Designs of four universal architectures for multi-valued quantum adders
Multi-valued quantum adder circuits, based on multi-valued logic, are significant components in numerous quantum algorithms. Their low-cost implementations can enhance the efficiency of these algorithms. In this paper, innovative universal architectures for d(d>3)-level quantum half-adder, full-adder, parallel adder, and parallel adder/subtractor circuits are designed using d-level 1-qudit (quantum digit) and M–S gates. To demonstrate the effectiveness of these architectures, quaternary adder circuits derived from them are displayed and compared with several existing counterparts. Judging by the results, these circuits exhibit reductions in quantum cost (QC), hardware complexity (HC), number of constant inputs (NCIs), and number of garbage outputs (NGOs).
- 19 August 2025
- Published by Springer Nature in Quantum Information Processing
- Vol. 24 (9) , 1-18
A family of new quantum MDS codes with lengths dividing $q^w-1$- 19 August 2025
- Published by Springer Nature in Quantum Information Processing
- Vol. 24 (9) , 1-18
A family of new quantum MDS codes with lengths dividing $q^w-1$- 14 July 2025
- Published by Springer Nature in Quantum Information Processing
- Vol. 24 (7) , 1-25
Quantum representation and geometric transformation of 3D images
- 14 July 2025
- Published by Springer Nature in Quantum Information Processing
- Vol. 24 (7) , 1-25
Quantum representation and geometric transformation of 3D images
- 28 March 2025
- Published by IOP Publishing in Physica Scripta
- Vol. 100 (4) , 045115
Design and optimization of the multi-valued quantum adder
Multi-valued quantum logic circuits possess the ability to store and process more intricate information than binary quantum logic circuits. A key component within numerous intricate computational circuits is the multi-valued quantum adder circuit. The primary objective of this paper is to propose a multi-valued quantum full adder and an optimal replacement of two multi-valued Toffoli gate cascades which can effectively reduce the quantum cost of the circuit. Constructed from multi-valued 1-qudit and 2-qudit M-S gates, this adder circuit is designed by effectively setting the control conditions of multi-valued quantum Toffoli gates. For a quaternary quantum adder based on this M-S gate architecture, the number of QC, 1-qudit gates, and 2-qudit gates are 48.6%, 46.2%, and 54.2%, respectively, of the previous design. Additionally, NCI and NGO are consistent with prior adder. It shows the potential applications of complex quantum reversible logic circuits.
- 28 March 2025
- Published by IOP Publishing in Physica Scripta
- Vol. 100 (4) , 045115
Design and optimization of the multi-valued quantum adder
Multi-valued quantum logic circuits possess the ability to store and process more intricate information than binary quantum logic circuits. A key component within numerous intricate computational circuits is the multi-valued quantum adder circuit. The primary objective of this paper is to propose a multi-valued quantum full adder and an optimal replacement of two multi-valued Toffoli gate cascades which can effectively reduce the quantum cost of the circuit. Constructed from multi-valued 1-qudit and 2-qudit M-S gates, this adder circuit is designed by effectively setting the control conditions of multi-valued quantum Toffoli gates. For a quaternary quantum adder based on this M-S gate architecture, the number of QC, 1-qudit gates, and 2-qudit gates are 48.6%, 46.2%, and 54.2%, respectively, of the previous design. Additionally, NCI and NGO are consistent with prior adder. It shows the potential applications of complex quantum reversible logic circuits.
- 24 March 2025
- Published by Elsevier in Chinese Journal of Physics
- Vol. 96, 1354-1363
Uncertainty relations for quantum measurements assigned to the conical 2-designs
- 24 March 2025
- Published by Elsevier in Chinese Journal of Physics
- Vol. 96, 1354-1363
Uncertainty relations for quantum measurements assigned to the conical 2-designs
- 11 February 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Quantum Information
- Vol. 23 (02)
Blind quantum computation with fewer quantum and delegated cost of client
Blind quantum computation (for measuring the client Alice) protocol changes the role of the client from state preparation to measurement. In order to further save the quantum cost and delegated cost of Alice, two protocols are proposed to complete a certain single-qubit gate with fewer measurements and qubits while remaining loss tolerant in this paper. Finally, the protocols are feasibility from three aspects: blindness, correctness and universality.
- 11 February 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Quantum Information
- Vol. 23 (02)
Blind quantum computation with fewer quantum and delegated cost of client
Blind quantum computation (for measuring the client Alice) protocol changes the role of the client from state preparation to measurement. In order to further save the quantum cost and delegated cost of Alice, two protocols are proposed to complete a certain single-qubit gate with fewer measurements and qubits while remaining loss tolerant in this paper. Finally, the protocols are feasibility from three aspects: blindness, correctness and universality.