000			02915nam a2200433 i 4500
999			_c387978 _d387978 _x1
001			387978
003			ES-MaUEC
005			20231212160800.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2018 sz | o |||| 0|eng d
020			_a9783031798955
024	7		_a10.1007/978-3-031-79895-5 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aTK7888.4 _b2018 EB
100	1		_aVos, Alexis de _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9688389
245	1	0	_aSynthesis of Quantum Circuits vs. Synthesis of Classical Reversible Circuits _cby Alexis De Vos, Stijn De Baerdemacker, Yvan Van Rentergem
250			_a1st edition 2018
264		1	_aCham _bSpringer International Publishing _c2018
300			_a1 recurso en línea (XV, 109 páginas)
336			_aTexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aSynthesis Lectures on Digital Circuits & Systems _x1932-3174
505	0		_aAcknowledgments -- Introduction -- Bottom -- Bottom-Up -- Top -- Top-Down -- Conclusion -- Bibliography -- Authors' Biographies -- Index.
520			_aAt 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.
988			_aSynthesis Collection of Technology_2018
650		7	_2embne _9139135 _aCircuitos lógicos
700	1		_aDe Baerdemacker, Stijn _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9688390
700	1		_aVan Rentergem, Yvan _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9688391
776	0	8	_iPrinted edition: _z9783031798962
776	0	8	_iPrinted edition: _z9783031798948
776	0	8	_iPrinted edition: _z9783031798979
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-79895-5 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b05/2023 _dz _eb _zSI