Fast State Stabilization Using Deep Reinforcement Learning for Measurement-Based Quantum Feedback Control

Abstract: The stabilization of quantum states is a fundamental problem for realizing various quantum technologies. Measurement-based-feedback strategies have demonstrated powerful performance, and the construction of quantum control signals using measurement information has attracted great interest. However, the interaction between quantum systems and the environment is inevitable, especially when measurements are introduced, which leads to decoherence. […]

Fidelity-Aware Multipath Routing for Multipartite State Distribution in Quantum Networks

Abstract: We consider the problem of distributing entangled multipartite states across a quantum network with improved distribution rate and fidelity. For this, we propose fidelity-aware multipath routing protocols, assess their performance in terms of the rate and fidelity of the distributed Greenberger–Horne–Zeilinger (GHZ) states, and compare such performance against that of single-path routing. Simulation results […]

Quantum Direct-Sequence Spread-Spectrum CDMA Communication Systems: Mathematical Foundations

Abstract: This article describes the fundamental principles and mathematical foundations of quantum direct-sequence spread-spectrum code division multiple-access communication systems. The evolution of quantum signals through the quantum direct-sequence spread-spectrum multiple-access communication system is carefully characterized by a novel approach called the decomposition of creation operators. In this methodology, the creation operator of the transmitted quantum […]

Optimized Distribution of Entanglement Graph States in Quantum Networks

Building large-scale quantum computers, essential to demonstrating quantum advantage, is a key challenge. Quantum networks can help address this challenge by enabling the construction of large, robust, and more capable quantum computing platforms by connecting smaller quantum computers. Moreover, unlike classical systems, quantum networks can enable fully secured long-distance communication. Thus, quantum networks lie at […]

Entanglement Routing in Quantum Networks: A Comprehensive Survey

Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine through swapping operations to establish end-to-end entanglement between two distant nodes. Similar to traditional routing technologies, a quantum routing protocol uses network information to choose the best paths to satisfy a set of end-to-end entanglement requests. However, in […]

Fault-Tolerant One-Way Noiseless Amplification for Microwave Bosonic Quantum Information Processing

Microwave quantum information networks require reliable transmission of single-photon propagating modes over lossy channels. In this article, we propose a microwave noiseless linear amplifier (NLA) suitable to circumvent the losses incurred by a flying photon undergoing an amplitude damping channel (ADC). The proposed model is constructed by engineering a simple 1-D four-node cluster state. Contrary […]

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 toward 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 placement […]

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 toward 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 placement […]

Approximate Solutions of Combinatorial Problems via Quantum Relaxations

Combinatorial problems are formulated to find optimal designs within a fixed set of constraints and are commonly found across diverse engineering and scientific domains. Understanding how to best use quantum computers for combinatorial optimization remains an ongoing area of study. Here, we propose new methods for producing approximate solutions to quadratic unconstrained binary optimization problems, […]