Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Circuits and Systems proceedings

Quantum Circuit Design of Discrete Hartley Transform using Recursive Decomposition Formula

Chien‐Cheng Tseng, Tsung-Ming Hwang

Published Jul 27, 2005• 8 citations
Publisher

Abstract

In this paper, the quantum circuit design of a discrete Hartley transform (DHT) is investigated. The proposed design procedure can be divided into the following two steps. First, the N-point transform matrix is decomposed into the combination of N/2-point transform matrices and several sparse matrices such that any 2/sup n/-point transform can be computed recursively from the 2-point transform. Second, starting from the 2-point Hadamard transform, the quantum circuit of 2/sup n/-point transform can be designed recursively by using elementary quantum gates. The design results are compared with those of the conventional factorization method to demonstrate the effectiveness of proposed method.

DOI
10.1109/iscas.2005.1464715

Related papers

Quantum circuit design of 8 /spl times/ 8 discrete Hartley transform

Chien‐Cheng Tseng, Tsung-Ming Hwang

In this paper, the 8 /spl times/ 8 discrete Hartley transform will be implemented by using quantum elementary gates such as controlled NOT gates and Hadamard gates. Two steps involved are as follows: first, the discrete Hartley transform matrix is decomposed into the product of several sparse unitary matrices using the structure of fast Hartley transform algorithm. Then, each sparse matrix is implemented by elementary quantum gates and cascade them to obtain the final circuit. The design results show that the proposed design method has less circuit complexity than the conventional Cybenko's method.

IEEE International Symposium on Circuits and Systems proceedings•Jan 1, 2004•10 citations

QUANTUM SOFTWARE REUSABILITY

Andreas Klappenecker, Martin Rötteler

The design of efficient quantum circuits is an important issue in quantum computing. It is in general a formidable task to find a highly optimized quantum circuit for a given unitary matrix. We propose a quantum circuit design method that has the following unique feature: It allows to construct efficient quantum circuits in a systematic way by reusing and combining a set of highly optimized quantum circuits. Specifically, the method realizes a quantum circuit for a given unitary matrix by implementing a linear combination of representing matrices of a group, which have known fast quantum circuits. We motivate and illustrate this method by deriving extremely efficient quantum circuits for the discrete Hartley transform and for the fractional Fourier transforms. The sound mathematical basis of this design method allows to give meaningful and natural interpretations of the resulting circuits. We demonstrate this aspect by giving a natural interpretation of known teleportation circuits.

International Journal of Foundations of Computer Science•Oct 1, 2003•21 citations

Quantum circuit design of 8x8 discrete fourier transform using its fast computation flow graph

Chien‐Cheng Tseng, Tsung-Ming Hwang

In this paper, quantum circuit design of 8x8 discrete cosine transform (DCT) is investigated. The proposed design procedure can be divided into the following three steps. First, the DCT matrix is decomposed into the product of sparse matrices based on its fast computation flow graph. Second, each sparse matrix is implemented by elementary quantum gates. Third, cascade the circuits of sparse matrices to obtain the final circuit. The proposed method makes fast DCT computation algorithm in digital signal processing be suitable for implementation in quantum computer.

IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)•Apr 12, 2005•5 citations

Quantum Software Reusability

Andreas Klappenecker, Martin Roetteler

The design of efficient quantum circuits is an important issue in quantum computing. It is in general a formidable task to find a highly optimized quantum circuit for a given unitary matrix. We propose a quantum circuit design method that has the following unique feature: It allows to construct efficient quantum circuits in a systematic way by reusing and combining a set of highly optimized quantum circuits. Specifically, the method realizes a quantum circuit for a given unitary matrix by implementing a linear combination of representing matrices of a group, which have known fast quantum circuits. We motivate and illustrate this method by deriving extremely efficient quantum circuits for the discrete Hartley transform and for the fractional Fourier transforms. The sound mathematical basis of this design method allows to give meaningful and natural interpretations of the resulting circuits. We demonstrate this aspect by giving a natural interpretation of known teleportation circuits.

arXiv:quant-ph/0309121•Sep 15, 2003•1 citation

Quantum Circuit Design of 8 X 8 Discrete Cosine Transform using its Fast Computation Flow Graph

Chien‐Cheng Tseng, Tsung-Ming Hwang

In this paper, the quantum circuit design of an 8/spl times/8 discrete cosine transform (DCT) is investigated. The proposed design procedure can be divided into the following three steps. First, the DCT matrix is decomposed into the product of sparse matrices, based on its fast computation flow graph. Second, each sparse matrix is implemented by elementary quantum gates. Third, the sparse matrix circuits are cascaded to obtain the final circuit. The proposed method makes the fast DCT computation algorithm in digital signal processing suitable for implementation in a quantum computer.

IEEE International Symposium on Circuits and Systems proceedings•Jul 27, 2005•29 citations

On the Irresistible Efficiency of Signal Processing Methods in Quantum Computing

Andreas Klappenecker, Martin Roetteler

We show that many well-known signal transforms allow highly efficient realizations on a quantum computer. We explain some elementary quantum circuits and review the construction of the Quantum Fourier Transform. We derive quantum circuits for the Discrete Cosine and Sine Transforms, and for the Discrete Hartley transform. We show that at most O(log^2 N) elementary quantum gates are necessary to implement any of those transforms for input sequences of length N.

arXiv:quant-ph/0111039•Nov 7, 2001•3 citations
In this paper, the quantum circuit design of a discrete Hartley transform (DHT) is investigated. The proposed design procedure can be divided into the following two steps. First, the N-point transform matrix is decomposed into the combination of N/2-point transform matrices and several sparse matrices such that any 2/sup n/-point transform can be computed recursively from the 2-point transform. Second, starting from the 2-point Hadamard transform, the quantum circuit of 2/sup n/-point transform can be designed recursively by using elementary quantum gates. The design results are compared with those of the conventional factorization method to demonstrate the effectiveness of proposed method.
In this paper, the 8 /spl times/ 8 discrete Hartley transform will be implemented by using quantum elementary gates such as controlled NOT gates and Hadamard gates. Two steps involved are as follows: first, the discrete Hartley transform matrix is decomposed into the product of several sparse unitary matrices using the structure of fast Hartley transform algorithm. Then, each sparse matrix is implemented by elementary quantum gates and cascade them to obtain the final circuit. The design results show that the proposed design method has less circuit complexity than the conventional Cybenko's method.
The design of efficient quantum circuits is an important issue in quantum computing. It is in general a formidable task to find a highly optimized quantum circuit for a given unitary matrix. We propose a quantum circuit design method that has the following unique feature: It allows to construct efficient quantum circuits in a systematic way by reusing and combining a set of highly optimized quantum circuits. Specifically, the method realizes a quantum circuit for a given unitary matrix by implementing a linear combination of representing matrices of a group, which have known fast quantum circuits. We motivate and illustrate this method by deriving extremely efficient quantum circuits for the discrete Hartley transform and for the fractional Fourier transforms. The sound mathematical basis of this design method allows to give meaningful and natural interpretations of the resulting circuits. We demonstrate this aspect by giving a natural interpretation of known teleportation circuits.
In this paper, quantum circuit design of 8x8 discrete cosine transform (DCT) is investigated. The proposed design procedure can be divided into the following three steps. First, the DCT matrix is decomposed into the product of sparse matrices based on its fast computation flow graph. Second, each sparse matrix is implemented by elementary quantum gates. Third, cascade the circuits of sparse matrices to obtain the final circuit. The proposed method makes fast DCT computation algorithm in digital signal processing be suitable for implementation in quantum computer.
The design of efficient quantum circuits is an important issue in quantum computing. It is in general a formidable task to find a highly optimized quantum circuit for a given unitary matrix. We propose a quantum circuit design method that has the following unique feature: It allows to construct efficient quantum circuits in a systematic way by reusing and combining a set of highly optimized quantum circuits. Specifically, the method realizes a quantum circuit for a given unitary matrix by implementing a linear combination of representing matrices of a group, which have known fast quantum circuits. We motivate and illustrate this method by deriving extremely efficient quantum circuits for the discrete Hartley transform and for the fractional Fourier transforms. The sound mathematical basis of this design method allows to give meaningful and natural interpretations of the resulting circuits. We demonstrate this aspect by giving a natural interpretation of known teleportation circuits.
In this paper, the quantum circuit design of an 8/spl times/8 discrete cosine transform (DCT) is investigated. The proposed design procedure can be divided into the following three steps. First, the DCT matrix is decomposed into the product of sparse matrices, based on its fast computation flow graph. Second, each sparse matrix is implemented by elementary quantum gates. Third, the sparse matrix circuits are cascaded to obtain the final circuit. The proposed method makes the fast DCT computation algorithm in digital signal processing suitable for implementation in a quantum computer.