• Rapid Communication

Robust quantum random access memory

Fang-Yu Hong, Yang Xiang, Zhi-Yan Zhu, Li-zhen Jiang, and Liang-neng Wu
Phys. Rev. A 86, 010306(R) – Published 25 July 2012

Abstract

A “bucket brigade” architecture for a quantum random memory of N=2n memory cells needs n(n+5)/2 times of quantum manipulation on control circuit nodes per memory call. Here we propose a scheme in which only on average n/2 times manipulations are required to accomplish a memory call. This scheme may significantly decrease the time spent on a memory call and the average overall error rate per memory call. A physical implementation scheme is discussed for storing an arbitrary state in a selected memory cell followed by reading it out.

  • Figure
  • Figure
  • Figure
  • Received 11 January 2012

DOI:https://doi.org/10.1103/PhysRevA.86.010306

©2012 American Physical Society

Authors & Affiliations

Fang-Yu Hong1, Yang Xiang2, Zhi-Yan Zhu1, Li-zhen Jiang3, and Liang-neng Wu4

  • 1Department of Physics, Center for Optoelectronics Materials and Devices, Zhejiang Sci-Tech University, Hangzhou, Zhejiang 310018, China
  • 2School of Physics and Electronics, Henan University, Kaifeng, Henan 475004, China
  • 3College of Information and Electronic Engineering, Zhejiang Gongshang University, Hangzhou, Zhejiang 310018, China
  • 4College of Science, China Jiliang University, Hangzhou, Zhejiang 310018, China

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 86, Iss. 1 — July 2012

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×