Subscribe

Issue No.06 - June (2010 vol.59)

pp: 735-747

Manish Kumar Shukla , University of Maryland, College Park

A. Yavuz Oruç , University of Maryland, College Park

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2010.52

ABSTRACT

In this paper, we present a quantum multicasting network, called a generalized quantum connector (n-GQC), which can be used to multicast quantum information from n inputs to n outputs. This network is recursively constructed using n/2-GQCs and consists of O(n \log^2 n) quantum gates. The key component of the n-GQC is another network, called an n-quantum concentrator (n--QC). This concentrator is also an n \times n quantum network, and can route arbitrary quantum states on any m of its inputs to its top m outputs, for any m, 1\le m\le n. Its quantum gate complexity is O(n\log n). The quantum gate-level depths of n-QC and n-GQC are O(\log^2n) and O(\log^3 n), respectively. Both n-QC and n-GQC are based on the classical self-routing concentrators and generalized connection networks given by Lee and Oruç [1]. While these networks work for multicasting classical packets, they cannot be used to multicast quantum packets as they employ balancer switches with both forward and backward propagation of packets. We introduce a quantum balancer switch that works using a forward propagation of packets only, thereby facilitating the n-QC and n-GQC designs presented in the paper.

INDEX TERMS

Generalized quantum connector, quantum concentrator, quantum switching, quantum information, switching networks, quantum multicasting.

CITATION

Manish Kumar Shukla, A. Yavuz Oruç, "Multicasting in Quantum Switching Networks",

*IEEE Transactions on Computers*, vol.59, no. 6, pp. 735-747, June 2010, doi:10.1109/TC.2010.52REFERENCES

- [1] C.Y. Lee and A.Y. Oruç, "Design of Efficient and Easily Routable Generalized Connectors,"
IEEE Trans. Comm., vol. 43, nos. 2-4, pp. 646-650, Feb.-Apr. 1995.- [2] P.W. Shor, "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer,"
SIAM Rev., vol. 41, no. 2, pp. 303-332, June 1999.- [3] L.K. Grover, "A Fast Quantum Mechanical Algorithm for Database Search,"
Proc. 28th Ann. ACM Symp. Theory of Computing, pp. 212-219, May 1996.- [4] M. Oskin, F.T. Chong, I.L. Chuang, and J. Kubiatowicz, "Building Quantum Wires: The Long and the Short of It,"
Proc. 30th Ann. Int'l Symp. Computer Architecture, pp. 374-385, 2003.- [5] C. Moore and M. Nilsson, "Parallel Quantum Computation and Quantum Codes,"
SIAM J. Computing, vol. 31, no. 3, pp. 799-815, 2001.- [6] I.M. Tsai and S.Y. Kuo, "Digital Switching in the Quantum Domain,"
IEEE Trans. Nanotechnology, vol. 1, no. 3, pp. 154-164, Sept. 2002.- [7] M.K. Shukla, R. Ratan, and A.Y. Oruç, "A Quantum Self-Routing Packet Switch,"
Proc. 38th Ann. Conf. Information Sciences and Systems (CISS '04), pp. 484-489, Mar. 2004.- [8] M.K. Shukla, R. Ratan, and A.Y. Oruç, "The Quantum Baseline Network,"
Proc. 39th Ann. Conf. Information Sciences and Systems (CISS '05), Mar. 2005.- [9] S.T. Cheng and C.Y. Wang, "Quantum Switching and Quantum Merge Sorting,"
IEEE Trans. Circuits and Systems, vol. 53, no. 2, pp. 316-325, Feb. 2006.- [10] C.C. Sue, "An Enhanced Universal n x n Fully Nonblocking Quantum Switch,"
IEEE Trans. Computers, vol. 58, no. 2, pp. 238-250, Feb. 2009.- [11] C.Y. Lee and A.Y. Oruç, "Design of Efficient and Easily Routable Generalized Connectors," Technical Report UMIACS-TR-92-22,CS-TR-2846, Inst. for Advanced Computer Studies, Univ. of Maryland, College Park, 1992.
- [12] J.P. Ofman, "A Universal Automaton,"
Trans. Moscow Math. Soc., vol. 14, pp. 200-215, 1965.- [13] C.D. Thompson, "Generalized Connection Networks for Parallel Processor Intercommunication,"
IEEE Trans. Computers, vol. 27, no. 12, pp. 1119-1125, Dec. 1978.- [14] Y. Yang and G.M. Masson, "Nonblocking Broadcast Switching Networks,"
IEEE Trans. Computers, vol. 40, no. 9, pp. 1005-1015, Sept. 1991.- [15] D. Nassimi and S. Sahni, "Parallel Permutation and Sorting Algorithms and a New Generalized Connection Network,"
J. ACM, vol. 29, pp. 642-667, July 1982.- [16] M.A. Nielsen and I.L. Chuang,
Quantum Computation and Quantum Information. Cambridge Univ. Press, Sept. 2000.- [17] J. Preskill, "Physics 229: Advanced Mathematical Methods of Physics—Quantum Computation and Information," http://www.theory.caltech.edu/people/preskill ph229, 1998.
- [18] W. Wootters and W. Zurek, "A Single Quantum Cannot be Cloned,"
Nature, vol. 299, pp. 802-803, 1982.- [19] V. Bužek and M. Hillery, "Quantum Copying: Beyond the No-Cloning Theorem,"
Physical Rev. A, vol. 54, no. 3, pp. 1844-1852, Sept. 1996.- [20] R. Ratan, M.K. Shukla, and A.Y. Oruç, "Quantum Switching Networks with Classical Routing,"
Proc. 41st Ann. Conf. Information Sciences and Systems (CISS '07), pp. 789-793, Mar. 2007.- [21] N. McKeown and B. Prabhakar, "Scheduling Multicast Cells in an Input Queued Switch,"
Proc. IEEE INFOCOM, vol. 1, pp. 261-278, Mar. 1996.- [22] B. Prabhakar, N. McKeown, and R. Ahuja, "Multicast Scheduling for Input-Queued Switches,"
IEEE J. Selected Areas Comm., vol. 15, no. 5, pp. 855-866, June 1997.- [23] M.A. Marsan, A. Bianco, P. Giaccone, E. Leonardi, and F. Neri, "Multicast Traffic in Input-Queued Switches: Optimal Scheduling and Maximum Throughput,"
IEEE/ACM Trans. Networking, vol. 11, no. 3, pp. 465-477, June 2003.- [24] D. Pan and Y. Yang, "FIFO-Based Multicast Scheduling Algorithm for Virtual Output Queued Packet Switches,"
IEEE Trans. Computers, vol. 54, no. 10, pp. 1283-1297, Oct. 2005.- [25] N. Mckeown, A. Mekkittikul, V. Anantharam, and J. Walrand, "Achieving 100 Percent Throughput in an Input-Queued Switch,"
IEEE Trans. Comm., vol. 47, no. 8, pp. 1260-1267, Aug. 1999.- [26] D. Shah, P. Giaccone, and B. Prabhakar, "Efficient Randomized Algorithms for Input-Queued Switch Scheduling,"
IEEE Micro, vol. 22, no. 1, pp. 10-18, Jan./Feb. 2002.- [27] V. Bužek, S.L. Braunstein, M. Hillery, and D. Bruss, "Quantum Copying: A Network,"
Physical Rev. A, vol. 56, no. 5, pp. 3446-3452, Nov. 1997. |