activity
20002004
most citedSynchronizing quantum clocks with classical one-way communication: Bounds on the generated entropy

13 citations · 38 across the 9 of their papers we have counts for

collaborators
Showing 2003 · quant-phShow all

7 papers · 2 filters

quant-ph2003

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…

quant-ph200312 cited

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…

quant-ph200313 cited

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…

quant-ph2003

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…

quant-ph20037 cited

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…

quant-ph2003

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…