arXiv subjects

Uzi Pereg

Publications and source records attributed to Uzi Pereg.

At least 19 recordsLinked to original sources

arXiv2026

Quantum Coordination and Nonlocal Games: Theory and Applications

Coordination is a fundamental primitive in communication and information theory, in which distributed systems must collectively generate correlated behavior rather than merely exchange messages. In quantum networks, the nature of entanglement, quantum measurements, and nonclassical correlations introduces coordination possibilities unavailable classically. This article reviews recent advances in coordination over classical and quantum communication networks, focusing on empirical and strong coordination in multi-user settings. We consider the implications of coordination for nonlocal games, showing how it provides a natural framework for understanding the correlations that enable spatially separated players to improve their probability of winning. We present a unified framework for coordination using classical or quantum communication and pre-shared correlation resources. The review covers simulation of both entanglement and separable correlations across a variety of network architectures, including two-node, cascade, broadcast, and multiple-access networks. We study the operational differences between empirical and strong coordination, and the tradeoffs between communication and correlation resources, such as pre-shared randomness and entanglement. Coordination plays a major role in device-independent quantum key distribution (DI-QKD) schemes, in which parties can generate a secret key even if the devices used in the process have been prepared by an adversary. Furthermore, we examine the role of coordination in quantum repeaters, where distributed entanglement serves as a resource for long-distance quantum communication. The review highlights connections between coordination theory and applications such as distributed quantum systems, quantum internet architectures, and future communication networks.

quant-ph↗

arXiv2026

Quantum Secret Sharing Rates

This paper studies the capacity limits for quantum secret sharing (QSS). The goal of a QSS scheme is to distribute a quantum secret among multiple participants, such that only authorized parties can recover it through collaboration, while no information can be obtained without such collaboration. We introduce an information-theoretic model for the rate analysis of QSS and its relation to compound quantum channels, following a similar approach as of Zou et al. (2015) on classical secret sharing. We establish a regularized characterization for the QSS capacity, and determine the capacity for QSS with dephasing noise.

quant-ph↗

arXiv2026

Quantum Physics-Informed Neural Networks for Maxwell's Equations: Circuit Design, "Black Hole" Barren Plateaus Mitigation, and GPU Acceleration

Physics-Informed Neural Networks (PINNs) have emerged as a promising approach for solving partial differential equations (PDEs) by embedding the governing physics into the loss function associated with a deep neural network. In this work, a Quantum PINNs (QPINN) framework is proposed to solve two-dimensional (2D) time-dependent Maxwell's equations. Our approach utilizes a parametrized quantum circuit in conjunction with the classical neural network architecture and enforces physical laws, including a global energy conservation principle, during training. A quantum simulation library, TorQ, was developed to efficiently compute circuit outputs and derivatives by leveraging GPU acceleration based on PyTorch, enabling end-to-end training of the QPINN. The method was evaluated on two 2D electromagnetic wave propagation problems: one in free space (vacuum) and the other has an added dielectric medium. Multiple quantum circuit ansätze, input scales, and an added loss term were compared in a thorough ablation study. Furthermore, recent techniques to enhance PINN convergence, including random Fourier feature embeddings and adaptive time weighting, have been incorporated. Our results demonstrate that the QPINN achieves accuracy comparable to, and even greater than, the classical PINN baseline, while using a significantly smaller number of trainable parameters. This study also shows that adding an energy conservation term to the loss stabilizes training and improves the physical fidelity of the solution in the lossless free-space case. This added term helps mitigate a new kind of barren plateau (BP) related phenomenon - ``black hole'' (BH) loss landscape for the quantum experiments in that scenario. By optimizing the quantum-circuit ansatz and embedding energy-conservation constraints, our QPINN achieves up to a 19% higher accuracy on 2D Maxwell benchmark problems compared to a classical PINN.

quant-ph↗

arXiv2026

Classical Feedback in a Quantum Network

Communication over a quantum multiple access channel (MAC) is considered with classical feedback. Since the no-cloning prohibits universal copying of arbitrary quantum states, classical feedback is generated through measurement. An achievable rate region is derived using partial information decoding at each transmitter. Our region generalizes both the classical Cover-Leung region and the generalized feedback region. As an example, we show that the qubit SWAP channel can benefit from feedback.

quant-ph↗

arXiv2025

Covert Entanglement Generation over Bosonic Channels

We explore covert entanglement generation over the lossy thermal-noise bosonic channel, which is a quantum-mechanical model of many practical settings, including optical, microwave, and radio-frequency (RF) channels. Covert communication ensures that an adversary is unable to detect the presence of transmissions, which are concealed in channel noise. We show that a square root law (SRL) for covert entanglement generation similar to that for classical communication: $L_{\rm EG}\sqrt{n}$ entangled bits (ebits) can be generated covertly and reliably over $n$ uses of a bosonic channel. We report a single-letter expression for optimal $L_{\rm EG}$ as well as an achievable method. We additionally analyze the performance of covert entanglement generation using single- and dual-rail photonic qubits, which may be more practical for physical implementation.

quant-ph↗

arXiv2025

Reduced State Embedding for Error Correction in Quantum Cryptography

Encoding in a high-dimensional Hilbert space improves noise resilience in quantum information processing. This approach, however, may result in cross-mode coupling and detection complexities, thereby reducing quantum cryptography performance. This fundamental trade-off between correctness and secrecy motivates the search for quantum error-correction approaches for cryptography. Here, we introduce state embeddings that use a k-symbol subset within a d-dimensional Hilbert space, tailored to the channel's error structure. In the framework of quantum error-correction, our reduced-state embedding realizes an explicit erasure-type error-correction within the quantum channel. We demonstrate the advantage of our scheme in realistic quantum channels, producing a higher secure key rate. We validate our approach using a d=25 quantum key distribution (QKD) experimental data, derive closed-form expressions for the key rate and threshold, and determine the optimum at k=5. These findings advance high-dimensional QKD and pave the way to error-correction and modulation for quantum cryptography.

quant-ph↗

arXiv2025

The Quantum Multiple-Access Channel with Cribbing Encoders

Communication over a quantum multiple-access channel (MAC) with cribbing encoders is considered, whereby Transmitter 2 performs a measurement on a system that is entangled with Transmitter 1. Based on the no-cloning theorem, perfect cribbing is impossible. This leads to the introduction of a MAC model with noisy cribbing. In the causal and non-causal cribbing scenarios, Transmitter 2 performs the measurement before the input of Transmitter 1 is sent through the channel. Hence, Transmitter 2's cribbing may inflict a "state collapse" for Transmitter 1. Achievable regions are derived for each setting. Furthermore, a regularized capacity characterization is established for robust cribbing, i.e. when the cribbing system contains all the information of the channel input. Building on the analogy between the noisy cribbing model and the relay channel, a partial decode-forward region is derived for a quantum MAC with non-robust cribbing. For the classical-quantum MAC with cribbing encoders, the capacity region is determined with perfect cribbing of the classical input, and a cutset region is derived for noisy cribbing. In the special case of a classical-quantum MAC with a deterministic cribbing channel, the inner and outer bounds coincide.

quant-ph↗

arXiv2025

Quantum Action-Dependent Channels

We study communication over a quantum action-dependent channel, where the transmitter first performs an action that "shocks" the channel environment, and subsequently encodes a message into a transmission sent through the channel. This two-stage interaction arises in various settings, including rewriting over defective memory and quantum effects such as measurement-induced state collapse. Our model can be viewed as a quantum generalization of Weissman's classical action-dependent channel (2010). Here, however, Alice cannot have a copy of the environment state due to the no-cloning theorem. Instead, she may share entanglement with this environment. We derive achievable rates for reliable message transmission via the quantum action-dependent channel, with either causal or non-causal channel side information (CSI). As a case study, we analyze memory storage with depolarization and selective rewriting, demonstrating how action-dependent control influences performance.

quant-ph↗

arXiv2025

Relaying Quantum Information

Quantum relays are central to both quantum communication and distributed quantum computing, enabling long-distance transmission and modular architectures. Unlike classical repeaters, quantum repeaters preserve coherence without amplifying quantum information, relying on entanglement swapping and quantum error correction to overcome loss and decoherence. In this work, we investigate the transmission of quantum information via quantum relay channels. Our three-terminal relay model captures the trade-off between repeater-assisted and repeaterless communication strategies. Specifically, we propose a partial decode-forward strategy, in which quantum ``message system" consists of two components. The first component is decoded by the relay and then sent to the destination receiver, whereas the second component is decoded by the destination receiver without the relay's help. We analyze both entanglement-assisted and unassisted scenarios. As a special case, the full decode-forward strategy is recovered, with the relay decoding, re-encoding, and forwarding the entire message. Our framework allows for different entanglement topologies between the transmitter, the relay and the destination receiver, recovering known results on entanglement-assisted and unassisted communication. Furthermore, we discuss the interpretation of coding with quantum side information. These findings provide a foundation for designing secure, efficient, and reliable quantum networks and for realizing practical quantum repeaters and long-range quantum key distribution.

quant-ph↗

arXiv2025

Quantum Relay Channels

Communication over a fully quantum relay channel is considered. We establish three bounds based on different coding strategies, i.e., partial decode-forward, measure-forward, and assist-forward. Using the partial-decode forward strategy, the relay decodes part of the information, while the other part is decoded without the relay's help. The result by Savov et al. (2012) for a classical-quantum relay channel is obtained as a special case. Based on our partial-decode forward bound, the capacity is determined for Hadamard relay channels. In the measure-forward coding scheme, the relay performs a sequence of measurements and then sends a compressed representation of the measurement outcome to the destination receiver. The measure-forward strategy can be viewed as a generalization of the classical compress-forward bound. At last, we consider quantum relay channels with orthogonal receiver components. The assist-forward bound is based on a new approach, whereby the transmitter sends the message to the relay and simultaneously generates entanglement assistance between the relay and the destination receiver. Subsequently, the relay can transmit the message to the destination receiver with rate-limited entanglement assistance.

quant-ph↗

arXiv2025

Empirical Coordination of Quantum Correlations

We introduce the notion of empirical coordination for quantum correlations. Quantum mechanics enables the calculation of probabilities for experimental outcomes, emphasizing statistical averages rather than detailed descriptions of individual events. This makes empirical coordination a natural and operationally meaningful framework for quantum systems - particularly in the context of nonlocal games, which rely on repeated measurements to assess performance. We begin by analyzing networks with classical links, focusing on the cascade network. For this setting, we establish the optimal coordination rates, which indicate the minimal resources required to simulate a quantum state on average. Providing the users with shared randomness, before communication begins, does not affect the optimal rates for empirical coordination. Our analysis starts with a basic two-node scenario and extends to cascade networks, including the special case of a network with an isolated node. The results can be further generalized to other networks as our analysis includes a generic achievability scheme. The optimal rate formula involves optimization over a collection of state extensions. This is a unique feature of the quantum setting, as the classical parallel does not include optimization. As demonstrated through examples, the performance depends heavily on the choice of decomposition. We then extend the framework to networks with quantum links, focusing on a broadcast setting where the receivers have side information. Finally, we discuss how our results provide new insights into the implementation and simulation of quantum nonlocal games in the empirical regime.

quant-ph↗

arXiv2025

Covert Entanglement Generation and Secrecy

We determine the covert capacity for entanglement generation over a noisy quantum channel. While secrecy guarantees that the transmitted information remains inaccessible to an adversary, covert communication ensures that the transmission itself remains undetectable. The entanglement dimension follows a square root law (SRL) in the covert setting, i.e., $O(\sqrt{n})$ Einstein-Podolsky-Rosen (EPR) pairs can be distributed covertly and reliably over $n$ channel uses. We begin with covert communication of classical information under a secrecy constraint. We then leverage this result to construct a coding scheme for covert entanglement generation. Single-letter expressions are derived for the covert key-assisted and unassisted secrecy capacities, as well as for the covert entanglement-generation capacity.

quant-ph↗

arXiv2025

Nonlinear Nanophotonics for High-Dimensional Quantum States

Quantum nanophotonics merges the precision of nanoscale light manipulation with the capabilities of quantum technologies, offering a pathway for enhanced light-matter interaction and compact realization of quantum devices. Here, we show how a recently-demonstrated nonlinear nanophotonic process can be employed to selectively create photonic high-dimensional quantum states (qudits). We utilize the nonlinearity on the surface of the nanophotonic device to dress, through the polarization of the pump field, the near-field modes carrying angular momentum and their superpositions. We then use this approach for the realization of a multilevel quantum key distribution protocol, which doubles the key rate compared to standard schemes. This idea is an important step towards experimental realizations of quantum state generation and manipulation through nonlinearity within nanophotonic platforms, and enables new capabilities for on-chip quantum devices.

physics.optics↗

arXiv2025

Entanglement-Assisted Covert Communication via Qubit Depolarizing Channels

We consider entanglement-assisted communication over the qubit depolarizing channel under the security requirement of covert communication, where not only the information is kept secret, but the transmission itself must be concealed from detection by an adversary. Previous work showed that $O(\sqrt{n})$ information bits can be reliably and covertly transmitted in $n$ channel uses without entanglement assistance. However, Gagatsos et al. (2020) showed that entanglement assistance can increase this scaling to $O(\sqrt{n}\log(n))$ for continuous-variable bosonic channels. Here, we present a finite-dimensional parallel, and show that $O(\sqrt{n}\log(n))$ covert bits can be transmitted reliably over $n$ uses of a qubit depolarizing channel. The coding scheme employs "weakly" entangled states such that their squared amplitude scales as $O(1/\sqrt{n})$.

quant-ph↗

arXiv2025

Entanglement Coordination Rates in Multi-User Networks

The optimal coordination rates are determined in three primary settings of multi-user quantum networks, thus characterizing the minimal resources required in order to simulate a joint quantum state among multiple parties. We study the following models: (1) a cascade network with rate-limited entanglement, (2) a broadcast network, which consists of a single sender and two receivers, (3) a multiple-access network with two senders and a single receiver. We establish the necessary and sufficient conditions on the asymptotically-achievable communication and entanglement rates in each setting. At last, we show the implications of our results on nonlocal games with quantum strategies.

quant-ph↗

arXiv2025

Identification Under the Semantic Effective Secrecy Constraint

The problem of identification over a discrete memoryless wiretap channel is examined under the criterion of semantic effective secrecy. This secrecy criterion guarantees both the requirement of semantic secrecy and of stealthy communication. Additionally, we introduce the related problem of combining approximation-of-output statistics and transmission. We derive a capacity theorem for approximation-of-output statistics transmission codes. For a general model, we present lower and upper bounds on the capacity, showing that these bounds are tight for more capable wiretap channels. We also provide illustrative examples for more capable wiretap channels, along with examples of wiretap channel classes where a gap exists between the lower and upper bounds.

cs.IT↗

arXiv2024

The Multiple-Access Channel with Entangled Transmitters

Communication over a classical multiple-access channel (MAC) with entanglement resources is considered, whereby two transmitters share entanglement resources a priori before communication begins. Leditzky et al. (2020) presented an example of a classical MAC, defined in terms of a pseudo telepathy game, such that the sum rate with entangled transmitters is strictly higher than the best achievable sum rate without such resources. Here, we establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters, and show that the previous result can be obtained as a special case. It has long been known that the capacity region of the classical MAC under a message-average error criterion can be strictly larger than with a maximal error criterion (Dueck, 1978). We observe that given entanglement resources, the regions coincide. Furthermore, we address the combined setting of entanglement resources and conferencing, where the transmitters can also communicate with each other over rate-limited links. Using superdense coding, entanglement can double the conferencing rate.

quant-ph↗

arXiv2024

Semantic Security with Unreliable Entanglement Assistance: Interception and Loss

Semantic security is considered with unreliable entanglement assistance, due to one of two reasons: Interception or loss. We consider two corresponding models. In the first model, Eve may intercept the entanglement resource. In the second model, Eve is passive, and the resource may dissipate to the environment beyond her reach. We derive achievable rates for both models, subject to a maximal error criterion and semantic security. As an example, we consider the amplitude damping channel. Under interception, time division is not necessarily possible, and the boundary of our achievable region is disconnected. In the passive model, our rate region outperforms time division.

quant-ph↗