Research

Open AccessArticle

Nontraditional Deterministic Remote State Preparation Using a Non-Maximally Entangled Channel without Additional Quantum Resources

by

,

,

and

Entropy 2023, 25(5), 768; https://doi.org/10.3390/e25050768 - 08 May 2023

Viewed by 529

Abstract

In this paper, we have reinvestigated probabilistic quantum communication protocols and developed a nontraditional remote state preparation protocol that allows for deterministically transferring information encoded in quantum states using a non-maximally entangled channel. With an auxiliary particle and a simple measurement method, the [...] Read more.

In this paper, we have reinvestigated probabilistic quantum communication protocols and developed a nontraditional remote state preparation protocol that allows for deterministically transferring information encoded in quantum states using a non-maximally entangled channel. With an auxiliary particle and a simple measurement method, the success probability of preparing a d-dimensional quantum state is increased to 1 without spending additional quantum resources in advance to improve quantum channels, such as entanglement purification. Furthermore, we have designed a feasible experimental scheme to demonstrate the deterministic paradigm of transporting a polarization-encoded photon from one location to another using a generalized entangled state. This approach provides a practical method to address decoherence and environmental noises in actual quantum communication. Full article

(This article belongs to the Special Issue New Advances in Quantum Communication and Networks)

► Show Figures

Figure 1

Open AccessArticle

A Semi-Quantum Secret-Sharing Protocol with a High Channel Capacity

by

,

,

,

,

and

Entropy 2023, 25(5), 742; https://doi.org/10.3390/e25050742 - 30 Apr 2023

Viewed by 693

Abstract

Semi-quantum cryptography communication stipulates that the quantum user has complete quantum capabilities, and the classical user has limited quantum capabilities, only being able to perform the following operations: (1) measuring and preparing qubits with a Z basis and (2) returning qubits without any [...] Read more.

Semi-quantum cryptography communication stipulates that the quantum user has complete quantum capabilities, and the classical user has limited quantum capabilities, only being able to perform the following operations: (1) measuring and preparing qubits with a Z basis and (2) returning qubits without any processing. Secret sharing requires participants to work together to obtain complete secret information, which ensures the security of the secret information. In the semi-quantum secret sharing (SQSS) protocol, the quantum user Alice divides the secret information into two parts and gives them to two classical participants. Only when they cooperate can they obtain Alice’s original secret information. The quantum states with multiple degrees of freedom (DoFs) are defined as hyper-entangled states. Based on the hyper-entangled single-photon states, an efficient SQSS protocol is proposed. The security analysis proves that the protocol can effectively resist well-known attacks. Compared with the existing protocols, this protocol uses hyper-entangled states to expand the channel capacity. The transmission efficiency is 100% higher than that of single-degree-of-freedom (DoF) single-photon states, providing an innovative scheme for the design of the SQSS protocol in quantum communication networks. This research also provides a theoretical basis for the practical application of semi-quantum cryptography communication. Full article

(This article belongs to the Special Issue New Advances in Quantum Communication and Networks)

Open AccessArticle

Entanglement Purification for Logic-Qubit of Photon System Based on Parity Check Measurement Gate

by

,

,

,

and

Entropy 2023, 25(5), 705; https://doi.org/10.3390/e25050705 - 24 Apr 2023

Viewed by 545

Abstract

It has been found that logic-qubit entanglement has great potential for applications in quantum communication and quantum networks in recent years. However, along with the effects of noise and decoherence, the fidelity of the communication transmission can be greatly reduced. In this paper, [...] Read more.

It has been found that logic-qubit entanglement has great potential for applications in quantum communication and quantum networks in recent years. However, along with the effects of noise and decoherence, the fidelity of the communication transmission can be greatly reduced. In this paper, we investigate the entanglement purification of logic bit-flip error and phase-flip error in polarization logic-qubit entanglement based on the parity-check measurement (PCM) gate, which is constructed by the cross-Kerr nonlinearity and used to distinguish the parity information of two-photon polarization states. The probability of entanglement purification is higher than the scheme using the linear optical method. Moreover, the quality of logic-qubit entangled states can be improved by a cyclic purification process. This entanglement purification protocol will be useful in the future when faced with long-distance communication with logic-qubit entanglement states. Full article

(This article belongs to the Special Issue New Advances in Quantum Communication and Networks)

► Show Figures

Figure 1

Open AccessArticle

Quantum Error-Correcting Codes Based on Orthogonal Arrays

by

,

,

and

Entropy 2023, 25(4), 680; https://doi.org/10.3390/e25040680 - 19 Apr 2023

Viewed by 1923

Abstract

In this paper, by using the Hamming distance, we establish a relation between quantum error-correcting codes

{((N, K, d + 1))}_{s}

and orthogonal arrays with orthogonal partitions. Therefore, this is a generalization of the relation between [...] Read more.

In this paper, by using the Hamming distance, we establish a relation between quantum error-correcting codes

{((N, K, d + 1))}_{s}

and orthogonal arrays with orthogonal partitions. Therefore, this is a generalization of the relation between quantum error-correcting codes

{((N, 1, d + 1))}_{s}

and irredundant orthogonal arrays. This relation is used for the construction of pure quantum error-correcting codes. As applications of this method, numerous infinite families of optimal quantum codes can be constructed explicitly such as

{((3, s, 2))}_{s}

for all

s_{i} \geq 3

,

{((4, s^{2}, 2))}_{s}

for all

s_{i} \geq 5

,

{((5, s, 3))}_{s}

for all

s_{i} \geq 4

,

{((6, s^{2}, 3))}_{s}

for all

s_{i} \geq 5

,

{((7, s^{3}, 3))}_{s}

for all

s_{i} \geq 7

,

{((8, s^{2}, 4))}_{s}

for all

s_{i} \geq 9

,

{((9, s^{3}, 4))}_{s}

for all

s_{i} \geq 11

,

{((9, s, 5))}_{s}

for all

s_{i} \geq 9

,

{((10, s^{2}, 5))}_{s}

for all

s_{i} \geq 11

,

{((11, s, 6))}_{s}

for all

s_{i} \geq 11

, and

{((12, s^{2}, 6))}_{s}

for all

s_{i} \geq 13

, where

s = s_{1} \dots s_{n}

and

s_{1}, \dots, s_{n}

are all prime powers. The advantages of our approach over existing methods lie in the facts that these results are not just existence results, but constructive results, the codes constructed are pure, and each basis state of these codes has far less terms. Moreover, the above method developed can be extended to construction of quantum error-correcting codes over mixed alphabets. Full article

(This article belongs to the Special Issue New Advances in Quantum Communication and Networks)

Open AccessArticle

Quantum Secure Multi-Party Summation Using Single Photons

by

Wan-Qing Wu

and

Ming-Zhe Xie

Entropy 2023, 25(4), 590; https://doi.org/10.3390/e25040590 - 30 Mar 2023

Viewed by 432

Abstract

In this paper, we propose a secure multi-party summation based on single photons. With the help of a semi-honest third party, n participants can simultaneously obtain the summation result without revealing their secret inputs. Our protocol uses single photon states as the information [...] Read more.

In this paper, we propose a secure multi-party summation based on single photons. With the help of a semi-honest third party, n participants can simultaneously obtain the summation result without revealing their secret inputs. Our protocol uses single photon states as the information carriers. In addition, each participant with secret input only performs simple single-particle operators rather than particle preparation and any complex quantum measurements. These features make our protocol more feasible to implement. We demonstrate the correctness and security of the proposed protocol, which is resistant to participant attack and outside attack. In the end, we compare in detail the performance of the quantum summation protocol in this paper with other schemes in terms of different indicators. By comparison, our protocol is efficient and easy to implement. Full article

(This article belongs to the Special Issue New Advances in Quantum Communication and Networks)

► Show Figures

Figure 1

Open AccessArticle

A New Quantum Private Protocol for Set Intersection Cardinality Based on a Quantum Homomorphic Encryption Scheme for Toffoli Gate

by

,

,

and

Entropy 2023, 25(3), 516; https://doi.org/10.3390/e25030516 - 16 Mar 2023

Viewed by 542

Abstract

Set Intersection Cardinality (SI-CA) computes the intersection cardinality of two parties’ sets, which has many important and practical applications such as data mining and data analysis. However, in the face of big data sets, it is difficult for two parties to execute the [...] Read more.

Set Intersection Cardinality (SI-CA) computes the intersection cardinality of two parties’ sets, which has many important and practical applications such as data mining and data analysis. However, in the face of big data sets, it is difficult for two parties to execute the SI-CA protocol repeatedly. In order to reduce the execution pressure, a Private Set Intersection Cardinality (PSI-CA) protocol based on a quantum homomorphic encryption scheme for the Toffoli gate is proposed. Two parties encode their private sets into two quantum sequences and encrypt their sequences by way of a quantum homomorphic encryption scheme. After receiving the encrypted results, the semi-honest third party (TP) can determine the equality of two quantum sequences with the Toffoli gate and decrypted keys. The simulation of the quantum homomorphic encryption scheme for the Toffoli gate on two quantum bits is given by the IBM Quantum Experience platform. The simulation results show that the scheme can also realize the corresponding function on two quantum sequences. Full article

(This article belongs to the Special Issue New Advances in Quantum Communication and Networks)

► Show Figures

Figure 1

Open AccessArticle

Two Types of Trilocality of Probability and Correlation Tensors

by

,

,

and

Entropy 2023, 25(2), 273; https://doi.org/10.3390/e25020273 - 01 Feb 2023

Cited by 1 | Viewed by 483

Abstract

In this work, we discuss two types of trilocality of probability tensors (PTs)

P = 〚 P (a_{1} a_{2} a_{3}) 〛

over an outcome set

Ω_{3}

and correlation tensors (CTs) [...] Read more.

In this work, we discuss two types of trilocality of probability tensors (PTs)

P = 〚 P (a_{1} a_{2} a_{3}) 〛

over an outcome set

Ω_{3}

and correlation tensors (CTs)

P = 〚 P (a_{1} a_{2} a_{3} | x_{1} x_{2} x_{3}) 〛

over an outcome-input set

Δ_{3}

based on a triangle network and described by continuous (integral) and discrete (sum) trilocal hidden variable models (C-triLHVMs and D-triLHVMs). We say that a PT (or CT)

P

is C-trilocal (resp. D-trilocal) if it can be described by a C-triLHVM (resp. D-triLHVM). It is proved that a PT (resp. CT) is D-trilocal if and only if it can be realized in a triangle network by three shared separable states and a local POVM (resp. a set of local POVMs) performed at each node; a CT is C-trilocal (resp. D-trilocal) if and only if it can be written as a convex combination of the product deterministic CTs with a C-trilocal (resp. D-trilocal) PT as a coefficient tensor. Some properties of the sets consisting of C-trilocal and D-trilocal PTs (resp. C-trilocal and D-trilocal CTs) are proved, including their path-connectedness and partial star-convexity. Full article

(This article belongs to the Special Issue New Advances in Quantum Communication and Networks)

► Show Figures

Figure 1

Open AccessArticle

Dynamics of Quantum Networks in Noisy Environments

by

,

,

and

Entropy 2023, 25(1), 157; https://doi.org/10.3390/e25010157 - 12 Jan 2023

Viewed by 690

Abstract

Noise exists inherently in realistic quantum systems and affects the evolution of quantum systems. We investigate the dynamics of quantum networks in noisy environments by using the fidelity of the quantum evolved states and the classical percolation theory. We propose an analytical framework [...] Read more.

Noise exists inherently in realistic quantum systems and affects the evolution of quantum systems. We investigate the dynamics of quantum networks in noisy environments by using the fidelity of the quantum evolved states and the classical percolation theory. We propose an analytical framework that allows us to characterize the stability of quantum networks in terms of quantum noises and network topologies. The calculation results of the framework determine the maximal time that quantum networks with different network topologies can maintain the ability to communicate under noise. We demonstrate the results of the framework through examples of specific graphs under amplitude damping and phase damping noises. We further consider the capacity of the quantum network in a noisy environment according to the proposed framework. The analytical framework helps us better understand the evolution time of a quantum network and provides a reference for designing large quantum networks. Full article

(This article belongs to the Special Issue New Advances in Quantum Communication and Networks)

► Show Figures

Figure 1

Open AccessFeature PaperArticle

The QQUIC Transport Protocol: Quantum-Assisted UDP Internet Connections

by

Peng Yan

and

Nengkun Yu

Entropy 2022, 24(10), 1488; https://doi.org/10.3390/e24101488 - 18 Oct 2022

Cited by 1 | Viewed by 900

Abstract

Quantum key distribution, initialized in 1984, is a commercialized secure communication method that enables two parties to produce a shared random secret key using quantum mechanics. We propose a QQUIC (Quantum-assisted Quick UDP Internet Connections) transport protocol, which modifies the well-known QUIC transport [...] Read more.

Quantum key distribution, initialized in 1984, is a commercialized secure communication method that enables two parties to produce a shared random secret key using quantum mechanics. We propose a QQUIC (Quantum-assisted Quick UDP Internet Connections) transport protocol, which modifies the well-known QUIC transport protocol by employing quantum key distribution instead of the original classical algorithms in the key exchange stage. Due to the provable security of quantum key distribution, the security of the QQUIC key does not depend on computational assumptions. It is possible that, surprisingly, QQUIC can reduce network latency in some circumstances even compared with QUIC. To achieve this, the attached quantum connections are used as the dedicated lines for key generation. Full article

(This article belongs to the Special Issue New Advances in Quantum Communication and Networks)

► Show Figures

Figure 1

Journal Menu

Journal Browser

Special Issue "New Advances in Quantum Communication and Networks"

Share This Special Issue

Special Issue Editor

Special Issue Information

Keywords

Published Papers (9 papers)

Research

Further Information

Guidelines

MDPI Initiatives

Follow MDPI