01341nas a2200145 4500008004100000245007700041210006900118260001400187490000700201520087300208100002301081700002201104700002501126856004401151 2005 eng d00aUnified derivations of measurement-based schemes for quantum computation0 aUnified derivations of measurementbased schemes for quantum comp c2005/3/170 v713 a 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. Rev. Lett., 86, 5188 (2001)]) uses a fixed
entangled state, adaptive measurements on single qubits, and feedforward of the
measurement results. The second model (proposed by Nielsen [Phys. Lett. A, 308,
96 (2003)] and further simplified by Leung [Int. J. Quant. Inf., 2, 33 (2004)])
uses adaptive two-qubit measurements that can be applied to arbitrary pairs of
qubits, and feedforward of the measurement results. The underlying principle of
our derivations is a variant of teleportation introduced by Zhou, Leung, and
Chuang [Phys. Rev. A, 62, 052316 (2000)]. Our derivations unify these two
measurement-based models of quantum computation and provide significantly
simpler schemes.
1 aChilds, Andrew, M.1 aLeung, Debbie, W.1 aNielsen, Michael, A. uhttp://arxiv.org/abs/quant-ph/0404132v200715nas a2200145 4500008004100000245006300041210006300104260001500167490000700182520026200189100002300451700002600474700002500500856004400525 2003 eng d00aLower bounds on the complexity of simulating quantum gates0 aLower bounds on the complexity of simulating quantum gates c2003/11/180 v683 a 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. We also note that a related lower bound holds for
arbitrary n-qubit gates.
1 aChilds, Andrew, M.1 aHaselgrove, Henry, L.1 aNielsen, Michael, A. uhttp://arxiv.org/abs/quant-ph/0307190v101113nas a2200169 4500008004100000245006000041210006000101260001400161490000700175520059300182100002500775700002500800700002300825700002300848700002800871856004400899 2002 eng d00aUniversal simulation of Hamiltonian dynamics for qudits0 aUniversal simulation of Hamiltonian dynamics for qudits c2002/8/300 v663 a What interactions are sufficient to simulate arbitrary quantum dynamics in a
composite quantum system? Dodd et al. (quant-ph/0106064) provided a partial
solution to this problem in the form of an efficient algorithm to simulate any
desired two-body Hamiltonian evolution using any fixed two-body entangling
N-qubit Hamiltonian, and local unitaries. We extend this result to the case
where the component systems have D dimensions. As a consequence we explain how
universal quantum computation can be performed with any fixed two-body
entangling N-qudit Hamiltonian, and local unitaries.
1 aNielsen, Michael, A.1 aBremner, Michael, J.1 aDodd, Jennifer, L.1 aChilds, Andrew, M.1 aDawson, Christopher, M. uhttp://arxiv.org/abs/quant-ph/0109064v2