Zobrazeno 1 - 10
of 41
pro vyhledávání: '"David Reeb"'
Publikováno v:
Quantum, Vol 7, p 1001 (2023)
In his solution of Hilbert's 17th problem Artin showed that any positive definite polynomial in several variables can be written as the quotient of two sums of squares. Later Reznick showed that the denominator in Artin's result can always be chosen
Externí odkaz:
https://doaj.org/article/7315e61acb934d3bbcb4c51556c700d6
Publikováno v:
Mathematics, Vol 4, Iss 2, p 38 (2016)
Measurement uncertainty relations are lower bounds on the errors of any approximate joint measurement of two or more quantum observables. The aim of this paper is to provide methods to compute optimal bounds of this type. The basic method is semidefi
Externí odkaz:
https://doaj.org/article/feb65efb001647f283e846cd1779617f
Publikováno v:
New Journal of Physics, Vol 16, Iss 7, p 073033 (2014)
We investigate the problem of quantum searching on a noisy quantum computer. Taking a fault-ignorant approach, we analyze quantum algorithms that solve the task for various different noise strengths, which are possibly unknown beforehand. We prove lo
Externí odkaz:
https://doaj.org/article/661e04eb566f406cb4836753fc13827f
Autor:
David Reeb, Michael M Wolf
Publikováno v:
New Journal of Physics, Vol 16, Iss 10, p 103011 (2014)
Landauerʼs principle relates entropy decrease and heat dissipation during logically irreversible processes. Most theoretical justifications of Landauerʼs principle either use thermodynamic reasoning or rely on specific models based on arguable assu
Externí odkaz:
https://doaj.org/article/04fb3b2b52424102a96f475f0cabc8cc
Publikováno v:
Flynn, H, Reeb, D, Kandemir, M & Peters, J 2022, ' PAC-Bayesian lifelong learning for multi-armed bandits ', Data Mining and Knowledge Discovery, vol. 36, pp. 841-876 . https://doi.org/10.1007/s10618-022-00825-4
We present a PAC-Bayesian analysis of lifelong learning. In the lifelong learning problem, a sequence of learning tasks is observed one-at-a-time, and the goal is to transfer information acquired from previous tasks to new learning tasks. We consider
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12881e4939a36efd00c809cc7859d2ed
http://arxiv.org/abs/2203.03303
http://arxiv.org/abs/2203.03303
Publikováno v:
Machine Learning and Knowledge Discovery in Databases. Research Track ISBN: 9783030865221
ECML/PKDD (3)
ECML/PKDD (3)
The loss surface of an overparameterized neural network (NN) possesses many global minima of zero training error. We explain how common variants of the standard NN training procedure change the minimizer obtained. First, we make explicit how the size
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::426c02078f4c2fc1d738bf061195147c
https://doi.org/10.1007/978-3-030-86523-8_6
https://doi.org/10.1007/978-3-030-86523-8_6
Autor:
Christoph Hirche, David Reeb
Publikováno v:
ISIT
"Bounds on information combining" are entropic inequalities that determine how the information (entropy) of a set of random variables can change when these are combined in certain prescribed ways. Such bounds play an important role in classical infor
Publikováno v:
Linear Algebra and its Applications
Linear Algebra and its Applications, Elsevier, 2015, 469, pp.276-304. ⟨10.1016/j.laa.2014.11.031⟩
Linear Algebra and its Applications, Elsevier, 2015, 469, pp.276-304. ⟨10.1016/j.laa.2014.11.031⟩
We study the problem of whether all bipartite quantum states having a prescribed spectrum remain positive under the reduction map applied to one subsystem. We provide necessary and sufficient conditions, in the form of a family of linear inequalities
Publikováno v:
Mathematics; Volume 4; Issue 2; Pages: 38
Mathematics 4 (2016), Nr. 2
BASE-Bielefeld Academic Search Engine
Mathematics, Vol 4, Iss 2, p 38 (2016)
Mathematics 4 (2016), Nr. 2
BASE-Bielefeld Academic Search Engine
Mathematics, Vol 4, Iss 2, p 38 (2016)
Measurement uncertainty relations are lower bounds on the errors of any approximate joint measurement of two or more quantum observables. The aim of this paper is to provide methods to compute optimal bounds of this type. The basic method is semidefi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::672e86fd17873e2956926f932e9fabb1
Autor:
Stephen D. H. Hsu, David Reeb
Publikováno v:
Modern Physics Letters A. 24:1875-1887
We review the construction of monsters in classical general relativity. Monsters have finite ADM mass and surface area, but potentially unbounded entropy. From the curved space perspective they are objects with large proper volume that can be glued o