Abstract: The design of efficient quantum circuits is an important issue in quantum computing. It is in general a formidable task to find a highly optimized quantum circuit for a given unitary matrix. We propose a quantum circuit design method that has the following unique feature: It allows to construct efficient quantum circuits in a systematic way by reusing and combining a set of highly optimized quantum circuits. Specifically, the method realizes a quantum circuit for a given unitary matrix by implementing a linear combination of representing matrices of a group, which have known fast quantum circuits. We motivate and illustrate this method by deriving extremely efficient quantum circuits for the discrete Hartley transform and for the fractional Fourier transforms. The sound mathematical basis of this design method allows to give meaningful and natural interpretations of the resulting circuits. We demonstrate this aspect by giving a natural interpretation of known teleportation circuits.
Recommendations
Cites work
- Beyond stabilizer codes .I. Nice error bases
- scientific article; zbMATH DE number 47717 (Why is no real title available?)
- scientific article; zbMATH DE number 610966 (Why is no real title available?)
- Quantum algorithms and the Fourier transform
- Quantum algorithms revisited
- Quantum computations: algorithms and error correction
- Teleportation as a quantum computation.
- The discrete fractional Fourier transform
Cited in
(12)- A characterization of orthogonal permutative matrices of order 4
- The decomposition of an arbitrary \(2^w \times 2^w\) unitary matrix into signed permutation matrices
- The Birkhoff theorem for unitary matrices of prime-power dimension
- Quantum fast Poisson solver: the algorithm and complete and modular circuit design
- Quantum circuits design for evaluating transcendental functions based on a function-value binary expansion method
- Efficient quantum circuits for Toeplitz and Hankel matrices
- The Birkhoff theorem for unitary matrices of arbitrary dimensions
- Design of quantum Fourier transforms and quantum algorithms by using circulant Hamiltonians
- scientific article; zbMATH DE number 1406117 (Why is no real title available?)
- A Birkhoff Connection Between Quantum Circuits and Linear Classical Reversible Circuits
- Software science view on quantum circuit algorithms
- Quantum plug n' play: modular computation in the quantum regime
This page was built for publication: QUANTUM SOFTWARE REUSABILITY
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696938)
