Efficient algebraic representation of quantum circuits

DOI10.1080/09720529.2009.10698246MaRDI QIDQ3400283zbMATH OpenOpenAlexFDO

Authors Steven R. Hutsell, Garrison W. Greenwood

Publication date 5 February 2010

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2009.10698246

zbMATH Keywords

quantum simulationquantum logicquantum circuits

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Algebraic and logical emulations of quantum circuits
• Efficient Construction of Functional Representations for Quantum Algorithms
• An algorithmic construction of quantum circuits of high descriptive complexity
• An algebraic quantum circuit compression algorithm for Hamiltonian simulation
• Efficient circuits for exact-universal computation with qudits
• Efficient discrete approximations of quantum gates
• Quantum algorithms for algebraic problems
• The algebraic structure of an approximately universal system of quantum computational gates
• Algebraic Methods in Quantum Informatics
• Efficient quantum circuits for Schur and Clebsch-Gordan transforms

Cites work

• A universal two-bit gate for quantum computation

Cited in

(7)

• Efficient quantum circuit of Proth number modular multiplication
• Algebraic representation of Three Qubit Quantum Circuit Problems
• Generating three-qubit quantum circuits with neural networks
• Some algorithms for calculating unitary matrices for quantum circuits
• Efficient quantum algorithms to construct arbitrary Dicke states
• scientific article; zbMATH DE number 1795877 (Why is no real title available?)
• Research on the decomposition of unitary operators in quantum circuits

This page was built for publication: Efficient algebraic representation of quantum circuits

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