Universal Quantum Random Access Memory: A Data-Independent Unitary Construction

• URL: http://arxiv.org/abs/2512.12999v1
• Date: Mon, 15 Dec 2025 05:46:20 GMT
• Title: Universal Quantum Random Access Memory: A Data-Independent Unitary Construction
• Authors: Leonardo Bohac,
• Abstract summary: We present a construction for Quantum Random Access Memory (QRAM) that achieves a single, data-independent unitary operator.<n>Unlike routing-based approaches or circuit methods that yield data-dependent unitaries, our Universal QRAM encodes data in memory qubits that act as quantum control signals.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a construction for Quantum Random Access Memory (QRAM) that achieves a single, data-independent unitary operator. Unlike routing-based approaches or circuit methods that yield data-dependent unitaries, our Universal QRAM encodes data in memory qubits that act as quantum control signals within a block-diagonal permutation structure. The key insight is that memory qubits serve as control signals, enabling coherent lookup when addresses are in superposition. For N addresses with K-bit data words, the construction requires $\log_2 N + K + NK$ qubits and decomposes into exactly $NK$ multi-controlled gates. We verify the construction for $N \in \{2, 4, 8, 16\}$ and $K \in \{1, 2, 3, 4\}$, confirming that the resulting unitary is a pure permutation matrix with zero error across all data configurations. This approach simplifies QRAM implementation by separating fixed circuit structure from variable data encoding.

Related papers

• Efficient Quantum State Preparation with Bucket Brigade QRAM [47.72095699729477]
  Preparation of data in quantum states is a critical component in the design of quantum algorithms.<n>One of the main approaches to achieve efficient state preparation is through the use of Quantum Random Access Memory (QRAM)<n>We present a framework that integrates the physical model of the Bucket Brigade QRAM (BBQRAM) with the classical data structure of the Segment Tree to achieve efficient state preparation.
  arXiv  Detail & Related papers  (2025-10-17T18:50:07Z)
• Stab-QRAM: An All-Clifford Quantum Random Access Memory for Special Data [9.722458605511436]
  We introduce the Stabilizer-QRAM (Stab-QRAM), a domain-specific architecture tailored for data.<n>We show that Stab-QRAM achieves an optimal logical circuit depth of $O(log N)$ for $N$ data items, matching its $O(log N)$ space complexity.<n>This design completely circumvents the non-Clifford bottleneck, eliminating the need for costly magic state distillation.
  arXiv  Detail & Related papers  (2025-09-30T16:36:52Z)
• 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)
• Quantum encoder for fixed Hamming-weight subspaces [0.0]
  We present an exact $n$-qubit computational-basis amplitude encoder of real- or complex data vectors of $d=binomnk$valued into a subspace of fixed Hamming weight $k$.<n>We show how our encoder can improve the performance of variational quantum algorithms for problems that include particle-string symmetries.<n>Our results constitute a versatile framework for quantum data compression with various potential applications in fields such as quantum chemistry, quantum machine learning, and constrained $k$ optimizations.
  arXiv  Detail & Related papers  (2024-05-30T18:26:41Z)
• Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
  We simulate the logical Hadamard gate in the surface code under a circuit-level noise model. Our paper is the first to do this for a unitary gate on a quantum error-correction code.
  arXiv  Detail & Related papers  (2023-12-18T19:00:00Z)
• Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates [40.56175933029223]
  We propose two types of constant-depth constructions for implementing Uniformly Controlled Gates. We obtain constant-depth circuits for the quantum counterparts of read-only and read-write memory devices.
  arXiv  Detail & Related papers  (2023-08-16T17:54:56Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Quantum Resources Required to Block-Encode a Matrix of Classical Data [56.508135743727934]
  We provide circuit-level implementations and resource estimates for several methods of block-encoding a dense $Ntimes N$ matrix of classical data to precision $epsilon$. We examine resource tradeoffs between the different approaches and explore implementations of two separate models of quantum random access memory (QRAM) Our results go beyond simple query complexity and provide a clear picture into the resource costs when large amounts of classical data are assumed to be accessible to quantum algorithms.
  arXiv  Detail & Related papers  (2022-06-07T18:00:01Z)
• Two-level Quantum Walkers on Directed Graphs II: An Application to qRAM [0.0]
  We physically implement a quantum random access memory (qRAM) Data with address information are dual-rail encoded into quantum walkers. Walkers pass through perfect binary trees to access memory cells and copy the data stored in the cells.
  arXiv  Detail & Related papers  (2022-04-19T07:26:41Z)
• Quantum state preparation protocol for encoding classical data into the amplitudes of a quantum information processing register's wave function [0.0]
  We present a protocol for encoding $N$ real numbers stored in $N$ memory registers into the amplitudes of the quantum superposition. The protocol combines partial CNOT gate rotations with probabilistic projection onto the desired state.
  arXiv  Detail & Related papers  (2021-07-29T16:02:38Z)

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.