Uncomputability and complexity of quantum control
Abstract In laboratory and numerical experiments, physical quantities are known with a finite precision and described by rational numbers. Based on this, we deduce that quantum control problems both for open and closed systems are in general not algorithmically solvable, i.e., there is no algorithm...
Main Authors: | Denys I. Bondar, Alexander N. Pechen |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Publishing Group
2020-01-01
|
Series: | Scientific Reports |
Online Access: | https://doi.org/10.1038/s41598-019-56804-1 |
Similar Items
-
Uncomputability of phase diagrams
by: Johannes Bausch, et al.
Published: (2021-01-01) -
Uncomputability of the Bolzano–Weierstrass theorem
by: Bo-Lin Chen, et al.
Published: (2016) -
Uncomputable Numbers and the Limits of Coding in Computer Science
Published: (2020-05-01) -
Agent Inaccessibility as a Fundamental Principle in Quantum Mechanics: Objective Unpredictability and Formal Uncomputability
by: Jan Walleczek
Published: (2018-12-01) -
The topological entropy of iterated piecewise affine maps is uncomputable
by: Pascal Koiran
Published: (2001-12-01)