Recent work has shown that a simple chain of interacting spins can be used as a medium for high-fidelity quantum communication. We describe a scheme for quantum communication using a spin system that conserves z-spin, but otherwise is arbitrary. The sender and receiver are assumed to directly control several spins each, with the sender encoding the message state onto the larger state-space of her control spins. We show how to find the encoding that maximises the fidelity of communication, using a simple method based on the singular-value decomposition. Also, we show that this solution can be used to increase communication fidelity in a rather different circumstance: where no encoding of initial states is used, but where the sender and receiver control exactly two spins each and vary the interactions on those spins over time. The methods presented are computationally efficient, and numerical examples are given for systems having up to 300 spins.
We provide a theoretical framework for encoding arbitrary logical states of a quantum bit (qubit) into a continuous-variable quantum mode through quantum walks. Starting with a squeezed-vacuum state of the quantum mode, we show that quantum walks of the state in phase space can generate output states that are variants of codeword states originally put forward by Gottesman, Kitaev, and Preskill (GKP) [Phys. Rev. A {\bf 64}, 012310 (2001)]. In particular, with a coin-toss transformation that projects the quantum coin onto the diagonal coin-state, we show that the resulting {\em dissipative} quan…
The unique features of quantum walk, such as the possibility of the walker to be in superposition ofthe position space and get entangled with the position space, provides inherent advantages that canbe captured to design highly secure quantum communication protocols. Here we propose two quan-tum direct communication protocols, a Quantum Secure Direct Communication (QSDC) protocoland a Controlled Quantum Dialogue (CQD) protocol using discrete-time quantum walk on a cycle.The proposed protocols are unconditionally secure against various attacks such as the intercept-resend attack, the denial of …
The exponential speed-up of quantum walks on certain graphs, relative to classical particles diffusing on the same graph, is a striking observation. It has suggested the possibility of new fast quantum algorithms. We point out here that quantum mechanics can also lead, through the phenomenon of localization, to exponential suppression of motion on these graphs (even in the absence of decoherence). In fact, for physical embodiments of graphs, this will be the generic behaviour. It also has implications for proposals for using spin networks, including spin chains, as quantum communication channe…
We introduce some new perfect state transfer and teleportation schemes by quantum walks with two coins. Encoding the transferred information in coin 1 state and alternatively using two coin operators, we can perfectly recover the information on coin 1 state at target position only by at most two times of flipping operation. Based on quantum walks with two coins either on the line or on the $N$-circle, we can perfectly transfer any qubit state. In addition, using quantum walks with two coins either on complete graphs or regular graphs, we can first implement perfect qudit state transfer by quan…
An asymmetric preparation of the quantum states sent through a noisy channel can enable a new way to monitor and actively compensate the channel noise. The paradigm of such an asymmetric treatment of quantum information is the Bennett 1992 protocol, in which the ratio between conclusive and inconclusive counts is in direct connection with the channel noise. Using this protocol as a guiding example, we show how to correct the phase drift of a communication channel without using reference pulses, interruptions of the quantum transmission or public data exchanges.
We propose a multi-mode modulation scheme for Continuous Variable (CV) quantum communications, which we call quantum pattern encoding. In this setting, classical information can be encoded into multi-mode patterns of discretely-modulated coherent states, which form instances of a communicable image space. Communicators can devise arbitrarily complex encoding schemes which are degenerate and highly non-uniform, such that communication is likened to the task of pattern recognition. We explore initial communication schemes that exploit these techniques, and which lead to an increased encoding com…
Quantum steganography is the study of hiding secret quantum information by encoding it into what an eavesdropper would perceive as an innocent-looking message. Here we study an explicit steganographic encoding for Alice to hide her secret message in the syndromes of an error-correcting code, so that the encoding simulates a given noisy quantum channel. We calculate achievable rates of steganographic communication over noiseless quantum channels using this encoding. We give definitions of secrecy and reliability for the communication process, and with these assumptions derive upper bounds on th…
A real-time polarization control system employing two nonorthogonal reference signals multiplexed in either time or wavelength with the data signal is presented. It is shown, theoretically and experimentally, that complete control of multiple polarization states can be attained employing polarization controllers in closed-loop configuration. Experimental results show that negligible added penalties, corresponding to an average added optical Quantum Bit Error Rate of 0.044%, can be achieved with response times smaller than 10 ms, without significant introduction of noise counts in the quantum c…
The preparation of initial superposition states of discrete-time quantum walks (DTQWs) are necessary for the study and applications of DTQWs. In linear optics, it is easy to prepare initial superposition states of the coin, which are always encoded by polarization states; while the preparation of superposition states of the walker is challenging. Based on a novel encoding method, we here propose a DTQW protocol in linear optics which enables the preparation of arbitrary initial superposition states of the walker and the coin. With this protocol, we report an experimental demonstration of DTQW …
The central issue in this article is to transmit a quantum state in such a way that after some decoherence occurs, most of the information can be restored by a suitable decoding operation. For this purpose, we incorporate redundancy by mapping a given initial quantum state to a messenger state on a larger-dimensional Hilbert space via a $C^*$-algebra embedding. Our noise model for the transmission is a phase damping channel which admits a noiseless or decoherence-free subspace or subsystem. More precisely, the transmission channel is obtained from convex combinations of a set of lowest rank ye…
Secure communication protocols are often formulated in a paradigm where the message is encoded in measurement outcomes. In this work we propose a rather unexplored framework in which the message is encoded in measurement settings rather than in their outcomes. In particular, we study two different variants of such secure communication protocols in which the message alphabet corresponds to measurement settings of mutually unbiased bases.
Free-space communication allows one to use spatial mode encoding, which is susceptible to the effects of diffraction and turbulence. Here, we discuss the optimum communication modes of a system while taking such effects into account. We construct a free-space communication system that encodes information onto the plane-wave (PW) modes of light. We study the performance of this system in the presence of atmospheric turbulence, and compare it with previous results for a system employing orbital-angular-momentum (OAM) encoding. We are able to show that the PW basis is the preferred basis set for …
Losses of optical signals scale exponentially with the distance. Quantum repeaters are devices that tackle these losses in quantum communication by splitting the total distance into shorter parts. Today two types of quantum repeaters are subject of research in the field of quantum information: Those that use two-way communication and those that only use one-way communication. Here we explain the details of the performance analysis for repeaters of the second type. Furthermore we compare the two different schemes. Finally we show how the performance analysis generalizes to large-scale quantum n…
We propose a new approach to implement quantum repeaters for long distance quantum communication. Our protocol generates a backbone of encoded Bell pairs and uses the procedure of classical error correction during simultaneous entanglement connection. We illustrate that the repeater protocol with simple Calderbank-Shor-Steane (CSS) encoding can significantly extend the communication distance, while still maintaining a fast key generation rate.
In this article, a procedure called Probabilistic Swapped-Bell-States Analysis (PSBA) is proposed. Using this procedure two communication partners can transmit (binary-encoded) information over large spatial distances. This procedure is unusual insofar as no classical communication channels are used either during or after information encoding. To make this possible, entanglement swapping is used as a transport channel. The encoding of bits is realized by the execution (or non-execution, as the case may be) of entanglement swapping on multiple photon pairs, while decoding is realized by a stati…
We propose an implementation of a quantum walk on a circle on an optomechanical system by encoding the walker on the phase space of a radiation field and the coin on a two-level state of a mechanical resonator. The dynamics of the system is obtained by applying Suzuki-Trotter decomposition. We numerically show that the system displays typical behaviors of quantum walks, namely, the probability distribution evolves ballistically and the standard deviation of the phase distribution is linearly proportional to the number of steps. We also analyze the effects of decoherence by using the phase damp…
We present a scheme for secure deterministic quantum communication without using entanglement, in a Plug-and-Play fashion. The protocol is completely deterministic, both in the encoding procedure and in the control one, thus doubling the communication rate with respect to other setups; moreover, deterministic nature of transmission, apart from rendering unnecessary bases revelation on the public channel, allows the realization of protocols like `direct communication' and `quantum dialogue'. The encoding exploits the phase degree of freedom of a photon, thus paving the way to an optical fiber i…
We establish the fundamental limit of communication capacity within Gaussian schemes under phase-insensitive Gaussian channels, which employ multimode Gaussian states for encoding and collective Gaussian operations and measurements for decoding. We prove that this Gaussian capacity is additive, i.e., its upper bound occurs with separable encoding and separable receivers so that a single-mode communication suffices to achieve the largest capacity under Gaussian schemes. This rigorously characterizes the gap between the ultimate Holevo capacity and the capacity within Gaussian communication, sho…
The Goldenberg-Vaidman (GV) protocol for quantum key distribution (QKD) uses orthogonal encoding states of a particle. Its security arises because operations accessible to Eve are insufficient to distinguish the two states encoding the secret bit. We propose a two-particle cryptographic protocol for quantum secure direct communication, wherein orthogonal states encode the secret, and security arises from restricting Eve from accessing any two-particle operations. However, there is a non-trivial difference between the two cases. While the encoding states are perfectly indistinguishable in GV, t…
The maximum rates for reliably transmitting classical information over Bosonic multiple-access channels (MACs) are derived when the transmitters are restricted to coherent-state encodings. Inner and outer bounds for the ultimate capacity region of the Bosonic MAC are also presented. It is shown that the sum-rate upper bound is achievable with a coherent-state encoding and that the entire region is asymptotically achievable in the limit of large mean input photon numbers.
The ability of quantum walks to evolve in a superposition of distinct quantum states has been used as a resource in quantum communication protocols. Under certain settings, the $k$-cycle discrete-time quantum walks\,(DTQW) are known to recur to its initial state after every $t_r$ steps. We first present a scheme to optically realize any $k$-cycle DTQW using $J$-plate, orbital angular momentum\,(OAM) sorters, optical switch, and optical delay line. This entangles the polarization and OAM degrees of freedom\,(DoF) of a single photon. Making use of this recurrence phenomena of $k$-cycle DTQW and …
We study the problem of transmitting classical information using quantum Gaussian states on a family of phase-noise channels with a finite decoherence time, such that the phase-reference is lost after $m$ consecutive uses of the transmission line. This problem is relevant for long-distance communication in free space and optical fiber, where phase noise is typically considered as a limiting factor. The Holevo capacity of these channels is always attained with photon-number encodings, challenging with current technology. Hence for coherent-state encodings the optimal rate depends only on the to…
We analyze the capacity of a simultaneous quantum secure direct communication scheme between the central party and other $M$ parties via $M+1$-particle GHZ states and swapping quantum entanglement. It is shown that the encoding scheme should be secret if other $M$ parties wants to transmit $M+1$ bit classical messages to the center party secretly. However when the encoding scheme is announced publicly, we prove that the capacity of the scheme in transmitting the secret messages is 2 bits, no matter how big $M$ is.
Efficient and faithful implementation of quantum information tasks, e.g., quantum computing, quantum communication and quantum metrology, requires robust and state-independent decoherence-suppressing measures to protect quantum information carriers. Here we present an experimental demonstration of a robust distribution scheme in which one photon of an entangled photon pair is successfully encoded into and decoded from a decoherence-free subspace (DFS) by a state-independent scheme. We achieved a high-fidelity distribution of the entangled state over fibre communication channel, and also demons…
The continuous-time quantum walk is a particle evolving by Schrödinger's equation in discrete space. Encoding the space as a graph of vertices and edges, the Hamiltonian is proportional to the discrete Laplacian. In some physical systems, however, the Hamiltonian is proportional to the adjacency matrix instead. It is well-known that these quantum walks are equivalent when the graph is regular, i.e., when each vertex has the same number of neighbors. If the graph is irregular, however, the quantum walks evolve differently. In this paper, we show that for some irregular graphs, if the particle i…
Encoding and decoding quantum information in a multipartite quantum system are indispensable for quantum error correction and also play crucial roles in multiparty tasks in distributed quantum information processing such as quantum secret sharing. To quantitatively characterize nonlocal properties of multipartite quantum transformations for encoding and decoding, we analyze entanglement costs of encoding and decoding quantum information in a multipartite quantum system distributed among spatially separated parties connected by a network. This analysis generalizes previous studies of entangleme…
We propose a scheme for encoding logical qubits in a subspace protected against collective rotations around the propagation axis using the polarization and transverse spatial degrees of freedom of single photons. This encoding allows for quantum key distribution without the need of a shared reference frame. We present methods to generate entangled states of two logical qubits using present day down-conversion sources and linear optics, and show that the application of these entangled logical states to quantum information schemes allows for alignment-free tests of Bell's inequalities, quantum d…
In quantum communications, quantum states are employed for the transmission of information between remote parties. This usually requires sharing knowledge of the measurement bases through a classical public channel in the sifting phase of the protocol. Here, we demonstrate a quantum communication scheme where the information on the bases is shared "non-classically", by encoding this information in the same photons used for carrying the data. This enhanced capability is achieved by exploiting the localization of the photonic wave function, observed when the photons are prepared and measured in …
A new concept of a free-space, high-speed (Gbps) optical communication system based on spectral encoding of radiation from a broadband pulsed laser is developed. It is shown that, in combination with the use of partially coherent laser beams and a relatively slow photosensor, scintillations can be suppressed by orders of magnitude for distances of more than 10 km. We also consider the spectral encoding of radiation from a LED as a gigabit rate solution of the "last mile" problem and rapid-deployment systems for disaster recovery.
The evolution of a many-particle system on a one-dimensional lattice, subjected to a quantum walk can cause spatial entanglement in the lattice position, which can be exploited for quantum information/communication purposes. We demonstrate the evolution of spatial entanglement and its dependence on the quantum coin operation parameters, the number of particles present in the lattice and the number of steps of quantum walk on the system. Thus, spatial entanglement can be controlled and optimized using a many-particle discrete-time quantum walk.
We propose efficient-phase-encoding protocols for continuous-variable quantum key distribution using coherent states and postselection. By these phase encodings, the probability of basis mismatch is reduced and total efficiency is increased. We also propose mixed-state protocols by omitting a part of classical communication steps in the efficient-phase-encoding protocols. The omission implies a reduction of information to an eavesdropper and possibly enhances the security of the protocols. We investigate the security of the protocols against individual beam splitting attack.
We describe an experimental implementation of a free-space 11-dimensional communication system using orbital angular momentum (OAM) modes. This system has a maximum measured OAM channel capacity of 2.12 bits/photon. The effects of Kolmogorov thin-phase turbulence on the OAM channel capacity are quantified. We find that increasing the turbulence leads to a degradation of the channel capacity. We are able to mitigate the effects of turbulence by increasing the spacing between detected OAM modes. This study has implications for high-dimensional quantum key distribution (QKD) systems. We describe …
A deterministic direct quantum communication protocol by using swapping quantum entanglement and local unitary operations is proposed in this paper. A set of ordered EPR pairs in one of the four Bell states is used. For each pair, each of the two legitimate users owns a photon of the entangled pair via quantum channel. The pairs are divided into two types of group, i.e., the checking groups and the encoding-decoding groups. In the checking groups, taking advantage of the swapping quantum entanglement and Alice's (the message sender's) public announcement, the eavesdropping can be detected prov…
The problem of sharing entanglement over large distances is crucial for implementations of quantum cryptography. A possible scheme for long-distance entanglement sharing and quantum communication exploits networks whose nodes share Einstein-Podolsky-Rosen (EPR) pairs. In Perseguers et al. [Phys. Rev. A 78, 062324 (2008)] the authors put forward an important isomorphism between storing quantum information in a dimension $D$ and transmission of quantum information in a $D+1$-dimensional network. We show that it is possible to obtain long-distance entanglement in a noisy two-dimensional (2D) netw…
We introduce a new quantum communication protocol for the transmission of quantum information under collective noise. Our protocol utilizes a decoherence-free subspace in such a way that an optimal asymptotic transmission rate is achieved, while at the same time encoding and decoding operations can be efficiently implemented. The encoding and decoding circuit requires a number of elementary gates that scale linearly with the number of transmitted qudits, m. The logical depth of our encoding and decoding operations is constant and depends only on the channel in question. For channels described …
Underwater quantum key distribution (QKD) has potential applications in absolutely secure underwater communication. However, the performance of underwater QKD is limited by the optical elements, background light, and dark counts of the detector. In this paper, we propose a modified formula for the quantum bit error rate (QBER), which takes into account the effect of detector efficiency on the QBER caused by the background light. Then we calculate the QBER of the polarization encoding BB84 protocol in Jerlov type seawater by analyzing the effect of the background light and optical components in…
We investigate the use of noisy entanglement as a resource in classical communication via a quantum channel. In particular, we are interested in the question whether for any entangled state, including bound entangled states, there exists a quantum channel the classical capacity of which can be increased by providing the state as an additional resource. We partially answer this question by showing, for any entangled state, the existence of a quantum memory channel the feedback-assisted classical capacity with product encodings of which can be increased by using the state as a resource. Using a …
