On the complexity of unitary transformations

DOI10.1515/156939203322733291MaRDI QIDQ4809642zbMATH OpenOpenAlexFDO

Authors D. Yu. Cherukhin

Publication date 30 August 2004

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/156939203322733291

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A lower bound for Fourier transform computation in a linear model over \(2\times 2\) unitary gates using matrix entropy
• Quantum complexity of permutations
• Publication:3471634
• The arithmetic computational complexity of linear transforms
• An \(\mathrm{Omega}((n \log n)/R)\) lower bound for Fourier transform computation in the \(R\)-well conditioned model

Cited in

(3)

• On complexity of round transformations
• Comparison of unitary transforms
• A lower bound for Fourier transform computation in a linear model over \(2\times 2\) unitary gates using matrix entropy

This page was built for publication: On the complexity of unitary transformations

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