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 ?? qubits, is described by an ?? × ?? unitary matrix with ??=2??, a reversible classical circuit, acting on ?? bits, is described by a 2?? × 2?? permutation matrix. The permutation matrices are studied in group theory of finite groups (in particular the symmetric group ????); the unitary matrices are discussed in group theory of continuous groups (a.k.a. Lie groups, in particular the unitary group U(??)). 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."synopsis" may belong to another edition of this title.
Alexis De Vos is an electrical engineer, physicist, and doctor in applied sciences and graduated from the Universiteit Gent (Belgium). He is currently a part-time professor in the Department of Electronics of the Universiteit Gent. His research is concerned with material science (polymers, semiconductors, metals, liquid crystals), microelectronics (thin films, chips, neural networks, reversible circuits), and energy sciences (thermodynamics, solar energy, endoreversible engines). He is author of the books Thermodynamics of Solar Energy Conversion (Wiley-VCH, 2008) and Reversible Computing (Wiley-VCH, 2010). He designed and produced several prototype integrated circuits for reversible computers such as adders, multipliers, and linear transformers. He currently investigates quantum computing.
"About this title" may belong to another edition of this title.
£ 9.51 shipping from Germany to United Kingdom
Destination, rates & speedsSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 qubits, is described by an × unitary matrix with =2 , a reversible classical circuit, acting on bits, is described by a 2 × 2 permutation matrix. The permutation matrices are studied in group theory of finite groups (in particular the symmetric group ); the unitary matrices are discussed in group theory of continuous groups (a.k.a. Lie groups, in particular the unitary group U( )).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. 128 pp. Englisch. Seller Inventory # 9783031798948
Quantity: 2 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 qubits, is described by an × unitary matrix with =2 , a reversible classical circuit, acting on bits, is described by a 2 × 2 permutation matrix. The permutation matrices are studied in group theory of finite groups (in particular the symmetric group ); the unitary matrices are discussed in group theory of continuous groups (a.k.a. Lie groups, in particular the unitary group U( )).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. Seller Inventory # 9783031798948
Quantity: 1 available
Seller: moluna, Greven, Germany
Condition: New. Seller Inventory # 608130038
Quantity: Over 20 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand. Seller Inventory # 401726712
Quantity: 4 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. 1st edition NO-PA16APR2015-KAP. Seller Inventory # 26394683175
Quantity: 4 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND. Seller Inventory # 18394683181
Quantity: 4 available
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. Neuware -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 qubits, is described by an × unitary matrix with =2 , a reversible classical circuit, acting on bits, is described by a 2 × 2 permutation matrix. The permutation matrices are studied in group theory of finite groups (in particular the symmetric group ); the unitary matrices are discussed in group theory of continuous groups (a.k.a. Lie groups, in particular the unitary group U( )).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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 128 pp. Englisch. Seller Inventory # 9783031798948
Quantity: 2 available