CoChat

A divide-and-conquer algorithm for quantum state preparation

Open access
Araujo, Israel F., Park, Daniel K., Petruccione, Francesco, da Silva, Adenilton J. · 2021 · Scientific Reports
Cited by 166

The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.

Abstract

Advantages in several fields of research and industry are expected with the rise of quantum computers. However, the computational cost to load classical data in quantum computers can impose restrictions on possible quantum speedups. Known algorithms to create arbitrary quantum states require quantum circuits with depth O(N) to load an N-dimensional vector. Here, we show that it is possible to load an N-dimensional vector with exponential time advantage using a quantum circuit with polylogarithmic depth and entangled information in ancillary qubits. Results show that we can efficiently load data in quantum devices using a divide-and-conquer strategy to exchange computational time for space. We demonstrate a proof of concept on a real quantum device and present two applications for quantum machine learning. We expect that this new loading strategy allows the quantum speedup of tasks that require to load a significant volume of information to quantum devices.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1038/s41598-021-85474-1

Cites

12 of 12 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Self-check

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

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

Citations

Cites

Show all 12 references

Research works printed but not linked: 13

  1. Dong, Y. et al. Stochastic quantization for learning accurate low-bit deep neural networks. Int. J. Comput. Vis. 127, 1629–1642 (2019). · DOI
  2. Yang, C.-C. & Cong, G. Accelerating data loading in deep neural network training. In 2019 IEEE 26th International Conference on High Performance Computing, Data, and Analytics (HiPC), 235–245 (IEEE, 2019). · DOI
  3. Hughes, R. J., James, D. F., Knill, E. H., Laflamme, R. & Petschek, A. G. Decoherence bounds on quantum computation with trapped ions. Phys. Rev. Lett. 77, 3240 (1996). · DOI
  4. Shende, V. V., Bullock, S. S. & Markov, I. L. Synthesis of quantum-logic circuits. IEEE Trans. Comput.-Aided Design Integr. Circuits Syst. 25, 1000–1010 (2006). · DOI · Paper page
  5. Iten, R., Colbeck, R., Kukuljan, I., Home, J. & Christandl, M. Quantum circuits for isometries. Phys. Rev. A 93, 032318 (2016). · DOI · Paper page
  6. Park, D. K., Sinayskiy, I., Fingerhuth, M., Petruccione, F. & Rhee, J.-K.K. Parallel quantum trajectories via forking for sampling without redundancy. New J. Phys. 21, 083024. https://doi.org/10.1088/1367-2630/ab35fb (2019). · DOI
  7. Cormen, T. H., Leiserson, C. E., Rivest, R. L. & Stein, C. Introduction to algorithms (MIT press, 2009).
  8. Gentleman, W. M. & Sande, G. Fast fourier transforms: for fun and profit. In Proceedings of the November 7-10, 1966, fall joint computer conference, 563–578 (1966). · DOI · Paper page
  9. Mottonen, M., Vartiainen, J. J., Bergholm, V. & Salomaa, M. M. Transformation of quantum states using uniformly controlled rotations. Quant. Inf. Comput. 5, 467–473 (2005).
  10. Grant, E. et al. Hierarchical quantum classifiers. npj Quant. Inf.4, 65. https://doi.org/10.1038/s41534-018-0116-9 (2018). · DOI · Paper page
  11. Cohen, N. & Shashua, A. Convolutional rectifier networks as generalized tensor decompositions. Int. Conf. Mach. Learn. 955–963, (2016).
  12. Rossi, R. A. & Ahmed, N. K. The network data repository with interactive graph analytics and visualization. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI’15, 4292–4293 (AAAI Press, 2015). · DOI · Paper page
  13. Demšar, J. Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1–30 (2006).

Cited by

See all 166

Metadata

Authors
Araujo, I. F., Park, D. K., Petruccione, F., & da Silva, A. J.
Venue
Scientific Reports
Published
2021-03-18
Volume
11
Issue
1
Pages
6329-6329
ISSN
2045-2322 (ISSN-L)
OpenAlex
W3047378565
Cited by
166
References
12
FWCI
10.59
Type
journal article
Language
en
Open access
gold
Licence

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A divide-and-conquer algorithm for quantum state preparation. https://app.cochat.ai/papers/10.1038/s41598-021-85474-1
The paper
Araujo, I. F., Park, D. K., Petruccione, F., & da Silva, A. J. (2021). A divide-and-conquer algorithm for quantum state preparation. Scientific Reports. https://doi.org/10.1038/s41598-021-85474-1

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.