13 citations · 42 across the 9 of their papers we have counts for
Showing 2002 · quant-phShow all
2 papers · 2 filters
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…