Quantum computing has been proven to excel in factorization issues and unordered search
problems due to its capability of quantum parallelism. This unique feature allows …

The CRC Handbook of Finite Fields (hereafter referred to as the Handbook) is a reference
book for the theory and applications of finite fields. It is not intended to be an introductory …

One formidable difficulty in quantum communication and computation is to protect
information-carrying quantum states against undesired interactions with the environment. To …

The notion of universal quantum computation can be generalized to multilevel qudits, which
offer advantages in resource usage and algorithmic efficiencies. Trapped ions, which are …

Quantum maximum-distance-separable (MDS) codes form an important class of quantum
codes. To get q-ary quantum MDS codes, one of the effective ways is to find linear MDS …

We present families of quantum error-correcting codes which are optimal in the sense that
the minimum distance is maximal. These maximum distance separable (MDS) codes are …

Let q be an odd prime power. Based on classical negacyclic codes, we construct two
classes of quantum maximum-distance-separable (MDS) codes with parameters [[q 2+ 1, q 2 …

In this paper, we first construct several classes of classical Hermitian self-orthogonal
maximum distance separable (MDS) codes. Through these classical codes, we are able to …

We have implemented a Walsh-Hadamard gate, which performs a quantum Fourier
transform, in a superconducting qutrit. The qutrit is encoded in the lowest three energy levels …

We describe generalizations of the Pauli group, the Clifford group, and stabilizer states for
qudits in a Hilbert space of arbitrary dimension d. We examine a link with modular arithmetic …