Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rahul Ratan

dblp:65/2126 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 75% Interconnection networks and networks-on-chip · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Emerging computing paradigms
quantum computer architecture
0.112011
Self-Routing Quantum Sparse Crossbar Packet Concentrators · IEEE Trans. Computers 2011
Emerging computing paradigms
quantum computing
0.112011
Self-Routing Quantum Sparse Crossbar Packet Concentrators · IEEE Trans. Computers 2011
Emerging computing paradigms › quantum computer architecture › quantum network
quantum switch
0.112011
Self-Routing Quantum Sparse Crossbar Packet Concentrators · IEEE Trans. Computers 2011
Interconnection networks and networks-on-chip
switching network
0.112011
Self-Routing Quantum Sparse Crossbar Packet Concentrators · IEEE Trans. Computers 2011

Methods — techniques the papers use, named apart from their topics

sparse crossbar design · 0.1quantum circuit design · 0.1
YearPublicationVenuePosition
2011 Self-Routing Quantum Sparse Crossbar Packet Concentrators
abstract
Quantum switching networks are derived from conventional switching networks by replacing the classical switches by quantum switches. We give the quantum circuit design and routing of an n \times m network, called a quantum concentrator that can direct quantum bit packets in arbitrary quantum states from any of its k inputs to some of its k outputs, where 1 \le k \le m \le n. Our designs are based on sparse crossbars which are rectangular grids of 2 \times 2 crosspoints. Sparse crossbar concentrator structures with theoretically minimum crosspoint complexities for any values of n and m are well known but no self-routing algorithms have been reported for such concentrators. We transform two such families of optimal concentrators, called fat-slim and banded sparse crossbars into quantum networks and provide self-routing algorithms for these families of concentrators. In this process, we extend the notion of packet concentration to a quantum network and design self-routing quantum crosspoints from quantum gates. We address issues critical to quantum operation like reversibility and localized self-routing and give a rigorous proof that quantum fat-slim and banded sparse crossbar concentrators are self-routable. The self-routing algorithms described in the paper can be used for both quantum and classical sparse crossbar concentrators by the linearity property of all quantum systems.
Rahul Ratan, A. Yavuz Oruç
IEEE Trans. Computers1