Measurement-device-independent resource characterization protocols
- URL: http://arxiv.org/abs/2410.19617v1
- Date: Fri, 25 Oct 2024 15:17:09 GMT
- Title: Measurement-device-independent resource characterization protocols
- Authors: Chenxu Li, Mingze Xu, Hao Dai, Xiongfeng Ma,
- Abstract summary: We show that resources that do not increase under local operation and shared randomness can be characterized with any untrusted measurement.
We demonstrate several MDI characterization protocols for these resources.
- Score: 7.471666991920787
- License:
- Abstract: Measurement-device-independent (MDI) quantum information processing tasks are important subroutines in quantum information science because they are robust against any type of measurement imperfections. In this work, we propose a framework of MDI resource characterization protocols that unifies and generalizes these tasks. We show that resources that do not increase under local operation and shared randomness can be characterized with any untrusted measurement, and we provide a general procedure to convert such resource characterization tasks into MDI protocols. We then focus on applying our framework to two cases that satisfy the criteria: the resource theory of bipartite and multipartite entanglement, and the resource theory of quantum memories. We demonstrate several MDI characterization protocols for these resources. These protocols are either novel or generalize existing ones from the literature. We also show that MDI quantum key distribution can be viewed as an MDI quantification protocol for quantum memory.
Related papers
- Robust and efficient verification of graph states in blind
measurement-based quantum computation [52.70359447203418]
Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients.
It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario.
Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
arXiv Detail & Related papers (2023-05-18T06:24:45Z) - Verification of Continuous-Variable Quantum Memories [0.0]
verification of quantum memories (non-EB channels) is a task in which an honest user wants to test the quantum memory of an untrusted, remote provider.
Here, we study the MDI certification of non-EB channels in continuous variable (CV) systems.
arXiv Detail & Related papers (2023-05-12T14:28:35Z) - Boosted quantum and semi-quantum communication protocols [0.0]
We show that it is possible to reduce the number of such runs by a suitable design of the key generation rule.
We illustrate this advantage by proposing quantum and semi-quantum key distribution protocols.
arXiv Detail & Related papers (2023-03-24T12:33:22Z) - Single-photon-memory measurement-device-independent quantum secure
direct communication [63.75763893884079]
Quantum secure direct communication (QSDC) uses the quantum channel to transmit information reliably and securely.
In order to eliminate the security loopholes resulting from practical detectors, the measurement-device-independent (MDI) QSDC protocol has been proposed.
We propose a single-photon-memory MDI QSDC protocol (SPMQC) for dispensing with high-performance quantum memory.
arXiv Detail & Related papers (2022-12-12T02:23:57Z) - Towards Semantic Communication Protocols: A Probabilistic Logic
Perspective [69.68769942563812]
We propose a semantic protocol model (SPM) constructed by transforming an NPM into an interpretable symbolic graph written in the probabilistic logic programming language (ProbLog)
By leveraging its interpretability and memory-efficiency, we demonstrate several applications such as SPM reconfiguration for collision-avoidance.
arXiv Detail & Related papers (2022-07-08T14:19:36Z) - Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding [58.720142291102135]
We define a resource measure for magic, the sought-after property in most fault-tolerant quantum computers.
Our formulation is based on bosonic codes, well-studied tools in continuous-variable quantum computation.
arXiv Detail & Related papers (2021-09-27T12:56:01Z) - Multi-party Semi-quantum Secret Sharing Protocol based on Measure-flip and Reflect Operations [1.3812010983144802]
Semi-quantum secret sharing (SQSS) protocols serve as fundamental frameworks in quantum secure multi-party computations.
This paper proposes a novel SQSS protocol based on multi-particle GHZ states.
arXiv Detail & Related papers (2021-09-03T08:52:17Z) - Sample-efficient device-independent quantum state verification and
certification [68.8204255655161]
Authentication of quantum sources is a crucial task in building reliable and efficient protocols for quantum-information processing.
We develop a systematic approach to device-independent verification of quantum states free of IID assumptions in the finite copy regime.
We show that device-independent verification can be performed with optimal sample efficiency.
arXiv Detail & Related papers (2021-05-12T17:48:04Z) - Composably secure data processing for Gaussian-modulated continuous
variable quantum key distribution [58.720142291102135]
Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties.
We consider a protocol with homodyne detection in the general setting of composable finite-size security.
In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
arXiv Detail & Related papers (2021-03-30T18:02:55Z) - Measurement-Device-Independent Quantum Key Distribution with Leaky
Sources [0.0]
Measurement-device-independent quantum key distribution (MDI-QKD) can remove all detection side-channels from quantum communication systems.
We show that MDI-QKD is feasible within a reasonable time frame of signal transmission given that the sources are sufficiently isolated.
arXiv Detail & Related papers (2020-01-21T08:19:21Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.