Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes
- URL: http://arxiv.org/abs/2411.03683v1
- Date: Wed, 06 Nov 2024 06:06:36 GMT
- Title: Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes
- Authors: Shiro Tamiya, Masato Koashi, Hayata Yamasaki,
- Abstract summary: 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.
- Score: 2.048226951354646
- License:
- Abstract: A major challenge in fault-tolerant quantum computation (FTQC) is to reduce both space overhead -- the large number of physical qubits per logical qubit -- and time overhead -- the long physical gate sequences per logical gate. We prove that a protocol using non-vanishing-rate quantum low-density parity-check (LDPC) codes, combined with concatenated Steane codes, achieves constant space overhead and polylogarithmic time overhead, even when accounting for non-zero classical computation time. This protocol offers an improvement over existing constant-space-overhead protocols, which have polynomial time overhead using quantum LDPC codes and quasi-polylogarithmic time overhead using concatenated quantum Hamming codes. To ensure the completeness of this proof, we develop a technique called partial circuit reduction, which enables error analysis for the entire fault-tolerant circuit by examining smaller parts composed of a few gadgets. With this technique, we resolve a previously unaddressed logical gap in the existing arguments and complete the proof of the threshold theorem for the constant-space-overhead protocol with quantum LDPC codes. Our work highlights that the quantum-LDPC-code approach can realize FTQC with a negligibly small slowdown and a bounded overhead of physical qubits, similar to the code-concatenation approach, underscoring the importance of a comprehensive comparison of the future realizability of these two approaches.
Related papers
- Time-efficient logical operations on quantum LDPC 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) - Algorithmic Fault Tolerance for Fast Quantum Computing [37.448838730002905]
We show that fault-tolerant logical operations can be performed with constant time overhead for a broad class of quantum codes.
We prove that the deviation from the ideal measurement result distribution can be made exponentially small in the code distance.
Our work sheds new light on the theory of fault tolerance, potentially reducing the space-time cost of practical fault-tolerant quantum computation by orders of magnitude.
arXiv Detail & Related papers (2024-06-25T15:43:25Z) - 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) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Single-shot decoding of good quantum LDPC codes [38.12919328528587]
We prove that quantum Tanner codes facilitate single-shot quantum error correction (QEC) of adversarial noise.
We show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round.
arXiv Detail & Related papers (2023-06-21T18:00:01Z) - 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) - Neural Belief Propagation Decoding of Quantum LDPC Codes Using
Overcomplete Check Matrices [60.02503434201552]
We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix.
This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
arXiv Detail & Related papers (2022-12-20T13:41:27Z) - Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs)
We propose a new protocol for approximating TN states using realistic quantum circuits.
Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z) - Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum
Computation [5.33024001730262]
Protocols for fault-tolerant quantum computation (FTQC) demand excessive space overhead of physical qubits per logical qubit.
We introduce an alternative approach using a concatenation of multiple small-size quantum codes for the constant-space-overhead FTQC.
Our protocol accomplishes FTQC even if a decoder has non-constant runtime, unlike the existing constant-space-overhead protocol.
arXiv Detail & Related papers (2022-07-18T18:00:00Z) - Low-overhead fault-tolerant quantum computing using long-range
connectivity [2.867517731896504]
Scheme for low-overhead fault-tolerant quantum computation based on quantum low-density parity-check codes.
We estimate order-of-magnitude improvements in the overheads for processing around one hundred logical qubits.
arXiv Detail & Related papers (2021-10-20T21:49:48Z)
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.