TY - GEN
AU - Wecker, Christian
AU - Hoppe, Anna
AU - Schulz, Andreas
AU - Heine, Jens
AU - Bart, Hans-Jörg
AU - Kenig, Eugeny
ID - 16307
TI - Numerische Untersuchungen des Stofftransports in Flüssig-Flüssig-Systemen unter Berücksichtigung der Marangonikonvektion
ER -
TY - JOUR
AU - Gharibian, Sevag
AU - Aldi, Marco
AU - de Beaudrap, Niel
AU - Saeedi, Seyran
ID - 16927
JF - Communications in Mathematical Physics
TI - On efficiently solvable cases of Quantum k-SAT
ER -
TY - GEN
AU - Warner, Daniel
ID - 15770
TI - On the complexity of local transformations in SDN overlays
ER -
TY - CHAP
AU - Yigitbas, Enes
AU - Jovanovikj, Ivan
AU - Sauer, Stefan
AU - Engels, Gregor
ID - 15267
T2 - Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5
TI - On the Development of Context-aware Augmented Reality Applications (to appear)
ER -
TY - JOUR
AU - Kumar Sahoo, Sudhir
AU - Heske, Julian
AU - Azadi, Sam
AU - Zhang, Zhenzhe
AU - V Tarakina, Nadezda
AU - Oschatz, Martin
AU - Z. Khaliullin, Rustam
AU - Antonietti, Markus
AU - D. Kühne, Thomas
ID - 17379
IS - 1
JF - Scientific Reports
TI - On the Possibility of Helium Adsorption in Nitrogen Doped Graphitic Materials
VL - 10
ER -
TY - GEN
AB - We consider an extension of the contextual multi-armed bandit problem, in
which, instead of selecting a single alternative (arm), a learner is supposed
to make a preselection in the form of a subset of alternatives. More
specifically, in each iteration, the learner is presented a set of arms and a
context, both described in terms of feature vectors. The task of the learner is
to preselect $k$ of these arms, among which a final choice is made in a second
step. In our setup, we assume that each arm has a latent (context-dependent)
utility, and that feedback on a preselection is produced according to a
Plackett-Luce model. We propose the CPPL algorithm, which is inspired by the
well-known UCB algorithm, and evaluate this algorithm on synthetic and real
data. In particular, we consider an online algorithm selection scenario, which
served as a main motivation of our problem setting. Here, an instance (which
defines the context) from a certain problem class (such as SAT) can be solved
by different algorithms (the arms), but only $k$ of these algorithms can
actually be run.
AU - El Mesaoudi-Paul, Adil
AU - Bengs, Viktor
AU - Hüllermeier, Eyke
ID - 18017
T2 - arXiv:2002.04275
TI - Online Preselection with Context Information under the Plackett-Luce Model
ER -
TY - CHAP
AU - Nickchen, Tobias
AU - Engels, Gregor
AU - Lohn, Johannes
ID - 18789
SN - 9783030543334
T2 - Industrializing Additive Manufacturing
TI - Opportunities of 3D Machine Learning for Manufacturability Analysis and Component Recognition in the Additive Manufacturing Process Chain
ER -
TY - CONF
AU - Guetttatfi, Zakarya
AU - Kaufmann, Paul
AU - Platzner, Marco
ID - 3583
T2 - Proceedings of the International Workshop on Applied Reconfigurable Computing (ARC)
TI - Optimal and Greedy Heuristic Approaches for Scheduling and Mapping of Hardware Tasks to Reconfigurable Computing Devices
ER -
TY - GEN
AU - Mayer, Stefan
ID - 19999
TI - Optimierung von JMCTest beim Testen von Inter Method Contracts
ER -
TY - CONF
AB - The canonical problem for the class Quantum Merlin-Arthur (QMA) is that of
estimating ground state energies of local Hamiltonians. Perhaps surprisingly,
[Ambainis, CCC 2014] showed that the related, but arguably more natural,
problem of simulating local measurements on ground states of local Hamiltonians
(APX-SIM) is likely harder than QMA. Indeed, [Ambainis, CCC 2014] showed that
APX-SIM is P^QMA[log]-complete, for P^QMA[log] the class of languages decidable
by a P machine making a logarithmic number of adaptive queries to a QMA oracle.
In this work, we show that APX-SIM is P^QMA[log]-complete even when restricted
to more physical Hamiltonians, obtaining as intermediate steps a variety of
related complexity-theoretic results.
We first give a sequence of results which together yield P^QMA[log]-hardness
for APX-SIM on well-motivated Hamiltonians: (1) We show that for NP, StoqMA,
and QMA oracles, a logarithmic number of adaptive queries is equivalent to
polynomially many parallel queries. These equalities simplify the proofs of our
subsequent results. (2) Next, we show that the hardness of APX-SIM is preserved
under Hamiltonian simulations (a la [Cubitt, Montanaro, Piddock, 2017]). As a
byproduct, we obtain a full complexity classification of APX-SIM, showing it is
complete for P, P^||NP, P^||StoqMA, or P^||QMA depending on the Hamiltonians
employed. (3) Leveraging the above, we show that APX-SIM is P^QMA[log]-complete
for any family of Hamiltonians which can efficiently simulate spatially sparse
Hamiltonians, including physically motivated models such as the 2D Heisenberg
model.
Our second focus considers 1D systems: We show that APX-SIM remains
P^QMA[log]-complete even for local Hamiltonians on a 1D line of 8-dimensional
qudits. This uses a number of ideas from above, along with replacing the "query
Hamiltonian" of [Ambainis, CCC 2014] with a new "sifter" construction.
AU - Gharibian, Sevag
AU - Piddock, Stephen
AU - Yirka, Justin
ID - 13226
T2 - Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020)
TI - Oracle complexity classes and local measurements on physical Hamiltonians
ER -