39 citations · 165 across the 21 of their papers we have counts for
Showing 2006 · quant-phShow all
3 papers · 2 filters
quant-ph2006★ 14 cited
BQP-complete Problems Concerning Mixing Properties of Classical Random Walks on Sparse Graphs
Dominik Janzing, Pawel Wocjan
We describe two BQP-complete problems concerning properties of sparse graphs having a certain symmetry. The graphs are specified by efficiently computable functions which output th…
quant-ph2006★ 3 cited
Estimating diagonal entries of powers of sparse symmetric matrices is BQP-complete
Dominik Janzing, Pawel Wocjan
Let A be a real symmetric matrix of size N such that the number of the non-zero entries in each row is polylogarithmic in N and the positions and the values of these entries are sp…
quant-ph2006★ 20 cited
Entanglement generation via scattering of two particles with hard-core repulsion
Frank Schmüser, Dominik Janzing
We analyse the entanglement generation in a one dimensional scattering process. The two colliding particles have a Gaussian wave function and interact by hard--core repulsion.In ou…