A new universal and fault-tolerant quantum basis
From MaRDI portal
Publication:294808
DOI10.1016/S0020-0190(00)00084-3zbMATH Open1338.68072OpenAlexW2159673235MaRDI QIDQ294808FDOQ294808
Authors: P. Oscar Boykin, Tal Mor, Matthew Pulver, Farrokh Vatan, Vwani 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
Recommendations
- scientific article; zbMATH DE number 5595797
- A Fully Fault-Tolerant Representation of Quantum Circuits
- Fault-tolerant quantum computation with higher-dimensional systems
- Fault-Tolerant Quantum Computation with Constant Error Rate
- Universal fault tolerant quantum computation on bilinear nearest neighbor arrays
- Fault-tolerant quantum computation by anyons
- Universal quantum computation in a hidden basis
- scientific article; zbMATH DE number 1559533
- Fault-tolerant quantum computation with non-binary systems
- Beyond Single-Shot Fault-Tolerant Quantum Error Correction
Cites Work
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Computability
- Quantum computational networks
- Reliable quantum computers
- Quantum computations: algorithms and error correction
- Quantum Complexity Theory
- Title not available (Why is that?)
- Resilient quantum computation: error models and thresholds
- Title not available (Why is that?)
- A universal two-bit gate for quantum computation
Cited In (31)
- An approximately universal set consisting of two observables
- Dynamically protected cat-qubits: a new paradigm for universal quantum computation
- Teleportation-based quantum computation, extended Temperley-Lieb diagrammatical approach and Yang-Baxter equation
- A novel fault-tolerant quantum divider and its simulation
- Advanced exact synthesis of Clifford+T circuits
- Universal quantum computation via quantum controlled classical operations
- Nodal free geometric phases: concept and application to geometric quantum computation
- Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
- Finding Optimal Implementations of Non-native CNOT Gates Using SAT
- Title not available (Why is that?)
- NONUNITARY QUANTUM CIRCUIT
- MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES
- Quantifying non-stabilizerness via information scrambling
- Topological computation without braiding
- Analytic methods in quantum computing
- A programming language characterizing quantum polynomial time
- How to Verify a Quantum Computation
- Quantum multi-prover interactive proof systems with limited prior entanglement.
- Quantum universality from magic states distillation applied to CSS codes
- A geometric algebra perspective on quantum computational gates and universality in quantum computing
- Group frames via magic states with applications to SIC-POVMs and MUBs
- Constructing arbitrary Steane code single logical qubit fault-tolerant gates
- Quantum simulation from the bottom up: the case of rebits
- Universal quantum computation on the power of quantum non-demolition measurements
- Self-testing of universal and fault-tolerant sets of quantum gates
- Quantum teleportation and Birman-Murakami-Wenzl algebra
- A model of discrete quantum computation
- A Fully Fault-Tolerant Representation of Quantum Circuits
- Algorithms on ensemble quantum computers
- Title not available (Why is that?)
- Quantum algorithms for algebraic problems
This page was built for publication: A new universal and fault-tolerant quantum basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294808)
