Quantum circuits synthesis using Householder transformations

DOI10.1016/J.CPC.2019.107001MaRDI QIDQ2698830zbMATH OpenOpenAlexWikidataFDO

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

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

Householder transformationsmulticore and GPU computingQR factorizationquantum circuit synthesisquantum computing

Mathematics Subject Classification ID

Computer science (68-XX) Quantum theory (81-XX)

Recommendations

• Global Synthesis of CNOT Circuits with Holes
• scientific article; zbMATH DE number 5953563
• Synthesis of semi-classical quantum circuits
• Optimal synthesis of linear reversible circuits
• Synthesis of reversible logic quantum circuits

Cites work

• A Basis-Kernel Representation of Orthogonal Matrices
• A Storage-Efficient WY Representation for Products of Householder Transformations
• A universal two-bit gate for quantum computation
• Asymptotically optimal circuits for arbitrary n-qubit diagonal computations
• Computing the complete CS decomposition
• scientific article; zbMATH DE number 5608701 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 845841 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• LAPACK
• LAPACK Users' Guide
• On the role of entanglement in quantum-computational speed-up
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum-walk speedup of backtracking algorithms
• The canonical coset decomposition of unitary matrices through Householder transformations
• The computation of elementary unitary matrices
• The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
• The Solovay--Kitaev algorithm
• The ubiquitous Kronecker product
• Towards dense linear algebra for hybrid GPU accelerated manycore systems
• Universality in quantum computation

Cited in

(9)

• Transformation rules for CNOT-based quantum circuits and their applications
• Optimal ancilla-free Pauli+V circuits for axial rotations
• An FPGA-based quantum circuit emulation framework using heisenberg representation
• scientific article; zbMATH DE number 7559364 (Why is no real title available?)
• A Birkhoff Connection Between Quantum Circuits and Linear Classical Reversible Circuits
• 2-D lossless FIR filter design using synthesis of the paraunitary transfer function matrix
• Improved synthesis of Toffoli-Hadamard circuits
• Global Synthesis of CNOT Circuits with Holes
• Synthesis of quantum circuits based on supervised learning and correlations

Describes a project that uses

Uses Software

• LAPACK
• MKL

This page was built for publication: Quantum circuits synthesis using Householder transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2698830)