Synthesis of quantum circuits vs. synthesis of classical reversible circuits /
| Main Authors: | , , |
|---|---|
| Corporate Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
[San Rafael, California] :
Morgan & Claypool,
2018.
|
| Series: | Synthesis digital library of engineering and computer science.
Synthesis lectures on digital circuits and systems ; # 54. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book (PDF) |
| Abstract: | At first sight, quantum computing is completely different from classical computing. Nevertheless, a link is provided by reversible computation. Whereas an arbitrary quantum circuit, acting on w qubits, is described by an n x n unitary matrix with n = 2w, a reversible classical circuit, acting on w bits, is described by a 2w x 2w permutation matrix. The permutation matrices are studied in group theory of finite groups (in particular the symmetric group Sn); the unitary matrices are discussed in group theory of continuous groups (a.k.a. Lie groups, in particular the unitary group U(n)). Both the synthesis of a reversible logic circuit and the synthesis of a quantum logic circuit take advantage of the decomposition of a matrix: the former of a permutation matrix, the latter of a unitary matrix. In both cases the decomposition is into three matrices. In both cases the decomposition is not unique. |
|---|---|
| Item Description: | Part of: Synthesis digital library of engineering and computer science. |
| Physical Description: | 1 online resource (xv, 109 pages) : illustrations. Also available in print. |
| Format: | Mode of access: World Wide Web. System requirements: Adobe Acrobat Reader. |
| Bibliography: | Includes bibliographical references (pages 99-104) and index. |
| ISBN: | 9781681733807 |
| ISSN: | 1932-3174 ; |
| DOI: | 10.2200/S00856ED1V01Y201805DCS054 |
| Access: | Abstract freely available; full-text restricted to subscribers or individual document purchasers. |