1.5k citations · 11.1k across the 55 of their papers we have counts for
8 papers · 1 filter
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…
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…
Distance measures to compare real and ideal quantum processes
Alexei Gilchrist, Nathan K. Langford, Michael A. Nielsen
With growing success in experimental implementations it is critical to identify a "gold standard" for quantum information processing, a single measure of distance that can be used…
Fault-tolerant quantum computation with cluster states
Michael A. Nielsen, Christopher M. Dawson
The one-way quantum computing model introduced by Raussendorf and Briegel [Phys. Rev. Lett. 86 (22), 5188-5191 (2001)] shows that it is possible to quantum compute using only a fix…
Simulating Hamiltonian dynamics using many-qudit Hamiltonians and local unitary control
Michael J. Bremner, Dave Bacon, Michael A. Nielsen
When can a quantum system of finite dimension be used to simulate another quantum system of finite dimension? What restricts the capacity of one system to simulate another? In this…
Unified derivations of measurement-based schemes for quantum computation
Andrew M. Childs, Debbie W. Leung, Michael A. Nielsen
We present unified, systematic derivations of schemes in the two known measurement-based models of quantum computation. The first model (introduced by Raussendorf and Briegel [Phys…