Self-Testing of One-Qubit Gates
Year: 1999
Type: preprint
Abstract: We design self-testers for several families of unitary one-qubit gates, in particular for the family of Hadamard gates. A self-tester for a gate family F is a classical procedure which, given a gate G, decides with high probability if G is close, with respect to some norm, to an element of F. For this the self-tester can access the gate G only in a restricted way: it can measure in the computational basis the outcome of iterating G on the `classical' basis states. To achieve our goal we borrow an idea of the theory of program testing: we characterize the gate families by specific properties. Then we develop a theory of robustness for these properties and show that they lead to self-testers.
Source: arXiv (Cornell University)
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2591838467