Related papers: Perfect cheating is impossible for single-qubit po…

Bit commitment is a fundamental cryptographic task that guarantees a secure commitment between two mutually mistrustful parties and is a building block for many cryptographic primitives, including coin tossing, zero-knowledge proofs,…

Current implementations of quantum key distribution (QKD) typically rely on prepare-and-measure (P&M) schemes. Unfortunately, these implementations are not completely secure, unless security proofs fully incorporate all imperfections of…

Based on the instantaneous nonlocal quantum computation (INQC), Buhrman et al. proposed an excellent attack strategy to quantum position verification (QPV) protocols in 2011, and showed that, if the colluding adversaries are allowed to…

Quantum Information Processing, which is an exciting area of research at the intersection of physics and computer science, has great potential for influencing the future development of information processing systems. The building of…

As in modern communication networks, the security of quantum networks will rely on complex cryptographic tasks that are based on a handful of fundamental primitives. Weak coin flipping (WCF) is a significant such primitive which allows two…

We propose a scheme to measure the parity of two distant qubits, while ensuring that losses on the quantum channel between them does not destroy coherences within the parity subspaces. This capability enables deterministic preparation of…

We give a cheat sensitive protocol for blind universal quantum computation that is efficient in terms of computational and communication resources: it allows one party to perform an arbitrary computation on a second party's quantum computer…

Extracting information from quantum devices has long been a crucial problem in the field of quantum mechanics. By performing elaborate measurements, quantum state tomography, an important and fundamental tool in quantum science and…

So far, certifying quantum devices from their input-output statistics, under minimal assumptions, required the preparation of specific pure quantum states. Recently, Xu et al. [Phys. Rev. Lett. 132, 140201 (2024)] have demonstrated that…

This paper discusses the use of computer-aided verification as a practical means for analysing quantum information systems; specifically, the BB84 protocol for quantum key distribution is examined using this method. This protocol has been…

Quantum key distribution (QKD) and quantum message encryption protocols promise a secure way to distribute information while detecting eavesdropping. However, current protocols may suffer from significantly reduced eavesdropping protection…

In this work, we present a quantum secret sharing scheme based on Bell state entanglement and sequential projection measurements. The protocol verifies the $n$ out of $n$ scheme and supports the aborting of the protocol in case all the…

Self-testing is a fundamental feature of quantum mechanics that allows a classical verifier to force untrusted quantum devices to prepare certain states and perform certain measurements on them. The standard approach assumes at least two…

Verification is a task to check whether a given quantum state is close to an ideal state or not. In this paper, we show that a variety of many-qubit quantum states can be verified with only sequential single-qubit measurements of Pauli…

Quantum steering is a fundamental quantum correlation that plays a pivotal role in quantum technologies, but its verification crucially relies on precise measurements -- an assumption often undermined by practical imperfections. Here, we…

Verifiable blind quantum computing allows a client with poor quantum devices to delegate universal quantum computing to a remote quantum server in such a way that the client's privacy is protected and the honesty of the server is verified.…

The relationship between the quantum bit commitment (QBC) and quantum seal (QS) is studied. It is elaborated that QBC and QS are not equivalent, but QS protocols satisfying a stronger unconditional security requirement can lead to an…

Intermediate-scale quantum devices are becoming more reliable, and may soon be harnessed to solve useful computational tasks. At the same time, common classical methods used to verify their computational output become intractable due to a…

With the advent of delegated quantum computing as a service, verifying quantum computations is becoming a question of great importance. Existing information theoretically Secure Delegated Quantum Computing (SDQC) protocols require the…

In this paper, we propose a novel Quantum Private Query (QPQ) scheme with full Device-Independent certification. To the best of our knowledge, this is the first time we provide such a full DI-QPQ scheme using EPR-pairs. Our proposed scheme…