53 citations · 53 across the 1 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2004★ 53 cited
Classical simulatability, entanglement breaking, and quantum computation thresholds
S. Virmani, Susana F. Huelga, Martin B. Plenio
We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modelled classically. This question is useful for providing upper…
quant-ph2003★ 103 cited
Entangled states maximize the two qubit channel capacity for some Pauli channels with memory
C. Macchiavello, G. M. Palma, S. Virmani
We prove that a general upper bound on the maximal mutual information of quantum channels is saturated in the case of Pauli channels with an arbitrary degree of memory. For a subse…