Physics – Quantum Physics
Scientific paper
2005-04-14
Ch. 7 in Trends in Quantum Computing Research (NOVA Publishers, New York), 2006
Physics
Quantum Physics
A chapter of a book Quantum Computing: New Research
Scientific paper
Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used to construct any n-qubit gate. In 1995, the universality of the set of one-qubit gates and controlled NOT gate was shown by Barenco et al. using QR decomposition of unitary matrices. Almost ten years later the decomposition was improved to include essentially fewer elementary gates. In addition, the cosine-sine matrix decomposition was applied to efficiently implement decompositions of general quantum gates. In this chapter, we review the different types of general gate decompositions and slightly improve the best known gate count for the controlled NOT gates to (23/48)4^n in the leading order. In physical realizations, the interaction strength between the qubits can decrease strongly as a function of their distance. Therefore, we also discuss decompositions with the restriction to nearest-neighbor interactions in a linear chain of qubits.
Mottonen Mikko
Vartiainen Juha J.
No associations
LandOfFree
Decompositions of general quantum gates does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Decompositions of general quantum gates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decompositions of general quantum gates will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-145955