Optimal length of decomposition sequences composed of imperfect gates

DOI10.1007/s11128-017-1571-5zbMath1373.81148OpenAlexW2601681897MaRDI QIDQ1679266

Peng Zhang

Publication date: 9 November 2017

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-017-1571-5

zbMATH Keywords

fault tolerancequantum computingquantum error correctionquantum gatesquantum information processingqubitdecomposition sequences

Mathematics Subject Classification ID

Quantum computation (81P68) Other types of codes (94B60)

Cites Work

• Structural stability of the quantum Fourier transform
• Quantum universality from magic states distillation applied to CSS codes
• Handbook of Linear Algebra
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Scalability of Shor’s algorithm with a limited set of rotation gates
• Quantum Computation with Phase Drift Errors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal length of decomposition sequences composed of imperfect gates