Related papers: Solving the liar detection problem using the four-…
Entanglement detection is one of the most conventional tasks in quantum information processing. While most experimental demonstrations of high-dimensional entanglement rely on fidelity-based witnesses, these are powerless to detect…
We introduce a new primitive for quantum communication that we term "state targeting" wherein the goal is to pass a test for a target state even though the system upon which the test is performed is submitted prior to learning the target…
We present entanglement witnesses for detecting genuine multi-qubit entanglement. Our constructions are robust against noise and require only two local measurement settings, independent of the number of qubits. Thus they allow to verify…
The realization of quantum error correction is an essential ingredient for reaching the full potential of fault-tolerant universal quantum computation. Using a range of different schemes, logical qubits can be redundantly encoded in a set…
In this work, a theoretical generalization of Lloyd's quantum illumination to signal beams described by two entangled photon states is developed. It is shown that the new protocol offers a method to find the range of the target, reduces the…
One of the applications of quantum technology is to use quantum states and measurements to communicate which offers more reliable security promises. Quantum data hiding, which gives the source party the ability of sharing data among…
The necessary and sufficient conditions for minimization of the generalized rate error for discriminating among $N$ pure qubit states are reformulated in terms of Bloch vectors representing the states. For the direct optimization problem an…
I present a novel use of quantum annealing to solve the Set Splitting Problem using (QUBO) problem formulation. The contribution of the work is in formulating penalty functions that ensure the ground state of the QUBO Hamiltonian…
Quantum state elimination measurements tell us what states a quantum system does not have. This is different from state discrimination, where one tries to determine what the state of a quantum system is, rather than what it is not. Apart…
We investigate quantum state discrimination with confidentiality. $N$ observers share a given quantum state belonging to a finite set of known states. The observers want to determine the state as accurately as possible and send a…
We consider the problem of entanglement detection in the presence of faulty, potentially malicious detectors. A common - and, as of yet, the only - approach to this problem is to perform a Bell test in order to identify nonlocality of the…
King and Saia were the first to break the quadratic word complexity bound for Byzantine Agreement in synchronous systems against an adaptive adversary, and Algorand broke this bound with near-optimal resilience (first in the synchronous…
Two pure orthogonal quantum states can be perfectly distinguished by sequential local action of multiple pairs of parties. However, this process typically leads to the complete dissolution of entanglement in the states being discriminated.…
Quantum error mitigation is essential for computing on the noisy quantum computer with a limited number of qubits. In this paper, we propose a practical protocol of error mitigation by virtually purifying the quantum state without qubit…
We report on the fault-tolerant operation of logical qubits on a neutral atom quantum computer, with logical performance surpassing physical performance for multiple circuits including Bell states (12x error reduction), random circuits…
Detection of entanglement is an indispensable step to practical quantum computation and communication. Compared with the conventional entanglement witness method based on fidelity, we propose a flexible, machine learning assisted…
In a recent paper [S. Bagherinezhad and V. Karimipour, Phys. Rev. A 67, 044302 (2003)], a quantum secret sharing protocol based on reusable GHZ states was proposed. However, in this comment, it is shown that this protocol is insecure…
Verifying whether a quantum device produces a specific state is a fundamental task in many applications of modern quantum technologies. In the conventional framework of quantum state verification, designing an optimal or efficient protocol…
We consider the problem of minimum-error quantum state discrimination for single-qubit mixed states. We present a method which uses the Helstrom conditions constructively and analytically; this algebraic approach is complementary to…
This paper describes a simple and efficient asynchronous Binary Byzantine faulty tolerant consensus algorithm. In the algorithm, non-faulty nodes perform an initial broadcast followed by a executing a series of rounds each consisting of a…