Reduced space-time and time costs Ising dislocation codes and arbitrary ancillas

  title={Reduced space-time and time costs Ising dislocation codes and arbitrary ancillas},
  author={Matthew B. Hastings and Alan Geller},
  journal={Quantum Inf. Comput.},
  • M. Hastings, A. Geller
  • Published 1 August 2014
  • Computer Science, Mathematics, Physics
  • Quantum Inf. Comput.
We propose two distinct methods of improving quantum computing protocols based on surface codes. First, we analyze the use of dislocations instead of holes to produce logical qubits, potentially reducing spacetime volume required. Dislocations[8, 9] induce defects which, in many respects, behave like Majorana quasi-particles. We construct circuits to implement these codes and present fault-tolerant measurement methods for these and other defects which may reduce spatial overhead. One advantage… 
Braiding by Majorana tracking and long-range CNOT gates with color codes
Color-code quantum computation seamlessly combines Majorana-based hardware with topological error correction. Specifically, as Clifford gates are transversal in two-dimensional color codes, they
Fault-tolerant quantum gates with defects in topological stabilizer codes
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. Here, we explore the potential and limitations of such schemes in
The surface code with a twist
A patch-based encoding involving a modified twist of defect-based logical encodings of a new variety called twists is investigated, and the smallest triangle code can demonstrate high-pseudothreshold fault-tolerance to depolarizing noise using just 13 physical qubits.
Fault-tolerant Quantum Computation with Realistic Error Models
A novel scheme for fault-tolerant quantum computation with Rydberg atoms is presented, which uses topological error correction codes to provide fault-Tolerance and electromagnetically induced transparency to perform entangling gates between qubits.
Poking holes and cutting corners to achieve Clifford gates with the surface code
It is shown how all of the Clifford gates can be implemented with the planar code without loss of distance using code deformations, thus offering an attractive alternative to ancilla-mediated schemes to complete the Clifford group with lattice surgery.
Quantum computing with Majorana fermion codes
We establish a unified framework for Majorana-based fault-tolerant quantum computation with Majorana surface codes and Majorana color codes. All logical Clifford gates are implemented with zero time
The boundaries and twist defects of the color code and their applications to topological quantum computation
This work builds upon the abstract theory of boundaries and domain walls of topological phases of matter to comprehensively catalog the objects realizable in color codes and provides lattice representations of these objects which include three new types of boundaries as well as a generating set for all 72 color code twist defects.
The XZZX surface code
Focusing on the common situation where qubit dephasing is the dominant noise, a variant of the surface code—the XZZX code—is shown to have remarkable performance for fault-tolerant quantum computation and the error threshold matches what can be achieved with random codes for every single-qubit Pauli noise channel.
Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
We present a planar surface-code-based scheme for fault-tolerant quantum computation which eliminates the time overhead of single-qubit Clifford gates, and implements long-range multi-target CNOT
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
The cost of factoring integers and computing discrete logarithms in finite fields on a quantum computer is significantly reduced by combining techniques from Shor 1994, Griffiths-Niu 1996, Zalka 2006, Fowler 2012, Eker 2017, and Gidney-Fowler 2019.


Simulating chemistry efficiently on fault-tolerant quantum computers
Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. Here we consider methods to make proposed
Fault-tolerant renormalization group decoder for abelian topological codes
The 3D generalization of a renormalization group decoding algorithm for topological codes with Abelian anyonic excitations inherits many properties of the 2D algorithm, including a complexity linear in the space-time volume of the memory, which can be parallelized to logarithmic time.
Surface codes: Towards practical large-scale quantum computation
This article provides an introduction to surface code quantum computing. We first estimate the size and speed of a surface code quantum computer. We then introduce the concept of the stabilizer,
Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
We describe two implementations of the optimal error correction algorithm known as the maximum likelihood decoder (MLD) for the 2D surface code with a noiseless syndrome extraction. First, we show
A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
An efficient protocol for distilling other nonstabilizer states that requires only Clifford operations, measurement, and magic states is proposed, efficiently and fault-tolerantly implementing arbitrary, non-Clifford, single-qubit rotations in, on average, constant online circuit depth and polylogarithmic offline resource cost.
Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages)
We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state |0>, and qubit measurement in the computational basis.
Measurement-only topological quantum computation without forced measurements
We investigate themeasurement-only topological quantum computation (MOTQC) approach proposed by Bonderson et al (2008 Phys. Rev. Lett. 101 010501)where the braiding operation is shown to be
Improving quantum algorithms for quantum chemistry
Improvements to the standard Trotter-Suzuki based algorithms used in the simulation of quantum chemistry on a quantum computer by modifying how Jordan-Wigner transformations are implemented to reduce their cost from linear or logarithmic in the number of orbitals to a constant.
Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits.
Repeat-until-success: non-deterministic decomposition of single-qubit unitaries
An algorithm based on RUS circuits is constructed that approximates an arbitrary single-qubit Z-axis rotation to within distance e, where the number of T gates scales as 1:26 log2(1/e) - 3:53, an improvement of roughly three-fold over state-of-the-art techniques.