83 citations · 206 across the 8 of their papers we have counts for
17 papers · 1 filter
Optimal photons for quantum information processing
Peter P. Rohde, Timothy C. Ralph, Michael A. Nielsen
Photonic quantum information processing schemes, such as linear optics quantum computing, and other experiments relying on single-photon interference, inherently require complete p…
The Solovay-Kitaev algorithm
Christopher M. Dawson, Michael A. Nielsen
This pedagogical review presents the proof of the Solovay-Kitaev theorem in the form of an efficient classical algorithm for compiling an arbitrary single-qubit gate into a sequenc…
A geometric approach to quantum circuit lower bounds
Michael A. Nielsen
What is the minimal size quantum circuit required to exactly implement a specified n-qubit unitary operation, U, without the use of ancilla qubits? We show that a lower bound on th…
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…
Lower bounds on the complexity of simulating quantum gates
Andrew M. Childs, Henry L. Haselgrove, Michael A. Nielsen
We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries.…