dorsal/arxiv
View SchemaSelf-Testing of Quantum Circuits
| Authors | Frederic Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0512111 |
| URL | https://arxiv.org/abs/quant-ph/0512111 |
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.
{
"annotation_id": "5e7f3ba5-4ee6-499f-a424-2999a61336ec",
"date_created": "2026-03-02T18:02:23.065000Z",
"date_modified": "2026-03-02T18:02:23.065000Z",
"file_hash": "8feba4225f626040f13a5ac428c7f8a4c153f4d8ea160d58bf8a1d45a000966e",
"private": false,
"record": {
"abstract": "We prove that a quantum circuit together with measurement apparatuses and EPR\nsources can be fully verified without any reference to some other trusted set\nof quantum devices. Our main assumption is that the physical system we are\nworking with consists of several identifiable sub-systems, on which we can\napply some given gates locally.\n To achieve our goal we define the notions of simulation and equivalence. The\nconcept of simulation refers to producing the correct probabilities when\nmeasuring physical systems. To enable the efficient testing of the composition\nof quantum operations, we introduce the notion of equivalence. Unlike\nsimulation, which refers to measured quantities (i.e., probabilities of\noutcomes), equivalence relates mathematical objects like states, subspaces or\ngates.\n Using these two concepts, we prove that if a system satisfies some simulation\nconditions, then it is equivalent to the one it is purposed to implement. In\naddition, with our formalism, we can show that these statements are robust, and\nthe degree of robustness can be made explicit (unlike the robustness results of\n[DMMS00]). In particular, we also prove the robustness of the EPR Test [MY98].\nFinally, we design a test for any quantum circuit whose complexity is linear in\nthe number of gates and qubits, and polynomial in the required precision.",
"arxiv_id": "quant-ph/0512111",
"authors": [
"Frederic Magniez",
"Dominic Mayers",
"Michele Mosca",
"Harold Ollivier"
],
"categories": [
"quant-ph"
],
"title": "Self-Testing of Quantum Circuits",
"url": "https://arxiv.org/abs/quant-ph/0512111"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "8348837d-04c6-4180-a781-bfddb30872d0",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}