Actual computational time-cost of the Quantum Fourier Transform in a quantum computer using nuclear spins

Simple item page
dc.creatorSaito, A.
dc.creatorKioi, K.
dc.creatorAkagi, Y.
dc.creatorHashizume, N.
dc.creatorOhta, K.
dc.date2000-01-31
dc.date.accessioned2026-07-07T05:59:36Z
dc.date.available2026-07-07T05:59:36Z
dc.descriptionWe found that the actual computational time-cost of the QFT is O(n 2^n) for large n in a quantum computer using nuclear spins. The computational cost of a quantum algorithm has usually been estimated as the sum of the universal gates required in such ideal mathematical models as the Quantum Turing Machine(QTM) and the quantum circuit. This cost is proportional to an actual time-cost in the physical implementation where all quantum operations can be achieved in the same time. However, if the implementation takes a different time for each quantum gate, there is a possibility that the actual time-cost will have a different behavior from the ideal cost. So we estimated the actual time-cost of the QFT in these implementations by considering the gating time. The actual time-cost is drastically different from O(n^2) estimated by complexity analysis.
dc.description4pages, LaTeX2e file
dc.identifierhttps://arxiv.org/abs/quant-ph/0001113
dc.identifierhttp://arxiv.org/abs/quant-ph/0001113
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/88737
dc.subjectQuantum Physics
dc.titleActual computational time-cost of the Quantum Fourier Transform in a quantum computer using nuclear spins
dc.typetext

Files

Collections

arXiv