An algorithmic construction of quantum circuits of high descriptive complexity

DOI10.1016/J.ENTCS.2008.12.007zbMATH Open1262.68042OpenAlexW2090613783MaRDI QIDQ4918005FDOQ4918005

Authors: Willem Louw 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

Recommendations

• The Solovay--Kitaev algorithm
• Efficient Universal Quantum Circuits
• scientific article
• Efficient discrete approximations of quantum gates
• ALGORITHMIC COMPLEXITY OF QUANTUM STATES

zbMATH Keywords

computable representationsSolovay-Kitaev theoremlarge quantum circuits

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Computable Algebra, General Theory and Theory of Computable Fields
• New Decidable Fields of Algebraic Numbers
• The Solovay--Kitaev algorithm
• A geometric approach to quantum circuit lower bounds
• Universality in quantum computation
• Computable Fields and Arithmetically Definable Ordered Fields
• Universality and programmability of quantum computers

Cited In (8)

• Optimal ancilla-free Pauli+V circuits for axial rotations
• Efficient algebraic representation of quantum circuits
• Solovay-Kitaev approximations of special orthogonal matrices
• Title not available (Why is that?)
• Efficient discrete approximations of quantum gates
• Efficient Universal Quantum Circuits
• Efficient quantum algorithms to construct arbitrary Dicke states
• The Solovay--Kitaev algorithm

This page was built for publication: An algorithmic construction of quantum circuits of high descriptive complexity

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