Implementing the fanout gate by a Hamiltonian

Simple item page
dc.creatorFenner, Stephen A.
dc.date2003-09-23
dc.date.accessioned2026-07-07T06:07:54Z
dc.date.available2026-07-07T06:07:54Z
dc.descriptionWe show that, for even n, evolving n qubits according to a simple Hamiltonian can be used to exactly implement an (n+1)-qubit parity gate, which is equivalent in constant depth to an (n+1)-qubit fanout gate. We also observe that evolving the Hamiltonian for three qubits results in an inversion-on-three-way-equality gate, which together with single-qubit operations is universal for quantum computation.
dc.description6 pages, 6 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0309163
dc.identifierhttp://arxiv.org/abs/quant-ph/0309163
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91454
dc.subjectQuantum Physics
dc.titleImplementing the fanout gate by a Hamiltonian
dc.typetext

Files

Collections

arXiv