13 citations · 42 across the 9 of their papers we have counts for
Showing 2002Show all
3 papers · 1 filter
cs.LG2002
Required sample size for learning sparse Bayesian networks with many variables
Pawel Wocjan, Dominik Janzing, Thomas Beth
Learning joint probability distributions on n random variables requires exponential sample size in the generic case. Here we consider the case that a temporal (or causal) order of…
quant-ph2002
Bounds on the number of time steps for simulating arbitrary interaction graphs
Dominik Janzing, Pawel Wocjan, Thomas Beth
In previous papers we have considered mutual simulation of n-partite pair-interaction Hamiltonians. We have focussed on the running time overhead of general simulations, while cons…
quant-ph2002
Are there quantum bounds on the recyclability of clock signals in low power computers?
Dominik Janzing, Thomas Beth
Even if a logical network consists of thermodynamically reversible gate operations, the computation process may have high dissipation rate if the gate implementation is controlled…