Related papers: Multi-user QKD using quotient graph states derived…
The possibility of using squeezed states in the recently suggested unidimensional continuous-variable quantum key distribution based on a single quadrature modulation is addressed. It is shown that squeezing of the signal states expands the…
Quantum key distribution(QKD) allows two remote parties to share information-theoretic secret keys. Many QKD protocols assume the phase of encoding state can be continuous randomized from 0 to 2 pi, which, however, may be questionable in…
Quantum key distribution (QKD) protocols most often use two conjugate bases in order to verify the security of the quantum channel. In the majority of protocols, these bases are mutually unbiased to one another, which is to say they are…
We propose a quantum key distribution (QKD) protocol that enables three parties agree at once on a shared common random bit string in presence of an eavesdropper without use of entanglement. We prove its unconditional security and analyze…
Graph states are a family of stabilizer states which can be tailored towards various applications in photonic quantum computing and quantum communication. In this paper, we present a modular design based on quantum dot emitters coupled to a…
Cluster states are an essential component in one-way quantum computation protocols. We present two schemes to generate addressable continuous-variable cluster states from quadrature squeezed cylindrically polarized modes. By including…
We construct multipartite graph states whose dimension is the power of a prime number. This is realized by the finite field, as well as the generalized controlled-NOT quantum circuit acting on two qudits. We propose the standard form of…
The preparation of multipartite entangled states is the prerequisite for exploring quantum information networks and quantum computation. In this letter, we present the first experimental demonstration of eight-partite spatially separated CV…
Quantum key distribution (QKD) allows for secure communications safe against attacks by quantum computers. QKD protocols are performed by sending a sizeable, but finite, number of quantum signals between the distant parties involved. Many…
Quantum entanglement plays an irreplaceable role in various remote quantum information processing tasks. Here we present protocols for generating deterministic and heralded $N$-qubit entangled states across multiple network nodes. By…
We propose a high-efficiency three-party quantum key agreement protocol, by utilizing two-photon polarization-entangled Bell states and a few single-photon polarization states as the information carriers, and we use the quantum dense coding…
Quantum networks scale the advantages of quantum communication protocols to more than just two distant users. Here we present a fully connected quantum network architecture in which a single entangled photon source distributes quantum…
We propose several methods for quantum key distribution (QKD) based upon the generation and transmission of random distributions of coherent or squeezed states, and we show that they are are secure against individual eavesdropping attacks.…
Quantum key distribution (QKD) based on coherent states is well known for its implementation simplicity, but it suffers from loss-dependent attacks based on optimal unambiguous state discrimination. Crucially, previous research has…
Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a…
Quantum key distribution (QKD) is the most explored application of quantum information theory. A central problem in entanglement-based QKD (EB-QKD), is whether every entangled state can be used to extract a key. We observe that entanglement…
In this paper, numerical simulations of four-mode continuous-variable cluster states with different topologies in the framework of measurement-based quantum computation are presented. By utilizing the symplectic representation and…
An entangled state is said to be $m$-uniform if the reduced density matrix of any $m$ qubits is maximally mixed. This is intimately linked to pure quantum error correction codes (QECCs), which allow not only to correct errors, but also to…
We propose a method for constructing multi-qubit entangled quantum states representing weighted tripartite graphs. An expression for the entanglement distance for multi-qubit states corresponding to arbitrary tripartite graph structures is…
Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…