13 citations · 42 across the 9 of their papers we have counts for
7 papers · 2 filters
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…
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…
Cooling and Low Energy State Preparation for 3-local Hamiltonians are FQMA-complete
Dominik Janzing, Pawel Wocjan, Thomas Beth
We introduce the quantum complexity class FQMA. This class describes the complexity of generating a quantum state that serves as a witness for a given QMA problem. In a certain sen…
Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing
Pawel Wocjan, Dominik Janzing, Thomas Beth
We construct a nearest-neighbor Hamiltonian whose ground states encode the solutions to the NP-complete problem INDEPENDENT SET in cubic planar graphs. The Hamiltonian can be easil…
Bounds on the entropy generated when timing information is extracted from microscopic systems
Dominik Janzing, Thomas Beth
We consider Hamiltonian quantum systems with energy bandwidth ΔE and show that each measurement that determines the time up to an error Δt generates at least the entropy (\hbar/(Δt…