Quantum News
Sign InSign Up
Home/Quantum Technology/Quantum Networking & Communications: Quantum Internet & Entanglement

Quantum Networking & Communications: Quantum Internet & Entanglement

Quantum internet news: quantum communications, quantum repeaters, entanglement distribution, quantum teleportation. Network architecture updates.

2,273 Articles
Updated Daily

Quantum networking connects distant quantum processors via entanglement distribution, enabling distributed quantum computing, provably secure communications, and quantum sensor arrays.

India's Quantum Networking and Communications Initiatives

India's National Quantum Mission includes quantum communication as a major vertical with specific deliverables: satellite-based secure quantum communications between ground stations over 2000 kilometers; long-distance secure quantum communications with other countries; inter-city quantum key distribution over 2000 km; and multi-node quantum networks with quantum memories.

The IITM C-DOT Samgnya Technologies Foundation at IIT Madras serves as the Thematic Hub on Quantum Communication. Established in partnership with the Centre for Development of Telematics (C-DOT), the hub focuses on quantum cryptography, post-quantum security, QKD networks, quantum memory, quantum repeaters, and satellite-enabled quantum communication.

ISRO plans satellite-based quantum communication missions to demonstrate space-based quantum links. The Society for Applied Microwave Electronics Engineering & Research (SAMEER) in Mumbai develops indigenous QKD systems. The Centre for Development of Telematics (C-DOT) integrates quantum communication with national telecom infrastructure.

The NQM targets operational quantum communication networks connecting major Indian cities, with potential applications in government secure communications, financial transaction security, and defense applications.

Quantum Networking is the Missing Link to Scale Quantum Computing - Electronic Designquantum-computing

Quantum Networking is the Missing Link to Scale Quantum Computing - Electronic Design

Quantum Networking is the Missing Link to Scale Quantum Computing Electronic Design

Google News – Quantum ComputingLoading...0
Researchers Find Fermionic Quantum Error Correction Needs Extra Steps - Quantum Zeitgeist
Featured
quantum-computing

Researchers Find Fermionic Quantum Error Correction Needs Extra Steps - Quantum Zeitgeist

Fermionic platforms offer compelling architectures for quantum computing, ranging from topologically protected Majorana-based qubits to fermionic cold atoms. To achieve scalability, they require quantum error correction. The research proves that any exact and sufficiently accurate approximate fermionic quantum error correction necessarily requires non-Gaussian operations, beyond the free-fermion regime of quadratic dynamics. This is in sharp contrast to the qubit setting, where efficiently classically simulable stabilizer operations form the standard framework for quantum error correction. Specifically, the study demonstrates that the logical space of any non-trivial fermionic error-correcting code contains no pure states. Non-Gaussian Operations Essential For Strong Fermionic Error Correction Scientists at Freie Universität Berlin, collaborating with Quantum Research Centre Tsinghua University and Technology Innovation Institute, have identified a key limitation for scalable quantum computation utilising fermions. They proved that sufficiently accurate fermionic error correction requires non-Gaussian operations when Majorana distance reaches dF ≥3, a threshold previously impossible to cross. Existing codes relied on simpler free-fermion dynamics but lacked the capacity for strong logical qubit protection against accumulating errors during complex calculations. This incompatibility is rooted in Wick’s theorem which governs particle correlations, establishing that the logical space within any effective fermionic code cannot contain pure states describable by Gaussian statistics. The team quantified this limitation showing the number of necessary ‘non-Gaussian gates’ grows linearly alongside both error-protection strength and logically stored information within the system. Further analysis revealed distinctions between how fermions and bosons handle entanglement distillation, a process vital for extending communication range in quantum networks; Gaussian fermionic ope

Google News – Quantum ComputingLoading...0
Several postdoc positions @PhIQuS, Inria Saclay, Paris in quantum information theoryquantum-computing

Several postdoc positions @PhIQuS, Inria Saclay, Paris in quantum information theory

Several postdoc positions @PhIQuS, Inria Saclay, Paris in quantum information theory Application deadline: Monday, November 30, 2026Research group: PhiQus - Inria Saclay, Institut Polytechnique de ParisEmployer web page: Inria SaclayJob type: PostDocTags: quantum informationentanglementquantum correlationsquantum foundationsNoncommutative polynomial optimisationquantum networksnonlocalityI am recruiting several PostDocs in my group at Inria Saclay, Ecole Polytechnique near Paris on the following topics: - Quantum Distributed Computing - Quantum correlations, quantum nonlocality, entanglement - Fermionic quantum information - Quantum Foundations - Mathematical Physics (Noncommutative polynomial optimisation, C* Algebras) - More generally, all areas of Quantum Information Theory Precise projects will be tailored to your expertise. To explore the possibility of joining the group, email me (marc-olivier.renou@inria.fr). These positions are funded by my ERC Starting Grant QINF (fundamental laws ruling Quantum INFormation: bits, qubits and fermionic bits (febits) in networks - see https://marcolivierrenou.com/erc-qinf/), which studies how fermions can carry and process information in ways standard qubits cannot, and by the QuantERA project Quantum Network Algorithms (QNA, 2026–2029 - see https://research.cs.aalto.fi/da/qna/), which aims to identify the first distributed tasks with a practical quantum advantage. As part of a new INRIA Team located in Saclay, you will have the possibility to collaborate with other quantum information researchers in Paris area and abroad: - Distributed Computing: Jukka Suomela (Aalto, Finland), François Le Gall (Nagoya), and the other members of the QNA consortium, ... - Quantum Physics: Nicolas Gisin (Geneva), Omar Fawzi (Inria Lyon), Antonio Acín (ICFO, Barcelona), David Gross (Cologne), ... - Polynomial optimisation: Victor Magron (LAAS Toulouse), Igor Klep (Ljubljana), ... - Inria teams Quriosity, Quacs, Cosmiq,

QuantikiLoading...0
Restricting Trainable Lie-Algebra Growth in Equivariant Quantum Networks via Hierarchical Ancilla-Controlled Subspace Projectionsquantum-computing

Restricting Trainable Lie-Algebra Growth in Equivariant Quantum Networks via Hierarchical Ancilla-Controlled Subspace Projections

--> Quantum Physics arXiv:2609.30283 (quant-ph) [Submitted on 3 Sep 2026] Title:Restricting Trainable Lie-Algebra Growth in Equivariant Quantum Networks via Hierarchical Ancilla-Controlled Subspace Projections Authors:Ting Li, Zhiming Xiao, Qibiao Tang View a PDF of the paper titled Restricting Trainable Lie-Algebra Growth in Equivariant Quantum Networks via Hierarchical Ancilla-Controlled Subspace Projections, by Ting Li and 2 other authors View PDF HTML (experimental) Abstract:Equivariant quantum networks encode symmetry as an inductive bias, which can improve generalization and may also favor optimization convergence. Equivariance alone, however, does not constrain the noncommuting closure of trainable generators, and this closure can still grow rapidly in symmetry-preserving variational circuits. We introduce a hierarchical ancilla-controlled architecture that addresses this Lie-algebra-growth mechanism. Commuting invariant-sector projectors on the data register select parameterized operations on a shared ancilla register, where the noncommuting trainable dynamics is confined. The trainable circuit decomposes into compatible joint sectors, giving a sector-probability-weighted ancilla response and an explicit view of parameter sharing across hierarchical paths. For an ancilla dimension $d_A=2^m$ and $K_\ell$ retained layer-wise control modes, we prove the group-independent bound $\dim(\mathfrak g)\le (d_A^2-1)\prod_{\ell=1}^{L}(K_\ell+1)$. The bound is polynomial in the number of data qubits when $m$ and $K_\ell$ remain constant along a logarithmic-depth hierarchy. Particle-number and parity projectors illustrate the general construction, while a fixed Clebsch--Gordan coupling tree supplies a concrete $SU(2)$ realization with rotation-invariant scalar outputs. Finite-size state-vector simulations exhibit slower gradient-variance decay and larger initialization gradients than generic and conventional rotationally equivariant circuits over the studied system sizes.

arXiv Quantum PhysicsLoading...0
Generation of Photonic Graph States with minimal number of quantum emittersquantum-computing

Generation of Photonic Graph States with minimal number of quantum emitters

--> Quantum Physics arXiv:2609.30400 (quant-ph) [Submitted on 24 Sep 2026] Title:Generation of Photonic Graph States with minimal number of quantum emitters Authors:Konstantinos-Rafail Revis, Nils Tomke Ottink, Pierre-Emmanuel Emeriau, Paul Hilaire View a PDF of the paper titled Generation of Photonic Graph States with minimal number of quantum emitters, by Konstantinos-Rafail Revis and 3 other authors View PDF HTML (experimental) Abstract:Graph states are a fundamental resource for measurement and fusion-based quantum computing, quantum networks, and sensing. Preparing them in a photonic system deterministically is, in principle, possible, but finding efficient schemes to prepare them was a long-standing problem addressed recently. Additionally, heuristic optimization schemes for reducing the required number of two-qubit gates were developed. However, the problem of reducing the number of emitters by optimizing the emission ordering was not addressed, due to its computational complexity, as it is connected to a well-known NP-hard problem from graph theory, the linear rank width computation. In this work, we focus on developing heuristic polynomial algorithms to reduce the number of emitters required. In total, we propose four distinct algorithms, which demonstrate up to $30\%$ emitter reduction on random graphs. Furthermore, we provide numerical and statistical evidence that the combination of our optimization schemes with the preexisting algorithms for optimizing the two-qubit gates of the preparation protocol can further reduce them by around $20\%$. Finally, we examine the developed algorithms for various useful graph state families, such as graphs useful for measurement-based quantum algorithms, and cluster states and graph codes used for quantum error correction, to determine the performance of each algorithm. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2609.30400 [quant-ph]   (or arXiv:2609.30400v1 [quant-ph] for this version)   ht

arXiv Quantum PhysicsLoading...0
A 0.11 threshold defines secure quantum data for learningquantum-computing

A 0.11 threshold defines secure quantum data for learning

Jeongho Bang of Yonsei University established a security threshold of η_(BB84)≃0.11 defining acceptable noise levels in a BB84 protocol while still allowing a machine learning model to learn data securely and within a defined sample budget. This number marks a boundary for secure machine learning, connecting the formal framework of probably-approximately-correct (PAC) learning with the practical consideration of data-path security. The research specifically applies this framework to a “BB84-like quantum label path,” linking abstract security theory to the principles of quantum key distribution. The work demonstrates that the quantum component transforms a chosen noise tolerance into a testable security condition by connecting information acquisition to measurable disturbance. PAC Learning with Budget Constraints Defines Secure Quantum Data A security threshold of 0.11 was established by the research, creating a novel connection between concepts rarely linked in existing frameworks. This operational theory of secure learning centers on an explicit stopping time, combining a trained hypothesis reaching target accuracy with a validation gate halting within a finite sample budget. The work derives a closed-form requirement for this combined PAC-within-budget guarantee, operating under an admissible random-classification-noise channel. Under assumptions of ideal single-qubit operation, authenticated classical channels, memoryless systems, basis symmetry, collective attacks, asymptotic behavior and one-way reconciliation, the standard Holevo bound provides a protocol-specific information-advantage criterion. According to the paper published in Quantum Science and Technology, “The quantum layer is not invoked to reduce distribution-free PAC sample complexity; rather, it turns a designer-chosen classical noise tolerance into a physically testable, protocol-dependent security condition by linking information acquisition to observable disturbance.” Below the ηBB84≃0.11 thresh

Quantum ZeitgeistLoading...0
Nanjing University boosts quantum key rates for three-user networksquantum-computing

Nanjing University boosts quantum key rates for three-user networks

Nanjing University researchers have linked three users in a quantum communication experiment, establishing a shared secure key and moving beyond typical two-party quantum key distribution. The team reports demonstrating an asynchronous measurement-device-independent quantum cryptographic conferencing (AMDI QCC) protocol, designed to eliminate reliance on a trusted measurement station and safeguard against attacks on detection equipment. By using a fiber-based multipath interferometer at a central GHZ measurement station, the system enables interference between signals, offering a path toward scaling multiuser quantum networks; “This change brings a fundamental improvement in how the key rate scales with transmission loss,” the researchers state. This advance addresses key challenges in building practical quantum networks by improving key generation rates and reducing control complexity. They achieved a maximum total system loss of 59.6 dB, compared with 21.5 dB and a secure key rate of approximately 4.470 × 10⁻⁹ bits per pulse. Asynchronous Measurement-Device-Independent Quantum Cryptographic Conferencing Protocol The new protocol achieved secure key generation with a maximum total system loss of approximately 59.6 dB, compared with approximately 21.5 dB attained in the same group’s prior polarization-encoded MDI quantum conferencing experiment. This leap in performance addresses a critical limitation of earlier multiuser quantum key distribution systems, where key generation rates diminished rapidly with increased transmission loss and user count. By moving beyond reliance on rare multiphoton coincidence events, the Nanjing University team circumvented a fundamental bottleneck hindering scalability. Conventional measurement-device-independent quantum conferencing protocols depend on detecting multiple photons simultaneously, a process that becomes exponentially more difficult as network size increases. Professor Zeng-Bing Chen and Hua-Lei Yin’s group theoretically

Quantum ZeitgeistLoading...0
IonQ and SDT team up to bring quantum tech to Asia-Pacificquantum-computing

IonQ and SDT team up to bring quantum tech to Asia-Pacific

IonQ will deploy its Superion 256 quantum computer and a silicon-vacancy quantum memory module in South Korea through a new partnership with SDT, marking the first installation of these specific technologies in the Asia-Pacific region. The collaboration expands beyond software to include physical hardware production and assembly, with SDT planning a dedicated quantum manufacturing facility in Gumi, South Korea. “Demand for our new Superion 256 system is growing globally,” said Niccolo de Masi, Chairman and CEO of IonQ. This partnership aims to establish both high-performance computing and future quantum data centers within the region. IonQ and SDT Expand Partnership with Superion 256 Deployment This deployment, facilitated through a strategic partnership with Korean firm SDT, Inc., moves beyond simple cloud access to establish a physical hardware and manufacturing foothold within the country. SDT intends to integrate the Superion 256 into a customer’s existing infrastructure, with plans to co-develop a hybrid quantum-classical data center, signaling a move toward practical quantum applications. This facility represents a substantial investment in local production capabilities, shifting the partnership from a reseller agreement to a collaborative manufacturing venture. According to IonQ, this move underscores the growing global demand for the Superion 256, a 256-qubit trapped-ion platform utilizing the company’s Electronic Qubit Control, which replaces traditional laser-based control systems with on-chip electronics fabricated at SkyWater foundry. The SiV quantum memory module, a critical component for extending quantum coherence times, will also be manufactured at the Gumi facility, further solidifying the partnership’s scope. The collaboration builds upon existing relationships IonQ has cultivated within South Korea, including partnerships with KISTI, SK Telecom, Hyundai Motor Company, Seoul National University, and Sungkyunkwan University. “This purchase equips SD

Quantum ZeitgeistLoading...0
NIST Standards Drive Demand for 11 Quantum Encryption Approachesquantum-computing

NIST Standards Drive Demand for 11 Quantum Encryption Approaches

Organizations are now prioritizing evaluation of quantum-resistant encryption solutions as finalized government standards and emerging data interception risks demand immediate action in 2026. The core math underlying today’s standard security frameworks, relied upon for web traffic, cloud workloads, and digital identities, will not withstand the processing capabilities of quantum hardware running Shor’s algorithm. Instead of prime factorization, these defenses utilize lattice-based mathematics, hash structures, or physical laws to secure data, with algorithms like Module Learning With Errors (M-LWE) creating complex equations that resist both supercomputers and quantum systems. Transitioning to these methods, and implementing ML-KEM encryption under NIST post-quantum standards, is essential for enterprise security teams. What is the best quantum-resistant encryption solution for enterprises? To achieve robust, future-proof security, enterprises should prioritize crypto-agility platforms, systems designed to seamlessly integrate and update cryptographic algorithms. These platforms combine automated discovery of vulnerable systems, support for emerging standards, and native hybrid cryptography, allowing organizations to adapt quickly to evolving threats. A solution like enQase enables centralized management of quantum security policies and algorithm updates without disrupting existing software workflows, a critical feature for maintaining operational continuity. NIST subsequently selected HQC as a backup key encapsulation mechanism in March 2025, further solidifying the selection of approved algorithms. Western Digital’s Ultrastar HDDs now incorporate hardware-level defense using post-quantum cryptography and NIST-approved algorithms, indicating a trend toward embedding quantum-resistant cryptography directly into data storage solutions. This proactive approach minimizes the risk of data interception, even if encryption is compromised in transit. The agency’s partners

Quantum ZeitgeistLoading...0
Fisher matrix reveals limits of quantum learning speedquantum-computing

Fisher matrix reveals limits of quantum learning speed

Hyukgun Kwon, Seok Hyung Lie, and Liang Jiang have determined the number of samples needed to estimate parameters of a quantum system is fundamentally limited by a property of the inverse Fisher information matrix, differing only by a logarithmic factor. The researchers derived both upper and lower bounds for sample complexity, highlighting two fundamental contributions to quantum learning theory. This work addresses a longstanding open problem by providing unified analytical bounds for quantum learning protocols, which help with hardware benchmarking and noise modeling, and quantum error correction. “Our results address the important open problem of establishing task-independent sample complexity bounds,” the paper reports. Fisher Information Matrix Governs Quantum Learning Bounds This relationship establishes a quantifiable boundary between the information a quantum system holds and the resources required to extract it. The analysis extends beyond theoretical considerations, providing concrete bounds applicable to practical quantum learning tasks. Applying these bounds, researchers specifically examined Pauli channel learning and Pauli expectation value learning as representative problems in quantum channel and state estimation, focusing on scenarios where the desired accuracy is high. These analyses, conducted in the asymptotic small-error regime, demonstrate the broad applicability of the derived bounds to concrete quantum learning challenges. The work also establishes a framework for determining sample complexity independent of the specific task, a longstanding challenge in the field. Specifically, the researchers demonstrate that exponential sample complexity arises in Pauli channel learning when entanglement is absent, and in Pauli expectation value learning without quantum memory; this occurs because of a direct comparison between the quantum and classical Fisher information matrices, as demonstrated in reference.

Quantum ZeitgeistLoading...0
European Commission Approves eCAUSIS Results as Creotech Quantum Prepares QKD System for Commercial Rolloutquantum-computing

European Commission Approves eCAUSIS Results as Creotech Quantum Prepares QKD System for Commercial Rollout

European Commission Approves eCAUSIS Results as Creotech Quantum Prepares QKD System for Commercial Rollout Warsaw-listed quantum technology developer Creotech Quantum S.A. (GPW: CTQ) has received formal approval from the European Commission for the completion of project eCAUSIS (European, Certifiable, Affordable, User-oriented, Secure, Integration-able, Scalable quantum key distribution solutions). Executed under the Horizon Europe framework, the Digital Europe Programme (Project ID: 101091564), and the EuroQCI (European Quantum Communication Infrastructure) initiative, the technical and financial validation transitions Creotech Quantum’s proprietary Discrete-Variable Quantum Key Distribution (DV-QKD) platform from R&D into commercial production. The eCAUSIS project carried a total overall budget of €6,977,626.81 ($8 million USD) (with €4,523,868.99 ($5.155 million USD) in EU grant funding). Creotech Quantum served as consortium coordinator alongside the AIT Austrian Institute of Technology and the Fraunhofer Society (Fraunhofer HHI). Creotech’s share of the project totaled €4,180,000 ($4.76 million USD) in eligible costs (funded up to €3.13 million ($3.57 million USD)), while Fraunhofer HHI (€1.16M ($1.3M USD) EU contribution) developed 1300 nm InGaAs single-photon avalanche diode (SPAD) detector modules with CMOS active-quenching ICs, and AIT (€254K ($290K USD) EU contribution) delivered the production-ready, ETSI-compliant AURORA Key Management System (KMS) and SDN suite. The resulting architecture features an interoperable DV-QKD hardware module in a PCIe form factor, integrated optical assemblies, and platform-independent software aligned with ETSI certification frameworks and Common Criteria standards using the decoy-state BB84 protocol. [ eCAUSIS Project Financials, Consortium Architecture & Industrial Roadmap ]Consortium & Budget AllocationSystem & Optoelectronic DeliverablesManufacturing & Scaling Capacity• Overall Budget: €6.98 Million

Quantum Computing ReportLoading...0
Creotech Quantum Wins €2.33M ($2.66M USD) ESA Contract for Space-Grade Quantum Detectorsquantum-computing

Creotech Quantum Wins €2.33M ($2.66M USD) ESA Contract for Space-Grade Quantum Detectors

Creotech Quantum Wins €2.33M ($2.66M USD) ESA Contract for Space-Grade Quantum Detectors Warsaw-listed quantum infrastructure vendor Creotech Quantum S.A. (GPW: CTQ) has signed a contract with the European Space Agency (ESA) to lead an international consortium developing next-generation single-photon detectors. Titled HRQKD (High-Rate Quantum Key Distribution), the €2.33 million ($2.66 million USD) project allocates €1.2 million ($1.37 million USD) directly to Creotech Quantum as prime contractor to design, manufacture, and validate high-sensitivity Superconducting Nanowire Single-Photon Detectors (SNSPDs). Executed over a 24-month schedule, the initiative advances SNSPD detection hardware from proof-of-concept prototypes to Technology Readiness Level 5 (TRL 5), validating operational stability in simulated industrial and space-ground environments. The detectors serve as foundational components for optical ground stations receiving space-to-ground quantum signals across European satellite networks, including EuroQCI, IRIS², ARTES, SAGA, and ScyLight. In addition to QKD cryptographic key reception, the ultra-low-noise SNSPD systems enable high-bandwidth deep-space optical communication where received signals are extremely faint, such as lunar base links and deep-space science probes. [ ESA HRQKD Project Architecture & Financial Scope ]Contract ParameterHardware & Technical ScopeStrategic Deployment Scope• Total Value: €2.33 Million• Creotech Share: €1.2 Million• Timeline: 24 Months• Superconducting Nanowire Single-Photon Detectors (SNSPDs)• Integrated readout electronics & control software• Target Maturity: TRL 5 (Industrial Validation)• Satellite-to-Ground QKD Networks (EuroQCI, IRIS²)• Deep-space optical laser communications• Defense, telecom, & critical infrastructure links Led by CEO Dr. Anna Kamińska, Creotech Quantum acts as consortium lead, overseeing electronics engineering, software architecture, environmental testing, and product roadmap dev

Quantum Computing ReportLoading...0
Creotech Quantum Prepares QKD System for Commercializationquantum-computing

Creotech Quantum Prepares QKD System for Commercialization

Insider Brief PRESS RELEASE — Creotech Quantum S.A., a Warsaw Stock Exchange-listed company developing and commercializing quantum technologies, announced that the European Commission has approved the results of the eCAUSIS project – “European, Certifiable, Affordable, User-oriented, Secure, Integrationable, Scalable quantum key distribution solutions”. The project was positively assessed both in terms of its technical and […]

Quantum DailyLoading...0
Gradiant to showcase quantum develops at New Space Españaquantum-computing

Gradiant to showcase quantum develops at New Space España

Gradiant will showcase developments in quantum key distribution and precision sensing at New Space España in Vigo on September 24 and 25, bringing together the aerospace innovation ecosystem. The technology centre focuses on bolstering defenses against a major threat: the potential for large-scale quantum computing to compromise current communication security. “We see quantum technologies as a strategic and operational field that will transform security, defence and the aerospace sector,” says a Gradiant representative. Gradiant’s work combines quantum information theory with advanced instrumentation, aiming to extend secure communications and enhance precision sensing for applications from navigation to Earth observation. QKD Protocols Enhance Security for Future Space Communications Gradiant is developing quantum key distribution protocols to address a critical vulnerability in space communications, the looming threat of large-scale quantum computing compromising existing encryption methods. This approach offers a fundamentally different security paradigm, protecting data even against adversaries with quantum computers capable of breaking current encryption standards. These QKD protocols enable the distribution of encryption keys with security rooted in quantum mechanics, a departure from classical cryptography’s reliance on computational difficulty. Gradiant’s work extends beyond basic protocol development, encompassing the creation of components for real-world implementation, including emitters, detectors, and photonic integrated circuits. The team is also designing architectures to connect multiple users and integrate quantum security with existing telecommunications networks, anticipating a future where quantum-safe communication is essential for space-based assets. A key focus is overcoming operational limitations, such as potential denial-of-service attacks, by investigating new multi-user network paradigms for key exchange. Extending the range and key gener

Quantum ZeitgeistLoading...0
memQ Open-Sources Industry-First Modality-Agnostic Distributed Quantum Compiler (memQ DQC)quantum-computing

memQ Open-Sources Industry-First Modality-Agnostic Distributed Quantum Compiler (memQ DQC)

memQ Open-Sources Industry-First Modality-Agnostic Distributed Quantum Compiler (memQ DQC) Quantum networking technology developer memQ Inc. has publicly released its Distributed Quantum Compiler (memQ DQC) as an open-source toolchain on GitHub. Spun out from the University of Chicago, the startup introduced the modality-agnostic software framework to provide scale-out deployment capabilities across multi-vendor, heterogeneous quantum processing unit (QPU) networks connected via optical quantum channels. The open-source release aligns with U.S. federal technology directives, including Executive Order 14413 issued in June 2026, which instructs government agencies to establish operational frameworks for quantum networking and distributed quantum computing architectures. By converting standard monolithic circuits into network-optimized OpenQASM execution graphs, memQ DQC enables developers, system integrators, and researchers to model multi-QPU execution, evaluate entanglement generation rates, and analyze resource trade-offs without requiring manual low-level quantum network programming. The modular compiler toolchain incorporates an interactive Quantum Network Constructor (QNC) that models arbitrary inter-QPU topologies (chain, ring, hub, grid, all-to-all) alongside intra-QPU physical qubit layouts. The compiler manages cross-processor dependencies by dynamically inserting state teleportation operations (qubit relocation) and gate teleportation primitives (Cat-Entangler and Cat-Disentangler protocols). Integrated discrete-event schedulers simulate heralded photon arrivals to generate time-resolved execution schedules under realistic physical hardware constraints, such as gate durations, decoherence times, and link entanglement generation rates. [ memQ DQC Open-Source Framework Feature & Capability Summary ]Software ComponentFunctional SpecificationSystem & Architectural BenefitQuantum Network Constructor (QNC)• Graphical topology configuration tool• Custom JS

Quantum Computing ReportLoading...0
memQ Releases memQ DQC: An Open-Source Framework for Distributed Quantum Computingquantum-computing

memQ Releases memQ DQC: An Open-Source Framework for Distributed Quantum Computing

memQ Releases memQ DQC: An Open-Source Framework for Distributed Quantum Computing Quantum networking startup memQ Inc. has officially released memQ DQC (version 0.1.2-beta), an open-source, modality-agnostic software framework designed to compile, partition, and schedule quantum programs across multi-processor distributed quantum architectures. Accompanied by a technical preprint published on arXiv (arXiv:2609.15728), the Python library (GitHub Repository) bridges the gap between monolithic circuit compilers and network-level simulators, addressing software-hardware co-design for entanglement-based distributed quantum computing (DQC). As physical constraints limit the expansion of monolithic quantum processing units (QPUs), scaling beyond hundreds of physical qubits relies on interconnecting multiple QPUs using Einstein-Podolsky-Rosen (EPR) entangled pairs. However, distributing a quantum program introduces complex trade-offs: cross-QPU operations require either state teleportation (moving a qubit state between processors) or gate teleportation (executing a remote controlled gate via Cat-Entangler/Disentangler protocols). The memQ DQC framework allows researchers to define arbitrary inter-QPU network topologies (chains, rings, hubs, grids, and all-to-all) alongside intra-QPU qubit connectivity maps using an interactive Quantum Network Constructor (QNC). The compiler ingests standard OpenQASM circuits, partitions operations across network nodes based on hardware capacity constraints, routes remote gates, and outputs a distributed OpenQASM file. The framework includes a multi-algorithm compiler paired with both deterministic and discrete-event (stochastic) schedulers. The scheduler models Poisson-distributed photon arrival events for heralded remote entanglement generation, tracking link arbitration, gate execution times, and total schedule makespans. [ memQ DQC Software Architecture & Core Components ]Component / ModuleFunctional RoleAlgorithmic & Architectu

Quantum Computing ReportLoading...0
Classical Capacity and Entanglement Cost of the Amplitude Damping Channelquantum-computing

Classical Capacity and Entanglement Cost of the Amplitude Damping Channel

--> Quantum Physics arXiv:2609.28592 (quant-ph) [Submitted on 23 Sep 2026] Title:Classical Capacity and Entanglement Cost of the Amplitude Damping Channel Authors:Ziao Tang, Chengkai Zhu, Ge Bai, Xin Wang View a PDF of the paper titled Classical Capacity and Entanglement Cost of the Amplitude Damping Channel, by Ziao Tang and 3 other authors View PDF HTML (experimental) Abstract:Determining a noisy quantum channel's classical capacity and entanglement cost generally requires regularization over many channel uses. We remove both regularizations for every qubit-to-qubit channel admitting a pure output. For each such channel, Holevo information, channel entanglement of formation, and parallel entanglement cost are additive with those of any finite-dimensional partner channel. This class includes all qubit-to-qubit channels of Kraus rank at most two. For the amplitude damping channel with damping probability $p$, the unassisted classical capacity equals the known single-use Holevo information, attained by a binary pure-state ensemble with collective decoding, and the entanglement cost is $h_2((1+\sqrt p)/2)$ ebits per use. The common mechanism is a support criterion for strong superadditivity of entanglement of formation: one marginal has no support on the sector in which both local systems are orthogonal to fixed distinguished vectors. We prove this criterion in arbitrary finite dimensions using a triangular block-matrix entropy inequality and decompositions preserving two expectations. For amplitude damping, we also derive an exact finite-block Holevo deficit, identify the unique optimal average input for $p<1$, and construct a binary Kraus representation attaining the uniform formation bound. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2609.28592 [quant-ph]   (or arXiv:2609.28592v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2609.28592 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission

arXiv Quantum PhysicsLoading...0
Reconfigurable bus-based quantum router for modular superconducting processorsquantum-computing

Reconfigurable bus-based quantum router for modular superconducting processors

--> Quantum Physics arXiv:2609.28881 (quant-ph) [Submitted on 24 Sep 2026] Title:Reconfigurable bus-based quantum router for modular superconducting processors Authors:Benzheng Yuan, chaojie Zhang, Yangyang Fei, Chuanbing Han, Haoran He, Huihui Sun, Bo Zhao, Fudong Liu, Weilong Wang, Zheng Shan View a PDF of the paper titled Reconfigurable bus-based quantum router for modular superconducting processors, by Benzheng Yuan and 9 other authors View PDF HTML (experimental) Abstract:Scaling superconducting quantum processors requires interconnects that provide both non-local connectivity and parallel entangling operations. Nearest-neighbour couplings require distant interactions to be routed through SWAP networks, increasing the native two-qubit-gate count and potentially extending the circuit critical path. Here we introduce a bus-based reconfigurable quantum router for modular superconducting processors. Flux-tunable SQUID couplers selectively connect interface qubits to two shared buses, allowing destructive interference to suppress idle interactions while supporting two disjoint controlled-$Z$ (CZ) gates in parallel. Full-system Hamiltonian simulations yield parallel-gate errors at the level of $10^{-3}$, and open-system analysis identifies the coherence requirements for high-fidelity operation. We further assess the circuit-level consequences using hardware-aware compilation and resource-constrained scheduling. For 36-qubit quantum Fourier transform (QFT), QAOA-MaxCut and random-pairing circuits, the router reduces the median SWAP count by up to $34\%$ and the native CZ count by up to $20\%$ relative to a matched two-dimensional grid. End-to-end depth reduction is circuit dependent, reaching $20\%$ for QAOA-MaxCut but remaining negligible for the QFT despite its lower gate count. These results show that enhanced connectivity and schedulable parallelism provide distinct benefits, establishing the router as a compiler-visible hardware resource for modular superconducti

arXiv Quantum PhysicsLoading...0
Could Cisco (CSCO)’s Networking Power Give Infleqtion (INFQ) a Major Edge in Quantum Computing? - Yahoo Financequantum-computing

Could Cisco (CSCO)’s Networking Power Give Infleqtion (INFQ) a Major Edge in Quantum Computing? - Yahoo Finance

Could Cisco (CSCO)’s Networking Power Give Infleqtion (INFQ) a Major Edge in Quantum Computing? Laiba Immad Thu, September 24, 2026 at 5:59 PM EDT 3 min read INFQ +3.40% CSCO +0.51% Infleqtion, Inc. (NYSE:INFQ) announced a joint research and development collaboration with Cisco Systems, Inc. (NASDAQ:CSCO) on September 10, 2026, to connect, operate, and scale quantum systems into distributed networks. By linking Infleqtion's neutral-atom quantum processors and sensors with Cisco's quantum networking stack, the companies aim to transition standalone quantum hardware into scalable, interconnected networks. As Infleqtion Chief Technology Officer Pranav Gokhale noted, connecting quantum systems mirrors how the internet emerged from linked classical computers. The initiative directly ties Infleqtion's commercial execution goals to Cisco's broader networking and infrastructure strategy. You Might Be Interested In: Cisco (CSCO) Leans on Splunk to Broaden Its Share of Enterprise AI Spending. It Faces a Big Test Could Palantir Technologies Inc. (PLTR)’s Partnership With Nebius Group N.V. (NBIS) Accelerate Its AI Growth? Infleqtion and Cisco Stand to Gain Strategic Traction For Infleqtion, partnering with networking giant Cisco validates its neutral-atom platform and multi-modal quantum hardware. Neutral atoms interface naturally with photons, making them uniquely suitable for linking quantum computing and sensing devices over optical channels. This technical edge complements Infleqtion's commercial momentum, highlighted by record Q2 2026 revenue of $12.6 million, a trailing 12-month revenue of $42.44 million, and an updated 2026 revenue outlook of ~$43 million. Supported by a $100 million Department of Commerce grant and a roughly four-year funding runway, the Cisco partnership gives Infleqtion a clear path to scale its architecture alongside major deployment milestones, including its 2027 fault-tolerant Illinois system.

Google News – Quantum ComputingLoading...0
memQ Releases Open-Source Distributed Quantum Compilerquantum-computing

memQ Releases Open-Source Distributed Quantum Compiler

Insider Brief PRESS RELEASE — memQ™, the industry leader in quantum networking for scalable and distributed quantum computing, announced today the public release of its distributed quantum compiler (DQC). This integral part of a distributed quantum computing environment will be released as a publicly available, open-source offering available on GitHub. memQ’s DQC is a compilation […]

Quantum DailyLoading...0

Related Topics

Quantum Cryptography CybersecurityPhotonic Quantum ComputingQuantum Sensing MetrologyGovernment Quantum Initiatives