A Graphical Rule Book for Clifford Manipulations of Stabilizer States

Abstract: Stabilizer states, along with Clifford manipulations (unitary transformations and measurements) thereof—despite being efficiently simulable on a classical computer—are an important tool in quantum information processing, with applications to quantum computing, error correction, and networking. Graph states, defined on a graph, are a special class of stabilizer states that are central to measurement-based quantum computing, […]

A Low-Complexity Quantum Simulation Framework for Toeplitz-Structured Matrix and Its Application in Signal Processing

Toeplitz matrix reconstruction algorithms (TMRAs) are one of the central subroutines in array processing for wireless communication applications. The classical TMRAs have shown excellent accuracy in the spectral estimation for both uncorrelated and coherence sources in the recent era. However, TMRAs incorporate the classical eigenvalue decomposition technique for estimating the eigenvalues of the Toeplitz-structured covariance […]

Perfect and Quasi-Perfect Codes for the Bosonic Classical-Quantum Channel

In this article, we explore perfect and quasi-perfect codes for the Bosonic channel, where information is generated by a laser and conveyed in the form of coherent states. In particular, we consider the phase-modulation codebook for coherent states in a Bosonic channel. We show that these phase-modulation codes are quasi-perfect as long as the cardinality […]

A Low-Complexity Quantum Principal Component Analysis Algorithm

In this article, we propose a low-complexity quantum principal component analysis (qPCA) algorithm. Similar to the state-of-the-art qPCA, it achieves dimension reduction by extracting principal components of the data matrix, rather than all components of the data matrix, to quantum registers, so that the samples of measurement required can be reduced considerably. Both our qPCA […]