Storing the Quantum Fourier Operator in the QuIDD Data Structure

DOI10.14232/ACTACYB.23.2.2017.5MaRDI QIDQ3133272zbMATH OpenOpenAlexFDO

Authors Katalin Friedl, László Kabódi

Publication date 13 February 2018

Published in Acta Cybernetica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14232/actacyb.23.2.2017.5

zbMATH Keywords

quantum algorithmsquantum Fourier operatorQuIDD

Mathematics Subject Classification ID

Data structures (68P05) Quantum algorithms and complexity in the theory of computing (68Q12)

Recommendations

• On the ``Q in QMDDs: efficient representation of quantum functionality in the QMDD data-structure
• Quantum operation, quantum Fourier transform and semi-definite programming
• Coping with decoherence: parallelizing the quantum Fourier transform
• Quantum arithmetic with the quantum Fourier transform
• scientific article; zbMATH DE number 5320404
• Efficient scheme for optimizing quantum Fourier circuits
• Quantum Fourier transform in computational basis
• Obtaining the quantum Fourier transform from the classical FFT with QR decomposition
• EFFICIENT IMPLEMENTATIONS OF THE QUANTUM FOURIER TRANSFORM: AN EXPERIMENTAL PERSPECTIVE
• Implementation of the semiclassical quantum Fourier transform in a scalable system

Cited in

(2)

• Improved BDD Algorithms for the Simulation of Quantum Circuits
• Improving gate-level simulation of quantum circuits

This page was built for publication: Storing the Quantum Fourier Operator in the QuIDD Data Structure

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