13 citations · 38 across the 9 of their papers we have counts for
6 papers · 1 filter
Quasi-order of clocks and synchronism and quantum bounds for copying timing information
Dominik Janzing, Thomas Beth
The statistical state of any (classical or quantum) system with non-trivial time evolution can be interpreted as the pointer of a clock. The quality of such a clock is given by the…
Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices
Pawel Wocjan, Dominik Janzing, Thomas Beth
A lower bound on the chromatic number of a graph is derived by majorization of spectra of weighted adjacency matrices. These matrices are given by Hadamard products of the adjacenc…
Quantum algorithm for finding periodicities in the spectrum of a black-box Hamiltonian or unitary transformation
Dominik Janzing, Thomas Beth
Estimating the eigenvalues of a unitary transformation U by standard phase estimation requires the implementation of controlled-U-gates which are not available if U is only given a…
Quantum algorithm for measuring the energy of n qubits with unknown pair-interactions
Dominik Janzing
The well-known algorithm for quantum phase estimation requires that the considered unitary is available as a conditional transformation depending on the quantum state of an ancilla…
On Using Quantum Protocols to Detect Traffic Analysis
Rainer Steinwandt, Dominik Janzing, Thomas Beth
We consider the problem of detecting whether an attacker measures the amount of traffic sent over a communication channel-possibly without extracting information about the transmit…
Simulating Arbitrary Pair-Interactions by a Given Hamiltonian: Graph-Theoretical Bounds on the Time Complexity
P. Wocjan, D. Janzing, Th. Beth
We use an n-spin system with permutation symmetric zz-interaction for simulating arbitrary pair-interaction Hamiltonians. The calculation of the required time overhead is mathemati…