Heterogeneously error-corrected QRAMs

• URL: http://arxiv.org/abs/2504.21687v1
• Date: Wed, 30 Apr 2025 14:23:42 GMT
• Title: Heterogeneously error-corrected QRAMs
• Authors: Ansh Singal, Kaitlin N. Smith,
• Abstract summary: We propose a surface code error-corrected QRAM made of heterogeneous code distance logical qubits.<n>Our designs can achieve up to polylogarithmic reduction in query infidelity, producing constant query infidelity scaling.
• Score: 0.8057006406834466
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum Random Access Memories (QRAM) could prove essential for scalable quantum computing, for everything from accessing classical databases for unordered search to creating arbitrary superpositions of states. However, like most applications of quantum computing, QRAMs suffer from qubit error and decoherence. Quantum Error Correction (QEC) provides a potential solution, but unfortunately, most QEC proposals that uniformly correct all qubits of the QRAM incur major overheads, making the QRAM infeasible. In this work, we propose a surface code error-corrected QRAM made of heterogeneous code distance logical qubits. Our QRAM can produce higher fidelity queries, while keeping qubit overheads smaller than the uniformly error-corrected QRAMs. Comparisons between our novel QRAM architectures and a uniformly error corrected baseline are presented, showing that our designs can achieve up to polylogarithmic reduction in query infidelity, producing constant query infidelity scaling, while simultaneously reducing qubit overhead.

Related papers

• Analysis and Suppression of Errors in Quantum Random Access Memory under Extended Noise Models [1.9545616531173555]
  We show that QRAM is highly resilient to arbitrary local incoherent noise channels. Fully quantifying the extent to which QRAM's noise resilience holds may provide a guide for the design of QRAM architectures.
  arXiv  Detail & Related papers  (2024-12-13T17:59:16Z)
• Does quantum lattice sieving require quantum RAM? [6.159206988529989]
  We study the requirement for quantum random access memory (QRAM) in quantum lattice sieving. In particular, no quantum speedup is possible without QRAM. We show that further improvements require a novel way to use the QRAM.
  arXiv  Detail & Related papers  (2024-10-21T01:22:59Z)
• Systems Architecture for Quantum Random Access Memory [0.6386668251980657]
  Quantum random access memory (QRAM) is a promising architecture for realizing quantum queries. We show how to leverage the intrinsic biased-noise resilience of the proposed QRAM for implementation on either Noisy Intermediate-Scale Quantum (NISQ) or Fault-Tolerant Quantum Computing (FTQC) hardware.
  arXiv  Detail & Related papers  (2023-06-05T20:52:28Z)
• QRAM: A Survey and Critique [1.52292571922932]
  Quantum random-access memory (QRAM) is a mechanism to access data based on addresses which are themselves a quantum state. We use two primary categories of QRAM from the literature: active and passive. In summary, we conclude that cheap, scalableally passive QRAM is unlikely with existing proposals.
  arXiv  Detail & Related papers  (2023-05-17T15:48:48Z)
• Efficient and Error-Resilient Data Access Protocols for a Limited-Sized Quantum Random Access Memory [7.304498344470287]
  We focus on the access of larger data sizes without keeping on increasing the size of the QRAM. We propose a novel protocol for loading data with larger word lengths $k$ without increasing the number of QRAM levels $n$. By exploiting the parallelism in the data query process, our protocol achieves a time complexity of $O(n+k)$ and improves error scaling performance.
  arXiv  Detail & Related papers  (2023-03-09T12:21:18Z)
• 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 computation on a 19-qubit wide 2d nearest neighbour qubit array [59.24209911146749]
  This paper explores the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds. We engineer an error bias at the lowest level of encoding using the surface code. We then address this bias at a higher level of encoding using a lattice-surgery surface code bus.
  arXiv  Detail & Related papers  (2022-12-03T06:16:07Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)
• Parallelising the Queries in Bucket Brigade Quantum RAM [69.43216268165402]
  Quantum algorithms often use quantum RAMs (QRAM) for accessing information stored in a database-like manner. We show a systematic method to significantly reduce the effective query time by using Clifford+T gate parallelism. We conclude that, in theory, fault-tolerant bucket brigade quantum RAM queries can be performed approximately with the speed of classical RAM.
  arXiv  Detail & Related papers  (2020-02-21T14:50:03Z)

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.