83 citations · 216 across the 9 of their papers we have counts for
Showing 2004 · quant-phShow all
2 papers · 2 filters
quant-ph2004★ 7 cited
Quantum computing and polynomial equations over the finite field Z_2
Christopher M. Dawson, Henry L. Haselgrove, Andrew P. Hines +3
What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily c…
quant-ph2004★ 4 cited
A simple proof of the strong subadditivity inequality
Michael A. Nielsen, Denes Petz
Arguably the deepest fact known about the von Neumann entropy, the strong subadditivity inequality is a potent hammer in the quantum information theorist's toolkit. This short tuto…