5
votes
2answers
209 views

Classically efficient universal quantum computation (P=BQP) with magic and bound states

$\text P$ vs $\text {BQP}$ is an open question. That is, "can systems which require a polynomial number of qubits in the size of an input be described with only a polynomial number of bits?" If the ...
6
votes
1answer
260 views

partial trace with sparse matrices

Let $\rho_{ABCD}$ be a sparse matrix of 4 systems each in a $d$-dimensional Hilbert space. For $d<7$ in a reasonable time (few seconds) I able to perform the partial trace $\rho_{AD}$ using the ...