Unitary transformations for quantum computing
No Thumbnail Available
Journal Title
Journal ISSN
Volume Title
Doctoral thesis (article-based)
Checking the digitized thesis and permission for publishing
Instructions for the author
Instructions for the author
Unless otherwise stated, all rights belong to the author. You may download, display and print this publication for Your own personal use. Commercial use is prohibited.
Author
Date
2005-04-08
Major/Subject
Mcode
Degree programme
Language
en
Pages
56, [46]
Series
TKK dissertations, 3
Abstract
The last two decades have seen an enormous increase in the computational power of digital computers. This was due to the rapid technical development in manufacturing processes and controlling semiconducting structures on submicron scale. Concurrently, the electric circuits have encountered the first signs of the realm of quantum mechanics. Those effects may induce noise and thus they are typically considered harmful. However, the manipulation of the coherent quantum states might turn out be the basis of powerful computers – quantum computers. There, the computation is encoded into the unitary time evolution of a quantum mechanical state vector. Eventually, quantum mechanics could enable one, for example, to read secret electronic messages which are encrypted by the widely employed RSA cryptosystem – a task which is extremely laborious for the current digital computers. This thesis presents a theoretical study of the coherent manipulations of pure quantum states in a quantum register, that is, quantum algorithms. An implementation of a quantum algorithm involves the initialization of the input state and its manipulation with quantum gates followed by the measurements. The physical implementation of each gate requires that it is decomposed into low-level gates whose physical realizations are explicitly known. Here, the problem is examined from two directions. Firstly, the numerical optimization scheme for controlling time-evolution of a closed quantum system is discussed. This yields a method for implementing quantum gates acting on up to three quantum bits, qubits. The approach is independent of the physical realization of the quantum computer, but it is considered explicitly for a proposed inductively coupled Josephson charge qubit register. Secondly, the techniques of numerical matrix computation are utilized to find a general method for decomposing an arbitrary n-qubit gate into a sequence of elementary gates, which act on one or two qubits. The results of this thesis help to improve the implementation of quantum algorithms. The quantum circuit construction developed in the thesis is the first one to achieve the asymptotically minimal complexity in the number of elementary gates. In context of acceleration of quantum algorithms we present a gate-level study of Shor's algorithm and show how to accelerate the algorithm by merging several elementary gates into multiqubit gates. Finally, the requirements set by the resulting gate array are compared to the properties of superconducting qubits. This allows us to discuss the feasibility of the Josephson charge qubit register, for instance, as hardware for breaking the RSA cryptosystem.Description
Keywords
quantum computing, unitary transformations, gate decompositions
Other note
Parts
- A. O. Niskanen, J. J. Vartiainen, and M. M. Salomaa. 2003. Optimal multiqubit operations for Josephson charge qubits. Physical Review Letters 90 (19), 197901. [article1.pdf] © 2003 American Physical Society. By permission.
- J. J. Vartiainen, A. O. Niskanen, M. Nakahara, and M. M. Salomaa. 2004. Acceleration of quantum algorithms using three-qubit gates. International Journal of Quantum Information 2 (1), pages 1-10. [article2.pdf] © 2004 World Scientific Publishing Company. By permission.
- J. J. Vartiainen, A. O. Niskanen, M. Nakahara, and M. M. Salomaa. 2004. Implementing Shor's algorithm on Josephson charge qubits. Physical Review A 70 (1), 012319. [article3.pdf] © 2004 American Physical Society. By permission.
- J. J. Vartiainen, M. Möttönen, and M. M. Salomaa. 2004. Efficient decomposition of quantum gates. Physical Review Letters 92 (17), 177902. [article4.pdf] © 2004 American Physical Society. By permission.
- M. Möttönen, J. Vartiainen, V. Bergholm, and M. M. Salomaa. 2004. Quantum circuits for general multiqubit gates. Physical Review Letters 93 (13), 130502. [article5.pdf] © 2004 American Physical Society. By permission.
- M. Möttönen, J. J. Vartiainen, V. Bergholm, and M. M. Salomaa. Transformation of quantum states using uniformly controlled rotations. Quantum Information and Computation, submitted for publication. Preprint: quant-ph/0407010.
- V. Bergholm, J. J. Vartiainen, M. Möttönen, and M. M. Salomaa. Quantum circuits with uniformly controlled one-qubit gates. Physical Review A, accepted for publication. Preprint: quant-ph/0410066.
