Entanglement Verification in Quantum Networks With Tampered Nodes

@article{Amoretti2017EntanglementVI,
  title={Entanglement Verification in Quantum Networks With Tampered Nodes},
  author={Michele Amoretti and Stefano Carretta},
  journal={IEEE Journal on Selected Areas in Communications},
  year={2017},
  volume={38},
  pages={598-604}
}
  • M. AmorettiS. Carretta
  • Published 10 July 2017
  • Computer Science
  • IEEE Journal on Selected Areas in Communications
In this paper, we consider the problem of entanglement verification across the quantum memories of any two nodes of a quantum network. Its solution can be a means for detecting (albeit not preventing) the presence of intruders that have taken full control of a node, either to make a denial-of-service attack or to reprogram the node. Looking for strategies that only require local operations and classical communication (LOCC), we propose two entanglement verification protocols characterized by… 

Figures and Tables from this paper

Objective function maximization by machine learning for gate-model quantum computers

The method significantly reduces the costs of the objective function estimation and provides an estimate of the new state of the quantum computer, particularly convenient for the performance optimization of experimental gate-model quantum computations.

Detection and localization of image tampering in digital images with fused features

The simulation outcomes illustrate that the adopted model attains better tamper detection as well as localization performance over the existing methods.

End-to-End Entanglement Generation Strategies: Capacity Bounds and Impact on Quantum Key Distribution

This paper provides an overview of current methods and systems for end-to-end entanglement generation, with some simulations and a discussion of capacity upper bounds and their impact of secret key rate in QKD systems.

Problem solving dynamics for gate-model quantum computers

This work studies the model of adaptive problem solving dynamics in gate-model quantum computers, which can be realized in near-term experimental implementations of quantum computers.

Resource optimization for the quantum Internet

Methods and procedures of resource prioritization and resource balancing for the quantum Internet are defined to optimize the resource allocation mechanisms and to reduce the resource consumptions of the network entities.

Private Set Intersection with Delegated Blind Quantum Computing

  • M. Amoretti
  • Computer Science
    2021 IEEE Global Communications Conference (GLOBECOM)
  • 2021
A protocol is proposed that solves the server-aided PSI problem using delegated blind quantum computing and is correct, secure and blind against a malicious server, and characterized by a quantum communication complexity that is linear in the input size.

Approximation Method for Optimization Problems in Gate-Model Quantum Computers

  • L. Gyongyosi
  • Computer Science, Physics
    Chaos, Solitons & Fractals: X
  • 2021

Scalable distributed gate-model quantum computers

It is proved that the proposed architecture can maximize an objective function of a computational problem in a distributed manner and study the impacts of decoherence on distributed objective function evaluation.

Resource prioritization and balancing for the quantum internet

It is proved that a strongly-entangled quantum network is two times more efficient in a resource balancing problem than a full-mesh network of the traditional Internet.

References

SHOWING 1-10 OF 31 REFERENCES

Entanglement Verification with an Application to Quantum Key Distribution Protocols

An entanglement verification method not based on Bell inequalities is developed, that achieves a higher reliability per number of qubits tested than existing procedures of this kind and gives rise to a new protocol for distributing classical keys through insecure quantum channels.

SimulaQron—a simulator for developing quantum internet software

SimulaQron is built to enable application development and explore software engineering practises for a quantum internet, and features a modular design that performs a distributed simulation based on any existing simulation of a quantum computer capable of integrating with Python.

Enhancing distributed functional monitoring with quantum protocols

The proposed quantum protocols enhance the classical geometric monitoring (GM) method with quantum communication and entanglement, showing that they outperform their classical counterparts in terms of reduced communication cost, while showing the same accuracy.

A Survey on quantum computing technology

Advertising Entanglement Capabilities in Quantum Networks

Proposals for additions to the IS-IS and OSPF protocols in order for them to transport relevant information for a Quantum Network, specifically, for the creation and manipulation of entangled pairs are presented.

Opportunistic Entanglement Distribution for the Quantum Internet

The method of opportunistic entanglement distributing with respect to the actual statuses of the local quantum memories of the node pairs provides an easily-applicable, moderate-complexity solution for high-fidelityEntanglement distribution in experimental quantum Internet scenarios.

Arbitrarily loss-tolerant Einstein-Podolsky-Rosen steering allowing a demonstration over 1 km of optical fiber with no detection loophole

Demonstrating nonclassical effects over longer and longer distances is essential for both quantum technology and fundamental science. The main challenge is the loss of photons during propagation,

Multilayer Optimization for the Quantum Internet

The multilayer optimization framework provides a practically implementable tool for quantum network communications, or long-distance quantum communications.

Entanglement Availability Differentiation Service for the Quantum Internet

The proposed EAD framework provides an efficient and easily-implementable solution for the differentiation of entanglement availability in experimental quantum networking scenarios.

Decentralized Base-Graph Routing for the Quantum Internet

The proposed method allows an efficient routing to find the shortest paths in entangled quantum networks by using only local knowledge of the quantum nodes, and gives bounds on the maximum value of the total number of entangled links of a path.