Alireza Shabani

Alireza Shabani

Auto-generated profile, based on publicly available information

Alireza Shabani

Cisco Quantum Lab, Santa Monica, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 January 2024 in AVS Quantum Science
Verified
Journal Article
Open access
PDF file
ZYZebo Yang
Zebo Yang
AGAli Ghubaish
Ali Ghubaish
RJRaj Jain
Raj Jain
HSHassan Shapourian
Hassan Shapourian
ASAlireza Shabani
Alireza Shabani
With the emergence of the Quantum Internet, the need for advanced quantum networking techniques has significantly risen. Various models of quantum repeaters have been presented, each delineating a unique strategy to ensure quantum communication over long distances. We focus on repeaters that employ entanglement generation and swapping. This revolves around establishing remote end-to-end entanglement through repeaters, a concept we denote as the “quantum-native” repeaters (also called “first-generation” repeaters in some literature). The challenges in routing with quantum-native repeaters arise from probabilistic entanglement generation and restricted coherence time. Current approaches use synchronized time slots to search for entanglement-swapping paths, resulting in inefficiencies. Here, we propose a new set of asynchronous routing protocols for quantum networks by incorporating the idea of maintaining a dynamic topology in a distributed manner, which has been extensively studied in classical routing for lossy networks, such as using a destination-oriented directed acyclic graph or a spanning tree. The protocols update the entanglement-link topology asynchronously, identify optimal entanglement-swapping paths, and preserve unused direct-link entanglements. Our results indicate that asynchronous protocols achieve a larger upper bound with an appropriate setting and significantly higher entanglement rate than existing synchronous approaches, and the rate increases with coherence time, suggesting that it will have a much more profound impact on quantum networks as technology advances.

17 June 2023
Verified
Conference Paper
Open access
HZHezi Zhang
Hezi Zhang
AWAnbang Wu
Anbang Wu
YWYuke Wang
Yuke Wang
GLGushu Li
Gushu Li
HSHassan Shapourian
Hassan Shapourian
YDYufei Ding
Yufei Ding
In this paper, we propose OneQ, the first optimizing compilation framework for one-way quantum computation towards realistic photonic quantum architectures. Unlike previous compilation efforts for solid-state qubit technologies, our innovative framework addresses a unique set of challenges in photonic quantum computing. Specifically, this includes the dynamic generation of qubits over time, the need to perform all computation through measurements instead of relying on 1-qubit and 2-qubit gates, and the fact that photons are instantaneously destroyed after measurements. As pioneers in this field, we demonstrate the vast optimization potential of photonic one-way quantum computing, showcasing the remarkable ability of OneQ to reduce computing resource requirements by orders of magnitude.

27 April 2024
Verified
Conference Paper
Open access
HZHezi Zhang
Hezi Zhang
KYKeyi Yin
Keyi Yin
AWAnbang Wu
Anbang Wu
HSHassan Shapourian
Hassan Shapourian
ASAlireza Shabani
Alireza Shabani
YDYufei Ding
Yufei Ding
Chiplet architecture is an emerging architecture for quantum computing that could significantly increase qubit resources with its great scalability and modularity. However, as the computing scale increases, communication between qubits would become a more severe bottleneck due to the long routing distances. In this paper, we propose a multi-entry communication highway (MECH) mechanism to trade ancillary qubits for program concurrency, and build a compilation framework to efficiently manage and utilize the highway resources. Our evaluation shows that this framework significantly outperforms the baseline approach in both the circuit depth and the number of operations on typical quantum benchmarks. This implies a more efficient and less error-prone compilation of quantum programs.

10 September 2023
Verified
Conference Paper
Open access
SPShahrooz Pouryousef
Shahrooz Pouryousef
HSHassan Shapourian
Hassan Shapourian
ASAlireza Shabani
Alireza Shabani
DTDon Towsley
Don Towsley