Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation

• URL: http://arxiv.org/abs/2207.08826v3
• Date: Tue, 28 Jan 2025 07:12:09 GMT
• Title: Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
• Authors: Hayata Yamasaki, Masato Koashi,
• Abstract summary: Protocols for fault-tolerant quantum computation demand excessive space overheads.<n>We introduce an alternative approach to constant-space-overhead fault-tolerant quantum computing.<n>Our protocol is fault tolerant even if a decoder has a non-constant runtime.
• Score: 2.3020018305241337
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Scaling up quantum computers to attain substantial speedups over classical computing requires fault tolerance. Conventionally, protocols for fault-tolerant quantum computation demand excessive space overheads by using many physical qubits for each logical qubit. A more recent protocol using quantum analogues of low-density parity-check codes needs only a constant space overhead that does not grow with the number of logical qubits. However, the overhead in the processing time required to implement this protocol grows polynomially with the number of computational steps. To address these problems, here we introduce an alternative approach to constant-space-overhead fault-tolerant quantum computing using a concatenation of multiple small-size quantum codes rather than a single large-size quantum low-density parity-check code. We develop techniques for concatenating different quantum Hamming codes with growing sizes. As a result, we construct a low-overhead protocol to achieve constant space overhead and only quasi-polylogarithmic time overhead simultaneously. Our protocol is fault tolerant even if a decoder has a non-constant runtime, unlike the existing constant-space-overhead protocol. This code concatenation approach will make possible a large class of quantum speedups within feasibly bounded space overhead yet negligibly short time overhead.

Related papers

• Order-of-magnitude extension of qubit lifetimes with a decoherence-free subspace quantum error correction code [0.0]
  We report on a robust quantum memory design using a decoherence-free subspace quantum error correction code. The resulting encoding scheme is characterized for long probe times, and shown to extend the memory time by over an order of magnitude compared to physical qubits.
  arXiv  Detail & Related papers  (2025-03-28T02:58:34Z)
• Doubly-polylog-time-overhead fault-tolerant quantum computation by a polylog-time parallel minimum-weight perfect matching decoder [1.6114012813668932]
  We develop a protocol that achieves doubly polylog time overhead while maintaining the conventional polylog space overhead. Our protocol integrates this decoder with a topological-code protocol that incorporates single-shot decoding for efficient extraction. Results suggest the feasibility of surpassing the conventional polylog-time-overhead barrier, opening a new frontier in low-overhead FTQC.
  arXiv  Detail & Related papers  (2025-03-17T18:00:04Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes [2.048226951354646]
  A major challenge in fault-tolerant quantum computation is to reduce both space overhead and time overhead. We show that a protocol using non-vanishing-rate quantum low-density parity-check codes achieves constant space overhead and polylogarithmic time overhead.
  arXiv  Detail & Related papers  (2024-11-06T06:06:36Z)
• Integrating Window-Based Correlated Decoding with Constant-Time Logical Gates for Large-Scale Quantum Computation [11.657137510701165]
  One crucial issue of fault-tolerant quantum computing is reducing the overhead of implementing gates. Recently proposed correlated decoding and algorithmic fault tolerance" achieve fast universality gates. This approach is incompatible with window-based decoding, which is a natural requirement for handling large-scale circuits.
  arXiv  Detail & Related papers  (2024-10-22T12:44:41Z)
• Time-Efficient Logical Operations on Quantum Low-Density Parity Check Codes [5.881311286656519]
  We propose schemes capable of measuring an arbitrary set of commutative logical Pauli operators in time independent of the number of operators. The only condition is commutativity, a fundamental requirement for simultaneous measurements in quantum mechanics.
  arXiv  Detail & Related papers  (2024-08-02T15:35:05Z)
• Quantum memory based on concatenating surface codes and quantum Hamming codes [0.0]
  We study the concatenation of surface codes with quantum Hamming codes as a quantum memory. A high error threshold is achieved, which can in principle be pushed up to the threshold of the surface code. The advantage in suppressing errors starts to show for a quantum memory of intermediate scale.
  arXiv  Detail & Related papers  (2024-07-23T04:47:14Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Quantum Error Correction via Noise Guessing Decoding [0.0]
  Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation. This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime.
  arXiv  Detail & Related papers  (2022-08-04T16:18:20Z)
• Quantum Machine Learning for Software Supply Chain Attacks: How Far Can We Go? [5.655023007686363]
  This paper analyzes speed up performance of QC when applied to machine learning algorithms, known as Quantum Machine Learning (QML) Due to limitations of real quantum computers, the QML methods were implemented on open-source quantum simulators such as Qiskit and IBM Quantum. Interestingly, the experimental results differ to the speed up promises of QC by demonstrating higher computational time and lower accuracy in comparison to the classical approaches for SSC attacks.
  arXiv  Detail & Related papers  (2022-04-04T21:16:06Z)
• Optimised Multithreaded CV-QKD Reconciliation for Global Quantum Networks [3.4519649635864584]
  Quantum Key Distribution system requires estimation of quantum channel characteristics and extraction of secure key bits. On standard processors, it can take several hours to reconcile the required number of quantum signals. New solution results in a significant increase in the final key rate relative to non-optimised reconciliation.
  arXiv  Detail & Related papers  (2021-08-19T00:43:07Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• 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)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.