Asset Details
Do you wish to reserve the book?
A quantum random access memory (QRAM) using a polynomial encoding of binary strings
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
A quantum random access memory (QRAM) using a polynomial encoding of binary strings
Do you wish to request the book?
A quantum random access memory (QRAM) using a polynomial encoding of binary strings
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
A quantum random access memory (QRAM) using a polynomial encoding of binary strings
2025
Overview
Quantum algorithms claim significant speedup over their classical counterparts for solving many problems. An important aspect of many of these algorithms is the existence of a quantum oracle, which needs to be implemented efficiently in order to realize the claimed advantages in practice. A quantum random access memory (QRAM) is a promising architecture for realizing these oracles. In this paper we develop a new design for QRAM and implement it with Clifford+T circuit. We focus on optimizing the T-count and T-depth since non-Clifford gates are the most expensive to implement fault-tolerantly in most error correction schemes. Integral to our design is a polynomial encoding of bit strings and so we refer to this design as
. Compared to the previous state-of-the-art bucket brigade architecture for QRAM, we achieve an exponential improvement in T-depth, while reducing T-count and keeping the qubit-count same. Specifically, if
N
is the number of memory locations to be queried, then
has T-depth
, T-count
and uses
O
(
N
) logical qubits, while the bucket brigade circuit has T-depth
, T-count
O
(
N
) and uses
O
(
N
) qubits. Combining two
we design a quantum look-up-table,
, that has T-depth
, T-count
and qubit count
. A quantum look-up table (qLUT) or quantum read-only memory (QROM) has restricted functionality than a QRAM. For example, it cannot write into a memory location and the circuit needs to be compiled each time the contents of the memory change. The previous state-of-the-art CSWAP architecture has T-depth
, T-count
and qubit count
. Thus we achieve a double exponential improvement in T-depth while keeping the T-count and qubit-count asymptotically same. Additionally, with our polynomial encoding of bit strings, we develop a method to optimize the Toffoli-count of circuits, specially those consisting of multi-controlled-NOT gates.
Publisher
Nature Publishing Group UK,Nature Publishing Group,Nature Portfolio
