A Fully Fault-Tolerant Representation of Quantum Circuits

DOI10.1007/978-3-319-20860-2_9zbMath1464.81023arXiv1509.03962OpenAlexW2256043622MaRDI QIDQ2822503

Kae Nemoto, Ilia Polian, Simon J. Devitt, Alexandru Paler

Publication date: 30 September 2016

Published in: Reversible Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.03962

Mathematics Subject Classification ID

Quantum computation (81P68) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum gates (81P65)

Related Items (1)

Circular CNOT Circuits: Definition, Analysis and Application to Fault-Tolerant Quantum Circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Synthesis and optimization of reversible circuits—a survey
• Quantum Computation and Quantum Information
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Mapping NCV Circuits to Optimized Clifford+T Circuits
• Cross-Level Validation of Topological Quantum Circuits
• The measurement calculus
• Towards a Design Flow for Reversible Logic
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• A single quantum cannot be cloned

This page was built for publication: A Fully Fault-Tolerant Representation of Quantum Circuits