Abstract
The gate array version of quantum computation uses logical gates adopting convenient forms for computational algorithms based on the algorithms classical computation. Two-level quantum systems are the basic elements connecting the binary nature of classical computation with the settlement of quantum processing. Despite this, their design depends on specific quantum systems and the physical interactions involved, thus complicating the dynamics analysis. Predictable and controllable manipulation should be addressed in order to control the quantum states in terms of the physical control parameters. Resources are restricted to limitations imposed by the physical settlement. This work presents a formalism to decompose the quantum information dynamics in S U ( 2 2 d ) for 2 d -partite two-level systems into 2 2 d − 1 S U ( 2 ) quantum subsystems. It generates an easier and more direct physical implementation of quantum processing developments for qubits. Easy and traditional operations proposed by quantum computation are recovered for larger and more complex systems. Alternating the parameters of local and non-local interactions, the procedure states a universal exchange semantics on the basis of generalized Bell states. Although the main procedure could still be settled on other interaction architectures by the proper selection of the basis as natural grammar, the procedure can be understood as a momentary splitting of the 2 d information channels into 2 2 d − 1 pairs of 2 level quantum information subsystems. Additionally, it is a settlement of the quantum information manipulation that is free of the restrictions imposed by the underlying physical system. Thus, the motivation of decomposition is to set control procedures easily in order to generate large entangled states and to design specialized dedicated quantum gates. They are potential applications that properly bypass the general induced superposition generated by physical dynamics.
Subject
General Physics and Astronomy
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献