Very recently, Lee et al. proposed the first secure quantum teleporation protocol, where quantum information shared by an arbitrary number of senders can be transferred to another arbitrary number of receivers. Here, by introducing quantum walks, a novel secure (n,m) quantum teleportation of shared quantum secret between n senders and $m$ receivers is presented. Firstly, two kinds of (n,2) teleportation schemes are proposed by n-walker quantum walks on the line, the first walker of which is driven by three coins, respectively, based on two kinds of coin operators: the homogeneous coins and the position-dependent coins. Secondly, by increasing the amount of the coins of the first walker to m+1, the previous (n,2) scheme can be generalized to (n,m) teleportation scheme. Then, we give the proof of the information security of our proposed scheme, in which neither any single nor subparties of senders and receivers can fully access the secret quantum information. Moreover, the projective measurements are needed, instead of the joint Bell measurements that are necessary in Lee et al.'s protocol. Our work can also be extended further to QWs on the cycle. This work provides an additional relevant instance of the richness of quantum walks for quantum information processing tasks and thus opens the wider application purpose of quantum walks.
We present two optimal methods of teleporting an unknown qubit using any pure entangled state. We also discuss how such methods can also have succesful application in quantum secret sharing with pure multipartite entangled states.
We show how an arbitrary qubit rotation can be teleported, albeit probabilistically, using 1 e-bit of entanglement and one classical bit. We use this to present a scheme for implementing quantum secret sharing. The scheme operates essentially by sending a "secret" rotated qubit of information to several users, who need to cooperate in order to recover the original qubit.
A novel scheme for secure direct communication between Alice and Bob is proposed, where there is no need for establishing a shared secret key. The communication is based on Einstein-Podolsky-Rosen pairs and teleportation between Alice and Bob. After insuring the security of the quantum channel (EPR pairs), Bob encodes the secret message directly on a sequence of particle states and transmits them to Alice by teleportation. In this scheme teleportation transmits Bob's message without revealing any information to a potential eavesdropper. Alice can read out the encoded messages directly by the m…
Quantum teleportation allows to transfer unknown quantum states between distant parties. It is not only a primitive of quantum communications but also an essential task in realization of the quantum networks for promising applications such as quantum cryptography and distributed quantum computation. Despite recent substantial progresses in the realization of quantum communications, teleportation of shared quantum information between multiple senders and receivers is still missing. Here we propose and experimentally demonstrate quantum teleportation among spatially separate parties in a quantum…
We extend the scheme of quantum teleportation by quantum walks introduced by Wang et al. (2017). First, we introduce the mathematical definition of the accomplishment of quantum teleportation by this extended scheme. Secondly, we show a useful necessary and sufficient condition that the quantum teleportation is accomplished rigorously. Our result classifies the parameters of the setting for the accomplishment of the quantum teleportation.
A theoretical scheme for controlled and secure direct communication is proposed. The communication is based on GHZ state and controlled quantum teleportation. After insuring the security of the quantum channel (a set of qubits in the GHZ state), Alice encodes the secret message directly on a sequence of particle states and transmits them to Bob supervised by Charlie using controlled quantum teleportation. Bob can read out the encoded messages directly by the measurement on his qubits. In this scheme, the controlled quantum teleportation transmits Alice's message without revealing any informati…
The goal of teleportation is to transfer the state of one particle to another particle. In coined quantum walks, conditional shift operators can introduce entanglement between position space and coin space. This entanglement resource can be used as a quantum channel for teleportation, as proposed by Wang, Shang and Xue [Quantum Inf. Process. 16, 221 (2017)]. Here, we demonstrate the implementation of quantum teleportation using quantum walks on a five-qubit quantum computer and a 32-qubit simulator provided by IBM quantum experience beta platform. We show the teleportation of single-qubit, two…
We present a controlled quantum teleportation protocol. In the protocol, quantum information of an unknown state of a 2-level particle is faithfully transmitted from a sender (Alice) to a remote receiver (Bob) via an initially shared triplet of entangled particles under the control of the supervisor Charlie. The distributed entangled particles shared by Alice, Bob and Charlie function as a quantum information channel for faithful transmission. We also propose a controlled and secure direct communication scheme by means of this teleportation. After insuring the security of the quantum channel, …
Upper bounds for private communication over quantum channels can be derived by adopting channel simulation, protocol stretching, and relative entropy of entanglement. All these ingredients have led to single-letter upper bounds to the secret key capacity which can be directly computed over suitable resource states. For bosonic Gaussian channels, the tightest upper bounds have been derived by employing teleportation simulation over asymptotic resource states, namely the asymptotic Choi matrices of these channels. In this work, we adopt a different approach. We show that teleporting over an anal…
We investigate a quantum repeater scheme for quantum key distribution based on the work by Muralidharan et al., Phys. Rev. Lett. 112, 250501 (2014). Our scheme extends that work by making use of error syndrome measurement outcomes available at the repeater stations. We show how to calculate the secret key rates for the case of optimizing the syndrome information, while the known key rate is based on a scenario of coarse-graining the syndrome information. We show that these key rates can surpass the Pirandola-Laurenza-Ottaviani-Banchi bound on secret key rates of direct transmission over lossy …
We prove that the teleportation based quantum cryptography protocol presented in [Opt. Commun. 283, 184 (2010)], which is built using only orthogonal states encoding the classical bits that are teleported from Alice to Bob, is asymptotically secure against all types of individual and collective attacks. We then investigate modifications to that protocol leading to greater secret-key rates and to security against coherent attacks. In other words, we show an unconditional secure quantum key distribution protocol that does not need non-orthogonal quantum states to encode the bits of the secret ke…
In this paper, a bidirectional quantum teleportation protocol based on Einstein-Podolsky-Rosen (EPR) pairs and entanglement swapping is proposed. In this scheme, two users can simultaneously transmit an unknown single-qubit state to each other. The implementation of the proposed scheme is easier in experiment as compared to previous work. By utilizing this bidirectional quantum teleportation protocol, a bidirectional quantum secure direct communication scheme without carrying secret message is presented. Therefore, in the case of using perfect quantum channel, the protocol is completely secure…
We propose here a quantum secret sharing scheme that works for both quantum and classical secrets. The proposed scheme is based on both entanglement swapping and teleportation together. It allows sender to encrypt his/her secret and simultaneously distribute decryption information of the encrypted secret among distant parties where decryption shares are nonlocally correlated with each other. Two-fold quantum non-local correlations, generated through entanglement swapping and then teleporting quantum states over swapped maximally entangled pairs, guarantee both authentication and secrecy of the…
Recently, a broadcasting multiple blind signature scheme based on quantum teleportation has been proposed for the first time. It is claimed to have unconditional security and properties of quantum multiple signature and quantum blind signature. In this paper, we analyze the security of the protocol and show that the signatory Ui can learn the signed message m by a single particle measurement and the signed message m can be modified at random by anyone according to the scheme. Furthermore, there are some participant attacks and external attacks existing in the scheme. Finally we present an impr…
We extend the formalism of cluster state quantum secret sharing, as presented in Markham and Sanders [Phys. Rev. A 78, 042309 (2008)] and Keet et al. [Phy. Rev. A 82, 062315 (2010)], to the continuous-variable regime. We show that both classical and quantum information can be shared by distributing continuous-variable cluster states through either public or private channels. We find that the adversary structure is completely denied from the secret if the cluster state is infinitely squeezed, but some secret information would be leaked if a realistic finitely squeezed state is employed. We sugg…
The efficacies of maximally and that of non-maximally entangled mixed states as teleportation channels have been studied. A new class of non-maximally entangled mixed states have been proposed also. Their advantages as quantum teleportation channels over existing non-maximally entangled mixed states have been verified. The mixed states can also be generated using quantum cloning machines. We have also studied how one can utilize the mixed entangled states obtained as output from a state independent quantum cloning machine in teleportation and dense coding. Mixed states can also be used in secr…
We characterize the complete set of protocols that may be used to securely encrypt n quantum bits using secret and random classical bits. In addition to the application of such quantum encryption protocols to quantum data security, our framework allows for generalizations of many classical cryptographic protocols to quantum data. We show that the encrypted state gives no information without the secret classical data, and that 2n random classical bits are the minimum necessary for informationally secure quantum encryption. Moreover, the quantum operations are shown to have a surprising structur…
A protocol for multiparty quantum secret splitting is proposed with an ordered $N$ EPR pairs and Bell state measurements. It is secure and has the high intrinsic efficiency and source capacity as almost all the instances are useful and each EPR pair carries two bits of message securely. Moreover, we modify it for multiparty quantum state sharing of an arbitrary $m$-particle entangled state based on quantum teleportation with only Bell state measurements and local unitary operations which make this protocol more convenient in a practical application than others.
We present a continuous variable (CV) quantum key distribution (QKD) scheme based on the CV quantum teleportation of coherent states that yields a raw secret key made up of discrete variables for both Alice and Bob. This protocol preserves the efficient detection schemes of current CV technology (no single-photon detection techniques) and, at the same time, has efficient error correction and privacy amplification schemes due to the binary modulation of the key. We show that for a certain type of incoherent attack it is secure for almost any value of the transmittance of the optical line used b…
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…
We present a quantum secure direct communication(QSDC) scheme as an extension for a proposed supervised secure entanglement sharing protocol. Starting with a quick review on the supervised entanglement sharing protocol -- the "Wuhan" protocol [Y. Li and Y. Liu, arXiv:0709.1449v2], we primarily focus on its further extend using for a QSDC task, in which the communication attendant Alice encodes the secret message directly onto a sequence of 2-level particles which then can be faithfully teleported to Bob using the shared maximal entanglement states obtained by the previous "Wuhan" protocol. We …
A rational secret sharing scheme is a game in which each party responsible for reconstructing a secret tries to maximize his utility by obtaining the secret alone. Quantum secret sharing schemes, either derived from quantum teleportation or from quantum error correcting code, do not succeed when we assume rational participants. This is because all existing quantum secret sharing schemes consider that the secret is reconstructed by a party chosen by the dealer. In this paper, for the first time, we propose a quantum secret sharing scheme which is resistant to rational parties. The proposed sche…
We study the existence of absolutely maximally entangled (AME) states in quantum mechanics and its applications to quantum information. AME states are characterized by being maximally entangled for all bipartitions of the system and exhibit genuine multipartite entanglement. With such states, we present a novel parallel teleportation protocol which teleports multiple quantum states between groups of senders and receivers. The notable features of this protocol are that (i) the partition into senders and receivers can be chosen after the state has been distributed, and (ii) one group has to perf…
Universal quantum error-correction requires the ability of manipulating entanglement of five or more particles. Although entanglement of three or four particles has been experimentally demonstrated and used to obtain the extreme contradiction between quantum mechanics and local realism, the realization of five-particle entanglement remains an experimental challenge. Meanwhile, a crucial experimental challenge in multi-party quantum communication and computation is the so-called open-destination teleportation. During open-destination teleportation, an unknown quantum state of a single particle …
Recently, an information theoretical model for Quantum Secret Sharing (QSS) schemes was introduced. By using this model, we prove that pure state Quantum Threshold Schemes (QTS) can be constructed from quantum MDS codes and vice versa. In particular, we consider stabilizer codes and give a constructive proof of their relation with QTS. Furthermore, we reformulate the Monotone Span Program (MSP) construction according to the information theoretical model and check the recoverability and secrecy requirement. Finally, we consider QSS schemes which are based on quantum teleportation.
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 two-particle entangled state to a distant receiver, an arbitrary one of the $n+1$ agents via the control of the others in a network. It will be shown that the outcomes in the cases that $n$ is odd or it is even are different in principle as the receiver has to perform a controlled-not operation on his particles for reconstructing the original arbitrary entangled sta…
We present a full experimental characterization of continuous variable quantum communication channels established by shared entanglement together with local operations and classical communication. The resulting teleportation channel was fully characterized by measuring all elements of the covariance matrix of the shared two-mode squeezed Gaussian state. From the experimental data we determined the lower bound to the quantum channel capacity, the teleportation fidelity of coherent states and the logarithmic negativity and the purity of the shared state. Additionally, a positive secret key rate …
Upper bounds on the secret-key-agreement capacity of a quantum channel serve as a way to assess the performance of practical quantum-key-distribution protocols conducted over that channel. In particular, if a protocol employs a quantum repeater, achieving secret-key rates exceeding these upper bounds is a witness to having a working quantum repeater. In this paper, we extend a recent advance [Liuzzo-Scorpo et al., arXiv:1705.03017] in the theory of the teleportation simulation of single-mode phase-insensitive Gaussian channels such that it now applies to the relative entropy of entanglement me…
We propose a protocol for secret sharing, called dual quantum information splitting (DQIS), that reverses the roles of state and channel in standard quantum information splitting. In this method, a secret is shared via teleportation of a fiducial input state over an entangled state that encodes the secret in a graph state basis. By performing a test of violation of a Bell inequality on the encoded state, the legitimate parties determine if the violation is sufficiently high to permit distilling secret bits. Thus, the code space must be maximally and exclusively nonlocal. To this end, we propos…
This paper defines the amortized entanglement of a quantum channel as the largest difference in entanglement between the output and the input of the channel, where entanglement is quantified by an arbitrary entanglement measure. We prove that the amortized entanglement of a channel obeys several desirable properties, and we also consider special cases such as the amortized relative entropy of entanglement and the amortized Rains relative entropy. These latter quantities are shown to be single-letter upper bounds on the secret-key-agreement and PPT-assisted quantum capacities of a quantum chann…
We demonstrate that quantum information processing (QIP) completely rests on quantum Fourier transform (QFT), and 190 years after his death, the work of Jean-Baptiste Joseph Fourier is more present than ever in Physics, constituting the heart of QIP, and showing the spectral nature of quantum entanglement, quantum teleportation, and quantum secret sharing.
Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an ordered sequence of graphs governs free evolution of the quantum walk. We then consider how perfect state transfer during the quantum walk can be used to design dynamic graphs that implement a universal set of quantum logic gates. We give explicit examples for a complete logical basis, and we validate implementations using numerical simulations for quantum telep…
We introduce the distribution of a secret multipartite entangled state in a real-world scenario as a quantum primitive. We show that in the presence of noisy quantum channels (and noisy control operations) any state chosen from the set of two-colorable graph states (CSS codewords) can be created with high fidelity while it remains unknown to all parties. This is accomplished by either blind multipartite entanglement purification, which we introduce in this paper, or by multipartite entanglement purification of enlarged states, which offers advantages over an alternative scheme based on standar…
We show that quantum entanglement has a very close classical analogue, namely secret classical correlations. The fundamental analogy stems from the behavior of quantum entanglement under local operations and classical communication and the behavior of secret correlations under local operations and public communication. A large number of derived analogies follow. In particular teleportation is analogous to the one-time-pad, the concept of ``pure state'' exists in the classical domain, entanglement concentration and dilution are essentially classical secrecy protocols, and single copy entangleme…
We present a scheme for asymmetric quantum information splitting, where a sender distributes asymmetrically a qubit to distant agents in a network. The asymmetric distribution leads to that the agents have different powers to reconstruct the sender's qubit. In other words, the authorities of the agents for getting the quantum secret are hierarchized. The scheme does not need the agents to get together and make nonlocal operations. Our scheme can also be modified to implement controlled teleportation against uncooperation of part of supervisors.
We propose a protocol for multipartite secret sharing of quantum information through an \textit{amplitude damping} quantum channel. This network is, for example, of two organizations communicating with their own employees connected via classical channels locally. We consider a GHZ state distributed among four members in an asymmetric fashion where the members of a sub-party collaborate to decode the received information at their end. The target is to send two bits of information in \textit{one execution} of the protocol. Firstly, we consider an ideal channel and observe that our protocol enabl…
Intrinsic entanglement (IE) is a quantity which aims at quantifying bipartite entanglement carried by a quantum state as an optimal amount of the intrinsic information that can be extracted from the state by measurement. We investigate in detail the properties of a Gaussian version of IE, the so-called Gaussian intrinsic entanglement (GIE). We show explicitly how GIE simplifies to the mutual information of a distribution of outcomes of measurements on a conditional state obtained by a measurement on a purifying subsystem of the analyzed state, which is first minimized over all measurements on …
Generation of entangled state is of paramount importance both from quantum theoretical foundation and technology applications. Entanglement swapping provides an efficient method to generate entanglement in quantum communication protocols. However, perfect Bell measurements for qudits, the key to entanglement swapping, have been proven impossible to achieve by using only linear elements and particle detectors. To avoid this bottleneck, we propose a novel scheme to generate entangled state including two-qubit entangled state, two-qudit entangled state, three-qubit GHZ state and three-qudit GHZ s…
We begin this thesis by expanding the technique of teleportation simulation, which adds noise to the entangled resource state to mimic channel effects. By introducing classical noise in the communication step, we show it is possible to simulate more than just Pauli channels using teleportation. This new class is characterised, and studied in detail for a particular resource state, leading to a family of simulable channels named "Pauli-Damping channels" whose properties are analysed. Also introduced are a new family of quantum states, "phase Werner" states, whose entanglement properties relate …
We report the first experimental generation and characterization of a six-photon Dicke state. The produced state shows a fidelity of F=0.56+/-0.02 with respect to an ideal Dicke state and violates a witness detecting genuine six-qubit entanglement by four standard deviations. We confirm characteristic Dicke properties of our resource and demonstrate its versatility by projecting out four- and five-photon Dicke states, as well as four-photon GHZ and W states. We also show that Dicke states have interesting applications in multiparty quantum networking protocols such as open-destination teleport…
We report the first experimental realization of perfect W-state in a superconducting qubit based system. In contrast to maximally entangled state, the perfect W state is different in weights and phases of the terms contained in the maximally entangled W-state. The prefect W state finds important applications in quantum information processing tasks such as perfect teleportation, superdense coding, secret sharing etc. The efficiency of generation is quantified by fidelity which is calculated by performing full quantum state tomography. To verify the presence of genuine nonlocality in the generat…
Recently, position-based quantum cryptography has been claimed to be unconditionally secure. In contrary, here we show that the existing proposals for position-based quantum cryptography are, in fact, insecure if entanglement is shared among two adversaries. Specifically, we demonstrate how the adversaries can incorporate ideas of quantum teleportation and quantum secret sharing to compromise the security with certainty. The common flaw to all current protocols is that the Pauli operators always map a codeword to a codeword (up to an irrelevant overall phase). We propose a modified scheme lack…
Using a technique based on quantum teleportation, we simplify the most general adaptive protocols for key distribution, entanglement distillation and quantum communication over a wide class of quantum channels in arbitrary dimension. Thanks to this method, we bound the ultimate rates for secret key generation and quantum communication through single-mode Gaussian channels and several discrete-variable channels. In particular, we derive exact formulas for the two-way assisted capacities of the bosonic quantum-limited amplifier and the dephasing channel in arbitrary dimension, as well as the sec…
We consider the distribution of secret keys, both in a bipartite and a multipartite (conference) setting, via a quantum network and establish a framework to obtain bounds on the achievable rates. We show that any multipartite private state--the output of a protocol distilling secret key among the trusted parties--has to be genuinely multipartite entangled. In order to describe general network settings, we introduce a multiplex quantum channel, which links an arbitrary number of parties, where each party can take the role of sender only, receiver only, or both sender and receiver. We define asy…
The homodyne detection is one of the most basic tools for identifying the quantum state of light. It has been used to detect useful non-local properties, such as entanglement for the quantum teleportation and distillability of a secret key in quantum key distribution. In so doing, the detection scheme employs a bright optical pulse, called the local oscillator (LO) pulse, and the LO pulse is usually transmitted along with the signal pulses. The LO pulse is presumed to be a coherent state with an infinite intensity. However, it is difficult in practice to hold this presumption owing to noise in…
The main contribution of this paper is the introduction of a dynamic logic formalism for reasoning about information flow in composite quantum systems. This builds on our previous work on a complete quantum dynamic logic for single systems. Here we extend that work to a sound (but not necessarily complete) logic for composite systems, which brings together ideas from the quantum logic tradition with concepts from (dynamic) modal logic and from quantum computation. This Logic of Quantum Programs (LQP) is capable of expressing important features of quantum measurements and unitary evolutions of …
Bosonic channels are important in practice as they form a simple model for free-space or fiber-optic communication. Here we consider a single-sender two-receiver pure-loss bosonic broadcast channel and determine the unconstrained capacity region for the distillation of bipartite entanglement and secret key between the sender and each receiver, whenever they are allowed arbitrary public classical communication. We show how the state merging protocol leads to achievable rates in this setting, giving an inner bound on the capacity region. We also evaluate an outer bound on the region by using the…
This paper demonstrates and proves that the coordination of actions in a distributed swarm can be enhanced by using quantum entanglement. In particular, we focus on - Global and local simultaneous random walks, using entangled qubits that collapse into the same (or opposite) direction, either random direction or totally controlled simultaneous movements. - Identifying eavesdropping from malicious eavesdroppers aimed at disturbing the simultaneous random walks by using entangled qubits that were sent at random or with predefined bases. - Identifying Byzantine robots or malicious robots that are…
Quantum entanglement is widely recognized as one of the key resources for the advantages of quantum information processing, including universal quantum computation, reduction of communication complexity or secret key distribution. However, computational models have been discovered, which consume very little or no entanglement and still can efficiently solve certain problems thought to be classically intractable. The existence of these models suggests that separable or weakly entangled states could be extremely useful tools for quantum information processing as they are much easier to prepare a…
