Circuit-Based Quantum Random Access Memory for Classical Data

Abstract

A prerequisite for many quantum information processing tasks to truly surpass classical approaches is an efficient procedure to encode classical data in quantum superposition states. In this work, we present a circuit-based flip-flop quantum random access memory to construct a quantum database of classical information in a systematic and flexible way. For registering or updating classical data consisting of $M$ entries, each represented by $n$ bits, the method requires $O(n)$ qubits and $O(Mn)$ steps. With post-selection at an additional cost, our method can also store continuous data as probability amplitudes. As an example, we present a procedure to convert classical training data for a quantum supervised learning algorithm to a quantum state. Further improvements can be achieved by reducing the number of state preparation queries with the introduction of quantum forking.

9 pages, 5 figures

References in corpus (6)

• Quantum algorithm for solving linear systems of equations
• Quantum random access memory
• Architectures for a quantum random access memory
• Efficient Toffoli Gates Using Qudits
• Quantum Image Processing and Its Application to Edge Detection: Theory and Experiment
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes