13 citations · 26 across the 6 of their papers we have counts for
6 papers
Ergodic quantum computing
Dominik Janzing, Pawel Wocjan
We propose a (theoretical ;-) model for quantum computation where the result can be read out from the time average of the Hamiltonian dynamics of a 2-dimensional crystal on a cylin…
Reliable and Efficient Inference of Bayesian Networks from Sparse Data by Statistical Learning Theory
Dominik Janzing, Daniel Herrmann
To learn (statistical) dependencies among random variables requires exponentially large sample size in the number of observed random variables if any arbitrary joint probability di…
Quantum circuits for single-qubit measurements corresponding to platonic solids
Thomas Decker, Dominik Janzing, Thomas Beth
Each platonic solid defines a single-qubit positive operator valued measure (POVM) by interpreting its vertices as points on the Bloch sphere. We construct simple circuits for impl…
Measuring 4-local n-qubit observables could probabilistically solve PSPACE
Pawel Wocjan, Dominik Janzing, Thomas Decker +1
We consider a hypothetical apparatus that implements measurements for arbitrary 4-local quantum observables A on n qubits. The apparatus implements the ``measurement algorithm'' af…
Synchronizing quantum clocks with classical one-way communication: Bounds on the generated entropy
Dominik Janzing, Thomas Beth
We describe separable joint states on bipartite quantum systems that cannot be prepared by any thermodynamically reversible classical one-way communication protocol. We argue that…
Two QCMA-complete problems
Pawel Wocjan, Dominik Janzing, Thomas Beth
QMA and QCMA are possible quantum analogues of the complexity class NP. In QCMA the verifier is a quantum program and the proof is classical. In contrast, in QMA the proof is also…