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 条
  • [41] Comparison of extrasystolic ECG signal classifiers using discrete wavelet transforms
    Froese, T
    Hadjiloucas, S
    Galvao, RKH
    Becerra, VM
    Coelho, CJ
    PATTERN RECOGNITION LETTERS, 2006, 27 (05) : 393 - 407
  • [43] Fast Diameter Computation of Large Sparse Graphs using GPUs
    Dal, Giso H.
    Kosters, Walter A.
    Takes, Frank W.
    2014 22ND EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, AND NETWORK-BASED PROCESSING (PDP 2014), 2014, : 641 - 648
  • [44] Universal quantum computation using the discrete-time quantum walk
    Lovett, Neil B.
    Cooper, Sally
    Everitt, Matthew
    Trevers, Matthew
    Kendon, Viv
    PHYSICAL REVIEW A, 2010, 81 (04)
  • [45] Universal quantum computation and quantum error correction using discrete holonomies
    Mommers, Cornelis J. G.
    Sjoqvist, Erik
    PHYSICAL REVIEW A, 2022, 105 (02)
  • [46] Quantum circuit compilation and hybrid computation using Pauli-based computation
    Peres, Filipa C. R.
    Galvao, Ernesto F.
    QUANTUM, 2023, 7
  • [47] Focal field computation of an arbitrarily polarized beam using fast Fourier transforms
    Boruah, B. R.
    Neil, M. A. A.
    OPTICS COMMUNICATIONS, 2009, 282 (24) : 4660 - 4667
  • [48] Process identification using discrete wavelet transforms: Design of prefilters
    Palavajjhala, S
    Motard, RL
    Joseph, B
    AICHE JOURNAL, 1996, 42 (03) : 777 - 790
  • [49] GENERALIZED FAST ALGORITHMS OF SIGNAL DISCRETE-TRANSFORMS ACCORDING TO ODD PERIODIC ORTHOGONAL FUNCTIONS
    GAGARIN, YI
    RADIOTEKHNIKA I ELEKTRONIKA, 1990, 35 (04): : 774 - 780
  • [50] Computation of discrete function Chrestenson spectrum using Cayley color graphs
    Thornton, MA
    Miller, DM
    JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING, 2004, 10 (02) : 189 - 202