On Friday October 17, this site was moved to a new server, https://mw.hh.se. The original address will continue to work. Whithin a week or two this site will return to the original address. /Peo HH IT-dep
WG11/M23Johnson: Difference between revisions
From WG 2.11
Jump to navigationJump to search
Created page with "A quantum computer is a collection of n qubits, which form a basis for a complex vector space of dimension 2^n. A quantum computation can be viewed as a Unitary matrix acting..." |
(No difference)
|
Latest revision as of 18:43, 24 March 2024
A quantum computer is a collection of n qubits, which form a basis for a complex vector space of dimension 2^n. A quantum computation can be viewed as a Unitary matrix acting on the qubits. Quantum algorithms correspond to factorizations of unitary matrices into a sequence of gates (often 2x2 or 4x4 unitary matrices). Algorithms can be derived by factoring a given unitary matrix, or a family of matrices, into a product of gates. Alternative factorizations provide algorithmically equivalent choices which can have different costs. In this talk, we derive factorizations of the Discrete Fourier Transform (DFT) matrix into a product of gates and formally verify that the mapping to gates is correct using the Coq proof assistant.
