Design and optimization of quantum latch

Yang DONG; Min WU; Shan-qing GAO; Hong-jun Lü

doi:10.3969/j.issn.1007-5461.2013.06.016

[1] Feynman R P. Simulating physics with computers ［J］. Int. J. Theor. Phys., 1982, 21: 457-488.

[2] Shor P W. Algorithms for quantums computation: Discrete log and factoring ［C］. Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, 1994, 124-134.

[3] Preskill J. Quantum Information and Computation ［M］. Cambridge University Press, 1998: 231-318.

[5] Wilde M M. Quantum-shift-register circuits ［J］. Phys. Rev. A, 2009, 79(6): 062325.

[7] Mozammel H A K. Design of reversible / quantum ternary multiplexer and demultiplexer ［J］. Engin. Lett., 2006, 13(2): 65-69.

[9] Thapliyal H, Srinivas M B, Zwolinski M. A beginning in the reversible logic synthesis of sequential circuits ［C］. MAPLD International Conference, 2005, 10-12.

[10] Thapliyal H, et al. Design of reversible latches optimized for quantum cost, delay and garbage outputs ［C］. rd International Conference on VLSI Design, 2010, 235-240.

[11] Maslov D. Efficient reversible and quantum implementations of symmetric Boolean functions ［J］. IEEE Proc. Circuits Devices Syst., 2006, 153(5): 31-36.