Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation

• URL: http://arxiv.org/abs/2506.13619v1
• Date: Mon, 16 Jun 2025 15:48:19 GMT
• Title: Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation
• Authors: Daniel Litinski,
• Abstract summary: We introduce a construction for protocols for fault-tolerant quantum computing based on code concatenation and gates.<n>These protocols can be interpreted as families of quantum circuits of low-weight stabilizer measurements without strict locality constraints.<n>We present techniques for performing logical operations, decoding, and implementing the protocols in photonic hardware.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a construction for protocols for fault-tolerant quantum computing based on code concatenation and transversal gates. These protocols can be interpreted as families of quantum circuits of low-weight stabilizer measurements without strict locality constraints, effectively implementing concatenated codes. However, we primarily study these protocols in the context of photonic fusion-based quantum computing (FBQC), where they yield families of fusion networks with constant-sized resource states. Their high erasure thresholds relative to their resource-state cost establish them as promising candidates to replace surface codes in the context of FBQC. Examples include protocol families using 8-, 10- and 12-qubit resource states, with erasure thresholds of 13.8%, 19.1% and 11.5%, and footprint-per-logical-qubit scaling as $\mathcal{O}(d)$, $\mathcal{O}(d^{1.46})$ and $\mathcal{O}(d^{0.58})$, respectively, where $d$ is the code distance. We also present techniques for performing logical operations, decoding, and implementing the protocols in photonic hardware. Although we focus on photonic FBQC, these ideas may also be of interest in other settings.

Related papers

• A distillation-teleportation protocol for fault-tolerant QRAM [95.99192129224721]
  We present a protocol for fault-tolerantly implementing the logical quantum random access memory (QRAM) operation.<n>For coherently accessing classical memories of size $2n$, our protocol consumes only $mathrmpoly(n)$ fault-tolerant quantum resources.
  arXiv  Detail & Related papers  (2025-05-26T17:42:56Z)
• High-Dimensional Quantum Key Distribution with Qubit-like States [0.0]
  We introduce a high-dimensional QKD protocol using qubit-like states, referred to as Fourier-qubits (or $textitF$-qubits)<n>In our scheme, each $textitF$-qubit is a superposition of only two computational basis states with a relative phase that can take $d$ distinct values, where $d$ is the dimension of the computational basis.<n>This non-mutually unbiased approach allows us to bound the information leaked to an eavesdropper, maintaining security in high-dimensional quantum systems despite the states' seemingly two-dimensional nature
  arXiv  Detail & Related papers  (2025-04-04T19:34:28Z)
• Extractors: QLDPC Architectures for Efficient Pauli-Based Computation [42.95092131256421]
  We propose a new primitive that can augment any QLDPC memory into a computational block well-suited for Pauli-based computation.<n>In particular, any logical Pauli operator supported on the memory can be fault-tolerantly measured in one logical cycle.<n>Our architecture can implement universal quantum circuits via parallel logical measurements.
  arXiv  Detail & Related papers  (2025-03-13T14:07:40Z)
• Constant Overhead Entanglement Distillation via Scrambling [0.6249768559720122]
  High-fidelity quantum entanglement enables key quantum networking capabilities such as secure communication and distributed quantum computing.<n>We introduce protocols that use quantum scrambling - the spreading of quantum information under chaotic dynamics.<n>We show this protocol remains effective even with noisy quantum gates, making it suitable for near-term devices.
  arXiv  Detail & Related papers  (2025-02-13T16:46:15Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• An assessment of quantum phase estimation protocols for early fault-tolerant quantum computers [0.0]
  We compare several quantum phase estimation protocols intended for early fault-tolerant quantum computers. We estimate the logical and physical resources required to use these protocols to calculate the ground state energy of molecular hydrogen.
  arXiv  Detail & Related papers  (2024-02-29T19:08:42Z)
• Concatenate codes, save qubits [1.433758865948252]
  A fault-tolerant protocol for fault-tolerant quantum computation is presented.<n>It achieves a constant space overhead, a high threshold, and flexibility in modular architecture designs.<n>Results indicate that the code-concatenation approach opens a way to significantly save qubits in realizing FTQC.
  arXiv  Detail & Related papers  (2024-02-14T22:27:48Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• 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)
• Entanglement Purification with Quantum LDPC Codes and Iterative Decoding [5.5165579223151795]
  We use QLDPC codes to distill GHZ states, as the resulting high-fidelity logical GHZ states can interact directly with the code used to perform distributed quantum computing. Our results apply to larger size GHZ states as well, where we extend our technical result about a measurement property of $3$-qubit GHZ states to construct a scalable GHZ purification protocol.
  arXiv  Detail & Related papers  (2022-10-25T16:42:32Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Security Limitations of Classical-Client Delegated Quantum Computing [54.28005879611532]
  A client remotely prepares a quantum state using a classical channel. Privacy loss incurred by employing $RSP_CC$ as a sub-module is unclear. We show that a specific $RSP_CC$ protocol can replace the quantum channel at least in some contexts.
  arXiv  Detail & Related papers  (2020-07-03T13:15:13Z)

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.