Papers for

quantum network engineers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Reducing provers simplifies distributed quantum verification tasks

Reducing Provers in Distributed Quantum Verification

Abstract: In the distributed quantum Merlin-Arthur ($\mathsf{dQMA}$) model introduced by Fraigniaud, Le Gall, Nishimura, and Paz (ITCS 2021), a network of quantum computers verifies a global property with the aid of a quantum proof supplied by an untrusted prover. While the nodes are computationally unbounded, the challenge is to limit proof size and the communication required for verification. In this paper, we consider the model of Hasegawa, Kundu, and Nishimura (PODC 2024), where the proof must be unentangled across nodes, and define its extension to $k$ unentangled provers, denoted by $\mathsf{dQMAS}(k)$. In this setting, we investigate the proof size per node and the communication costs of reducing the number of provers. Our first result reduces the number of provers from $k$ to two, doubling the proof size without additional communication. Moreover, with four additional rounds, we can reduce the number of provers from $k$ to one, using at most three times the original local proof size plus a logarithmic term in the number of nodes. Finally, we establish amplification for perfectly complete protocols. In this regime, a single prover suffices with a constant-factor overhead in our reductions, yielding $\mathsf{dQMAS} = \mathsf{dQMAS}(k)$.

Mon 9 NovDistributed, Parallel, and Cluster Computing
The gist
The paper looks at how groups of quantum computers check shared information using help from quantum proofs. Usually, many helpers called provers provide these proofs, but having fewer provers can make the process simpler. The authors show how to reduce multiple provers down to two or even just one, with some trade-offs in proof size and communication, without losing the system’s effectiveness. This helps make distributed quantum verification more practical.
Open → 2611.12600v1

Quantum phenomena shape network functions beyond message transport

Beyond Quantum Messages: Toward Quantum-Native Network Functioning

Abstract: The Quantum Internet is commonly envisioned as a network that transports quantum states and distributes entanglement as the key resource underpinning distributed quantum applications. This view is necessary but incomplete if quantum phenomena are confined to what the network carries or manages, while network functionalities remain grounded predominantly in classical abstractions. This Perspective advances a broader thesis: quantum phenomena can also participate directly in the realization of network functionalities. We first establish the architectural baseline by introducing entanglement as a stateful network resource whose operational condition is non-locally distributed across remote nodes, evolves through manipulation or consumption, and degrades over time through decoherence. Its evolving state must therefore remain visible to the functionalities acting on it. We then move beyond resource visibility and use two mechanisms as proof points of a broader quantum-native functional design space: entanglement generation during propagation through coherent spatial-path superposition, and operational connectivity induced by shared entanglement that can depart from the physical graph. These examples show that paths, neighbors, or participating nodes may become operationally relevant in ways determined by quantum coherence and shared entanglement, rather than by physical connectivity alone. We identify Quantum Addressing as a transversal abstraction capable of representing such relations while complementing, rather than replacing, classical addressing and signaling. The resulting perspective broadens the Quantum Internet from transporting quantum information and distributing entanglement to exploiting quantum phenomena in network functioning, opening a coupled frontier spanning routing, forwarding, control, and functionality placement.

Thu 5 NovNetworking and Internet Architecture
The gist
Most ideas about the Quantum Internet focus on sending quantum information and sharing entanglement between nodes. This paper argues that quantum effects can also be used directly to run the network itself, not just move data. It shows how shared entanglement and quantum superposition can change how network nodes connect and communicate in ways that are impossible classically. The authors suggest new ways to address and control networks that include these quantum-native features.
Open → 2611.08298v1

Efficiently finding structured subgraphs in labeled tour graphs

Finding full immersions is fixed-parameter tractable in labeled tour graphs

Abstract: We give an $O_H(n^5)$-time algorithm to test whether an $n$-vertex labeled tour graph has a full immersion isomorphic to a labeled tour graph $H$. A labeled tour graph is a connected $4$-regular graph whose edges are labeled by binary vectors of fixed length. To obtain a full immersion, a vertex may be removed only by pairing up its four incident edges and "splitting off" both pairs, summing the labels within each pair. Even for one-bit labels, no polynomial-time algorithm was previously known for arbitrary fixed $H$. Our main tool is of independent interest: we give an algorithmic min-max theorem that, in particular, characterizes the maximum number of odd-length circuits in a rooted circuit decomposition of an Eulerian graph. Our results have implications for vertex-minors, whose study is motivated by applications in quantum networking, connections with graph minor theory, and the goal of developing an irrelevant vertex technique for dense graphs. For vertex-minors, circle graphs play the same role as planar graphs do for graph minors. As a corollary of our main theorem, we obtain a fixed-parameter tractable algorithm for apex-vertex-minor testing in $k$-apex circle graphs. We also prove an irrelevant vertex theorem for such graphs of large rank-width. More broadly, our results are essential to forthcoming work of three of the authors proving a structure theorem for graphs with a forbidden vertex-minor. There, our min-max theorem plays the role of both the algorithmic $A$-paths and Two Paths Theorems.

Wed 4 NovData Structures and Algorithms
The gist
Finding certain patterns inside complex networks is often difficult and slow. This paper focuses on special graphs called labeled tour graphs and presents a new algorithm that can quickly check for a specific kind of subgraph, called a full immersion, in these graphs. The authors also develop a broader theoretical tool that helps understand how certain circuits in graphs behave. These results link to problems in quantum networking and improve understanding of complex graph structures.
Open → 2611.06776v1

Quantum communication enhanced by spatial path superposition technique

Spatial Path Superposition: A No-Cloning Perspective on MIMO-Inspired Spatial Diversity

Abstract: Spatial diversity is a key mechanism in classical Multi-Input Multi-Output (MIMO) communications, where multiple propagation alternatives provide redundant observations that improve reliability in noisy environments. A direct translation of this principle to quantum communications is forbidden by the no-cloning theorem, since an unknown quantum state cannot be copied and transmitted through independent links. In this Perspective article, we argue that spatial path superposition provides a no-cloning-compatible analogue of the spatial-diversity principle of MIMO. Rather than duplicating the transmitted quantum state, a quantum carrier is coherently delocalized over multiple communication links, so that alternative spatial evolutions are experienced in quantum superposition. In this framework, classical redundancy is replaced by spatial coherence, and the communication link itself becomes part of the quantum dynamics. Indeed, spatial coherence can enhance the fidelity of the received quantum state, providing the quantum counterpart of the classical diversity gain, and can be converted into bipartite and multipartite entanglement during propagation. This implies that, under suitable coherent path control, noisy channel evolutions can contribute constructively to entanglement generation. This Perspective identifies spatial path superposition as a quantum-native primitive for the Quantum Internet, linking no-cloning-compatible spatial diversity, fidelity enhancement, entanglement generation, and coherent path control.

Wed 4 NovNetworking and Internet Architecture
The gist
Traditional wireless communication uses multiple antennas to send copies of a message through different paths to make signal reception more reliable. But in quantum communication, copying an unknown quantum message is impossible due to a rule called the no-cloning theorem. The authors explain a new way to improve quantum communication by spreading a single quantum signal across multiple paths at once, rather than copying it. This approach uses quantum superposition to make transmission more reliable and even helps create quantum connections called entanglement between different parts of the system.
Open → 2611.06306v1

Quantum base stations dynamically share entanglement for sensing and communication

Entanglement Allocation for Quantum Integrated Sensing and Communication

Abstract: Jointly supporting communication and distributed sensing over a shared, limited pool of entanglement resources is an attractive prospect for future quantum networks. We develop a network-level quantum integrated sensing and communication (Q-ISAC) framework in which a quantum base station dynamically allocates elementary Bell pairs between communication users and distributed sensing. Sensing resources are adaptively partitioned among multiple GHZ probes with dynamically selected sizes and sensing-node assignments. We derive an effective quantum Fisher information model accounting for probabilistic fusion, transmission loss, and memory decoherence, and formulate a finite-horizon allocation problem subject to communication QoS, expected sensing-information, sensing-reliability, and hardware constraints. A hierarchical constrained proximal policy optimization (HC-PPO) framework combines learned discrete sensing allocation with analytical continuous communication allocation. Numerical results show that GHZ probing requires approximately $27$--30% fewer sensing qubits than separable probing under modest probe-size caps and 65-67% fewer at the highest considered target under the same sensing requirements. Adaptive multi-GHZ partitioning provides greater robustness than single-GHZ sensing, while adaptive communication--sensing sharing outperforms the evaluated fixed splits. The proposed HC-PPO framework satisfies the joint requirements in at least 99.9% of test instances across the considered sensing targets and fusion probabilities. Monte Carlo evaluation separately shows that realized terminal information reached its target in 96-98% of realizations, distinguishing expected-information satisfaction from realized sensing performance.

Tue 3 NovNetworking and Internet Architecture
The gist
Future quantum networks will need to share special quantum connections, called entanglement, between many users for both sensing and communication at the same time. The authors create a system where a quantum base station smartly divides these entangled pairs between users sending messages and those performing precise sensing. Their method uses complex quantum states called GHZ probes and optimizes how to split resources to meet different reliability and quality targets. Their approach adapts to changing conditions and performs better than fixed sharing methods, saving resources and improving sensing accuracy.
Open → 2611.04128v1

Quantum method improves private data retrieval on forest graphs

Quantum Private Information Retrieval on Forests

Abstract: We consider the problem of graph private information retrieval (PIR) in the quantum setting. We focus on a specific type of graphs, namely the forest graphs. A forest graph is a union of disjoint trees. We consider the quantum setting where all the servers share an entangled state. Each server is allowed to send only one qudit per retrieval round. We design a scheme for the forest graphs that achieves the rate of $\frac{3}{N}$. The scheme uses a GHZ state as the initial entangled state between the servers prior to the scheme initiation. We compare our scheme with the only work done in the literature that considered the quantum setting of graph PIR. We show that our scheme is more efficient in this setting. We derive the quantum capacity for the case of $G=3K_2$, which is equal to $4/6$. $G=3K_2$ is a special case of the forest graph. We design a scheme that is specialized for this graph, achieving a rate equal to $4/6$ and provide the corresponding matching upper bound, establishing it as the capacity.

Mon 2 NovInformation TheoryCryptography and SecurityNetworking and Internet Architecture
The gist
The paper looks at how to privately retrieve information from servers connected in a simple network structure called a forest, using quantum technology. The authors design a quantum method that improves the efficiency of retrieving data without revealing what was asked for. They use a special quantum state called the GHZ state shared among servers to achieve this. They also find the maximum possible efficiency for a small special case of such networks and provide a matching method to reach it.
Open → 2611.03558v1

Entanglement does not boost classical communication in many quantum channels

Classical communication over quantum channels: does entanglement help in nature?

Abstract: Can entangling codewords across independent uses of a quantum channel improve the rate of classical communication? An old conjecture states that there is no such entanglement advantage for all channels. Although Hastings's result and follow-up works disproved this conjecture, it turns out that enormous dimension is required to construct a channel where entanglement enhances classical communication. This indicates that there might be no entanglement advantage for many physical channels, or for all low dimensional channels. Motivated by recent progress on (generalized) amplitude damping channels, we propose a general Schur-weighted block entropy inequality, and show that there is no entanglement advantage for all phase-covariant channels including multi-level amplitude damping channels, generalized dephasing channels, and damping-dephasing channels. As a by-product, we also recover the recently established result that there is no entanglement advantage for all qubit channels.

Thu 29 OctInformation Theory
The gist
The paper looks at whether using quantum entanglement can improve sending ordinary messages through certain quantum channels. While past work showed entanglement can help in very large and complex channels, these situations are rare and may not happen in typical physical systems. The authors prove that for a broad class of quantum channels often seen in practice, entanglement does not increase communication rates. This includes many types of channels that model noise and loss in quantum communication.
Open → 2610.40585v1

Quantum communication improves error rates with new decoding method

Quantum communication: a discrimination approach

Abstract: We develop a state discrimination approach to unassisted quantum communication through a noisy quantum channel. Starting from the operational duality between entanglement recovery and state discrimination, we construct entanglement-generation codes with explicit decoders constructed from Petz recovery maps. The resulting error bounds hold for every number of channel uses and are expressed in terms of Petz-Rényi coherent information. For product sources, they yield exponential error decay at rates below coherent information.

Thu 29 OctInformation Theory
The gist
Quantum communication faces challenges because messages can get scrambled by noise in the channel they travel through. The authors develop a new way to send quantum information that focuses on telling apart quantum states to improve accuracy. They design codes and decoding methods that help reduce errors effectively, even when many messages are sent. This approach uses mathematical tools called Petz recovery maps to help recover the intended message from noisy signals.
Open → 2610.40358v1

Quantum switch protocol minimizes memory for entanglement distribution

Entanglement Distribution in Quantum Switch Networks: Memory Limits and Achievability

Abstract: We study the minimum persistent memory required to distribute a graph state through a quantum switch. Specifically, consider a central switch that assists $n$ remote users in distributing a graph state, using independently generated user-switch Bell pairs. Since Bell-pair generation is probabilistic, different links generally succeed at different times. When a Bell-pair is generated, the qubits may need to be stored in memory while waiting for other links to succeed. Recently, new protocols have been proposed to reduce this storage overhead by processing and releasing some switch qubits before all Bell links are available. However, these protocols do not characterize the minimum persistent switch memory required at each stage. Moreover, the local-cover method in the state-of-the-art Piecemaker protocol is computationally expensive for general target graphs. In this work, we characterize the minimum persistent switch memory required after any subset of users' Bell links are generated and processed. We then develop an online stabilizer-transition protocol that attains this limit, which can be implemented in polynomial time in the number of qubits $n$. Remarkably, this optimal protocol can provide substantial memory reductions over existing heuristic approaches. In particular, for the path graph $P_n$ over $n$ users, Piecemaker protocol requires at least $\lfloor n/2\rfloor$ qubits of peak persistent memory for \textit{every Bell-links generation order}, whereas under the order $(1,2,\ldots,n)$, our protocol requires only one persistent switch qubit. Finally, the same stabilizer-transition framework also provides a direct forward construction for sequential graph-state generation using the minimum number of quantum emitters, equal to the maximum of the height function.

Tue 20 OctInformation TheoryNetworking and Internet Architecture
The gist
Distributing entangled quantum states among multiple users is tricky because connections succeed at different times and quantum information must be stored temporarily. The authors study how to reduce the amount of memory needed inside a central quantum switch that helps connect users. They develop an efficient method to process entangled links as they arrive, using fewer memory qubits than previous methods. This makes quantum networking more practical by lowering the memory resources required.
Open → 2610.28596v1

Quantum method improves decoding multiple senders messages jointly

Quantum simultaneous decoding via pretty-good measurements of tilted states

Abstract: A multiple-access channel transmits messages from several senders to one receiver. For quantum outputs, the receiver must distinguish states depending on all messages, while tests for different decoding errors may not commute. In this paper, we give a self-contained account of simultaneous decoding, in which one joint measurement recovers the messages at the established achievable rates using independent codebooks. The proof combines Sen's tilted-subspace method with Cheng's analysis of the pretty-good measurement, a standard measurement for distinguishing quantum states. Auxiliary labels close to a common reference state separate the geometric directions associated with different errors. A Gram-matrix bound then allows separately chosen binary tests to certify the performance of one measurement. The labels are removed from the completed decoder, leading to a deterministic packing theorem that applies to finite state ensembles, including unequal priors. We develop the two-sender case first, with worked examples and figures, before treating any fixed number of senders. Sharper finite-error guarantees for the same decoder are developed separately, with sharp bounds for two specified steps of the analysis rather than a claim of globally optimal decoding. Applications recover known achievable rates for unassisted and entanglement-assisted classical communication, distributed classical compression with quantum side information, and coherent-state communication through a beamsplitter or passive multiport device. The common proof makes the geometric mechanism and its quantitative consequences available without repeating the construction for each application.

Sun 11 OctInformation Theory
The gist
When multiple people send messages through a quantum communication channel to one receiver, the receiver has to figure out all the messages at once, which is tricky because of quantum effects. The authors explain a way to do this with a single measurement called pretty-good measurement, combined with a technique for separating different error types. They show how to design the measurement so it can accurately decode messages from several senders simultaneously using independent codebooks. This approach works for various scenarios including classical and quantum-assisted communication over quantum networks.
Open → 2610.15955v1

Quantum handshake verifies real quantum devices on networks

Secure Quantum Handshakes: Quantum Network Verification Via Simon's Algorithm

Abstract: Quantum networking represents the future of secure communication, enabling fundamentally new capabilities through quantum information exchange. However, these networks require secure, high-fidelity quantum communication channels, and they require every participating node to be a genuine quantum device. Currently, there is no reliable method to verify whether clients entering a quantum network truly possess quantum computational capability and are connecting over robust channels. In this work, we introduce a client-validation protocol that functions as a proof-of-quantum-capability handshake. Our protocol secures a quantum network against classical spoofers, noisy quantum computers, and genuine quantum devices connecting with the network over noisy or insecure channels. We validate the efficacy of this protocol through numerical simulations under erasure, dephasing, and depolarizing noise models.

Thu 8 OctNetworking and Internet Architecture
The gist
Quantum networks need to make sure that participants really have quantum computers and are connected through secure channels. The authors created a test, like a secret handshake, that can check if a client is truly quantum-powered and connected safely. This test works even when the devices or connections have noise or errors. They ran computer experiments to show their method works under realistic noisy conditions.
Open → 2610.12209v1

Pauli error composition controls key rate in multiparty quantum networks

Pauli Error Composition Determines the Multipartite Advantage in Conference Key Agreement

Abstract: GHZ-based conference key agreement distributes a shared key to $N$ parties in one network use, whereas pairwise BB84 needs $N-1$. The survival of that advantage has been studied against party number, loss, and topology, but almost always with the channel fixed at depolarizing. Simulating both protocols exactly for $N = 3, 4, 5$ under dephasing, amplitude damping, and depolarizing noise, we find the crossover is set by the channel's Pauli error composition, not its identity: normalized to average infidelity, amplitude damping and depolarizing agree to within about 1\% at each group size, while dephasing can tolerate roughly $2.4\times$ more at $N = 3$. We derive a closed-form rate for arbitrary per-party Pauli noise and use it to prove that concentrating a fixed noise budget on one arm is strictly worse than spreading it, and that giving the dealer role to the cleanest arm improves the rate by roughly 18\%. One structural fact drives every result: the phase-error term is a product over all $N$ arms, while the bit-error term stays local to a pair.

Mon 5 OctCryptography and SecurityNetworking and Internet Architecture
The gist
When multiple people want to share a secret key securely using quantum methods, a special quantum state called a GHZ state can let them do it all at once, unlike older methods that require many rounds. The authors studied how different kinds of noise in the communication channels affect this advantage. They found that it’s not just the type of noise, but how the noise is composed of certain basic errors (called Pauli errors) that determines performance. They also discovered that spreading noise evenly across all parties and choosing the cleanest connection to manage the key boosts the method's efficiency.
Open → 2610.07251v1

Quantum network routing method detects cheating with minimal calls

A Cheat-Sensitive Primitive for Destination-Private Quantum Routing

Abstract: Quantum networks will rely on intermediate nodes to distribute entanglement, but the same nodes may learn which users are being connected. We introduce a minimal two-call routing primitive in which a user, Alice, establishes an entangled link with one of several clients while testing whether the provider, Bob, has disturbed a coherently encoded request. The construction adapts the hidden-order mechanism of quantum private queries: one call contains a direct request, the other a coherent superposition of the desired and null addresses, and Alice keeps their order secret. A private matching qubit held by the selected client restores the coherent test state after a favorable Bell-measurement outcome, so that Alice can test the returned query without any further operation by Bob. The claim is deliberately limited. The protocol shows that a routing request can carry a physical cheating test, and it detects an explicit destination-reading attack with nonzero probability. It does not yet provide a quantitative information-disturbance tradeoff, composable security, or certification of an unmeasured output against arbitrary attacks. We also characterize the exact perfect-pass limit, in which Bob's residual state, averaged over the private matching states, is independent of the destination.

Sat 3 OctCryptography and Security
The gist
Quantum networks need to connect users securely through multiple points, but those points might spy on who is talking to whom. The authors show a simple way for one user, Alice, to ask for a connection while secretly testing if the network provider is cheating by learning the destination. Their technique uses quantum tricks to encode the request so that any spying attempt disturbs the message and gets noticed. Although this method doesn't yet guarantee perfect security, it opens a path to building quantum routing that can physically detect some cheating.
Open → 2610.04359v1

Quantum routers eliminate signal loss for perfect state transfers

Quantum State Routing and Perfect State Transfer on Signed Graphs under Environmental Noise

Abstract: Routing unknown quantum information across distributed communication networks requires autonomous, measurement-free mechanisms to prevent wave-function collapse. Szegedy quantum walks provide a mechanism for spatial state transport. The conventional walks on unweighted graphs suffer from severe back-reflection, spatial dispersion, and channel crosstalk. In this paper, we introduce a deterministic topological quantum routing architecture based on coined Szegedy quantum walks on edge-duplicated signed graphs. By treating edge signs as localized phase shifts within a balanced coin reflection, we enforce an exact zero back-scattering condition across routing nodes. We demonstrate deterministic Perfect State Transfer (PST) with unit fidelity at exact arrival times across fundamental archetypes, including the signed dumbbell switch $D_{2m,0,2n}$ and scalable glued binary trees. Furthermore, we analyse routing performance under realistic open-system amplitude and phase damping noise channels.

Wed 30 SeptDiscrete MathematicsInformation Theory
The gist
Sending quantum information across networks is tricky because measuring it can destroy the data. The authors developed a new method using special kinds of quantum walks on signed graphs that route quantum information without measurements or signal loss. Their method perfectly transfers quantum states to exact destinations without reflection or interference, even in complex network shapes. They also tested how well this routing works when the quantum system faces environmental noise that can cause errors.
Open → 2609.39890v1

Quantum position verification secured against large entanglement attacks

Breaking the Bounded Entanglement Barrier for Quantum Position Verification

Abstract: Position verification, introduced by Chandran et al. (SIAM J. Computing 2014), allows verifiers to test a prover's claimed position by an interactive protocol. Classical position verification is impossible. Even for Quantum Position Verification (QPV), there always exists an LOCC (Local Operations and Classical Communication) attack if the adversary can hold an exponentially large amount of preshared entanglement. Somewhat surprisingly, we show that we can circumvent this barrier in the idealized continuous-time model, where time is represented by a real-valued parameter and challenge messages can be sent at a time sampled uniformly from a real interval. In this model, we give a BB84-based protocol that remains secure against any finite coalition of LOCC adversaries with arbitrary finite (possibly exponential) quantum storage and entanglement. Our construction can also be instantiated in the discrete-time model. Even though the previous impossibility results apply, we are able to obtain an information-theoretic QPV protocol in which the honest parties' total resources (communication and storage) can be significantly smaller than the adversarial resource bound. In fact, we can achieve any desired polynomial gap between honest parties and adversarial resources. To our knowledge, all previous protocols in the literature required resources of the honest parties to be at least as large as the adversarial entanglement. Interestingly, the resource gap between the honest and adversarial party resources in our protocol depends on how precisely time can be measured. As the precision of the best-known clock improves with further research, the resource gap in our protocol keeps increasing. In particular, the adversarial resource bound keeps increasing while the honest parties' resources remain largely the same. We call this the "I sleep, you work" paradigm.

Wed 30 SeptCryptography and Security
The gist
Position verification lets others check where you claim to be, but classical versions can be tricked. Quantum Position Verification tried to fix this, but attackers with lots of shared quantum entanglement could still cheat. The authors show that by carefully measuring time in a continuous way, they can create a quantum protocol that remains secure even against attackers with huge entanglement and resources. This method lets honest parties use much fewer resources than attackers, improving security as clock precision improves.
Open → 2609.39234v1

Quantum networks improve data quality by routing with priority delays

Priority-Aware Routing for Quantum Networks:Integrating Coherence-Time Constraints into Scheduling

Abstract: Quantum networks face a fundamental challenge absent in classical networks; finite memory coherence times mean that queuing delay directly degrades information quality, causing decoherence that has no classical analog. Existing routing protocols optimize for hop count or channel fidelity while treating scheduling delays as a secondary concern, leaving fidelity vulnerable to congestion-induced decoherence. We present a coherence-aware routing protocol that integrates decoherence constraints into path selection via a priority-modulated aging model derived analytically from Weighted Fair Queueing theory, where high-priority traffic receives compressed effective queue delay. We build a custom discrete-event simulator verified against NetSquid (across 104 states), and evaluate across two structurally diverse topology classes under identical physical parameters, isolating topology structure as the sole independent variable. In all experiments, our protocol is benchmarked against loss-only Dijkstra routing and FIFO scheduling as baselines. On topologies, P2 traffic achieves 96.08% fidelity under a 9x load increase with only 0.04 percentage point degradation, versus a 13.51 percentage point collapse for the loss-only baseline; P2 tail latency holds stable at 0.055 ms while Dijkstra degrades 5.5x. On Barabasi-Albert scale-free topologies, our protocol delivers a +4.12 percentage point fidelity advantage with 97.8% higher aggregate throughput at operational loads over the baseline, with a clearly characterized hub-saturation boundary at 160k QPS. FIFO scheduling provides negligible priority differentiation on both topology classes, providing strong evidence that coherence-aware routing-not scheduling alone is responsible for the observed QoS gains.

Tue 29 SeptNetworking and Internet Architecture
The gist
Quantum networks have a problem that normal networks don't: the memory holding the quantum data loses quality the longer it waits. The authors created a way to pick network paths that consider how long data waits, so important messages lose less quality. They tested their method with computer simulations that matched real quantum network models and found it keeps data clearer and faster even when the network is busy. Their approach works well on different network designs and beats usual routing methods that ignore waiting time effects.
Open → 2609.38380v1

Quantum entanglement routing improves fidelity and throughput in repeater chains

Optimal Entanglement Routing in Quantum Repeater Chains: Beyond Fixed Operation Order and Purification Schedule

Abstract: Entanglement routing establishes entangled pairs between distant nodes of a quantum network by purifying and swapping pairs generated on elementary links. Existing methods typically restrict the decision space along two axes: the operation order, often fixed to purify-then-swap (PtS), and the purification schedule of each link, often restricted to pumping. Focusing on linear repeater chains with finite link capacities, we relax both restrictions and study the maximization of the expected end-to-end throughput subject to a fidelity threshold under two quantum-noise models. We develop a unified capacity-aware optimization framework comprising an exact mixed-integer linear program (MILP) under PtS, instantiated with either pumping or general tree purification schedules, and an exact dynamic program (DP) over arbitrary operation orders. Under symmetric Pauli noise, we prove that pumping converges to a fidelity strictly below unity, imposing a capacity-independent feasibility bound and a maximum chain length on every pumping-based PtS method, whereas general tree schedules yield a capacity-dependent bound. We further prove that post-swap purification never increases the throughput, so a free operation order can only increase feasibility. Numerical evaluations confirm the bounds: tree schedules serve over 90\% of the requests that pumping cannot at moderate fidelity thresholds; within the pumping class, a free operation order recovers much of this advantage; but once links use tree schedules, the tree-based MILP and the order-exact DP serve identical request sets throughout. Operation order and purification schedule are thus substitutes, with the purification schedule the dominant factor governing feasibility under symmetric Pauli noise.

Tue 29 SeptNetworking and Internet Architecture
The gist
Connecting distant quantum nodes needs special pairs called entangled pairs, which can be noisy and weak. Usually, scientists fix the order of two operations—making them better, then linking them—to build a long-distance connection. This paper shows that changing the order and using more flexible methods to improve those pairs can increase how many strong connections you get. They also found exact mathematical ways to plan this for the best results. Their tests show that better schedules for improving pairs matter more than changing operation order, especially under typical noise conditions.
Open → 2609.37206v1

Quantum networks enable information-free proof verification among many parties

Zero Knowledge Proofs in Quantum Networks

Abstract: Zero-knowledge proofs (ZKPs) enable the verification of a statement without revealing any information beyond its validity and constitute a fundamental primitive in cryptography and information theory. However, existing constructions rely on computational assumptions and are predominantly confined to bipartite settings, leaving their information-theoretic realization in bipartite or network scenarios largely unexplored. Here we develop a framework for zero-knowledge verification based on the indistinguishability of quantum states under operational constraints. Exploiting the fundamental limitations imposed by local operations, we show that a verifier is inherently restricted from extracting information about the underlying state while retaining the ability to verify correctness. We construct explicit protocols for multiparty quantum networks that achieve information-theoretic security, ensuring that no subset of collaborating parties can gain knowledge beyond the validity of the statement, independent of their joint computational power.

Mon 28 SeptCryptography and SecuritySocial and Information Networks
The gist
Sometimes you want to prove something is true without sharing any extra details. The authors find a way to do this using quantum states in networks of multiple people, relying on physics limits instead of complex math assumptions. Their method stops anyone from learning more than just whether the statement is true, even if they work together and have unlimited computing power. This is like a magic proof where nobody learns the secret, only the fact that the secret is correct.
Open → 2609.35339v1

Quantum algorithm colors cycle graphs in constant time

Quantum Advantage for Distributed Symmetry Breaking

Abstract: We present a distributed quantum algorithm that $3$-colors cycles in $O(1)$ rounds, with high probability. It follows that all locally checkable labeling problems (LCLs) that have round complexity $O(\log^* n)$ in the classical LOCAL model can be solved in $O(1)$ rounds in the quantum-LOCAL model, with high probability; this includes problems such as maximal independent set and maximal matching in bounded-degree graphs. This presents the first natural examples of graph problems with an asymptotic distributed quantum advantage for the LOCAL model; all prior examples that separate LOCAL and quantum-LOCAL are artificial problems constructed merely for the sake of demonstrating quantum advantage.

Tue 22 SeptDistributed, Parallel, and Cluster Computing
The gist
Some network problems require nodes to pick colors or labels without conflicts, which can be slow on classical computers. The authors show that quantum computing can solve these problems much faster in a distributed setting, specifically coloring cycle graphs with three colors in constant time. This speed-up works for many related problems where classical methods take longer, marking the first natural instance where quantum networks outperform classical ones. This suggests quantum communication can fundamentally improve distributed coordination tasks.
Open → 2609.26788v1

Quantum Markov blankets improve efficiency and security in quantum networks

QCMI-Based Quantum Markov Blanket Discovery for Semantic Quantum Networks

Abstract: Quantum-enabled semantic communication networks (QESCs) leverage quantum technologies to transmit data meaning efficiently, yet face challenges from costly resources and noise. This letter introduces Quantum Markov Blankets (QMBs) to QESCs, a novel framework to isolate essential quantum information for semantic transmission. We prove QMBs' validity using quantum conditional mutual information, showing that they shield semantic content from irrelevant subsystems. An implementation strategy optimises QMB detection, reducing resource use. Simulations suggest that QMB-based QESCs cut qubit consumption by 50\%-75\% while enhancing fidelity compared with non-optimised quantum semantic schemes. Unlike classical approaches, QMBs offer inherent security by limiting an eavesdropper's access to classical data outside the blanket. We outline future directions, including real-time QMB adaptation. This work bridges quantum information theory and semantic communication, advancing resource-efficient and secure quantum networks.

Sat 19 SeptInformation Theory
The gist
Transmitting important information in quantum communication networks is hard because quantum resources are costly and noise can interfere. The authors introduce Quantum Markov Blankets, a way to identify and isolate only the essential quantum information needed, which cuts down resource use and boosts accuracy. Their method also naturally protects data by restricting what an eavesdropper can see outside these blankets. Simulations show it can reduce qubit use by up to three-quarters and improve communication quality compared to existing methods.
Open → 2609.23190v1

Holevo barycenter does not multiply under combined quantum channels

Non-Multiplicativity of the Holevo Barycenter of Quantum Channels

Abstract: The Holevo barycenter of a quantum channel is the unique output state obtained as the average output of any ensemble achieving the Holevo capacity. Given two quantum channels, the multiplicativity problem asks whether this barycenter tensorizes under parallel composition, namely whether the barycenter of the product channel coincides with the tensor product of the individual barycenters. This question is closely related to the additivity problem for the Holevo capacity: additivity implies tensorization of the Holevo barycenter, while tensorization alone is not sufficient for additivity. Although a construction is known that demonstrates the existence of channels with non-additive Holevo capacity, their corresponding Holevo barycenters still tensorize, leaving open whether multiplicativity might ultimately hold universally. Here, we answer this question in the negative by exhibiting channels for which the Holevo barycenter is not multiplicative under the tensor product of the channel with itself. Moreover, we show that the entropy of the Holevo barycenter is neither universally subadditive nor universally superadditive under tensor product.

Tue 8 SeptInformation Theory
The gist
The Holevo barycenter is a way to describe the average output state from a quantum communication channel. People wondered whether combining two channels side-by-side would make their barycenters simply multiply or combine in a straightforward way. The authors show that this is not always true—the barycenter for the combined channel can be different from the product of the individual barycenters. They also find that the entropy of these barycenters does not reliably add up or break down in simple ways when channels are combined. This answers an open question about how quantum information capacity behaves when channels are used together.
Open → 2609.09373v1

Quantum channel capacity strictly limits reliable information transfer

No information transmission through quantum channels above capacity

Abstract: We show that the capacity of a quantum channel demarcates a phase transition: while reliable transmission below capacity is always possible, any attempt to transmit information above it fails catastrophically. Specifically, we prove exponential strong converse theorems for unassisted quantum and classical communication over arbitrary finite-dimensional memoryless quantum channels. At rates beyond the respective capacity, the entanglement-generation fidelity and the success probability for classical communication decay exponentially with the number of channel uses. This rules out transmission above capacity even when one tolerates arbitrarily large errors. Our proof follows the classical Arimoto strategy, augmented by a crucial new ingredient: integral representations of Rényi information measures that lead to asymptotic continuity bounds for Rényi capacities.

Tue 8 SeptInformation Theory
The gist
This paper shows there is a clear hard limit on how much information can be reliably sent over quantum communication channels. The authors prove that sending data above this limit doesn't just get harder, but actually fails exponentially fast with more uses of the channel. This means no matter the method, you can't hope to reliably communicate above the channel’s capacity, even if you're willing to accept large errors. The proof builds on classical methods but adds new mathematical tools for understanding quantum information measures.
Open → 2609.08998v1