Learning optimal quantum models is NP-hard
Physical modeling translates measured data into a physical model. Physical modeling is a major objective in physics and is generally regarded as a creative process. How good are computers at solving this task? Here, we show that in the absence of physical heuristics, the inference of optimal quantum...
Main Author: | Stark, Cyril |
---|---|
Other Authors: | Massachusetts Institute of Technology. Center for Theoretical Physics |
Format: | Article |
Language: | English |
Published: |
American Physical Society
2018
|
Online Access: | http://hdl.handle.net/1721.1/114464 https://orcid.org/0000-0002-7588-6796 |
Similar Items
-
NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
by: Rhonda Au-Yeung, et al.
Published: (2023-02-01) -
Detecting mixed-unitary quantum channels is NP-hard
by: Colin Do-Yan Lee, et al.
Published: (2020-04-01) -
NP-Hardness of the Problem of Optimal Box Positioning
by: Alexei V. Galatenko, et al.
Published: (2019-08-01) -
Cellular Neural Networks for NP-Hard Optimization
by: Mária Ercsey-Ravasz, et al.
Published: (2009-02-01) -
Heuristics for NP-hard optimization problems - simpler is better!?
by: Žerovnik Janez
Published: (2015-11-01)