메뉴 건너뛰기




Volumn , Issue , 2002, Pages 353-360

Reversible logic circuit synthesis

Author keywords

[No Author keywords available]

Indexed keywords

QUANTUM COMPUTATION; REVERSIBLE LOGIC CIRCUIT; TEMPORARY STORAGE CHANNELS;

EID: 0036907069     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/774572.774625     Document Type: Conference Paper
Times cited : (98)

References (16)
  • 1
    • 34748841353 scopus 로고
    • Elementary gates for quantum computation
    • A. Barenco et al., "Elementary Gates For Quantum Computation," Physical Review A, 52, 1995, pp. 3457-3467.
    • (1995) Physical Review A , vol.52 , pp. 3457-3467
    • Barenco, A.1
  • 2
    • 0015680909 scopus 로고
    • Logical reversibility of computation
    • C. Bennett, "Logical Reversibility of Computation," IBM J. of Research and Development, 17, 1973, pp. 525-532.
    • (1973) IBM J. of Research and Development , vol.17 , pp. 525-532
    • Bennett, C.1
  • 3
    • 4344599424 scopus 로고    scopus 로고
    • Toward an architecture for quantum programming
    • Nov.
    • S. Bettelli, L. Serafini and T. Calarco, "Toward an Architecture for Quantum Programming," Nov. 2001, http://arxiv.org/abs/cs.PL/0103009.
    • (2001)
    • Bettelli, S.1    Serafini, L.2    Calarco, T.3
  • 5
    • 0004886431 scopus 로고    scopus 로고
    • A comparison of logical efficiency of reversible and conventional gates
    • P. Kerntopf, "A Comparison of Logical Efficiency of Reversible and Conventional Gates," IWLS 2000, pp. 261-9.
    • IWLS 2000 , pp. 261-269
    • Kerntopf, P.1
  • 7
    • 0012153964 scopus 로고
    • An approach to multilevel boolean minimization
    • July
    • E. Lawler, "An Approach to Multilevel Boolean Minimization," JACM, 11, July 1964, pp. 283-295.
    • (1964) JACM , vol.11 , pp. 283-295
    • Lawler, E.1
  • 8
    • 0035183408 scopus 로고    scopus 로고
    • Architectural enhancements for fast subword permutations with repetitions in cryptographic applications
    • J. P. McGregor and R. B. Lee, "Architectural Enhancements for Fast Subword Permutations with Repetitions in Cryptographic Applications," ICCD, 2001, pp. 453-461.
    • (2001) ICCD , pp. 453-461
    • McGregor, J.P.1    Lee, R.B.2
  • 11
    • 0018518666 scopus 로고
    • Conservative logic elements and their universality
    • T. Sasao and K. Kinoshita, "Conservative Logic Elements and Their Universality," IEEE Trans. on Computers, 28, 1979, pp. 682-685.
    • (1979) IEEE Trans. on Computers , vol.28 , pp. 682-685
    • Sasao, T.1    Kinoshita, K.2
  • 12
    • 0012184091 scopus 로고
    • PROBLEM: Register swap
    • December
    • T. Silke, "PROBLEM: register swap," December 1995, http://www.mathematik.uni-bielefeld.de/~silke/PROBLEMS/bit_swap
    • (1995)
    • Silke, T.1
  • 14
    • 0004245012 scopus 로고
    • Reversible computing
    • Tech. Memo MIT/LCS/TM-151, MIT Lab for Comp. Sci
    • T. Toffoli, "Reversible Computing," Tech. Memo MIT/LCS/TM-151, MIT Lab for Comp. Sci, 1980.
    • (1980)
    • Toffoli, T.1
  • 15
    • 78049235884 scopus 로고    scopus 로고
    • ROM-based computation: Quantum versus classical
    • B. Travaglione et al. "ROM-based computation: Quantum Versus Classical," http://arxiv.org/abs/quant-ph/0109016 2001.
    • (2001)
    • Travaglione, B.1


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