An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity

DOI10.1016/J.ENTCS.2008.12.007zbMath1262.68042OpenAlexW2090613783MaRDI QIDQ4918005

Willem L. Fouché

Publication date: 3 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.007

zbMATH Keywords

computable representationsSolovay-Kitaev theoremlarge quantum circuits

Mathematics Subject Classification ID

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

Related Items (1)

Solovay-Kitaev approximations of special orthogonal matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universality and programmability of quantum computers
• New Decidable Fields of Algebraic Numbers
• Universality in quantum computation
• Computable Algebra, General Theory and Theory of Computable Fields
• Computable Fields and Arithmetically Definable Ordered Fields

This page was built for publication: An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity