P. Wocjan

A simple PromiseBQP-complete matrix problem (2008)

Dominik Janzing, Pawel Wocjan, D. Janzing, P. Wocjan

Abstract: Let A be a real symmetric matrix of size N such that the number of non-zero entries in each row is polylogarithmic in N and the positions and the values of these entries are specified by an...

A Single-shot Measurement of the Energy of Product States in a Translation Invariant Spin Chain Can Replace Any Quantum Computation (2008)

Janzing, D., Wocjan, P., Zhang, S.

In measurement-based quantum computation, quantum algorithms are implemented via sequences of measurements. We describe a translationally invariant finite-range interaction on a one-dimensional qudit...

Simulating Arbitrary Pair-Interactions by a Given Hamiltonian: Graph-Theoretical Bounds on the Time Complexity (2001)

Wocjan, P., Janzing, D., Beth, Th.

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 mathematically equivalent to...