We study the problem of remote control of quantum correlations (discord) in a sub-system of two qubits (receiver) via the parameters of the initial state of another sub-system of three qubits (sender) connected with the receiver by the inhomogeneous spin-1/2 chain. We propose two parameters characterizing the creatable correlations. The first one is the discord between the receiver and the rest of spin-1/2 chain, it concerns the mutual correlations between these two subsystems. The second parameter is the discord between the two nodes of the receiver and describes the correlations inside of the receiver. We study the dependence of these two discords on the inhomogeneity degree of spin chain.
We study the optimization problem for remote one- and two-qubit state creation via a homogeneous spin-1/2 communication line using the local unitary transformations of the multi-qubit sender and extended receiver. We show that the maximal length of a communication line used for the needed state creation (the critical length) increases with an increase in the dimensionality of the sender and extended receiver. The model with the sender and extended receiver consisting of up to 10 nodes is used for the one-qubit state creation and we consider two particular states: the almost pure state and the …
We investigate the maximum rates for transmitting quantum information, distilling entanglement, and distributing secret keys between a sender and a receiver in a multipoint communication scenario, with the assistance of unlimited two-way classical communication involving all parties. First we consider the case where a sender communicates with an arbitrary number of receivers, so called quantum broadcast channel. Here we also provide a simple analysis in the bosonic setting where we consider quantum broadcasting through a sequence of beamsplitters. Then, we consider the opposite case where an a…
We introduce the task of random-receiver quantum communication, in which a sender transmits a quantum message to a receiver chosen from a list of n spatially separated parties. The choice of receiver is unknown to the sender, but is known by the n parties, who coordinate their actions by exchanging classical messages. In normal conditions, random-receiver quantum communication requires a noiseless quantum communication channel from the sender to each of the n receivers. In contrast, we show that random-receiver quantum communication can take place through entanglement-breaking channels if the …
We propose and prove protocols of controlled and combined remote implementations of partially unknown quantum operations belonging to the restricted sets [An Min Wang: PRA, \textbf{74}, 032317(2006)] using GHZ states. We detailedly describe the protocols in the cases of one qubit, respectively, with one controller and with two senders. Then we extend the protocols to the cases of multiqubits with many controllers and two senders. Because our protocols have to demand the controller(s)'s startup and authorization or two senders together working and cooperations, the controlled and combined remot…
We propose a protocol for anonymous distribution of quantum information which can be used in two modifications. In the first modification the receiver of the message is publicly known, but the sender remains unknown (even to receiver). In the second modification the sender is known, but the receiver is unknown (even to sender). Our protocol achieves this goal with unconditional security using classical anonymous message transfer proposed by Chaum as a subprotocol.
The possibility of attaining current position of the message sender without person's consent seriously compromises the secrecy of correspondence. Classical communication systems cannot guarantee the security of communication against unwanted location tracking, because the sender must broadcast a signal at the moment of sending the message. The source of the signal could be always located, at least in principle. We show that quantum communication enables sending the message with pre-distributed entangled quantum systems, local weak measurements, time synchronization between the sender and the r…
Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both the sender and receiver vertices are in the same partition of the graph and when the sender and receiver are in opposite partitions of the same size. By changing the coin operator, we analyze the state transfer problem and we show that it is still possible to achieve state transfer with high fidelity even when the sender and receiver are in different partitions with different sizes. Moreover, it is also possible to use an …
Multiparty quantum communication is an important branch of quantum networks. It enables private information transmission with information-theoretic security among legitimate parties. We propose a sender-controlled measurement-device-independent multiparty quantum communication protocol. The sender Alice divides a private message into several parts and delivers them to different receivers for secret sharing with imperfect measurement devices and untrusted ancillary nodes. Furthermore, Alice acts as an active controller and checks the security of quantum channels and the reliability of each rece…
We study the quantum correlations between the two remote qubits (sender and receiver) connected by the transmission line (homogeneous spin-1/2 chain) depending on the parameters of the sender's and receiver's initial states (control parameters). We consider two different measures of quantum correlations: the entanglement (a traditional measure) and the informational correlation (based on the parameter exchange between the sender and receiver). We find the domain in the control parameter space yielding (i) zero entanglement between the sender and receiver during the whole evolution period and (…
We study the remote creation of the polarization and intensity of the first-order coherence (or coherence intensity) in long spin-1/2 chains with one qubit sender and receiver. Therewith we use a physically motivated initial condition with the pure state of the sender and the thermodynamical equilibrium state of the other nodes. The main part of the creatable region is a one-to-one map of the initial-state (control) parameters, except the small subregion twice covered by the control parameters, which appears owing to the chosen initial state. The polarization and coherence intensity behave dif…
We consider a method of remote mixed state creation of a one-qubit subsystem (receiver) in a spin-1/2 chain governed by the nearest-neighbor $XY$-Hamiltonian. Owing to the evolution of the chain along with the variable local unitary transformation of the one- or two-qubit sender, a large variety of receiver states can be created during some time interval starting with a fixed initial state of the whole quantum system. These states form the creatable region of the receiver's state-space. It is remarkable that, having the two-qubit sender, a large creatable region may be covered at a properly fi…
We consider the remote creation of a mixed state in a one-qubit receiver connected to two two-qubit senders via different channels. {Channels are assumed to be chains of spins (qubits) with nearest-neighbor interactions, no external fields are being applied.} The problem of sharing the creatable region of the receiver's state-space between two senders is considered for a communication line with the receiver located asymmetrically with respect to these senders (asymmetric communication line). An example of a quantum register realizing simple functions is constructed on the basis of a symmetric …
We present two schemes for joint remote preparation of an arbitrary four-qubit j\c{hi}i -type entangled state via three three- and (N+1)-qubit GHZ states as the quantum channel, respectively. In these schemes, two senders (or N senders) share the original state which they wish to help the receiver to remotely prepare. To complete the JRSP schemes, several novel sets of mutually orthogonal basis vectors are introduced. It is shown that, only if two senders (or N senders) collaborate with each other, and perform projective measurements under suitable measuring basis on their own qubits respectiv…
We study the effects of quantum entanglement on the performance of two classical zero-error communication tasks among multiple parties. Both tasks are generalizations of the two-party zero-error channel-coding problem, where a sender and a receiver want to perfectly communicate messages through a one-way classical noisy channel. If the two parties are allowed to share entanglement, there are several positive results that show the existence of channels for which they can communicate strictly more than what they could do with classical resources. In the first task, one sender wants to communicat…
We investigate the effect of noisy channels in a classical information transfer through a multipartite state which acts as a substrate for the distributed quantum dense coding protocol between several senders and two receivers. The situation is qualitatively different from the case with one or more senders and a single receiver. We obtain an upper bound on the multipartite capacity which is tightened in case of the covariant noisy channel. We also establish a relation between the genuine multipartite entanglement of the shared state and the capacity of distributed dense coding using that state…
We study the problem of remote one-qubit mixed state creation using a pure initial state of two-qubit sender and spin-1/2 chain as a connecting line. We express the parameters of creatable states in terms of transition amplitudes. We show that the creation of complete receiver's state-space can be achieved only in the chain engineered for the one-qubit perfect state transfer (PST) (for instance, in the fully engineered Ekert chain), the chain can be arbitrarily long in this case. As for the homogeneous chain, the creatable receiver's state region decreases quickly with the chain length. Both h…
Using the tool of unitary transformations of the extended receiver we perform simple operations with the non-diagonal elements of the initial sender's density matrix after their transferring to the receiver. These operations are following: turning some matrix elements to zero, rearranging the matrix elements and preparing their linear combinations with required coefficients. We also propose a protocol for solving a system of linear algebraic equations with a system of two equations as an example. Such operations are numerically simulated on the basis of 42-node spin-1/2 chain with the two-qubi…
We investigate probabilistic dense coding in non-symmetric Hilbert spaces of the sender's and the receiver's particles. The sender and the receiver share the multipartite non-maximally quantum channel. We also discuss the average information.
We propose a new quantum secret sharing scheme using a single non-entangled qubit. In the scheme, by transmitting a qubit to the next party sequentially, a sender can securely transmit a secret message to $N$ receivers who could only decode the message cooperatively after randomly shuffling the polarization of the qubit. We explain this quantum secret sharing scheme into the one between a sender and two receivers, and generalize the scheme between a sender and $N$ receivers. Since our scheme is capable of using a faint coherent pulse as a qubit, it is experimentally feasible within current tec…
We study the consequences of 'super-quantum non-local correlations' as represented by the PR-box model of Popescu and Rohrlich, and show PR-boxes can enhance the capacity of noisy interference channels between two senders and two receivers. PR-box correlations violate Bell/CHSH inequalities and are thus stronger -- more non-local -- than quantum mechanics; yet weak enough to respect special relativity in prohibiting faster-than-light communication. Understanding their power will yield insight into the non-locality of quantum mechanics. We exhibit two proof-of-concept channels: first, we show a…
We consider the communication line with two-qubit sender and receiver, the later is embedded into the four-qubit extended receiver. Using the optimizing unitary transformation on the extended receiver we restore the structure of the non-diagonal part of an arbitrary initial sender's state at the remote receiver at certain time instant. Obstacles for restoring the diagonal part are discussed. We represent examples of such structural restoring in a communication line of 42 spin-1/2 particles.
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 that the receivers cannot learn their messages unless they collaborate to perform the unlocking operation. We also show that the quantum Fourier transform can act as the locking operator both in simultaneous dense coding and teleportation.
We introduce and analyze an information theoretical task that we call the quantum multiple-access one-time pad. Here, a number of senders initially share a correlated quantum state with a receiver and an eavesdropper. Each sender performs a local operation to encode a classical message and sends their system to the receiver, who subsequently performs a measurement to decode the messages. The receiver will be able to decode the messages almost perfectly, while the eavesdropper must not be able to extract information about the messages even if they have access to the quantum systems transmitted.…
Two different models for performing efficiently routing of a quantum state are presented. Both cases involve an XX spin chain working as data bus and additional spins that play the role of sender and receivers, one of which is selected to be the target of the quantum state transmission protocol via a coherent quantum coupling mechanism making use of local/global magnetic fields. Quantum routing is achieved, in the first of the models considered, by weakly coupling the sender and the receiver to the data bus. In the second model, strong magnetic fields acting on additional spins located between…
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 of the graph is considered. We show that in this case the dynamics of the quantum walk is independent of the size of the second part and reduces to the one for the star graph where perfect state transfer is achieved. Second, we consider the situation where the sender and the receiver vertex are in the opposite parts of the graph. In such a case the state tr…
Multiple quantum (MQ) NMR coherence spectra, which can be obtained experimentally in MQ NMR, can be transferred from the sender to the remote receiver without mixing the MQ-coherences of different orders and distortions. The only effect of such transfer is scaling of the certain blocks of sender's density matrix (matrices of MQ-coherences of different order). Such a block-scaled transfer is an alternative to the perfect state transfer. In particular, equal scaling of higher order MQ-coherences matrices is possible. Moreover, there are states which can be transferred to the receiver preserving …
Quantum information theory has revolutionized the way in which information is processed using quantum resources such as entangled states, local operations and classical communications. Two important protocols in quantum communications are quantum teleportation and remote state preparation. In quantum teleportation neither the sender nor the receiver know the identity of a state. In remote state preparation the sender knows the state which is to be remotely prepared without ever physically sending the object or the complete classical description of it. Using one unit of entanglement and one cla…
We present a generalization of quantum teleportation that distributes quantum information from a sender's $d$-level particle to $N_o$ particles held by remote receivers via an initially shared multiparticle entangled state. This entangled state functions as a multiparty quantum information distribution channel between the sender and the receivers. The structure of the distribution channel determines how quantum information is processed. Our generalized teleportation scheme allows multiple receivers at arbitrary locations, and can be used for applications such as optimal quantum information bro…
We present a framework of a multimode dense coding network with multiple senders and a single receiver using continuous variable systems. The protocol is scalable to arbitrary numbers of modes with the encoding being displacements while the decoding involves homodyne measurements of the modes after they are combined in a pairwise manner by a sequence of beam splitters, thereby exhibiting its potentiality to implement in laboratories with currently available resources. We compute the closed form expression of the dense coding capacity for the cases of two and three senders that involve sharing …
We propose a scheme on the basis of a N+2 identical single-mode coupled-cavity QED system for selective transfer of a qubit constructed from superposition of standard coherent states. The cavities arranged in such way that the intermediate or channel cavity is connected uniformly to the sender and N receiver cavities. We consider N different ternary sets of identical QDs whose QDs have been distributed in the sender, channel and one of the receiver cavities respectively. We demonstrate a situation in which the dynamics of the system is confined selectively in a sub sector belongs to one of the…
We investigate coined quantum walk search and state transfer algorithms, focusing on the complete $M$-partite graph with $N$ vertices in each partition. First, it is shown that by adding a loop to each vertex the search algorithm finds the marked vertex with unit probability in the limit of a large graph. Next, we employ the evolution operator of the search with two marked vertices to perform a state transfer between the sender and the receiver. We show that when the sender and the receiver are in different partitions the algorithm succeeds with fidelity approaching unity for a large graph. Ho…
This paper considers the communication over a quantum multiple-unicast network where r sender-receiver pairs communicate independent quantum states. We concretely construct a quantum network code for the quantum multiple-unicast network as a generalization of the code [Song and Hayashi, arxiv:1801.03306, 2018] for the quantum unicast network. When the given node operations are restricted to invertible linear operations between bit basis states and the rates of transmissions and interferences are restricted, our code certainly transmits a quantum state for each sender-receiver pair by n-use of …
We consider the remote state creation via the homogeneous spin-1/2 chain and show that the significant extension of the creatable region can be achieved using the local unitary transformation of the so-called extended receiver (i.e. receiver joined with the nearest node(s)). This transformation is { most} effective in the models with all-node interactions. We consider the model with the two-qubit sender, one-qubit receiver and two-qubit extended receiver.
In this paper, we present an (n, n) threshold quantum secret sharing scheme of secure direct communication using Greenberger-Horne-Zeilinger state. The present scheme is efficient in that all the Greenberger-Horne-Zeilinger states used in the quantum secret sharing scheme are used to generate shared secret messages except those chosen for checking eavesdropper. In our scheme, the measuring basis of communication parties is invariable and the classical information used to check eavesdropping needs only the results of measurements of the communication parties. Another nice feature of our scheme …
We show that a quantum network can protect the identity of a sender and receiver from an external wiretapper. This new quantum communication protocol, which we call secure quantum routing, requires only single photons routed by linear optical elements and photon counters, and does not require distributing entanglement over multiple nodes or active feedforward. We prove that secure quantum routing protects both the contents of the message and the identity of the sender and receiver, and creates only a negligible reduction in the network channel capacity.
We propose a protocol for state transfer and entanglement generation between two distant spin qubits (sender and receiver) that have different energies. The two qubits are permanently coupled to a far off-resonant spin-chain, and the qubit of the sender is driven by an external field, which provides the energy required to bridge the energy gap between the sender and the receiver. State transfer and entanglement generation are achieved via virtual single-photon and multi-photon transitions to the eigenmodes of the channel.
Information, in its communications sense, is a transactional property. If the received signals communicate choices made by the sender of the signals, then information has been transmitter by the sender to the receiver. Given this reality, the potential information in an unknown pure quantum state should be non-zero. We examine transactional quantum information, which unlike von Neumann entropy, depends on the mutuality of the relationship between the sender and the receiver, associating information with an unknown pure state. The information that can be obtained from a pure state in repeated e…
The pure-interference bosonic multiple access channel has two senders and one receiver, such that the senders each communicate with multiple temporal modes of a single spatial mode of light. The channel mixes the input modes from the two users pairwise on a lossless beamsplitter, and the receiver has access to one of the two output ports. In prior work, Yen and Shapiro found the capacity region of this channel if encodings consist of coherent-state preparations. Here, we demonstrate how to achieve the coherent-state Yen-Shapiro region (for a range of parameters) using a sequential decoding str…
