Related papers: Quantum dimension test using the uncertainty princ…
We present an "uncertainty principle" for quantum channels, showing a relationship between the dimensions of the range of a channel and the range of its complement. We examine some interesting specific cases, and discuss consequences for…
Modern quantum engineering techniques enabled successful foundational tests of quantum mechanics. Yet, the universal validity of quantum postulates is an open question. Here we propose a new theoretical framework of Q-data tests, which…
A new interactive quantum zero-knowledge protocol for identity authentication implementable in currently available quantum cryptographic devices is proposed and demonstrated. The protocol design involves a verifier and a prover knowing a…
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quantum 1-out-of-2 Oblivious Transfer and quantum Bit Commitment…
A big challenge in continuous variable quantum key distribution is to prove security against arbitrary coherent attacks including realistic assumptions such as finite-size effects. Recently, such a proof has been presented in [Phys. Rev.…
We characterize minimal measurement setups for validating the quantum coherence of an unknown quantum state. We show that for a $d$-level system, the optimal strategy consists of measuring $d$ orthonormal bases such that each measured basis…
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify the quantum advantage of an untrusted prover. That is, a quantum prover can correctly answer the verifier's challenges and…
The stabilization of a quantum computer by repeated error correction can be reduced almost entirely to repeated preparation of blocks of qubits in quantum codeword states. These are multi-particle entangled states with a high degree of…
We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation. We achieve this by constructing a measurement protocol, which enables a classical verifier to use a quantum…
Quantum metrology is a promising practical use case for quantum technologies, where physical quantities can be measured with unprecedented precision. In lieu of quantum error correction procedures, near term quantum devices are expected to…
This article provides the unconditional security of a semi quantum key distribution (SQKD) protocol based on 3-dimensional quantum states. By deriving a lower bound for the key rate, in the asymptotic scenario, as a function of the quantum…
Quantum mass function has been applied in lots of fields because of its efficiency and validity of managing uncertainties in the form of quantum which can be regarded as an extension of classical Dempster-Shafer (D-S) evidence theory.…
Quantum metrology uses small changes in the output probabilities of a quantum measurement to estimate the magnitude of a weak interaction with the system. The sensitivity of this procedure depends on the relation between the input state,…
We present security proofs for a protocol for Quantum Key Distribution (QKD) based on encoding in finite high-dimensional Hilbert spaces. This protocol is an extension of Bennett's and Brassard's basic protocol from two bases, two state…
Uncertainty principle forbids one to determine which of the two paths a quantum system has travelled, unless interference between the alternatives had been destroyed by a measuring device, e.g., by a pointer. One can try to weaken the…
Estimation of quantum states is one of the most important steps in any quantum information processing experiment. A naive reconstruction of the density matrix from experimental measurements can often give density matrices which are not…
We introduce the notion of compatibility dimension for a set of quantum measurements: it is the largest dimension of a Hilbert space on which the given measurements are compatible. In the Schr\"odinger picture, this notion corresponds to…
Quantum error correcting codes have been shown to have the ability of making quantum information resilient against noise. Here we show that we can use quantum error correcting codes as diagnostics to characterise noise. The experiment is…
We introduce a protocol through which a pair of quantum mechanical devices may be used to generate n bits of true randomness from a seed of O(log n) uniform bits. The bits generated are certifiably random based only on a simple statistical…
The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based…