Learn More
— We present the design of a self-routing quantum packet switch that exploits quantum parallelism to route all the input packets of an internally blocking self-routing network to its outputs. The packets are represented using quantum bits (qubits) and the quantum self-routing switch creates a superposition of all the maximum size non-blocking subsets of the(More)
Flexible distribution of data in the form of quantum bits (qubits) amongst spatially separated entities is an essential component of envisioned scalable quantum computing architectures. Since qubits cannot be copied, this operation of moving qubits can be relatively costly in terms of resources. Moreover, implementation of quantum gates requires precise and(More)
Recently, Tang et. al. introduced an algorithm called the programmable graph architecture (PGA) algorithm for multiplying matrices in GL(n,mu), the generalized linear group of matrices modulo mu, where mu is an integer, using its Cayley graph representation. The problem of multiplying matrices in GL(n,mu) is mapped to the problem of finding routes on a(More)
We investigate the routing and performance of sparse crossbar packet concen-trators under a buffered network model. The concentration property in packet switching concentrators is defined with respect to packets instead of input/output ports. This allows such concentrators to function as generalized connectors (with some constraints). This altered(More)
  • 1