Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0005007 · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Contact between laboratory instruments and equations of quantum mechanics

John M. Myers, F. Hadi Madjid

Published Jul 13, 2000• 1 citation
arXivHTMLPDF

Abstract

Ambiguity int he contact between laboratory instruments and equations of quantum mechanics is formulated in terms of responses of the instruments to commands transmitted to them by a Classical digital Process-control Computer (CPC); in this way instruments are distinguished from quantum- mechanical models (sets of equations) that specify what is desired of the instruments. Results include: (1) a formulation of quantum mechanics adapted to computer- controlled instruments; (2) a lower bound on the precision of unitary transforms required for quantum searching and a lower bound on sample size needed to show that instruments implement a desired model at that precision; (3) a lower bound on precision of timing required of a CPC in directing instruments; (4) a demonstration that guesswork is necessary in ratcheting up the precision of commands.

DOI
10.1117/12.391960

Related papers

A proof that measured data and equations of quantum mechanics can be linked only by guesswork

John M. Myers, F. Hadi Madjid

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.

arXiv:quant-ph/0003144•Contemporary mathematics - American Mathematical Society•Jan 1, 2002•14 citations

Physics of computation: tightness of timing vs. heat generated

John M. Myers, F. Hadi Madjid

We relate quantum mechanics to the concept of an experimental trial, borrowed from statistics, in order to make clear that devices designed using quantum-mechanical equations require, in effect, management by a classical digital process-control computer (CPC). Energy dissipation essential for tolerance to component imperfections in classical digital computers is shown not to mix with quantum superposition expressed by the quantum dynamics of a Schrodinger equation. This precludes so-called quantum computers from producing super-linear speed-up at a scale large enough to be useful, and at the same clarifies a conceptual separation between digital computing and devices exhibiting quantum phase sensitivity. Quantum effects, such as random-number generation and photon correlations, are know to be useful and show further great potential for devices for computational and other purpose. Several such quantum-based devices are discussed that require or can be made more effective by bridging between these devices and CPCs that manage them. While the interdisciplinary promise of 'quantum computing' has faded, the area of quantum-to- classical bridging, once liberated from the misleading goal of super-linear speed-up, invites vigorous study and invention.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 26, 2001•0 citations

Modeling and Control of Quantum Systems: An Introduction

Claudio Altafini, F. Ticozzi

The scope of this work is to provide a self-contained introduction to a selection of basic theoretical aspects in the modeling and control of quantum mechanical systems, as well as a brief survey on the main approaches to control synthesis. While part of the existing theory, especially in the open-loop setting, stems directly from classical control theory (most notably geometric control and optimal control), a number of tools specifically tailored for quantum systems have been developed since the 1980s, in order to take into account their distinctive features: the probabilistic nature of atomic-scale physical systems, the effect of dissipation and the irreversible character of the measurements have all proved to be critical in feedback-design problems. The relevant dynamical models for both closed and open quantum systems are presented, along with the main results on their controllability and stability. A brief review of several currently available control design methods is meant to provide the interested reader with a roadmap for further studies.

arXiv:1210.7127•IEEE Transactions on Automatic Control•Jul 19, 2012•255 citations

A self-guided algorithm for learning control of quantum-mechanical systems

Minh Q. Phan, HERSCHEL A. RABITZ

This paper presents a general self-guided algorithm for direct laboratory learning of controls to manipulate quantum-mechanical systems. The primary focus is on an algorithm based on the learning of a linear laboratory input–output map from a sequence of controls, and their observed impact on the quantum-mechanical system. This map is then employed in an iterative fashion, to sequentially home in on the desired objective. The objective may be a target state at a final time, or a continuously weighted observational trajectory. The self-guided aspects of the algorithm are based on implementing a cost functional that only contains laboratory-accessible information. Through choice of the weights in this functional, the algorithm can automatically stay within the bounds of each local linear map and indicate when a new map is necessary for additional iterative improvement. Finally, these concepts can be generalized to include the possibility of employing nonlinear maps, as well as just the laboratory control instrument settings, rather than observation of the control itself. An illustrative simulation of the concepts is presented for the control of a four-level quantum system.

The Journal of Chemical Physics•Jan 1, 1999•36 citations

Basic Concepts in Quantum Physics— Mathematical Tools

Daniel Minoli, Benedict Occhiogrosso

This chapter presents some of the basic mathematical background and nomenclature needed to gain an introductory understanding of Quantum Mechanics (QM). The more direct application of the math to QM per se is covered in chapters that follow.

Auerbach Publications eBooks•Mar 18, 2025•0 citations

WHERE THE MATHEMATICAL STRUCTURE OF QUANTUM MECHANICS COMES FROM

Giacomo Mauro D’Ariano

The mathematical formulation of Quantum Mechanics is derived from purely operational axioms based on a general definition of experiment as a set of transformations. The main ingredient of the mathematical construction is the postulated existence of faithful states that allows one to calibrate the experimental apparatus. Such notion is at the basis of the operational definitions of the scalar product and of the adjoint of a transformation.

Beyond the Quantum•Sep 1, 2007•1 citation
Ambiguity int he contact between laboratory instruments and equations of quantum mechanics is formulated in terms of responses of the instruments to commands transmitted to them by a Classical digital Process-control Computer (CPC); in this way instruments are distinguished from quantum- mechanical models (sets of equations) that specify what is desired of the instruments. Results include: (1) a formulation of quantum mechanics adapted to computer- controlled instruments; (2) a lower bound on the precision of unitary transforms required for quantum searching and a lower bound on sample size needed to show that instruments implement a desired model at that precision; (3) a lower bound on precision of timing required of a CPC in directing instruments; (4) a demonstration that guesswork is necessary in ratcheting up the precision of commands.
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.
We relate quantum mechanics to the concept of an experimental trial, borrowed from statistics, in order to make clear that devices designed using quantum-mechanical equations require, in effect, management by a classical digital process-control computer (CPC). Energy dissipation essential for tolerance to component imperfections in classical digital computers is shown not to mix with quantum superposition expressed by the quantum dynamics of a Schrodinger equation. This precludes so-called quantum computers from producing super-linear speed-up at a scale large enough to be useful, and at the same clarifies a conceptual separation between digital computing and devices exhibiting quantum phase sensitivity. Quantum effects, such as random-number generation and photon correlations, are know to be useful and show further great potential for devices for computational and other purpose. Several such quantum-based devices are discussed that require or can be made more effective by bridging between these devices and CPCs that manage them. While the interdisciplinary promise of 'quantum computing' has faded, the area of quantum-to- classical bridging, once liberated from the misleading goal of super-linear speed-up, invites vigorous study and invention.
The scope of this work is to provide a self-contained introduction to a selection of basic theoretical aspects in the modeling and control of quantum mechanical systems, as well as a brief survey on the main approaches to control synthesis. While part of the existing theory, especially in the open-loop setting, stems directly from classical control theory (most notably geometric control and optimal control), a number of tools specifically tailored for quantum systems have been developed since the 1980s, in order to take into account their distinctive features: the probabilistic nature of atomic-scale physical systems, the effect of dissipation and the irreversible character of the measurements have all proved to be critical in feedback-design problems. The relevant dynamical models for both closed and open quantum systems are presented, along with the main results on their controllability and stability. A brief review of several currently available control design methods is meant to provide the interested reader with a roadmap for further studies.
This paper presents a general self-guided algorithm for direct laboratory learning of controls to manipulate quantum-mechanical systems. The primary focus is on an algorithm based on the learning of a linear laboratory input–output map from a sequence of controls, and their observed impact on the quantum-mechanical system. This map is then employed in an iterative fashion, to sequentially home in on the desired objective. The objective may be a target state at a final time, or a continuously weighted observational trajectory. The self-guided aspects of the algorithm are based on implementing a cost functional that only contains laboratory-accessible information. Through choice of the weights in this functional, the algorithm can automatically stay within the bounds of each local linear map and indicate when a new map is necessary for additional iterative improvement. Finally, these concepts can be generalized to include the possibility of employing nonlinear maps, as well as just the laboratory control instrument settings, rather than observation of the control itself. An illustrative simulation of the concepts is presented for the control of a four-level quantum system.