Related papers: Deterministic Dense Coding and Faithful Teleportat…

Measurement-based quantum computing offers a promising route towards scalable, universal photonic quantum computation. This approach relies on the deterministic and efficient generation of photonic graph states in which many photons are…

To build a global quantum communication network, low-transmission, fiber-based communication channels can be supplemented by using a free-space channel between a satellite and a ground station on Earth. We have constructed a system that…

The problem of finding a minimum-weight connected dominating set (CDS) of a given undirected graph has been studied actively, motivated by operations of wireless ad hoc networks. In this paper, we formulate a new stochastic variant of the…

In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density. Our results imply several new bounds for classical problems in graph Ramsey theory and improve…

We consider a quantum walk with two marked vertices, sender and receiver, and analyze its application to perfect state transfer on complete bipartite graphs. First, the situation with both the sender and the receiver vertex in the same part…

All-photonic quantum repeaters are essential for establishing long-range quantum entanglement. Within repeater nodes, reliably performing entanglement swapping is a key component of scalable quantum communication. To tackle the challenge of…

We show that {\it one} single-mode squeezed state distributed among $N$ parties using linear optics suffices to produce a truly $N$-partite entangled state for any nonzero squeezing and arbitrarily many parties. From this $N$-partite…

We derive the local density of states from itinerant and boundary states around transport barriers and edges in graphene and show that the itinerant states lead to mesoscale undulations that could be used to probe their scattering…

Recently Liu, Long, Tong and Li [Phys. Rev. A 65, 022304 (2002)] have proposed a scheme for superdense coding between multiparties. This scheme seems to be highly asymmetric in the sense that only one sender effectively exploits…

This study proposes a novel approach to ensure the security of textual data transmission in a semantic communication system. In the proposed system, a sender transmits textual information to a receiver, while a potential eavesdropper…

We introduce a repeater scheme to efficiently distribute multipartite entangled states in a quantum network with optimal scaling. The scheme allows to generate graph states such as 2D and 3D cluster states of growing size or GHZ states over…

While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…

Transfer of quantum information between physical systems of a different nature is a central matter in quantum technologies. Particularly challenging is the transfer between discrete- and continuous degrees of freedom of various harmonic…

We consider quantum state transfer on finite graphs which are attached to infinite paths. The finite graph represents an operational quantum system for performing useful quantum information tasks. In contrast, the infinite paths represent…

A continuous quantum walk on a graph $X$ with adjacency matrix $A$ is specified by the 1-parameter family of unitary matrices $U(t)=\exp(itA)$. These matrices act on the state space of a quantum system, the states of which we may represent…

Pliable index coding considers a server with m messages, and n clients where each has as side information a subset of the messages. We seek to minimize the number of transmissions the server should make, so that each client receives (any)…

Graph neural networks (GNNs) have become powerful tools for processing graph-based information in various domains. A desirable property of GNNs is transferability, where a trained network can swap in information from a different graph…

We present a new scheme for teleporting multiqubit quantum information from a sender to a distant receiver via the control of many agents in a network. We show that the receiver can successfully restore the original state of each qubit as…

We present a dense coding scheme between one sender and two receivers, which guarantees that the receivers simultaneously obtain their respective messages. In our scheme, the quantum entanglement channel is first locked by the sender so…

We present a way for symmetric multiparty-controlled teleportation of an arbitrary two-particle entangled state based on Bell-basis measurements by using two Greenberger-Horne-Zeilinger states, i.e., a sender transmits an arbitrary…