| Biography | |
|---|---|
 Prof. HAI Q. DINH Kent State University, USA |
|
| Title: Construction of quantum codes from repeated-root constacyclic codes | |
| Abstract: Classical computers work by manipulating bits that exist in one of two states, namely, 0 or 1. Quantum computers are not just limited to these two states, they are encoded with quantum data in the two conditions of 0 and 1 as quantum bits, or qubits, which can exist in superposition. That means, the qubits are both 0 and 1 and all points in between, which are processed at the same time, giving quantum computers the ability of performing many calculations at once. Qubits represent atoms, ions, photons or electrons and their respective control devices that are working together to act as computer memory and a processor. Since quantum computers can contain these multiple states simultaneously, they have the potential to be millions of times more powerful than the most powerful classical supercomputers. Quantum computers will make use of qubits to encode quantum data and figure complex scientific issues utilizing the resources unique to quantum computers, such as direct access to superposition and entanglement. Using quantum computing, one can harness the magnificent powers superposition and entanglement to tackle complicated issues that classical computer systems cannot practically do. In this talk, we construct all quantum MDS codes from repeated-root codes of prime power lengths over finite fields using the CSS and Hermitian constructions. We provide all quantum MDS codes constructed from dual codes of repeated-root codes of prime power lengths over finite fields using the Hermitian construction. They are new in the sense that their parameters are different from all the previous constructions. Moreover, some of them have larger Hamming distances than the well-known quantum error-correcting codes in the literature. Among others, we will discuss some open directions for future research. | |
| Biography: HAI Q. DINH received the B.Sc., M.Sc., and Ph.D. degrees in mathematics from Ohio University, USA, in 1998, 2000, and 2003, respectively. After his graduation, he worked one year as a Visiting Professor at North Dakota State University, USA. Since 2004, he has been working at Kent State University, USA, as a tenured Professor of Mathematics. He is currently a Professor of Applied Mathematics with the Department of Mathematical Sciences, Kent State University. His research interests include algebra and coding theory. Since 2004, he has been publishing more than 100 articles at high level SCI(E) research journals, such as Journal of Algebra, Journal of Pure and Applied Algebra, IEEE TRANSACTIONS ON INFORMATION THEORY, IEEE COMMUNICATIONS LETTERS, Finite Fields and Their Applications, Applicable Algebra in Engineering, Communication and Computing, and Discrete Applied Mathematics. He has been a well-known invited/keynote speaker at numerous international conferences and mathematics colloquium. Other than universities in the U.S., he also gave many honorary tutorial lectures at international universities in China, Indonesia, Kuwait, Mexico, Singapore, Thailand, and Vietnam. | |
