2010 · 105 citations · 19 references
ComputingComputer ScienceComputational GeometryGeometric ModelingQuantum ComputingGeometric TransformationsImage ProcessingQuantum BitsQuantum CircuitsQuantum ComputationQuantum GatesQuantum Circuit TransformationRotationsSwappingToffoli GateTransformations
Circuits to achieve geometric trans- formations including two-point swapping, flip, co- ordinate swapping, orthogonal rotations and their variants on N -sized quantum images are proposed based on the basic quantum gates; NOT, CNOT and Toffoli gates. The complexity of the circuits is O(log 2 N) for two-point swapping and O(logN) for flip, co-ordinate swapping and orthogonal rotations. The results indicate that local operations like two- point swapping are slower than global operations like flip, co-ordinate swapping, and orthogonal rotations in quantum image processing. This is in contrast to performing such operations in classical image process- ing where the local operations are faster. All the proposed transformations are confirmed by simula- tion on a classical computer. With their low com- plexity, these geometric transformations can be used as the major components to build circuits for other applications on quantum images.
19
<i>Quantum Computation and Quantum Information</i>
Michael A. Nielsen, Isaac L. Chuang, Lov K. Grover · American Journal of Physics · 2002 · 22.7K citations
A fast quantum mechanical algorithm for database search
Lov K. Grover · 1996 · 8.6K citations · Full text
Algorithms for quantum computation: discrete logarithms and factoring
Peter W. Shor · 2002 · 8.5K citations
Computing, Computer Science, Physics +12
Simulating physics with computers
Richard P. Feynman · International Journal of Theoretical Physics · 1982 · 7.5K citations
Elementary gates for quantum computation
Adriano Barenco, Charles H. Bennett, Richard Cleve et al. · Physical Review A · 1995 · 4.4K citations · Full text