A new universal and fault-tolerant quantum basis
From MaRDI portal
(Redirected from Publication:294808)
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
- scientific article; zbMATH DE number 53165 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1559533 (Why is no real title available?)
- A universal two-bit gate for quantum computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Complexity Theory
- Quantum Computability
- Quantum computational networks
- Quantum computations: algorithms and error correction
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Reliable quantum computers
- Resilient quantum computation: error models and thresholds
Cited in
(31)- Quantum algorithms for algebraic problems
- An approximately universal set consisting of two observables
- Teleportation-based quantum computation, extended Temperley-Lieb diagrammatical approach and Yang-Baxter equation
- Dynamically protected cat-qubits: a new paradigm for universal quantum computation
- A novel fault-tolerant quantum divider and its simulation
- Advanced exact synthesis of Clifford+T circuits
- Nodal free geometric phases: concept and application to geometric quantum computation
- Universal quantum computation via quantum controlled classical operations
- Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
- scientific article; zbMATH DE number 5595797 (Why is no real title available?)
- Finding Optimal Implementations of Non-native CNOT Gates Using SAT
- NONUNITARY QUANTUM CIRCUIT
- MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES
- Quantifying non-stabilizerness via information scrambling
- Analytic methods in quantum computing
- Topological computation without braiding
- A programming language characterizing quantum polynomial time
- Quantum multi-prover interactive proof systems with limited prior entanglement.
- How to Verify a Quantum Computation
- Quantum universality from magic states distillation applied to CSS codes
- A geometric algebra perspective on quantum computational gates and universality in quantum computing
- Constructing arbitrary Steane code single logical qubit fault-tolerant gates
- Group frames via magic states with applications to SIC-POVMs and MUBs
- Universal quantum computation on the power of quantum non-demolition measurements
- Quantum simulation from the bottom up: the case of rebits
- 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
- scientific article; zbMATH DE number 6712184 (Why is no real title available?)
- Algorithms on ensemble quantum computers
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)
