The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Combinatorial optimization through variational quantum power method
Open accessAbstract
The power method (or iteration) is a well-known classical technique that can be used to find the dominant eigenpair of a matrix. Here, we present a variational quantum circuit method for the power iteration, which can be used to find the eigenpairs of unitary matrices and so their associated Hamiltonians. We discuss how to apply the circuit to combinatorial optimization problems formulated as a quadratic unconstrained binary optimization and discuss its complexity. In addition, we run numerical simulations for random problem instances with up to 21 parameters and observe that the method can generate solutions to the optimization problems with only a few number of iterations and the growth in the number of iterations is polynomial in the number of parameters. Therefore, the circuit can be simulated on the near-term quantum computers with ease.
Overview
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
Verification
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?
The cited source says what the claim attributes to it.
In the citing paper
“Several other approaches have been identified where the ansatz adaptations happen as a secondary effect, e.g., References [36, 48, 82, 131, 153].”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [36]
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
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552 · cited 1×
“In order to maximize the probability P0; as in the standard variational quantum algorithm [5], a classical optimization algorithm such as NelderMead method [6] can be employed to determine the next values of θjs from the measurement output of the each individual qubits.”
MethodStatistical distance and the geometry of quantum states
Braunstein, S. L., & Caves, C. M. (1994) · Physical Review Letters · doi:10.1103/physrevlett.72.3439 · Cited by 3,176
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Combinatorial Optimization: Theory and Algorithms
Korte, B., & Vygen, J. (2012) · Algorithms and Combinatorics · doi:10.1007/978-3-642-24488-9 · Cited by 507
Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models
Glover, F., Kochenberger, G., & Du, Y. (2019) · 4OR · doi:10.1007/s10288-019-00424-y · Cited by 298
Reliable Quantum State Tomography
Christandl, M., & Renner, R. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.120403 · Cited by 200
Machine learning for precise quantum measurement
Hentschel, A., & Sanders, B. C. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.063603 · Cited by 197
Ezugwu, A. E.-S., Pillay, V., Hirasen, D., Sivanarain, K., & Govender, M. (2019) · IEEE Access · doi:10.1109/access.2019.2908489 · Cited by 101
Achieving quantum precision limit in adaptive qubit state tomography
Hou, Z., Zhu, H., Xiang, G., Li, C., & Guo, G. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.1 · Cited by 59
Research works printed but not linked: 2
- Cramér, H.: Mathematical Methods of Statistics, vol. 43. Princeton University Press, Princeton (1999)
- Farhi, E., Goldstone, J., Gutmann, S., Sipser, M. (2000). Quantum computation by adiabatic evolution. http://arxiv.org/abs/quant-ph/0001106 · arXiv
Cited by
Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study
Gemeinhardt, F., Garmendia, A., Wimmer, M., Weder, B., & Leymann, F. (2024) · ACM Computing Surveys · doi:10.1145/3620668 · Cited by 22
Metadata
- Authors
- Daskin, A.
- Affiliations
- Istanbul Medeniyet University (TR)
- Corresponding author
- Daskin, Ammar
- ORCID
- Daskin, Ammar
- Venue
- Quantum Information Processing
- Published
- 2021-10
- Volume
- 20
- Issue
- 10
- ISSN
- 1570-0755 (ISSN-L)
- 1573-1332
- OpenAlex
- W3038877908
- Cited by
- 4
- References
- 11
- Citations by year
- 2026: 1 · 2024: 2 · 2023: 1
- FWCI
- 0.27
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- www.springer.com/tdm (vor)
- Locations
- Quantum Information Processing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- variational quantum circuits, power iteration, unitary matrices, QUBO, combinatorial optimization, quantum circuit complexity, near-term quantum devices
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: Combinatorial optimization through variational quantum power method. https://app.cochat.ai/papers/10.1007/s11128-021-03283-x
- The paper
- Daskin, A. (2021). Combinatorial optimization through variational quantum power method. Quantum Information Processing. https://doi.org/10.1007/s11128-021-03283-x
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.
