dorsal/arxiv
View SchemaA proof that measured data and equations of quantum mechanics can be linked only by guesswork
| Authors | John M. Myers, F. Hadi Madjid |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0003144 |
| URL | https://arxiv.org/abs/quant-ph/0003144 |
Abstract
The design and operation of a quantum-mechanical device as a laboratory instrument puts models written in equations of quantum mechanics in contact with instruments. This contact is recordable in files of a Classical Digital Process-control Computer (CPC) used both to calculate with the equations and to manage the instruments. By noticing that equations and instruments make contact in a CPC, we rewrite equations of quantum mechanics to explicitly include functions of CPC-commands to the instruments. This sets up a proof that a scientist's choice in linking mathematical models to instruments is unresolvable without guesswork to narrow the set of models from which one is to be chosen. As for implications of the proof, scientists inherit choices from the past and frame choices for the future, choices open to guesswork and visible in CPC files. To picture these choices, we adapt colored Petri nets, and the availability of these net fragments makes choice and guesswork part and parcel of physics. Net fragments as a means of expressing guess-demanding choices are applied to portray guesswork needed in testing and calibrating a quantum computer. The sample size required to test a quantum gate in a quantum computer is shown to grow as the inverse square of the error allowed in implementing the gate.
{
"annotation_id": "b9ea62ca-6f16-4a8a-9386-0ed5e1578ab1",
"date_created": "2026-03-02T18:01:38.008000Z",
"date_modified": "2026-03-02T18:01:38.008000Z",
"file_hash": "28037a3ca215b0c01df310deca01883d76a9b20837cc9c678bd30ef8f1955730",
"private": false,
"record": {
"abstract": "The design and operation of a quantum-mechanical device as a laboratory\ninstrument puts models written in equations of quantum mechanics in contact\nwith instruments. This contact is recordable in files of a Classical Digital\nProcess-control Computer (CPC) used both to calculate with the equations and to\nmanage the instruments. By noticing that equations and instruments make contact\nin a CPC, we rewrite equations of quantum mechanics to explicitly include\nfunctions of CPC-commands to the instruments. This sets up a proof that a\nscientist\u0027s choice in linking mathematical models to instruments is\nunresolvable without guesswork to narrow the set of models from which one is to\nbe chosen.\n As for implications of the proof, scientists inherit choices from the past\nand frame choices for the future, choices open to guesswork and visible in CPC\nfiles. To picture these choices, we adapt colored Petri nets, and the\navailability of these net fragments makes choice and guesswork part and parcel\nof physics.\n Net fragments as a means of expressing guess-demanding choices are applied to\nportray guesswork needed in testing and calibrating a quantum computer. The\nsample size required to test a quantum gate in a quantum computer is shown to\ngrow as the inverse square of the error allowed in implementing the gate.",
"arxiv_id": "quant-ph/0003144",
"authors": [
"John M. Myers",
"F. Hadi Madjid"
],
"categories": [
"quant-ph"
],
"title": "A proof that measured data and equations of quantum mechanics can be linked only by guesswork",
"url": "https://arxiv.org/abs/quant-ph/0003144"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "a8e87dcc-f5e2-49a0-a212-90ff8885b16a",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}