
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ChuanChing Sue, "An Enhanced Universal N x N Fully Nonblocking Quantum Switch," IEEE Transactions on Computers, vol. 58, no. 2, pp. 238250, February, 2009.  
BibTex  x  
@article{ 10.1109/TC.2008.161, author = {ChuanChing Sue}, title = {An Enhanced Universal N x N Fully Nonblocking Quantum Switch}, journal ={IEEE Transactions on Computers}, volume = {58}, number = {2}, issn = {00189340}, year = {2009}, pages = {238250}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2008.161}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An Enhanced Universal N x N Fully Nonblocking Quantum Switch IS  2 SN  00189340 SP238 EP250 EPD  238250 A1  ChuanChing Sue, PY  2009 KW  Fully meshed KW  quantum computer KW  nonblocking KW  SWAP gate KW  quantum Karnaugh mapping. VL  58 JA  IEEE Transactions on Computers ER   
[1] C.L. Wu and T. Feng, “On a Class of Multistage Interconnection Networks,” IEEE Trans. Computers, vol. 29, no. 8, pp. 694702, Aug. 1980.
[2] C.L. Wu and T. Feng, “The Universality of the ShuffleExchange Network,” IEEE Trans. Computers, vol. 30, no. 8, pp.324332, May 1981.
[3] F.K. Hwang, “The Mathematical Theory of Nonblocking Switching Networks,” Series on Applied Mathematics, vol. 11, World Scientific, 1998.
[4] C. Clos, “A Study of NonBlocking Switching Networks,” Bell System Technical J., vol. 32, no. 2, pp. 406424, Mar. 1953.
[5] D.G. Cantor, “On Nonblocking Switching Networks,” Networks, vol. 1, pp. 367377, 1971.
[6] W.J. Cheng and W.T. Chen, “A New SelfRouting Permutation Network,” IEEE Trans. Computers, vol. 45, no. 5, pp. 630636, May 1996.
[7] C.Y. Lee and A.Y. Oruc, “Design of Efficient and Easily Routable Generalized Connectors,” IEEE Trans. Comm., pp.646650, Feb. 1995.
[8] V.E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, 1965.
[9] C.C. Sue, W.R. Chen, and C.Y. Huang, “Design and Analysis of a Fully NonBlocking Quantum Switch,” Proc. IEEE Int'l Conf. Innovative Computing, Information and Control (ICICIC '06), pp. 421424, Aug. 2006.
[10] M.K. Shukla, R. Ratan, and A.Y. Oruc, “A Quantum SelfRouting Packet Switch,” Proc. 38th Ann. Conf. Information Sciences and Systems (CISS '04), pp. 484489, Mar. 2004.
[11] S.T. Cheng and C.Y. Wang, “Quantum Switching and Quantum Merge Sorting,” IEEE Trans. Circuits and Systems, vol. 53, no. 2, pp. 316325, Feb. 2006.
[12] I.M. Tsai and S.Y. Kuo, “Digital Switching in the Quantum Domain,” IEEE Trans. Nanotechnology, vol. 1, no. 3, pp. 154164, 2002.
[13] C. Moore and M. Nilsson, Parallel Quantum Computation and Quantum Codes, http://arxiv.org/quantph9808027/, Aug. 1998.
[14] P.W. Diaconis and S.P. Holmes, “Matchings and Phylogenetic Trees,” Proc. Nat'l Academy of Sciences of the USA, vol. 95, pp.1460014602, Dec. 1998.
[15] J.S. Lee, Y. Chung, J. Kim, and S. Lee, A Practical Method of Constructing Quantum Combinational Logic Circuits, http://arxiv.org/quantph9911053, 2007.
[16] I.M. Tsai and S.Y. Kuo, “Quantum Boolean Circuit Construction and Layout under Locality Constraint,” Proc. First IEEE Conf. Nanotechnology, pp. 111116, 2001.
[17] V.V. Shende, A.K. Prasad, I.L. Markov, and J.P. Hayes, “Reversible Logic Circuit Synthesis,” Proc. IEEE/ACM Int'l Conf. Computer Aided Design (ICCAD '02), pp. 353360, Nov. 2002.
[18] K. Iwama, Y. Kambayashi, and S. Yamashita, “Transformation Rules for Designing CNOTBased Quantum Circuits,” Proc. 39th Design Automation Conf. (DAC '02), pp. 419425, June 2002.
[19] K.N. Patel, I.L. Markov, and J.P. Hayes, Efficient Synthesis of Linear Reversible Circuits, http://arXiv.org/quantph0302002, 2003.
[20] S.A. Wang, C.Y. Lu, I.M. Tsai, and S.Y. Kuo, “Modified Karnaugh Map for Quantum Boolean Circuit Construction,” Proc. Third IEEEConf. Nanotechnology (IEEENANO '03), vol. 2, pp. 651654, Aug. 2003.
[21] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms. MIT Press, 2001.