A comparative study of optical parallel computers working in quantum and classical modes Conference Paper uri icon

abstract

  • A model of parallel optical computer for Fourier transform tasks is built. The computer operates in both quantum and classical modes. The quantum computer (QC) works with entangled photons and the input gates are n-qubit sensitive, while the classical computer (CC) operates without entanglement. The information capacity (I) for both CC and QC is given as a function of number of qubits and Np(number of photons per input pixel). It is shown that the information capacity significantly increases for the quantum computer compared to the classical one as the number of qubits is increased, assuming that Npis constant for both the QC and CC, i.e. same amount of energy input is assumed for the computers. However, it is also pointed out that the complexity of the QC significantly increases, too. To quantify this, we introduce a new physical quantity called physical complexity (noted as Q). We define the physical complexity (Q) of a computer as i,klog2nkaiwhere k runs over all the gates/elements in the computer; naiis the number of distinguishable states what a gate can set for ai. For QC aiis defined as the ithcoefficient of the wave function. For CC it as the ithindependent component of the Fourier transform of the energy flow what a particular gate is able to control. By using this definition we show that, for both the quantum and classical computers built in this work, I Q, in other words the information capacity is less or equal than the physical complexity. Intuitively we suggest that this is a general law that is valid for every computer irrespectively of type, quantum or classic, and architecture.

name of conference

  • Noise and Information in Nanoelectronics, Sensors, and Standards

published proceedings

  • Proceedings of SPIE

author list (cited authors)

  • Heszler, P., & Kish, L. B.

citation count

  • 1

complete list of authors

  • Heszler, Peter||Kish, Laszlo B

editor list (cited editors)

  • Kish, L. B., Green, F., Iannaccone, G., & Vig, J. R.

publication date

  • January 2003