So, you've "built" a quantum internet that piggybacks on our meager WiFi like a college kid on laundry day 🧦🧺. That's 445 #qubits of "magic" spread over a few #IBM computers—just enough to impress your CS101 professor but not your cat 🐱. Welcome to the future of "quantum" clickbait! 🚀
https://github.com/mermaidnicheboutique-code/luxbin-quantum-internet #quantuminternet #technews #quantumcomputing #clickbait #HackerNews #ngated
GitHub - mermaidnicheboutique-code/luxbin-quantum-internet: World's first quantum internet over WiFi - 445 qubits across 3 IBM quantum computers

World's first quantum internet over WiFi - 445 qubits across 3 IBM quantum computers - mermaidnicheboutique-code/luxbin-quantum-internet

GitHub
GitHub - mermaidnicheboutique-code/luxbin-quantum-internet: World's first quantum internet over WiFi - 445 qubits across 3 IBM quantum computers

World's first quantum internet over WiFi - 445 qubits across 3 IBM quantum computers - mermaidnicheboutique-code/luxbin-quantum-internet

GitHub
So, I asked ChatGPT for a list of the most important people in #QuantumInternet are...and it didn't list me. I asked, "Why didn't you include me?" It replied, "I don't know who you are." So I told it...
New preprint from my group, another collaboration with the groups of David Elkouss and Akihito Soeda. Those guys are *good*, and so are my team, so this is a productive collaboration.
https://arxiv.org/abs/2512.06650
#quantumInternet #quantumcomputing
Efficient graph-diagonal characterization of noisy states distributed over quantum networks via Bell sampling

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.

arXiv.org
New preprint from my group, another collaboration with the groups of David Elkouss and Akihito Soeda. Those guys are *good*, and so are my team, so this is a productive collaboration. arxiv.org/abs/2512.06650 #quantumInternet #quantumcomputing

Efficient graph-diagonal chara...
Efficient graph-diagonal characterization of noisy states distributed over quantum networks via Bell sampling

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.

arXiv.org
New Nature Photonics demo links two quantum networks into one 8‑user system, routing and even “teleporting” entanglement on demand—using a programmable multimode optical fiber (under £100). Big step toward a real quantum internet. Read: https://postquantum.com/quantum-research/linking-two-quantum-networks/ #QuantumInternet #Photonics
Linking Two Quantum Networks

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

PostQuantum - Quantum Computing, Quantum Security, PQC
Hi, #quantum researchers and authors! Some friendly, informal, totally non-binding advice from your Editor in Chief at IEEE Transactions on Quantum Engineering (TQE). #QuantumComputing #QuantumInternet 1/about a hundred
IBM + Cisco are laying out a concrete path to network fault-tolerant quantum computers: PoC in ~5 years, metro links in the early 2030s, and a possible quantum internet by the late 2030s. It’s an architecture with timelines and research gaps. More: https://postquantum.com/industry-news/ibm-cisco-network-ftqc/ #QuantumInternet #QuantumComputing
IBM and Cisco Want to Network Fault‑Tolerant quantum computers

IBM and Cisco’s joint announcement this week is easy to misread as another “quantum + internet” headline. It isn’t. The two companies are laying out a step‑by‑step program to turn stand‑alone fault‑tolerant machines into a fabric: first a proof‑of‑concept linking multiple fault‑tolerant computers within five years, then a broader, distributed network in the early 2030s, and - if the physics and engineering behave - a fledgling “quantum computing internet” toward the late 2030s. That’s more than ambition; it’s a system architecture with timelines, components, and explicit research gaps.  IBM’s own blog frames the idea in one sentence I think is

PostQuantum - Quantum Computing, Quantum Security, PQC

IBM and Cisco are collaborating to build a global quantum network by the early 2030s, aiming to connect quantum computers for breakthroughs in computing, materials, and secure communications. The project tackles major technical challenges with a unified roadmap and open-source tools.

#QuantumComputing #IBM #Cisco #QuantumNetwork #QuantumInternet #FutureTech #Innovation #OpenSource #TechPartnership #TECHi

Read Full Article Here :- https://www.techi.com/ibm-cisco-quantum-computer-network/