Acceleration of quantum algorithms using three-qubit gates

Simple item page
dc.creatorVartiainen, Juha J.
dc.creatorNiskanen, Antti O.
dc.creatorNakahara, Mikio
dc.creatorSalomaa, Martti M.
dc.date2003-10-28
dc.date2004-03-02
dc.date.accessioned2026-07-07T06:08:11Z
dc.date.available2026-07-07T06:08:11Z
dc.descriptionQuantum-circuit optimization is essential for any practical realization of quantum computation, in order to beat decoherence. We present a scheme for implementing the final stage in the compilation of quantum circuits, i.e., for finding the actual physical realizations of the individual modules in the quantum-gate library. We find that numerical optimization can be efficiently utilized in order to generate the appropriate control-parameter sequences which produce the desired three-qubit modules within the Josephson charge-qubit model. Our work suggests ways in which one can in fact considerably reduce the number of gates required to implement a given quantum circuit, hence diminishing idle time and significantly accelerating the execution of quantum algorithms.
dc.description10 pages, To appear in the International Journal of Quantum Information Vol. 2 Year 2004
dc.identifierhttps://arxiv.org/abs/quant-ph/0310165
dc.identifierhttp://arxiv.org/abs/quant-ph/0310165
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91539
dc.subjectQuantum Physics
dc.titleAcceleration of quantum algorithms using three-qubit gates
dc.typetext

Files

Collections

arXiv