메뉴 건너뛰기




Volumn , Issue , 2005, Pages 828-831

Quantum circuit design of discrete hartley transform using recursive decomposition formula

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN PROCEDURE; DISCRETE HARTLEY TRANSFORMS; FACTORIZATION METHODS; HADAMARD TRANSFORMS; QUANTUM CIRCUIT; QUANTUM CIRCUIT DESIGN; QUANTUM GATES; RECURSIVE DECOMPOSITION; SPARSE MATRICES; TRANSFORM MATRICES;

EID: 33750524499     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCAS.2005.1464715     Document Type: Conference Paper
Times cited : (41)

References (9)
  • 4
    • 85115374351 scopus 로고
    • Algorithms for Quantum Computation: Discrete Logarithms and Factoring
    • IEEE Computer Soc. Press, Los Alamitos, CA, pp, Nov
    • P. W. Shor, "Algorithms for Quantum Computation: Discrete Logarithms and Factoring," Proc. 35-th Ann. Symposium Foundations of Computer Science, IEEE Computer Soc. Press, Los Alamitos, CA, pp.124-134, Nov. 1994.
    • (1994) Proc. 35-th Ann. Symposium Foundations of Computer Science , pp. 124-134
    • Shor, P.W.1
  • 7
    • 4344634898 scopus 로고    scopus 로고
    • Quantum Circuit Design of 8x8 Discrete Hartley Transform
    • May
    • C.C. Tseng and T.M. Hwang, "Quantum Circuit Design of 8x8 Discrete Hartley Transform", ISCAS 2004, vol. III, pp.397-400, May. 2004.
    • (2004) ISCAS 2004 , vol.3 , pp. 397-400
    • Tseng, C.C.1    Hwang, T.M.2
  • 8
    • 0141689114 scopus 로고    scopus 로고
    • Reducing Quantum Computations to Elementary Unitary Operations
    • Mar./Apr
    • G. Cybenko, "Reducing Quantum Computations to Elementary Unitary Operations", Computing in Science and Engineering, pp.27-32, Mar./Apr. 2001.
    • (2001) Computing in Science and Engineering , pp. 27-32
    • Cybenko, G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.