Results 1 
9 of
9
The Quantum Baseline Network
, 2005
"... We present the design of a selfrouting quantum packet switch which improves on a previous design given by the authors [1]. Like the earlier design, this switch too routes packets represented by quantum bits (qubits) but it reduces the routing overhead per packet from O(log N) qubits to O(1) qubits ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present the design of a selfrouting quantum packet switch which improves on a previous design given by the authors [1]. Like the earlier design, this switch too routes packets represented by quantum bits (qubits) but it reduces the routing overhead per packet from O(log N) qubits to O(1) qubits by eliminating the need for an extra "dummy" inputoutput pair and their associated "dummy" packets at each 2 2 internal switch. The quantum selfrouting switch creates a superposition of all the maximum size nonblocking subsets of input packets at its outputs, which cannot be achieved by any classical selfrouting switching network that is internally blocking. In addition to the network design, we give a method to characterize the output quantum state of the switch using the concepts of frames and balanced matrices.
RANDOM ROUTING AND CONCENTRATION IN QUANTUM SWITCHING NETWORKS
, 2008
"... Flexible distribution of data in the form of quantum bits or qubits among spatially separated entities is an essential component of envisioned scalable quantum computing architectures. Accordingly, we consider the problem of dynamically permuting groups of quantum bits, i.e., qubit packets, using n ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Flexible distribution of data in the form of quantum bits or qubits among spatially separated entities is an essential component of envisioned scalable quantum computing architectures. Accordingly, we consider the problem of dynamically permuting groups of quantum bits, i.e., qubit packets, using networks of reconfigurable quantum switches. We demonstrate and then explore the equivalence between the quantum process of creation of packet superpositions and the process of randomly routing packets in the corresponding classical network. In particular, we consider an n × n Baseline network for which we explicitly relate the pairwise inputoutput routing probabilities in the classical random routing scenario to the probability amplitudes of the individual packet patterns superposed in the quantum output state. We then analyze the effect of using quantum random routing on a classically nonblocking configuration like the Beneš network. We prove that for an n × n quantum Beneš network, any input packet assignment with no output contention is probabilistically selfroutable. In particular, we prove that with random routing
Programming and compiling for embedded SIMD architectures
, 2008
"... The dissertation is submitted ..."
(Show Context)
Abstract
, 1999
"... Titanium is an objectoriented, explicitly parallel programming language for scientific computing. Because Titanium is a novel language, it lacks the rich collection of libraries available for high performance C and Fortran programming. PETSc is a suite of data structures and routines for the scalab ..."
Abstract
 Add to MetaCart
(Show Context)
Titanium is an objectoriented, explicitly parallel programming language for scientific computing. Because Titanium is a novel language, it lacks the rich collection of libraries available for high performance C and Fortran programming. PETSc is a suite of data structures and routines for the scalable parallel solution of problems modeled by partial differential equations. We describe T iPETSc, a Titanium interface to the PETSc library suite. Our design balances the need for efficiency against desires for expressiveness and easeofuse. A collection of micro and application benchmarks quantify the costs of the crosslanguage binding, with implications for future optimization needs and for language, library, and system design. 1
QUANTUM SWITCHING NETWORKS: UNICAST AND MULTICAST
, 2010
"... Quantum switching networks are analogs of classical switching networks in which classical switches are replaced by quantum switches. These networks are used to switch quantum data among a set of quantum sources and receivers. They can also be used to efficiently switch classical data, and help overc ..."
Abstract
 Add to MetaCart
Quantum switching networks are analogs of classical switching networks in which classical switches are replaced by quantum switches. These networks are used to switch quantum data among a set of quantum sources and receivers. They can also be used to efficiently switch classical data, and help overcome some limitations of classical switching networks by utilizing the unique properties of quantum information systems, such as superposition and parallelism. In this thesis, we design several such networks which can be broadly put in the following three categories: 1. Quantum unicast networks: We give the design of quantum Baseline network (QBN) which is a selfrouting and unicast quantum packet switch that uses the Baseline topology. The classical version of the network blocks packets internally even when there are no output contentions and each input packet is addressed to a different output. The QBN uses the principles of quantum superposition and parallelism to overcome such blocking. Also, for assignments that have multiple input packets addressed to an output, this net