Distilling Magic States in the Bicycle Architecture

• URL: http://arxiv.org/abs/2602.20546v1
• Date: Tue, 24 Feb 2026 04:57:42 GMT
• Title: Distilling Magic States in the Bicycle Architecture
• Abstract summary: Magic State Distillation is considered to be one of the promising methods for supplying the non-Clifford resources required to achieve universal fault tolerance.<n> Conventional MSD protocols implemented in surface codes often require multiple code blocks and lattice surgery rounds, resulting in substantial qubit overhead, especially at low target error rates.
• Score: 2.0424354398563294
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Magic State Distillation is considered to be one of the promising methods for supplying the non-Clifford resources required to achieve universal fault tolerance. Conventional MSD protocols implemented in surface codes often require multiple code blocks and lattice surgery rounds, resulting in substantial qubit overhead, especially at low target error rates. In this work, we present practical magic state distillation factories on Bivariate Bicycle (BB) codes that execute Pauli-measurement-based Clifford circuits inside a single BB code block. We formulate distillation circuit design as a joint optimization of logical qubit mapping, gate scheduling, measurement nativization, and protocol compression via qubit recycling. Based on detailed resource analysis and simulations, our BB factories have space-time volume comparable to that of leading distillation factories while delivering lower target error at a smaller qubit footprint, and are particularly compelling as second-round distillers following magic state cultivations.

Related papers

• Constant sized support state distillation with qubit recycling [0.0]
  We provide a family of protocols able to produce diagonal states at every level of the Clifford hierarchy.<n>We show that the protocols we derive can be performed at arbitrary high distance on a fix number of logical qubits.
  arXiv  Detail & Related papers  (2026-09-15T11:52:36Z)
• Magic state distillation with permutation-invariant codes and a two-qubit example [3.437656066916039]
  Magic state distillation protocols aim to create clean copies of magic states from many noisier copies.<n>We present a protocol based on permutation-invariant gnu codes, as small as two qubits.<n>The protocol achieves a 0.5 error threshold and 1/2 distillation rate, surpassing prior schemes for comparable codes.
  arXiv  Detail & Related papers  (2026-03-04T17:27:43Z)
• Efficient simulation of logical magic state preparation protocols [0.0]
  We introduce a method for simulating logical magic state preparation protocols under the standard circuit-level noise model.<n>We provide a proof-of-principle numerical simulation that prepares a magic state using such logical Clifford measurements.
  arXiv  Detail & Related papers  (2025-12-29T19:00:05Z)
• Orchestrating multi-level magic state distillation: a dynamic pipeline architecture [0.8021197489470756]
  A magic state distillation factory consumes many low-fidelity input magic states and produces fewer, higher-fidelity states.<n>To reach high fidelities, multiple distillation factories are typically chained together into a multi-level pipeline.<n>We introduce a novel dynamic pipeline architecture to optimize the resource usage of distillation pipelines.
  arXiv  Detail & Related papers  (2025-09-29T07:49:40Z)
• Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes [1.0792624191049491]
  We introduce a class of finite block-length quantum LDPC codes which we name tricycle codes.<n>These codes can support constant-depth physical circuits that implement logical $CCZ$ gates between three code blocks.<n>We show that tricycle codes enable single-shot state-preparation and error correction, leading to a highly efficient magic-state generation protocol.
  arXiv  Detail & Related papers  (2025-08-14T14:56:50Z)
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution [41.95227943686519]
  We introduce mitigated magic dilution (MMD) as an approach to synthesise small-angle rotations.<n>This work paves the way for early fault-tolerant demonstrations on devices supporting millions of quantum operations.
  arXiv  Detail & Related papers  (2025-05-15T17:19:19Z)
• Low-overhead magic state distillation with color codes [1.3980986259786223]
  Fault-tolerant implementation of non-Clifford gates is a major challenge for achieving universal fault-tolerant quantum computing.<n>We propose two distillation schemes based on the 15-to-1 distillation circuit and lattice surgery, differing in their methods for handling faulty rotations.<n>To reach a given target infidelity, our schemes require approximately two orders of magnitude fewer resources than the previous best magic state distillation schemes for color codes.
  arXiv  Detail & Related papers  (2024-09-12T02:20:17Z)
• DB-LLM: Accurate Dual-Binarization for Efficient LLMs [83.70686728471547]
  Large language models (LLMs) have significantly advanced the field of natural language processing. Existing ultra-low-bit quantization always causes severe accuracy drops. We propose a novel Dual-Binarization method for LLMs, namely DB-LLM.
  arXiv  Detail & Related papers  (2024-02-19T09:04:30Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• 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)
• 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)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Entanglement purification by counting and locating errors with entangling measurements [62.997667081978825]
  We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about number and positions of errors in the noisy ensemble.
  arXiv  Detail & Related papers  (2020-11-13T19:02:33Z)
• TernaryBERT: Distillation-aware Ultra-low Bit BERT [53.06741585060951]
  We propose TernaryBERT, which ternarizes the weights in a fine-tuned BERT model. Experiments on the GLUE benchmark and SQuAD show that our proposed TernaryBERT outperforms the other BERT quantization methods.
  arXiv  Detail & Related papers  (2020-09-27T10:17:28Z)
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits [1.2891210250935146]
  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.
  arXiv  Detail & Related papers  (2020-03-06T06:24:02Z)

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.