Universal variational quantum computation
Open accessAbstract
The author proves that the contemporary variational approach to quantum-enhanced algorithms enables a universal model of quantum computation. This brings the resources required for universal quantum computation closer to contemporary quantum processors.
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.
Integrity signals
Registry
Cites
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.
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?
VQAs allow for universal quantum computing.
“This has lead to VQAs being proposed for essentially all applications envisioned for quantum computers, and in fact, it has been shown that VQAs allow for universal quantum computing [103].”
From Variational quantum algorithms (2021) · cites this paper as [103]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 40 · Cited by 102
Research works printed but not linked: 1
- See Supplemental Material at http://link.aps.org/supplemental/ 10.1103/PhysRevA.103.L030401 for proofs not appearing after a lemma or theorem.
- Authors
- Biamonte, J.
- Affiliations
- Skolkovo Institute of Science and Technology (RU)
- Corresponding author
- Biamonte, Jacob
- ORCID
- Biamonte, Jacob
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2021-03-10
- Volume
- 103
- Issue
- 3
- ISSN
- 0556-2791 (ISSN-L)
- 2469-9926
- 2469-9934
- OpenAlex
- W3134863278
- Cited by
- 102
- References
- 40
- Citations by year
- 2026: 8 · 2025: 14 · 2024: 15 · 2023: 24 · 2022: 18 · 2021: 18 · 2020: 4 · 2019: 1
- FWCI
- 6.57
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- Locations
- Physical Review A (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Leading Research Center on Quantum Computing (014/20)
- 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 many-body systems
- Keywords
- universal quantum computation, quantum-enhanced algorithms, quantum processors, variational quantum algorithms
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
