12 citations · 37 across the 8 of their papers we have counts for
14 papers
New Construction of Mutually Unbiased Bases in Square Dimensions
Pawel Wocjan, Thomas Beth
We show that k=w+2 mutually unbiased bases can be constructed in any square dimension d=s^2 provided that there are w mutually orthogonal Latin squares of order s. The construction…
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…
Estimating mixing properties of local Hamiltonian dynamics and continuous quantum random walks is PSPACE-hard
Pawel Wocjan
A major topic of (classical) ergodic theory is to examine qualitatively how the phase space of dynamical systems is penetrated by the orbits of their dynamics. We consider interact…
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…
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…