Abstract

Quantum entanglement is a unique phenomenon in quantum mechanics and a core resource in quantum information science, playing an irreplaceable role in cutting-edge fields such as quantum computing and quantum communication. However, the accurate identification of entangled states and the quantitative characterization of entanglement degrees remain crucial challenges in this field. Traditional quantum entanglement criteria (e.g., Bell inequalities, Peres-Horodecki criterion) suffer from limitations such as stringent experimental conditions, limited applicability to high-dimensional systems, and resource consumption that grows exponentially with system scale, creating an urgent demand for the development of novel, efficient and universal criteria. The vigorous development of quantum algorithms in recent years has provided a new approach to this problem. Leveraging the superposition and entanglement properties of qubits, quantum algorithms can achieve exponential speedup, supporting efficient measurement and analysis of entangled states. This study focuses on the research of quantum algorithm-based implementation schemes for quantum entanglement criteria, and designs a quantum algorithm for quantum entanglement detection using multi-qubit Toffoli gates and single-qubit operations, with useless information eliminated via ancillary measurements.

Biography

Professor Tao Yuanhong is a Professor and Master’s Supervisor at Zhejiang University of Science and Technology, China. He holds a PhD in Fundamental Mathematics from Harbin Institute of Technology and has extensive research experience in Quantum Information, Quantum Computing, quantum entanglement, quantum algorithms, and quantum information processing. He has published more than 50 SCI-indexed research papers and has led several national and provincial research projects.
Research Interests: Quantum Information and Quantum Computing
Affiliation: Zhejiang University of Science and Technology, China