Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits

• URL: http://arxiv.org/abs/2003.03049v1
• Date: Fri, 6 Mar 2020 06:24:02 GMT
• Title: Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Authors: Christopher Chamberland and Kyungjoo Noh
• Abstract summary: We introduce a new concept which we call redundant ancilla encoding. We show that our scheme can produce magic states using an order of magnitude fewer qubits and space-time overhead.
• Score: 1.2891210250935146
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The overhead cost of performing universal fault-tolerant quantum computation for large scale quantum algorithms is very high. Despite several attempts at alternative schemes, magic state distillation remains one of the most efficient schemes for simulating non-Clifford gates in a fault-tolerant way. However, since magic state distillation circuits are not fault-tolerant, all Clifford operations must be encoded in a large distance code in order to have comparable failure rates with the magic states being distilled. In this work, we introduce a new concept which we call redundant ancilla encoding. The latter combined with flag qubits allows for circuits to both measure stabilizer generators of some code, while also being able to measure global operators to fault-tolerantly prepare magic states, all using nearest neighbor interactions. In particular, we apply such schemes to a planar architecture of the triangular color code family. In addition to our scheme being suitable for experimental implementations, we show that for physical error rates near $10^{-4}$ and under a full circuit-level noise model, our scheme can produce magic states using an order of magnitude fewer qubits and space-time overhead compared to the most competitive magic state distillation schemes. Further, we can take advantage of the fault-tolerance of our circuits to produce magic states with very low logical failure rates using encoded Clifford gates with noise rates comparable to the magic states being injected. Thus, stabilizer operations are not required to be encoded in a very large distance code. Consequently, we believe our scheme to be suitable for implementing fault-tolerant universal quantum computation with hardware currently under development.

Related papers

• Demonstrating real-time and low-latency quantum error correction with superconducting qubits [52.08698178354922]
  We demonstrate low-latency feedback with a scalable FPGA decoder integrated into a superconducting quantum processor. We observe logical error suppression as the number of decoding rounds is increased. The decoder throughput and latency developed in this work, combined with continued device improvements, unlock the next generation of experiments.
  arXiv  Detail & Related papers  (2024-10-07T17:07:18Z)
• Non-local resources for error correction in quantum LDPC codes [0.0]
  Surface code suffers from a low encoding rate, requiring a vast number of physical qubits for large-scale quantum computation. hypergraph product codes present a promising alternative, as both their encoding rate and distance scale with block size. Recent advancements have shown how to deterministically perform high-fidelity cavity enabled non-local many-body gates.
  arXiv  Detail & Related papers  (2024-09-09T17:28:41Z)
• Even more efficient magic state distillation by zero-level distillation [0.8009842832476994]
  We propose zero-level distillation, which prepares a high fidelity logical magic state using physical qubits on a square lattice. The key idea behind is using the Steane code to distill a logical magic state by using noisy Clifford gates with error detection.
  arXiv  Detail & Related papers  (2024-03-06T19:01:28Z)
• Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code [2.5553228515450765]
  We implement a small quantum algorithm, one-qubit addition, fault-tolerantly on the Quantinuum H1-1 quantum computer. We observe arithmetic errors with a rate of $sim 1.1 times 10-3$ for the fault-tolerant circuit and $sim 9.5 times 10-3$ for the unencoded circuit.
  arXiv  Detail & Related papers  (2023-09-18T15:56:14Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Encoding a magic state with beyond break-even fidelity [1.449788466039287]
  We propose and implement a scheme to prepare a magic state on a superconducting qubit array using error correction. We find that our scheme produces better magic states than those we can prepare using the individual qubits of the device. Our prototype will be invaluable in the future as it can reduce the number of physical qubits needed to produce high-fidelity magic states.
  arXiv  Detail & Related papers  (2023-05-23T01:19:53Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• Error mitigation for universal gates on encoded qubits [5.774786149181392]
  We show how to implement Clifford+T circuits with a number of T-gates inversely proportional to the physical noise rate. We argue that such circuits can be out of reach for state-of-the-art classical simulation algorithms.
  arXiv  Detail & Related papers  (2021-03-08T17:27:04Z)
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes [63.62764375279861]
  We compare two leading FT implementations of the T gate in 2D color codes under circuit noise. We find a circuit noise threshold of 0.07(1)% for the T gate via code switching, almost an order of magnitude below that achievable by state distillation in the same setting.
  arXiv  Detail & Related papers  (2021-01-06T19:00:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.