Quantum circuit design of discrete signal transforms using their fast computation flow graphs

被引:0
|
作者
Tseng, Chien-Cheng [1 ]
Hwang, Tsung-Ming [1 ]
机构
[1] Department of Computer and Communication Engineering, National Kaohsiung First University of Science and Technology, Kaohsiung, Taiwan
来源
关键词
Cosine transforms - Fourier transforms - Gates (transistor) - Networks (circuits) - Quantum theory - Signal theory;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, quantum circuit designs of discrete signal transforms are investigated. These signal transforms include discrete Fourier transform (DFT), discrete Hartley transform (DHT) and discrete cosine transform (DCT). The proposed design procedure can be divided into the following three steps. First, the signal transform matrices are decomposed into the product of sparse matrices based on their fast computation flow graphs. Second, each sparse matrix is implemented by elementary quantum gates. Third, the circuits for sparse matrices are cascaded to obtain the final circuit. The design results are compared with those of conventional design methods to demonstrate the effectiveness of the proposed design method in terms of quantum gate count.
引用
收藏
页码:305 / 319
相关论文
共 50 条
  • [21] Quantum logic circuit design of many-valued galois reversible expansions and fast transforms
    Al-Rabadi, Anas N.
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2007, 16 (05) : 641 - 671
  • [22] Evaluation of design process alternatives using signal flow graphs
    Isaksson, O
    Keski-Seppälä, S
    Eppinger, SD
    JOURNAL OF ENGINEERING DESIGN, 2000, 11 (03) : 211 - 224
  • [23] Generalised models of design iteration using signal flow graphs
    Eppinger, SD
    Nukala, MV
    Whitney, DE
    RESEARCH IN ENGINEERING DESIGN-THEORY APPLICATIONS AND CONCURRENT ENGINEERING, 1997, 9 (02): : 112 - 123
  • [24] Generalised models of design interation using signal flow graphs
    Steven D. Eppinger
    Murthy V. Nukala
    Daniel E. Whitney
    Research in Engineering Design, 1997, 9 : 112 - 123
  • [25] Fast discrete W transforms via computation of first-order moments
    Liu, J. G.
    Hua, X.
    Wu, J. L.
    MIPPR 2011: PARALLEL PROCESSING OF IMAGES AND OPTIMIZATION AND MEDICAL IMAGING PROCESSING, 2011, 8005
  • [26] Fast discrete polynomial transforms with applications to data analysis for distance transitive graphs
    Driscoll, JR
    Healy, DM
    Rockmore, DN
    SIAM JOURNAL ON COMPUTING, 1997, 26 (04) : 1066 - 1099
  • [27] Discrete wavelet analysis for fast optic flow computation
    Bernard, CP
    APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2001, 11 (01) : 32 - 63
  • [28] Connectance and Reliability Computation of Wireless Body Area Networks using Signal Flow Graphs
    Peiravi, Ali
    LIFE SCIENCE JOURNAL-ACTA ZHENGZHOU UNIVERSITY OVERSEAS EDITION, 2010, 7 (02): : 52 - 56
  • [29] A Fast Algorithm for Aperiodic Linear Stencil Computation using Fast Fourier Transforms
    Ahmad, Zafar
    Chowdhury, Rezaul
    Das, Rathish
    Ganapathi, Pramod
    Gregory, Aaron
    Zhu, Yimin
    ACM TRANSACTIONS ON PARALLEL COMPUTING, 2023, 10 (04)
  • [30] Fast computation of orthogonal transforms using sparse mixed kernels
    Agbinya, JI
    ISSPA 96 - FOURTH INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND ITS APPLICATIONS, PROCEEDINGS, VOLS 1 AND 2, 1996, : 672 - 675