Benchmarking of Quantum Protocols
- URL: http://arxiv.org/abs/2111.02527v2
- Date: Sun, 17 Jul 2022 20:29:37 GMT
- Title: Benchmarking of Quantum Protocols
- Authors: Chin-Te Liao, Sima Bahrani, Francisco Ferreira da Silva, Elham Kashefi
- Abstract summary: We consider several quantum protocols that enable promising functionalities and services in near-future quantum networks.
We use NetSquid simulation platform to evaluate the effect of various sources of noise on the performance of these protocols.
- Score: 0.9176056742068812
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum network protocols offer new functionalities such as enhanced security
to communication and computational systems. Despite the rapid progress in
quantum hardware, it has not yet reached a level of maturity that enables
execution of many quantum protocols in practical settings. To develop quantum
protocols in real world, it is necessary to examine their performance
considering the imperfections in their practical implementation using
simulation platforms. In this paper, we consider several quantum protocols that
enable promising functionalities and services in near-future quantum networks.
The protocols are chosen from both areas of quantum communication and quantum
computation as follows: quantum money, W-state based anonymous transmission,
verifiable blind quantum computation, and quantum digital signature. We use
NetSquid simulation platform to evaluate the effect of various sources of noise
on the performance of these protocols, considering different figures of merit.
We find that to enable quantum money protocol, the decoherence time constant of
the quantum memory must be at least three times the storage time of qubits.
Furthermore, our simulation results for the w-state based anonymous
transmission protocol show that to achieve an average fidelity above 0.8 in
this protocol, the storage time of sender's and receiver's particles in the
quantum memory must be less than half of the decoherence time constant of the
quantum memory. We have also investigated the effect of gate imperfections on
the performance of verifiable blind quantum computation. We find that with our
chosen parameters, if the depolarizing probability of quantum gates is equal to
or greater than 0.05, the security of the protocol cannot be guaranteed.
Lastly, our simulation results for quantum digital signature protocol show that
channel loss has a significant effect on the probability of repudiation.
Related papers
- A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Secure and Efficient Entanglement Distribution Protocol for Near-Term
Quantum Internet [1.7562083088615124]
This paper introduces a protocol to distribute entanglements among quantum devices within classical-quantum networks with limited quantum links.
The proposed protocol uses entanglement swapping to distribute entanglements efficiently in a butterfly network.
We also propose a protocol for securing entanglement distribution against malicious entanglements using quantum state encoding through rotation.
arXiv Detail & Related papers (2023-12-10T05:38:40Z) - Secured Quantum Identity Authentication Protocol for Quantum Networks [2.3317857568404032]
This paper proposes a quantum identity authentication protocol that protects quantum networks from malicious entanglements.
Unlike the existing protocols, the proposed quantum authentication protocol does not require periodic refreshments of the shared secret keys.
arXiv Detail & Related papers (2023-12-10T05:36:49Z) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - Oblivious Quantum Computation and Delegated Multiparty Quantum
Computation [61.12008553173672]
We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required.
Exploiting quantum teleportation, we propose a two-server protocol for this task.
Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
arXiv Detail & Related papers (2022-11-02T09:01:33Z) - Testing quantum computers with the protocol of quantum state matching [0.0]
The presence of noise in quantum computers hinders their effective operation.
We suggest the application of the so-called quantum state matching protocol for testing purposes.
For systematically varied inputs we find that the device with the smaller quantum volume performs better on our tests than the one with larger quantum volume.
arXiv Detail & Related papers (2022-10-18T08:25:34Z) - Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement.
Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z) - Designing a Quantum Network Protocol [0.0]
We present a quantum network protocol designed to enable end-to-end quantum communication.
One of the key challenges in near-term quantum technology is decoherence -- the gradual decay of quantum information.
We show that the protocol is able to deliver its service even in the face of significant losses due to decoherence.
arXiv Detail & Related papers (2020-10-06T09:41:14Z) - SeQUeNCe: A Customizable Discrete-Event Simulator of Quantum Networks [53.56179714852967]
This work develops SeQUeNCe, a comprehensive, customizable quantum network simulator.
We implement a comprehensive suite of network protocols and demonstrate the use of SeQUeNCe by simulating a photonic quantum network with nine routers equipped with quantum memories.
We are releasing SeQUeNCe as an open source tool and aim to generate community interest in extending it.
arXiv Detail & Related papers (2020-09-25T01:52:15Z) - Efficient verification of Boson Sampling [0.0]
We derive an efficient protocol for verifying with single-mode Gaussian measurements the output states of a class of continuous-variable quantum circuits.
Our results also enable the efficient and reliable certification of a large class of intractable continuous-variable multimode quantum states.
arXiv Detail & Related papers (2020-06-05T15:55: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.