publication . Part of book or chapter of book . Article . Preprint . Other literature type . 2008

Quantum random access memory.

Giovannetti, Vittorio; Lloyd, Seth; Maccone, Lorenzo;
Restricted
  • Published: 21 Apr 2008
  • Publisher: IOP Publishing
Abstract
A random access memory (RAM) uses n bits to randomly address N=2^n distinct memory cells. A quantum random access memory (qRAM) uses n qubits to address any quantum superposition of N memory cells. We present an architecture that exponentially reduces the requirements for a memory call: O(log N) switches need be thrown instead of the N used in conventional (classical or quantum) RAM designs. This yields a more robust qRAM algorithm, as it in general requires entanglement among exponentially less gates, and leads to an exponential decrease in the power needed for addressing. A quantum optical implementation is presented.
Subjects
free text keywords: Quantum mechanics, Discrete mathematics, Quantum algorithm, Condensed matter physics, Qubit, Quantum error correction, Quantum computer, Quantum capacity, Physics, Quantum information, Quantum phase estimation algorithm, Quantum network, Quantum Physics
20 references, page 1 of 2

[1] R. Feynman, Feynman Lectures on Computation, (Perseus Books Group, 2000).

[2] R. C. Jaeger, T. N. Blalock, Microelectronic circuit design, (McGraw-Hill, Dubuque, 2003), pg. 545

[3] M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge Univ. Press, Cambridge, 2000).

[4] G. Schaller and R. Schu¨tzhold, Phys. Rev. A 74, 012303 (2006).

[5] R. Schu¨tzhold, Phys. Rev. A 67, 062311 (2003).

[6] C. A. Trugenberger, Phys. Rev. Lett. 87, 067901 (2001); ibid. 89, 277903 (2002).

[7] G. Brassard, P. Høyer, and A. Tapp, ACM SIGACT News (Cryptology Column), 28, 14 (1997). [OpenAIRE]

[8] A. Ambainis, Proc. 45th IEEE FOCS'04, pg. 22 (2004), preprint quant-ph/0311001.

[9] A. M. Childs, A. W. Harrow, and P. Wocjan, Proc. 24th Symposium on Theoretical Aspects of Computer Science (STACS 2007), Lecture Notes in Computer Science 4393, 598 (2007), preprint quant-ph/0609110.

[10] A. M. Childs et al., to be published in Proc. 48th IEEE Symposium on Foundations of Computer Science (FOCS'07), preprint quant-ph/0703015.

[11] V. Giovannetti, S. Lloyd, and L. Maccone, preprint quant-ph/0708.2992 (2007).

[12] V. Giovannetti, S. Lloyd, and L. Maccone, unpublished.

[13] The d-dimensional RAM consists of d such graphs, each addressing one side of a N 1/d × N 1/d × · · · array.

[14] We focus on the case in which we “read” from the memory, the “write” operation being completely analogous.

[15] R. Raussendorf and H. J. Briegel, Phys. Rev. Lett. 86, 5188 (2001).

20 references, page 1 of 2
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Part of book or chapter of book . Article . Preprint . Other literature type . 2008

Quantum random access memory.

Giovannetti, Vittorio; Lloyd, Seth; Maccone, Lorenzo;