Self-testing of Quantum Circuits

DOI10.1007/11786986_8MaRDI QIDQ3613750zbMATH OpenOpenAlexFDO

Authors Frédéric Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier

Publication date 12 March 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0512111, http://cds.cern.ch/record/915553

Mathematics Subject Classification ID

Quantum computation (81P68) Fault detection; testing in circuits and networks (94C12)

Abstract: We prove that a quantum circuit together with measurement apparatuses and EPR sources can be fully verified without any reference to some other trusted set of quantum devices. Our main assumption is that the physical system we are working with consists of several identifiable sub-systems, on which we can apply some given gates locally. To achieve our goal we define the notions of simulation and equivalence. The concept of simulation refers to producing the correct probabilities when measuring physical systems. To enable the efficient testing of the composition of quantum operations, we introduce the notion of equivalence. Unlike simulation, which refers to measured quantities (i.e., probabilities of outcomes), equivalence relates mathematical objects like states, subspaces or gates. Using these two concepts, we prove that if a system satisfies some simulation conditions, then it is equivalent to the one it is purposed to implement. In addition, with our formalism, we can show that these statements are robust, and the degree of robustness can be made explicit (unlike the robustness results of [DMMS00]). In particular, we also prove the robustness of the EPR Test [MY98]. Finally, we design a test for any quantum circuit whose complexity is linear in the number of gates and qubits, and polynomial in the required precision.

Recommendations

• Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
• Generalized self-testing and the security of the 6-state protocol
• Self-testing of universal and fault-tolerant sets of quantum gates
• Optimal robust self-testing by binary nonlocal XOR games
• Self-testing in parallel

Cited in

(16)

• Optimal robust self-testing by binary nonlocal XOR games
• Generalized self-testing and the security of the 6-state protocol
• Self-testing of universal and fault-tolerant sets of quantum gates
• Global completability with applications to self-consistent quantum tomography
• Parallel self-testing of the GHZ state with a proof by diagrams
• Self-Testing Graph States
• Testing quantum circuits and detecting insecure encryption
• Self testing quantum apparatus
• Device-independent tests of quantum channels
• A quantum linearity test for robustly verifying entanglement
• Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
• Device-independent bit commitment based on the CHSH inequality
• All the self-testings of the singlet for two binary measurements
• Self-testing protocols based on the chained Bell inequalities
• Self-testing in parallel
• Quantum cryptography beyond quantum key distribution

This page was built for publication: Self-testing of Quantum Circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613750)