大葉大學圖書館 |

Synthesis of quantum circuits vs. synthesis of classical reversible circuits[electronic resource] /

紀錄類型:	書目-電子資源 : Monograph/item
杜威分類號:	621.395
書名/作者:	Synthesis of quantum circuits vs. synthesis of classical reversible circuits/ Alexis De Vos, Stijn De Baerdemacker, Yvan Van Rentergem.
作者:	De Vos, Alexis.
其他作者:	De Baerdemacker, Stijn,
出版者:	San Rafael, California : : Morgan & Claypool Publishers,, 2018.
面頁冊數:	1 online resource (127 p.)
標題:	Computers - Circuits.
標題:	Quantum computing.
標題:	Reversible computing.
標題:	Computer Engineering.
ISBN:	168173379X
ISBN:	1681733803
ISBN:	1681733811
ISBN:	9781681733791
ISBN:	9781681733807
ISBN:	9781681733814
書目註:	Includes bibliographical references and index.
內容註:	Synthesis of quantum circuits vs. synthesis of classical reversible circuits -- Abstract; Keywords -- Contents -- Acknowledgments -- Chapter 1: Introduction -- Chapter 2: Bottom -- Chapter 3: Bottom-Up -- Chapter 4: Top -- Chapter 5: Top-Down -- Chapter 6: Conclusion -- Appendix A: Polar Decomposition -- Bibliography -- Authors' Biographies -- Index.
摘要、提要註:	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. 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.
電子資源:	click for full text

Synthesis of quantum circuits vs. synthesis of classical reversible circuits[electronic resource] /
De Vos, Alexis.

Synthesis of quantum circuits vs. synthesis of classical reversible circuits[electronic resource] /Alexis De Vos, Stijn De Baerdemacker, Yvan Van Rentergem. - 1st ed. - San Rafael, California :Morgan & Claypool Publishers,2018. - 1 online resource (127 p.) - Synthesis Lectures on Digital Circuits and Systems ;54.. - Synthesis Lectures on Digital Circuits and Systems ;54..

Includes bibliographical references and index.

Synthesis of quantum circuits vs. synthesis of classical reversible circuits -- Abstract; Keywords -- Contents -- Acknowledgments -- Chapter 1: Introduction -- Chapter 2: Bottom -- Chapter 3: Bottom-Up -- Chapter 4: Top -- Chapter 5: Top-Down -- Chapter 6: Conclusion -- Appendix A: Polar Decomposition -- Bibliography -- Authors' Biographies -- Index.

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. 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.

ISBN: 168173379XSubjects--Topical Terms:

714601
Computers
--Circuits.

LC Class. No.: TK7888.4

Dewey Class. No.: 621.395

Synthesis of quantum circuits vs. synthesis of classical reversible circuits[electronic resource] /
LDR:02595nmm a2200301 i 4500 001 492914
006 m o d
007 cr cn|||||||||
008 210205s2018 cau ob 000 0 eng d
020 $a 168173379X
020 $a 1681733803
020 $a 1681733811
020 $a 9781681733791
020 $a 9781681733807
020 $a 9781681733814
035 $a MCPB0006408
040 $a iG Publishing $b eng $e aacr2 $c iG Publishing
041 0 $a eng
050 0 0 $a TK7888.4
082 0 4 $a 621.395
100 1 $a De Vos, Alexis. $3 714597
245 1 0 $a Synthesis of quantum circuits vs. synthesis of classical reversible circuits $h [electronic resource] / $c Alexis De Vos, Stijn De Baerdemacker, Yvan Van Rentergem.
250 $a 1st ed.
260 $a San Rafael, California : $b Morgan & Claypool Publishers, $c 2018.
300 $a 1 online resource (127 p.)
490 1 $a Synthesis Lectures on Digital Circuits and Systems ; $v 54.
504 $a Includes bibliographical references and index.
505 0 $a Synthesis of quantum circuits vs. synthesis of classical reversible circuits -- Abstract; Keywords -- Contents -- Acknowledgments -- Chapter 1: Introduction -- Chapter 2: Bottom -- Chapter 3: Bottom-Up -- Chapter 4: Top -- Chapter 5: Top-Down -- Chapter 6: Conclusion -- Appendix A: Polar Decomposition -- Bibliography -- Authors' Biographies -- Index.
520 3 $a 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. 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.
650 0 $a Computers $x Circuits. $3 714601
650 0 $a Quantum computing. $3 636174
650 0 $a Reversible computing. $3 652870
650 0 $a Computer Engineering. $3 467301
700 1 $a De Baerdemacker, Stijn, $e author. $3 714598
700 1 $a Van Rentergem, Yvan, $e author. $3 714599
830 0 $a Synthesis Lectures on Digital Circuits and Systems ; $v 54. $3 714600
856 4 0 $u http://portal.igpublish.com/iglibrary/search/MCPB0006408.html $z click for full text