A Fully Fault-Tolerant Representation of Quantum Circuits

DOI10.1007/978-3-319-20860-2_9zbMATH Open1464.81023arXiv1509.03962OpenAlexW2256043622MaRDI QIDQ2822503FDOQ2822503

Authors: Alexandru Paler, Ilia Polian, K. Nemoto, Simon J. Devitt 

Publication date: 30 September 2016

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

Abstract: We present a quantum circuit representation consisting entirely of qubit initialisations (I), a network of controlled-NOT gates (C) and measurements with respect to different bases (M). The ICM representation is useful for optimisation of quantum circuits that include teleportation, which is required for fault-tolerant, error corrected quantum computation. The non-deterministic nature of teleportation necessitates the conditional introduction of corrective quantum gates and additional ancillae during circuit execution. Therefore, the standard optimisation objectives, gate count and number of wires, are not well-defined for general teleportation-based circuits. The transformation of a circuit into the ICM representation provides a canonical form for an exact fault-tolerant, error corrected circuit needed for optimisation prior to the final implementation in a realistic hardware model.

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

Recommendations

• scientific article; zbMATH DE number 1559533
• Fault-Tolerant Quantum Computation with Constant Error Rate
• Fault-tolerant quantum computation by anyons
• Fault-tolerant quantum computation with non-binary systems
• scientific article; zbMATH DE number 5595797
• Fault-tolerant quantum computation with higher-dimensional systems
• A new universal and fault-tolerant quantum basis
• A fault-tolerant one-way quantum computer
• Uniformity of quantum circuit families for error-free algorithms
• Fault-tolerant quantum computation for local leakage faults

Mathematics Subject Classification ID

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

Cites Work

• A single quantum cannot be cloned
• The Heisenberg representation of quantum computers
• Quantum computation and quantum information. 10th anniversary edition
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Towards a design flow for reversible logic
• Synthesis and optimization of reversible circuits -- a survey
• An efficient conversion of quantum circuits to a linear nearest neighbor architecture
• The measurement calculus
• Cross-level validation of topological quantum circuits
• Mapping NCV Circuits to Optimized Clifford+T Circuits

Cited In (8)

• Title not available (Why is that?)
• A new universal and fault-tolerant quantum basis
• A novel fault-tolerant quantum divider and its simulation
• Circular CNOT circuits: definition, analysis and application to fault-tolerant quantum circuits
• Title not available (Why is that?)
• Fault-tolerant quantum computation by anyons
• Lattice surgery translation for quantum computation
• Self-testing of universal and fault-tolerant sets of quantum gates

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

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