Fast Geometric Transformations on Quantum Images.docVIP

IAENG International Journal of Applied Mathematics, 40:3, IJAM_40_3_02 ______________________________________________________________________________________ Fast Geometric Transformations on Quantum Images PhucQ.Le,AbdullahiM.Iliyasu,FangyanDong,KaoruHirota§ ? ? ? Abstract—Circuits formations including two-point swapping, ?ip, co- to achieve geometric trans- on the quantum computation model. These results and theunavoidblyine?cientsimulationofquantumphysics ordinate swapping, orthogonal rotations and their onclassicalcomputers[5]providethesolidevidenceofthe variants on N-sized quantum images are proposed strengthofquantumcomputersoverclassicalones. based on the basic quantum gates; NOT, CNOT and To?oli gates. The complexity of the circuits In quantum circuit models of computation, designing 2 is O(log N) for two-point swapping and O(logN) for ?ip, co-ordinate swapping and orthogonal rotations. tum algorithm. It is well known that any unitary oper- The results indicate that local operations like two- suchcircuitsisnecessarytorealizeandanalyzeanyquan- ation or quantum algorithm can be decomposed into a point swapping are slower than global operations like circuitconsistingasuccessionofbasicunitarygatesthat ?ip, co-ordinate swapping, and orthogonal rotations in quantum image processing. This is in contrast to performingsuchoperationsinclassicalimageprocess- ing where the local operations are faster. All the proposed transformations are con?rmed by simula- tion on a classical computer. With their low com- plexity, these geometric transformations can be used actononeortwoqubitsonly. Manyelementarygatesin- cludingsinglequbitgates,controlled-NOTorCNOTand To?oligatesforquantumcomputationwasintroducedin [1]. Physicalimplementationsofthequbitandthesegates areavailablefrommanyapproaches[14],[15,Chapter7]. One of the most active ?elds in quantum computation andinformationisquantumimageprocessing. Quantum as the major components to build circuits for other appl