A new universal and fault-tolerant quantum basis

DOI10.1016/S0020-0190(00)00084-3zbMath1338.68072MaRDI QIDQ294808

P. Oscar Boykin, Matthew Pulver, Farrokh Vatan, Tal Mor, Vwani P. Roychowdhury

Publication date: 16 June 2016

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000843?np=y

zbMATH Keywords

fault tolerance; quantum computation; unitary operation; universal set of gates

Mathematics Subject Classification ID

81P68: Quantum computation

Related Items

Quantum simulation from the bottom up: the case of rebits, How to Verify a Quantum Computation, Finding Optimal Implementations of Non-native CNOT Gates Using SAT, NONUNITARY QUANTUM CIRCUIT, Algorithms on ensemble quantum computers, Teleportation-based quantum computation, extended Temperley-Lieb diagrammatical approach and Yang-Baxter equation, Nodal free geometric phases: concept and application to geometric quantum computation, A geometric algebra perspective on quantum computational gates and universality in quantum computing, Universal quantum computation on the power of quantum non-demolition measurements, Quantum multi-prover interactive proof systems with limited prior entanglement., Quantum teleportation and Birman-Murakami-Wenzl algebra, A model of discrete quantum computation, Analytic methods in quantum computing, Quantum universality from magic states distillation applied to CSS codes, Unnamed Item, SIMPLE SETS OF MEASUREMENTS FOR UNIVERSAL QUANTUM COMPUTATION AND GRAPH STATE PREPARATION, Quantum algorithms for algebraic problems, Topological Computation without Braiding, AN APPROXIMATELY UNIVERSAL SET CONSISTING OF TWO OBSERVABLES, Linear-algebraic λ-calculus: higher-order, encodings, and confluence., MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum computational networks
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Resilient quantum computation: error models and thresholds
• Reliable quantum computers
• Quantum computations: algorithms and error correction
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Computability
• Quantum Complexity Theory
• A universal two-bit gate for quantum computation