相关论文: Self-testing in parallel with CHSH
Complementarity is an essential feature of quantum mechanics. The preparation of an eigenstate of one observable implies complete randomness in its complementary observable. In quantum cryptography, complementarity allows us to formulate…
Certifying the entanglement of quantum states with Bell inequalities allows one to guarantee the security of quantum information protocols independently of imperfections in the measuring devices. Here we present a similar procedure for…
Certifying maximal quantum randomness without assumptions about system dimension remains a pivotal challenge for secure communication and foundational studies. Here, we introduce a generalized framework to directly certify maximal…
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…
We propose a method to reliably and efficiently extract the fidelity of many-qubit quantum circuits composed of continuously parametrized two-qubit gates called matchgates. This method, which we call matchgate benchmarking, relies on…
Bell inequality with self-testing property has played an important role in quantum information field with both fundamental and practical applications. However, it is generally challenging to find Bell inequalities with self-testing property…
Quantum error-correction codes would protect an arbitrary state of a multi-qubit register against decoherence-induced errors, but their implementation is an outstanding challenge for the development of large-scale quantum computers. A first…
The central question in quantum multi-prover interactive proof systems is whether or not entanglement shared between provers affects the verification power of the proof system. We study for the first time positive aspects of prior…
The Clauser-Horne-Shimony-Holt inequality test is widely used as a mean of invalidating the local deterministic theories and a tool of device independent quantum cryptographic tasks. There exists a randomness (freewill) loophole in the…
Quantum properties of the probes used to estimate a classical parameter can be used to attain accuracies that beat the standard quantum limit. When qubits are used to construct a quantum probe, it is known that initializing $n$ qubits in an…
Proving threshold theorems for fault-tolerant quantum computation is a burdensome endeavor with many moving parts that come together in relatively formulaic but lengthy ways. It is difficult and rare to combine elements from multiple papers…
Recently, dimensionality testing of a quantum state has received extensive attention (Ac{\'i}n et al. Phys. Rev. Letts. 2006, Scarani et al. Phys. Rev. Letts. 2006). Security proofs of existing quantum information processing protocols rely…
Quantum computers promise to solve certain problems more efficiently than their digital counterparts. A major challenge towards practically useful quantum computing is characterizing and reducing the various errors that accumulate during an…
In this work we study the phenomenon of self-testing from the first principles, aiming to place this versatile concept on a rigorous mathematical footing. Self-testing allows a classical verifier to infer a quantum mechanical description of…
Entangled two-qubit states are the core building blocks for constructing quantum communication networks. Their accurate verification is crucial to the functioning of the networks, especially for untrusted networks. In this work we study the…
In order to guarantee the output of a quantum computation, we usually assume that the component devices are trusted. However, when the total computation process is large, it is not easy to guarantee the whole system when we have scaling…
The self-testing protocols refer to novel device-independent certification schemes wherein the devices are uncharacterised, and the dimension of the system remains unspecified. The optimal quantum violation of a Bell's inequality…
Quantum computing hardware has grown sufficiently complex that it often can no longer be simulated by classical computers, but its computational power remains limited by errors. These errors corrupt the results of quantum algorithms, and it…
Quantum measurements on a two-level system can have more than two independent outcomes, and in this case, the measurement cannot be projective. Measurements of this general type are essential to an operational approach to quantum theory,…
It has been known that all bipartite pure quantum states can be certified by quantum self-testing, i.e., any such states can be pinned down completely based on the statistics produced by local quantum measurements. A notable feature of…