Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
arXiv:quant-ph/9904108 · doi:10.1145/335305.335402
Abstract
We consider the design of self-testers for quantum gates. A self-tester for the gates F_1,...,F_m is a classical procedure that, given any gates G_1,...,G_m, decides with high probability if each G_i is close to F_i. This decision has to rely only on measuring in the computational basis the effect of iterating the gates on the classical states. It turns out that instead of individual gates, we can only design procedures for families of gates. To achieve our goal we borrow some elegant ideas of the theory of program testing: we characterize the gate families by specific properties, we develop a theory of robustness for them, and show that they lead to self-testers. In particular we prove that the universal and fault-tolerant set of gates consisting of a Hadamard gate, a c-NOT gate, and a phase rotation gate of angle pi/4 is self-testable.
arXiv commentLaTeX2e, 14 pages, no figures, usepackage{a4wide,amssymb,amsmath}; major changes (Feb 2000), results expanded to 2-qubit gates. To appear in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing
References in corpus (9)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Elementary gates for quantum computation
- Two-Bit Gates are Universal for Quantum Computation
- Prescription for experimental determination of the dynamics of a quantum black box
- Complete Characterization of a Quantum Process: the Two-Bit Quantum Gate
- Resilient Quantum Computation: Error Models and Thresholds
- A Universal Two--Bit Gate for Quantum Computation
- Threshold Accuracy for Quantum Computation
- On Universal and Fault-Tolerant Quantum Computing
Cited by in corpus (10)
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Interactive proofs for BQP via self-tested graph states
- Invertible Quantum Operations and Perfect Encryption of Quantum States
- Generalized self-testing and the security of the 6-state protocol
- Secure assisted quantum computation
- Quantum Information Processing with Adversarial Devices
- Self-testing graph states
- Interactive proofs for BQP via self-tested graph states (extended abstract)
- Countering detector manipulation attacks in quantum communication through detector self-testing
- Classical certification of quantum gates under the dimension assumption