SarDub19: An Error Estimation and Reconciliation Protocol
- URL: http://arxiv.org/abs/2212.12816v1
- Date: Sat, 24 Dec 2022 21:16:21 GMT
- Title: SarDub19: An Error Estimation and Reconciliation Protocol
- Authors: Miralem Mehic and Harun Siljak
- Abstract summary: We present SarDub19 error key estimation and reconciliation protocol.
It is realized through public channel and it dominates the communication of the quantum key distribution process.
- Score: 1.4890829254686686
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Aside from significant advancements in the development of optical and quantum
components, the performance of practical quantum key distribution systems is
largely determined by the type and settings of the error key reconciliation
procedure. It is realized through public channel and it dominates the
communication complexity of the quantum key distribution process. The practical
utilization significantly depends on the computational capacities that are of
great importance in satellite-oriented quantum communications. Here we present
SarDub19 error key estimation and reconciliation protocol that improves
performances of practical quantum systems.
Related papers
- Simulations of distributed-phase-reference quantum key distribution protocols [0.1398098625978622]
Quantum key distribution protocols provide a secret key between two users with security guaranteed by the laws of quantum mechanics.
We perform simulations on the Interconnect platform to characterise the practical implementation of these devices.
We briefly describe and simulate some possible eavesdropping attempts, backflash attack, trojan-horse attack and detector-blinding attack exploiting the device imperfections.
arXiv Detail & Related papers (2024-06-13T13:19:04Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Secure Key from Quantum Discord [22.97866257572447]
We show how to make use of discord to analyze security in a specific quantum cryptography protocol.
Our method is robust against imperfections in qubit sources and qubit measurements as well as basis misalignment due to quantum channels.
arXiv Detail & Related papers (2023-04-12T14:21:49Z) - Breaking universal limitations on quantum conference key agreement
without quantum memory [6.300599548850421]
We report a measurement-device-independent quantum conference key agreement protocol with enhanced transmission efficiency over lossy channel.
Our protocol can break key rate bounds on quantum communication over quantum network without quantum memory.
Based on our results, we anticipate that our protocol will play an indispensable role in constructing multipartite quantum network.
arXiv Detail & Related papers (2022-12-10T06:37:53Z) - Data post-processing for the one-way heterodyne protocol under
composable finite-size security [62.997667081978825]
We study the performance of a practical continuous-variable (CV) quantum key distribution protocol.
We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime.
This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
arXiv Detail & Related papers (2022-05-20T12:37:09Z) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks.
Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts.
We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
arXiv Detail & Related papers (2021-06-11T18:00:09Z) - Efficient Assessment of Process Fidelity [0.0]
We find a faithful approximation to the quantum process fidelity that can be estimated experimentally with reduced effort.
Its practical use is demonstrated with the optimisation of a three-qubit quantum gate on a commercially available quantum processor.
arXiv Detail & Related papers (2021-02-16T11:49:02Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - Representation matching for delegated quantum computing [64.67104066707309]
representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network.
We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
arXiv Detail & Related papers (2020-09-14T18:07:43Z) - Reconciliation for Practical Quantum Key Distribution with BB84 protocol [0.22099217573031674]
We describe an explicit reconciliation method based on Turbo codes.
We believe that the proposed method can improve the efficiency of quantum key distribution protocols based on discrete quantum states.
arXiv Detail & Related papers (2020-02-16T20:46:18Z)
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.