Quantum circuits synthesis using Householder transformations

DOI10.1016/j.cpc.2019.107001WikidataQ126801349 ScholiaQ126801349MaRDI QIDQ2698830

Cyril Allouche, Marc Baboulin, Benoît Valiron, Timothée Goubault de Brugière

Publication date: 25 April 2023

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.07710

zbMATH Keywords

quantum computing; QR factorization; Householder transformations; quantum circuit synthesis; multicore and GPU computing

Mathematics Subject Classification ID

68-XX: Computer science

81-XX: Quantum theory

Related Items

A Birkhoff Connection Between Quantum Circuits and Linear Classical Reversible Circuits

Uses Software

• LAPACK
• MKL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• LAPACK
• Towards dense linear algebra for hybrid GPU accelerated manycore systems
• Computing the complete CS decomposition
• The ubiquitous Kronecker product
• A Storage-Efficient $WY$ Representation for Products of Householder Transformations
• LAPACK Users' Guide
• The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• The computation of elementary unitary matrices
• On the role of entanglement in quantum-computational speed-up
• A Basis-Kernel Representation of Orthogonal Matrices
• Universality in quantum computation
• A universal two-bit gate for quantum computation
• The canonical coset decomposition of unitary matrices through Householder transformations