arXiv subjects

Alireza Shabani

Publications and source records attributed to Alireza Shabani.

At least 19 recordsLinked to original sources

arXiv2025

Building a global quantum internet using a satellite constellation with inter-satellite links

The quantum internet is a global network to distribute entanglement and communicate quantum information with applications in cybersecurity, quantum computing, and quantum sensing. Here, we propose building a quantum internet using a constellation of low-Earth-orbit satellites equipped with inter-satellite laser links. Our proposal is based on the downlink model of photon transmission, where satellites carry entangled photon sources and/or have a mirror relay system to redirect the photon path in space. We show that few MHz entanglement distribution rates are possible between the US, Europe, and Asia, with a multiplexed entangled-photon source generating pairs at 10 GHz. Our proposal demonstrates the importance of passive optics in realizing a satellite-based quantum internet, which reduces dependency on quantum memory and repeater technologies.

quant-ph↗

arXiv2025

MECH: Multi-Entry Communication Highway for Superconducting Quantum Chiplets

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.

quant-ph↗

arXiv2024

Resource Placement for Rate and Fidelity Maximization in Quantum Networks

Existing classical optical network infrastructure cannot be immediately used for quantum network applications due to photon loss. The first step towards enabling quantum networks is the integration of quantum repeaters into optical networks. However, the expenses and intrinsic noise inherent in quantum hardware underscore the need for an efficient deployment strategy that optimizes the allocation of quantum repeaters and memories. In this paper, we present a comprehensive framework for network planning, aiming to efficiently distributing quantum repeaters across existing infrastructure, with the objective of maximizing quantum network utility within an entanglement distribution network. We apply our framework to several cases including a preliminary illustration of a dumbbell network topology and real-world cases of the SURFnet and ESnet. We explore the effect of quantum memory multiplexing within quantum repeaters, as well as the influence of memory coherence time on quantum network utility. We further examine the effects of different fairness assumptions on network planning, uncovering their impacts on real-time network performance.

quant-ph↗

arXiv2023

Asynchronous Entanglement Routing for the Quantum Internet

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 (DODAG) 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.

cs.NI↗

arXiv2023

Quantum Autoencoders for Learning Quantum Channel Codes

This work investigates the application of quantum machine learning techniques for classical and quantum communication across different qubit channel models. By employing parameterized quantum circuits and a flexible channel noise model, we develop a machine learning framework to generate quantum channel codes and evaluate their effectiveness. We explore classical, entanglement-assisted, and quantum communication scenarios within our framework. Applying it to various quantum channel models as proof of concept, we demonstrate strong performance in each case. Our results highlight the potential of quantum machine learning in advancing research on quantum communication systems, enabling a better understanding of capacity bounds under modulation constraints, various communication settings, and diverse channel models.

quant-ph↗

arXiv2023

OneQ: A Compilation Framework for Photonic One-Way Quantum Computation

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.

quant-ph↗

arXiv2023

Quantum Volume for Photonic Quantum Processors

Defining metrics for near-term quantum computing processors has been an integral part of the quantum hardware research and development efforts. Such quantitative characteristics are not only useful for reporting the progress and comparing different quantum platforms, but also essential for identifying the bottlenecks and designing a technology roadmap. Most metrics such as randomized benchmarking and quantum volume were originally introduced for circuit-based quantum computers and were not immediately applicable to measurement-based quantum computing (MBQC) processors such as in photonic devices. In this paper, we close this gap by presenting a framework to map physical noises and imperfections in MBQC processes to logical errors in equivalent quantum circuits, whereby enabling the well-known metrics to characterize MBQC. To showcase our framework, we study a continuous-variable cluster state based on the Gottesman-Kitaev-Preskill (GKP) encoding as a near-term candidate for photonic quantum computing, and derive the effective logical gate error channels and calculate the quantum volume in terms of the GKP squeezing and photon loss rate.

quant-ph↗

arXiv2023

Quantum key distribution in a packet-switched network

Packet switching revolutionized the Internet by allowing the efficient use of network resources for data transmission. In a previous work, we introduced packet switching in quantum networks as a path to the Quantum Internet and presented a proof-of-concept for its application to quantum key distribution (QKD). In this paper, we outline a three-step approach for key rate optimization in a packet-switched network. Our simulated results show that practical key rates may be achieved in a sixteen-user network with no optical storage capacity. Under certain network conditions, we may improve the key rate by using an ultra-low-loss fiber delay line to store packets during network delays. We also find that implementing cut-off storage times in a strategy analogous to real-time selection in free-space QKD can significantly enhance performance. Our work demonstrates that packet switching is imminently suitable as a platform for QKD, an important step towards developing large-scale and integrated quantum networks.

quant-ph↗

arXiv2023

Modular architectures to deterministically generate graph states

Graph states are a family of stabilizer states which can be tailored towards various applications in photonic quantum computing and quantum communication. In this paper, we present a modular design based on quantum dot emitters coupled to a waveguide and optical fiber delay lines to deterministically generate N-dimensional cluster states and other useful graph states such as tree states and repeater states. Unlike previous proposals, our design requires no two-qubit gates on quantum dots and at most one optical switch, thereby, minimizing challenges usually posed by these requirements. Furthermore, we discuss the error model for our design and demonstrate a fault-tolerant quantum memory with an error threshold of 0.53% in the case of a 3d graph state on a Raussendorf-Harrington-Goyal (RHG) lattice. We also provide a fundamental upper bound on the correctable loss in the fault-tolerant RHG state based on the percolation theory, which is 1.24 dB or 0.24 dB depending on whether the state is directly generated or obtained from a simple cubic cluster state, respectively.

quant-ph↗

arXiv2022

AutoComm: A Framework for Enabling Efficient Communication in Distributed Quantum Programs

Distributed quantum computing (DQC) is a promising approach to extending the computational power of near-term quantum devices. However, the non-local quantum communication between quantum devices is much more expensive and error-prone than the local quantum communication within each quantum device. Previous work on the DQC communication optimization focus on optimizing the communication protocol for each individual non-local gate and then adopt quantum compilation designs which are designed for local multi-qubit gates (such as controlled-x or CX gates) in a single quantum computer. The communication patterns in distributed quantum programs are not yet well studied, leading to a far-from-optimal communication cost. In this paper, we identify burst communication, a specific qubit-node communication pattern that widely exists in many distributed programs and can be leveraged to guide communication overhead optimization. We then propose AutoComm, an automatic compiler framework to first extract the burst communication patterns from the input programs, and then optimize the communication steps of burst communication discovered. Experimental results show that our proposed AutoComm can reduce the communication resource consumption and the program latency by 75.6% and 71.4% on average, respectively.

quant-ph↗

arXiv2022

All-photonic one-way quantum repeaters

Quantum repeater is the key technology enabler for long-distance quantum communication. To date, most of the existing quantum repeater protocols are designed based on specific quantum codes or graph states. In this paper, we propose a general framework for all-photonic one-way quantum repeaters based on the measurement-based error correction, which can be adapted to any Calderbank-Shor-Steane codes including the recently discovered quantum low density parity check (QLDPC) codes. We present a novel decoding scheme, where the error correction process is carried out at the destination based on the accumulated data from the measurements made across the network. This procedure not only outperforms the conventional protocols with independent repeaters but also simplifies the local quantum operations at repeaters. As an example, we numerically show that the [[48,6,8]] generalized bicycle code (as a small but efficient QLDPC code) has an equally good performance while reducing the resources by at least an order of magnitude.

quant-ph↗

arXiv2022

Packet Switching in Quantum Networks: A Path to Quantum Internet

Large-scale quantum networks with thousands of nodes require scalable network protocols and physical hardware to realize. In this work, we introduce packet switching as a new paradigm for quantum data transmission in both future and near-term quantum networks. We propose a classical-quantum data frame structure and explore methods of frame generation and processing. Further, we present conceptual designs for a quantum reconfigurable optical add-drop multiplexer to realize the proposed transmission scheme. Packet switching allows for a universal design for a next generation Internet where classical and quantum data share the same network protocols and infrastructure. In this new quantum networking paradigm, entanglement distribution, as with quantum key distribution, is an application built on top of the quantum network rather than as a network designed especially for those purposes. For analysis of the network model, we simulate the feasibility of quantum packet switching for some preliminary models of quantum key and entanglement distribution. Finally, we discuss how our model can be integrated with other network models toward a realization of a quantum Internet.

quant-ph↗

arXiv2019

High-Quality Protein Force Fields with Noisy Quantum Processors

A central problem in biophysics and computational drug design is accurate modeling of biomolecules. The current molecular dynamics simulation methods can answer how a molecule inhibits a cancerous cell signaling pathway, or the role of protein misfolding in neurodegenerative diseases. However, the accuracy of current force fields (interaction potential) limits the reliability of computer simulations. Fundamentally a quantum chemistry problem, here we discuss optimizing force fields using scalable ab initio quantum chemistry calculations on quantum computers and estimate the quantum resources required for this task. For a list of dipeptides for local parameterizations, we estimate the required number of qubits to be 1576 to 3808 with cc-pVTZ(-f) orbital basis and 88 to 276 with active space reduction. Using a linear depth ansatz with active-space reduction, we estimate a quantum circuit with a circuit depth of few thousands can be used to simulate these dipeptides. The estimated number of 100s of qubits and a few thousand long circuit depth puts the pharmaceutical application of near-term quantum processors in a realistic perspective.

quant-ph↗

arXiv2017

Optimally Stopped Variational Quantum Algorithms

Quantum processors promise a paradigm shift in high-performance computing which needs to be assessed by accurate benchmarking measures. In this work, we introduce a new benchmark for variational quantum algorithm (VQA), recently proposed as a heuristic algorithm for small-scale quantum processors. In VQA, a classical optimization algorithm guides the quantum dynamics of the processor to yield the best solution for a given problem. A complete assessment of scalability and competitiveness of VQA should take into account both the quality and the time of dynamics optimization. The method of optimal stopping, employed here, provides such an assessment by explicitly including time as a cost factor. Here we showcase this measure for benchmarking VQA as a solver for some quadratic unconstrained binary optimization. Moreover we show that a better choice for the cost function of the classical routine can significantly improve the performance of the VQA algorithm and even improving it's scaling properties.

quant-ph↗

arXiv2017

Tunable inductive coupling of superconducting qubits in the strongly nonlinear regime

For a variety of superconducting qubits, tunable interactions are achieved through mutual inductive coupling to a coupler circuit containing a nonlinear Josephson element. In this paper we derive the general interaction mediated by such a circuit under the Born-Oppenheimer Approximation. This interaction naturally decomposes into a classical part, with origin in the classical circuit equations, and a quantum part, associated with the coupler's zero-point energy. Our result is non-perturbative in the qubit-coupler coupling strengths and in the coupler nonlinearity. This can lead to significant departures from previous, linear theories for the inter-qubit coupling, including non-stoquastic and many-body interactions. Our analysis provides explicit and efficiently computable series for any term in the interaction Hamiltonian and can be applied to any superconducting qubit type. We conclude with a numerical investigation of our theory using a case study of two coupled flux qubits, and in particular study the regime of validity of the Born-Oppenheimer Approximation.

quant-ph↗

arXiv2017

Modelling and Filtering for Non-Markovian Quantum Systems

This paper presents an augmented Markovian system model for non-Markovian quantum systems. In this augmented system model, ancillary systems are introduced to play the role of internal modes of the non-Markovian environment converting white noise to colored noise. Consequently, non-Markovian dynamics are represented as resulting from direct interaction of the principal system with the ancillary system. To demonstrate the utility of the proposed augmented system model, it is applied to design whitening quantum filters for non-Markovian quantum systems. Examples are presented to illustrate how whitening quantum filters can be utilized for estimating non-Markovian linear quantum systems and qubit systems. In particular, we showed that the augmented Markovian formulation can be used to theoretically model the environment for an observed non-Markovian behavior in a recent experiment on quantum dots [ Phys. Rev. Lett., 108:046807, 2012]

quant-ph↗

arXiv2017

Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle

We use Pontryagin's minimum principle to optimize variational quantum algorithms. We show that for a fixed computation time, the optimal evolution has a bang-bang (square pulse) form, both for closed and open quantum systems with Markovian decoherence. Our findings support the choice of evolution ansatz in the recently proposed Quantum Approximate Optimization Algorithm. Focusing on the Sherrington-Kirkpatrick spin-glass as an example, we find a system-size independent distribution of the duration of pulses, with characteristic time scale set by the inverse of the coupling constants in the Hamiltonian. The optimality of the bang-bang protocols and the characteristic time scale of the pulses provide an efficient parameterization of the protocol and inform the search for effective hybrid (classical and quantum) schemes for tackling combinatorial optimization problems. For the particular systems we study, we find numerically that the optimal nonadiabatic bang-bang protocols outperform conventional quantum annealing in the presence of weak white additive external noise and weak coupling to a thermal bath modeled with the Redfield master equation.

quant-ph↗

arXiv2016

Artificial quantum thermal bath: Engineering temperature for a many-body quantum system

Temperature determines the relative probability of observing a physical system in an energy state when that system is energetically in equilibrium with its environment. In this paper, we present a theory for engineering the temperature of a quantum system different from its ambient temperature. We define criteria for an engineered quantum bath that, when coupled to a quantum system with Hamiltonian $H$, drives the system to the equilibrium state $\frac{e^{-H/T}}{\rm{Tr}(e^{-H/T})}$ with a tunable parameter $T$. This is basically an analog counterpart of the digital quantum metropolis algorithm. For a system of superconducting qubits, we propose a circuit-QED approximate realization of such an engineered thermal bath consisting of driven lossy resonators. Our proposal opens the path to simulate thermodynamical properties of many-body quantum systems of size not accessible to classical simulations. Also we discuss how an artificial thermal bath can serve as a temperature knob for a hybrid quantum-thermal annealer.

quant-ph↗