arXiv subjects

Chong-Qiang Ye

Publications and source records attributed to Chong-Qiang Ye.

13 recordsLinked to original sources

arXiv2025

A Quantum Walk-Enabled Blockchain with Weighted Quantum Voting Consensus

Quantum blockchains provide inherent resilience against quantum adversaries and represent a promising alternative to classical blockchain systems in the quantum era. However, existing quantum blockchain architectures largely depend on entanglement to maintain inter-block connections, facing challenges in stability, consensus efficiency, and system verification. To address these issues, this work proposes a novel quantum blockchain framework based on quantum walks, which reduces reliance on entanglement while improving stability and connection efficiency. We further propose a quantum consensus mechanism based on a weighted quantum voting protocol, which enables a fairer voting process while reflecting the weights of different nodes. To validate the proposed framework, we conduct circuit simulations to evaluate the correctness and effectiveness of both the quantum walk-based block construction and the quantum voting consensus mechanism. Compared with existing entanglement-dependent approaches, our framework achieves stronger stability and enables simpler verification of block integrity, making it a practical candidate for quantum-era blockchain applications.

quant-ph↗

arXiv2024

Quantum Scheme for Private Set Intersection and Union Cardinality based on Quantum Homomorphic Encryption

Private set intersection (PSI) and private set union (PSU) are the crucial primitives in secure multiparty computation protocols, which enable several participants to jointly compute the intersection and union of their private sets without revealing any additional information. Quantum homomorphic encryption (QHE) offers significant advantages in handling privacy-preserving computations. However, given the current limitations of quantum resources, developing efficient and feasible QHE-based protocols for PSI and PSU computations remains a critical challenge. In this work, a novel quantum private set intersection and union cardinality protocol is proposed, accompanied by the corresponding quantum circuits. Based on quantum homomorphic encryption, the protocol allows the intersection and union cardinality of users' private sets to be computed on quantum-encrypted data with the assistance of a semi-honest third party. By operating on encrypted quantum states, it effectively mitigates the risk of original information leakage. Furthermore, the protocol requires only simple Pauli and CNOT operations, avoiding the use of complex quantum manipulations (e.g., $T$ gate and phase rotation gate). Compared to related protocols, this approach offers advantages in feasibility and privacy protection.

quant-ph↗

arXiv2024

Multi-party Semi-quantum Secret Sharing Protocol based on Measure-flip and Reflect Operations

Semi-quantum secret sharing (SQSS) protocols serve as fundamental frameworks in quantum secure multi-party computations, offering the advantage of not requiring all users to possess intricate quantum devices. However, the current landscape of SQSS protocols predominantly caters to bipartite scenarios, rendering them inadequate for practical multi-party secret sharing requirements. Addressing this gap, this paper proposes a novel SQSS protocol based on multi-particle GHZ states. In this protocol, the quantum user distributes predetermined secret information to multiple classical users with limited quantum capabilities, necessitating collaborative efforts among all classical users to reconstruct the correct secret information. By utilizing measure-flip and reflect operations, the transmitted multi-particle GHZ states can all contribute keys, thereby improving the utilization of transmitted particles. Security analysis shows that the protocol's resilience against prevalent external and internal threats. Additionally, employing IBM Qiskit, we conduct quantum circuit simulations to validate the protocol's accuracy and feasibility. Compared with similar studies, the proposed protocol has advantages in terms of protocol scalability, qubit efficiency, and shared message types.

quant-ph↗

arXiv2023

A Feasible Semi-quantum Private Comparison Based on Entanglement Swapping of Bell States

Semi-quantum private comparison (SQPC) enables two classical users with limited quantum capabilities to compare confidential information using a semi-honest third party (TP) with full quantum power. However, entanglement swapping, as an important property of quantum mechanics in previously proposed SQPC protocols is usually neglected. In this paper, we propose a feasible SQPC protocol based on the entanglement swapping of Bell states, where two classical users do not require additional implementation of the semi-quantum key distribution protocol to ensure the security of their private data. Security analysis shows that our protocol is resilient to both external and internal attacks. To verify the feasibility and correctness of the proposed SQPC protocol, we design and simulate the corresponding quantum circuits using IBM Qiskit. Finally, we compare and discuss the proposed protocol with previous similar work. The results reveal that our protocol maintains high qubit efficiency, even when entanglement swapping is employed. Consequently, our proposed approach showcases the potential applications of entanglement swapping in the field of semi-quantum cryptography.

quant-ph↗

arXiv2023

Quantum adversarial metric learning model based on triplet loss function

Metric learning plays an essential role in image analysis and classification, and it has attracted more and more attention. In this paper, we propose a quantum adversarial metric learning (QAML) model based on the triplet loss function, where samples are embedded into the high-dimensional Hilbert space and the optimal metric is obtained by minimizing the triplet loss function. The QAML model employs entanglement and interference to build superposition states for triplet samples so that only one parameterized quantum circuit is needed to calculate sample distances, which reduces the demand for quantum resources. Considering the QAML model is fragile to adversarial attacks, an adversarial sample generation strategy is designed based on the quantum gradient ascent method, effectively improving the robustness against the functional adversarial attack. Simulation results show that the QAML model can effectively distinguish samples of MNIST and Iris datasets and has higher robustness accuracy over the general quantum metric learning. The QAML model is a fundamental research problem of machine learning. As a subroutine of classification and clustering tasks, the QAML model opens an avenue for exploring quantum advantages in machine learning.

quant-ph↗

arXiv2023

A hybrid quantum-classical classifier based on branching multi-scale entanglement renormalization ansatz

Label propagation is an essential semi-supervised learning method based on graphs, which has a broad spectrum of applications in pattern recognition and data mining. This paper proposes a quantum semi-supervised classifier based on label propagation. Considering the difficulty of graph construction, we develop a variational quantum label propagation (VQLP) method. In this method, a locally parameterized quantum circuit is created to reduce the parameters required in the optimization. Furthermore, we design a quantum semi-supervised binary classifier based on hybrid Bell and $Z$ bases measurement, which has shallower circuit depth and is more suitable for implementation on near-term quantum devices. We demonstrate the performance of the quantum semi-supervised classifier on the Iris data set, and the simulation results show that the quantum semi-supervised classifier has higher classification accuracy than the swap test classifier. This work opens a new path to quantum machine learning based on graphs.

quant-ph↗

arXiv2022

Semi-quantum private comparison and its generalization to the key agreement, summation, and anonymous ranking

Semi-quantum protocols construct connections between quantum users and ``classical'' users who can only perform certain ``classical'' operations. In this paper, we present a new semi-quantum private comparison protocol based on entangled states and single particles, which does not require pre-shared keys between the ``classical'' users to guarantee the security of their private data. By utilizing multi-particle entangled states and single particles, our protocol can be easily extended to multi-party scenarios to meet the requirements of multiple ``classical'' users who want to compare their private data. The security analysis shows that the protocol can effectively prevent attacks from outside eavesdroppers and adversarial participants. Besides, we generalize the proposed protocol to other semi-quantum protocols such as semi-quantum key agreement, semi-quantum summation, and semi-quantum anonymous ranking protocols. We compare and discuss the proposed protocols with previous similar protocols. The results show that our protocols satisfy the demands of their respective counterparts separately. Therefore, our protocols have a wide range of application scenarios.

quant-ph↗

arXiv2022

Scalable Mediated Semi-quantum Key Distribution

Mediated semi-quantum key distribution (M-SQKD) permits two limited "semi-quantum" or "classical" users to establish a secret key with the help of a third party (TP), in which TP has fully quantum power and may be untrusted. Several protocols have been studied recently for two-party scenarios, but no one has considered M-SQKD for multi-party scenarios. In this paper, we design a circular M-SQKD protocol based on Bell states, which offers an approach to realizing multiple "classical" users' key distribution. Then, we prove the protocol is unconditional security in the asymptotic scenario. The protocol's key rate and noise tolerance can be derived by utilizing the parameters observed in the channel. The results show that our protocol may hold similar security to a fully quantum one. We also compare the proposed protocol with similar protocols in terms of noise tolerance, qubit efficiency, communication cost, and scalability. Finally, the security proof method of this paper may contribute to studying the security of other circular semi-quantum cryptography protocols.

quant-ph↗

arXiv2022

Circular multi-party quantum private comparison with n-level single-particle states

In this paper, a novel multi-party quantum private comparison (MQPC) protocol for equality comparison with n-level single-particle states is constructed, where the encoded particles are transmitted in a circular way. Here, n parties employ the qudit shifting operation to encode their private secrets and can compare the equality of their private secrets within one time execution of protocol. The proposed MQPC protocol can overcome both the outside attack and the participant attack. Specially, each party's secret can be kept unknown to other parties and the third party (TP).

quant-ph↗

arXiv2022

Measure-resend semi-quantum private comparison without entanglement

In this paper, we successfully design the semi-quantum private comparison (SQPC) protocol with the measure-resend characteristic by using two-particle product states as the initial prepared quantum resource which allows two classical users to compare the equality of their private secrets under the help of a quantum third party (TP). The quantum TP is semi-honest in the sense that he is allowed to misbehave on his own but cannot conspire with either of users. Both the output correctness and the security against the outside attack and the participant attack can be guaranteed. Compared with the previous SQPC protocols, the advantage of our protocol lies in that it only employs two-particle product states as the initial prepared quantum resource, only requires TP to perform single-photon measurements and does not need quantum entanglement swapping. Our protocol can be realized with current quantum technologies.

quant-ph↗

arXiv2022

Multi-party quantum private comparison of size relation with d-level single-particle states

In this paper, by using d-level single-particle states, two novel multi-party quantum private comparison protocols for size relation comparison with two semi-honest third parties and one semi-honest third party are constructed, respectively. Here, each protocol can compare the size relation of secret integers from n parties rather than just the equality within one time execution. In each protocol, every third party is assumed to be semi-honest in the sense that she may misbehave on her own but is not allowed to collude with anyone else; and each party employs the qudit shifting operation to encode her secret integer. Each protocol can resist both the outside attack and the participant attack. Specially, each party's secret integer can be kept unknown to other parties and the third parties. The proposed protocol with two third parties is workable in a stranger environment, as there are no communication and no pre-shared key between each pair of party. The proposed protocol with one third party is workable in an acquaintance environment, as all parties need to share a common private key beforehand.

quant-ph↗

arXiv2022

Semi-quantum dialogue based on single photons

In this paper, we propose two semi-quantum dialogue (SQD) protocols by using single photons as the quantum carriers, where one requires the classical party to possess the measurement capability and the other does not have this requirement. The security towards active attacks from an outside Eve in the first SQD protocol is guaranteed by the complete robustness of present semi-quantum key distribution (SQKD) protocols, the classical one-time pad encryption, the classical party's randomization operation and the decoy photon technology. The information leakage problem of the first SQD protocol is overcome by the classical party' classical basis measurements on the single photons carrying messages which makes him share their initial states with the quantum party. The security towards active attacks from Eve in the second SQD protocol is guaranteed by the classical party's randomization operation, the complete robustness of present SQKD protocol and the classical one-time pad encryption. The information leakage problem of the second SQD protocol is overcome by the quantum party' classical basis measurements on each two adjacent single photons carrying messages which makes her share their initial states with the classical party. Compared with the traditional information leakage resistant QD protocols, the advantage of the proposed SQD protocols lies in that they only require one party to have quantum capabilities. Compared with the existing SQD protocol, the advantage of the proposed SQD protocols lies in that they only employ single photons rather than two-photon entangled states as the quantum carriers. The proposed SQD protocols can be implemented with present quantum technologies.

quant-ph↗

arXiv2022

Circular semi-quantum secret sharing using single particles

Semi-quantum secret sharing (SQSS) is an important branch of semi-quantum cryptography, and differs from quantum secret sharing (QSS) in that not all parties are required to possess quantum capabilities. All previous SQSS protocols have three common features: (1) they adopt product states or entangled states as initial quantum resource; (2) the particles prepared by quantum party are transmitted in a tree-type way; and (3) they require the classical parties to possess the measurement capability. In this paper, two circular SQSS protocols with single particles are suggested, where the first one requires the classical parties to possess the measurement capability while the second one does not have this requirement. Compared with the previous SQSS protocols, the proposed SQSS protocols have some distinct features: (1) they adopt single particles rather than product states or entangled states as initial quantum resource; (2) the particles prepared by quantum party are transmitted in a circular way; and (3) the second protocol releases the classical parties from the measurement capability. The proposed SQSS protocols are robust against some famous attacks from an eavesdropper, such as the measure-resend attack, the intercept-resend attack and the entangle-measure attack, and are feasible with present quantum technologies in reality.

quant-ph↗