Certification of a functionality in a quantum network stage

Abstract

We consider testing the ability of quantum network nodes to execute multi-round quantum protocols. Specifically, we examine protocols in which the nodes are capable of performing quantum gates, storing qubits and exchanging said qubits over the network a certain number of times. We propose a simple ping-pong test, which provides a certificate for the capability of the nodes to run certain multi-round protocols. We first show that in the noise-free regime the only way the nodes can pass the test is if they do indeed possess the desired capabilities. We then proceed to consider the case where operations are noisy, and provide an initial analysis showing how our test can be used to estimate parameters that allow us to draw conclusions about the actual performance of such protocols on the tested nodes. Finally, we investigate the tightness of this analysis using example cases in a numerical simulation.

17+18 pages. 6 figures

References in corpus (15)

• Quantum cryptography: Public key distribution and coin tossing
• Randomized Benchmarking of Quantum Gates
• Prescription for experimental determination of the dynamics of a quantum black box
• Robust randomized benchmarking of quantum processes
• Optimal Quantum Cloning Machines
• A simple formula for the average gate fidelity of a quantum dynamical operation
• Complete Characterization of a Quantum Process: the Two-Bit Quantum Gate
• Scalable Noise Estimation with Random Unitary Operators
• Evenly distributed unitaries: on the structure of unitary designs
• Self-Consistent Quantum Process Tomography
• Randomized Benchmarking with Confidence
• Quantum Gambling
• Unitary designs and codes
• Quantum Proofs
• Capacity estimation and verification of quantum channels with arbitrarily correlated errors