{"product_id":"synthesis-of-quantum-circuits-vs-synthesis-of-classical-reversible-circuits-9783031798948","title":"Synthesis of Quantum Circuits vs. Synthesis of Classical Reversible Circuits","description":"\u003cp\u003e • Author(s): Alexis de Vos\u003cbr\u003e • Publisher: Springer\u003cbr\u003e • Publisher Imprint: Springer\u003cbr\u003e • BISAC: Electronics - Circuits - General\u003c\/p\u003e\u003cp\u003eAt first sight, quantum computing is completely different from classical computing. Nevertheless, a link is provided by reversible computation.\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e 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( )).\u003cp\u003e\u003c\/p\u003e 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.\u003cp\u003e\u003c\/p\u003e","brand":"Springer","offers":[{"title":"Paperback","offer_id":45280574603415,"sku":"9783031798948","price":4407.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0666\/3471\/1191\/files\/9783031798948.webp?v=1769296704","url":"https:\/\/atlanticbooks.com\/products\/synthesis-of-quantum-circuits-vs-synthesis-of-classical-reversible-circuits-9783031798948","provider":"Atlantic Books","version":"1.0","type":"link"}