相关论文: Solving the liar detection problem using the four-…

We generalize Bell's hidden variable model describing the singlet state of a two-qubits system by extending it to arbitrary states and observables. As in the original work, we assume a uniform, state-independent probability distribution for…

We introduce a novel form of decoy-state technique to make the single-photon Bennett 1992 protocol robust against losses and noise of a communication channel. Two uninformative states are prepared by the transmitter in order to prevent the…

Byzantine agreement (BA) enables all honest nodes in a decentralized network to reach consensus. In the era of emerging quantum technologies, classical cryptography-based BA protocols face inherent security vulnerabilities. By leveraging…

In this paper a programmable quantum state discriminator is implemented by using nuclear magnetic resonance. We use a two qubit spin-1/2 system, one for the data qubit and one for the ancilla (programme) qubit. This device does the…

We analyze the efficacy of multiqubit W-type states as resources for quantum information. For this, we identify and generalize four-qubit W-type states. Our results show that the states can be used as resources for deterministic quantum…

Two quantum key agreement protocols using Bell states and Bell measurement were recently proposed by Shukla et al.(Quantum Inf. Process. 13(11), 2391-2405, 2014). However, Zhu et al. pointed out that there are some security flaws and…

To build a fault-tolerant quantum computer, it is necessary to implement a quantum error correcting code. Such codes rely on the ability to extract information about the quantum error syndrome while not destroying the quantum information…

We study the optimal entanglement witness with respect to multiqubits W-states. We show such entanglement witnesses can be used to distinguish genuine entangled states, different biseparable states and fully separable states.

This work considers two related learning problems in a federated attack prone setting: federated principal components analysis (PCA) and federated low rank column-wise sensing (LRCS). The node attacks are assumed to be Byzantine which means…

The use of higher-dimensional photonic encodings (qudits) instead of two-dimensional encodings (qubits) can improve the loss tolerance and reduce the computational resources of photonic-based quantum information processing. To harness this…

A generalization of the quantum cryptographic protocol by Bennett and Brassard is discussed, using three conjugate bases, i.e. six states. By calculating the optimal mutual information between sender and eavesdropper it is shown that this…

Recent advances in generative AI have enabled sophisticated multi-agent architectures for healthcare, where large language models power collaborative clinical decision-making. However, these distributed systems face critical challenges in…

We discuss several methods for unambiguous state discrimination of N symmetric coherent states using linear optics and photodetectors. One type of measurements is shown to be optimal in the limit of small photon numbers for any N. For the…

The paper investigates the Lattice Agreement (LA) problem in asynchronous systems. In LA each process proposes an element $e$ from a predetermined lattice, and has to decide on an element $e'$ of the lattice such that $e \leq e'$. Moreover,…

The LIT approach is reviewed both for inclusive and exclusive reactions. It is shown that the method reduces a continuum state problem to a bound-state-like problem, which then can be solved with typical bound-state techniques. The LIT…

A one way partial quantum bit commitment protocol is developed, using states with built-in classical correlation, completely independent of entanglement. It involves concealing information in a set of mutually non-orthogonal states and…

Qubits used in quantum computing tend to suffer from errors, either from the qubit interacting with the environment, or from imperfect control when quantum logic gates are applied. Fault-tolerant construction based on quantum error…

We exhibit that, when given a classical Byzantine agreement protocol designed in the private-channel model, it is feasible to construct a quantum agreement protocol that can effectively handle a full-information adversary. Notably, both…

It is well known that no quantum bit commitment protocol is unconditionally secure. Nonetheless, there can be non-trivial upper bounds on both Bob's probability of correctly estimating Alice's commitment and Alice's probability of…

Byzantine agreement is a fundamental problem in fault-tolerant distributed computing that has been studied intensively for the last four decades. Much of the research has focused on a static Byzantine adversary, where the adversary is…