Cited by 151Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Circuit-Based Quantum Random Access Memory for Classical Data

Open access
Park, Daniel K., Petruccione, Francesco, Rhee, June-Koo Kevin·2019·Scientific Reports

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.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/s41598-019-40439-3

Cites

34 of 34 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • A recent circuit-based proposal for QRAM shows an unavoidable linear cost on the number of states that would outweigh any logarithmic-time algorithm.

    “For example, a recent circuit-based proposal for QRAM [113] shows an unavoidable linear cost on the number of states that would outweigh any logarithmic-time algorithm.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 1

  1. [27]Park, D. K., Sinayskiy, I., Fingerhuth, M., Petruccione, F. & Rhee, J. K. Quantum forking for fast weighted power summation. arXiv:1902.07959 [quant-ph] (2019). · arXiv

Cited by

Sorted by citations

Authors
Park, D. K., Petruccione, F., & Rhee, J.-K. K.
Affiliations
Korea Advanced Institute of Science and Technology (KR)
Corresponding author
Rhee, June-Koo Kevin
Venue
Scientific Reports
Published
2019-03-08
Volume
9
Issue
1
Pages
3949-3949
ISSN
2045-2322 (ISSN-L)
OpenAlex
W2909846583
Cited by
151
References
34
Citations by year
2026: 11 · 2025: 28 · 2024: 22 · 2023: 22 · 2022: 26 · 2021: 24 · 2020: 15 · 2019: 3
FWCI
7.76
Type
journal article
Language
en
Open access
Locations
  • Scientific Reports (publishedVersion, cc-by)
  • Europe PMC (PubMed Central) (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Research Foundation (2016R1A5A1008184)
  • National Research Foundation of Korea (2016R1A5A1008184)
  • Korea Advanced Institute of Science and Technology (2016R1A5A1008184)
  • Iran Telecommunication Research Center
  • Ministry of Science and ICT, South Korea (IITP-2018, 2016R1A5A1008184)
  • Institute for Information and Communications Technology Promotion (IITP-2018-2015-0-00385, IITP-2018-2018-0-01402)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
quantum random access memory, flip-flops, quantum superposition, post-selection

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review