Weekend reading with TechAptitude!
Quantum networks hold the potential to enable fundamentally new capabilities, including ultra-secure communication with unbreakable encryption, distributed quantum computing, and hold out the promise of creating a “Quantum Internet”. Check it out!
https://techaptitude.substack.com/p/quantum-networking-ready-for-prime?r=vn8b8 #Quantum #QuantumNetworking #QuantumComputing #Networking #FiberOptics #Optical #Qubits #Photons #QuantumInternet #TechAptitude
Entangling quantum networks build on new physical mechanisms to distribute quantum entanglement among a set of nodes over a set of links. To design a complete network protocol stack with proper division of responsibilities into layers, hardware and protocol engineers must share an understanding of those physical mechanisms and use a common vocabulary. This document bridges the abstract concepts described in [RFC9340] and the underlying physics to engineering concerns such as timing constraints on arrival of photons and exchange of supporting classical messages. The equations presented here will serve as reference points for architectural decisions in future documents, allowing future documents to deal directly in code without complex mathematics. Application-layer developers will not need the low-level physics presented here.
I built a quantum internet that runs on your WiFi
https://github.com/mermaidnicheboutique-code/luxbin-quantum-internet
#HackerNews #quantuminternet #WiFi #technology #innovation #hackernews #coding #quantumcomputing
Graph states are an important class of entangled states that serve as a key resource for distributed information processing and communication in quantum networks. In this work, we propose a protocol that utilizes a Bell sampling subroutine to characterize the diagonal elements in the graph basis of noisy graph states distributed across a network. Our approach offers significant advantages over direct diagonal estimation using unentangled single-qubit measurements in terms of scalability. Specifically, we prove that estimating the full vector of diagonal elements requires a sample complexity that scales linearly with the number of qubits ($\mathcal{O}(n)$), providing an exponential reduction in resource overhead compared to the best known $\mathcal{O}(2^n)$ scaling of direct estimation. Furthermore, we demonstrate that global properties, such as state fidelity, can be estimated with a sample complexity independent of the network size. Finally, we present numerical results indicating that the estimation in practice is more efficient than the derived theoretical bounds. Our work thus establishes a promising technique for efficiently estimating noisy graph states in large networks under realistic experimental conditions.
Graph states are an important class of entangled states that serve as a key resource for distributed information processing and communication in quantum networks. In this work, we propose a protocol that utilizes a Bell sampling subroutine to characterize the diagonal elements in the graph basis of noisy graph states distributed across a network. Our approach offers significant advantages over direct diagonal estimation using unentangled single-qubit measurements in terms of scalability. Specifically, we prove that estimating the full vector of diagonal elements requires a sample complexity that scales linearly with the number of qubits ($\mathcal{O}(n)$), providing an exponential reduction in resource overhead compared to the best known $\mathcal{O}(2^n)$ scaling of direct estimation. Furthermore, we demonstrate that global properties, such as state fidelity, can be estimated with a sample complexity independent of the network size. Finally, we present numerical results indicating that the estimation in practice is more efficient than the derived theoretical bounds. Our work thus establishes a promising technique for efficiently estimating noisy graph states in large networks under realistic experimental conditions.
A new paper in Nature Photonics by Natalia Herrera Valencia et al. (2025) reports a prototype quantum network that connects two previously separate networks into a single eight-user system. In practical terms, the team from Heriot-Watt University demonstrated a reconfigurable quantum photonic network that can route entanglement to different users on demand and even “teleport” entanglement across network boundaries. This achievement marks the first time two distinct quantum networks have been linked together, allowing one network to effectively talk to the other. It sets a new benchmark for the scale, versatility, and performance of quantum networks envisioned as the backbone
BGDon 🇨🇦 🇺🇸 👨💻
Rod Van Meter
N-gated Hacker News
Hacker News
Rod Van Meter
Marin Ivezic