Synthesis of Quantum Circuits vs. Synthesis of Classical Reversible Circuits
- Indbinding:
- Paperback
- Sideantal:
- 128
- Udgivet:
- 3. Juli 2018
- Størrelse:
- 191x8x235 mm.
- Vægt:
- 255 g.
- 2-3 uger.
- 9. Oktober 2024
På lager
Normalpris
Abonnementspris
- Rabat på køb af fysiske bøger
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding
Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding
Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.
Beskrivelse af Synthesis of Quantum Circuits vs. Synthesis of Classical Reversible Circuits
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.
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.
Brugerbedømmelser af Synthesis of Quantum Circuits vs. Synthesis of Classical Reversible Circuits
Giv din bedømmelse
For at bedømme denne bog, skal du være logget ind.Andre købte også..
Find lignende bøger
Bogen Synthesis of Quantum Circuits vs. Synthesis of Classical Reversible Circuits findes i følgende kategorier:
- Business og læring > Computer og IT
- Teknologi, ingeniørvidenskab og landbrug > Teknologi: generelle emner > Ingeniørvidenskab: generelt
- Teknologi, ingeniørvidenskab og landbrug > Elektronik og kommunikationsteknik > Elektronik teknik > Elektronik: kredse og komponenter
- Teknologi, ingeniørvidenskab og landbrug > Elektronik og kommunikationsteknik > Elektronik teknik > Automatisk styringsteknik og reguleringsteknik
- Databehandling og informationsteknologi > Computere og hardware
© 2024 Pling BØGER Registered company number: DK43351621