The DOI matches its Crossref record; 41 of the 44 references it cites were found in a registry or an index.
Reverse quantum annealing approach to portfolio optimization problems
Open accessOverview
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
“When it comes to more advanced quantum annealing methods, forward as well as reverse annealing have been applied to the nurse scheduling problem [69] and portfolio optimization [140].”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [140]
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
“Options, Futures, and Other Derivatives”
(2016) · AMBER – ABBS Management Business and Entrepreneurship Review · doi:10.23874/amber/2016/v7/i1/121351 · Cited by 5,080
Sharpe, W. F. (1966) · The Journal of Business · doi:10.1086/294846 · Cited by 3,937
Quantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772
Self-citationSortino, F. A., & van der Meer, R. (1991) · The Journal of Portfolio Management · doi:10.3905/jpm.1991.409343 · Cited by 605
Defining and detecting quantum speedup
Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M. (2014) · Science · doi:10.1126/science.1252319 · Cited by 601
What is the Computational Value of Finite-Range Tunneling?
Denchev, V. S., Boixo, S., Isakov, S. V., Ding, N., Babbush, R., Smelyanskiy, V., Martinis, J., & Neven, H. (2016) · Physical Review X · doi:10.1103/physrevx.6.031015 · Cited by 399 · cited 2×
“For this reason they are subject to extensive empirical investigation by several groups around the world, not only for scientific and research purposes [1, 2], but also for performance evaluation on structured real world optimization challenges [3, 4, 5].”
BackgroundOptimization Methods in Finance
Cornuéjols, G., & Tütüncü, R. H. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511753886 · Cited by 354
Hamerly, R., Inagaki, T., McMahon, P. L., Venturelli, D., Marandi, A., Onodera, T., Ng, E., Langrock, C., Inaba, K., Honjo, T., et al. (2019) · CaltechAUTHORS (California Institute of Technology) · Cited by 257
Self-citationDemonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing
Albash, T., & Lidar, D. A. (2018) · Physical Review X · doi:10.1103/physrevx.8.031016 · Cited by 238 · cited 1×
“In particular, the annealing time is expected to be suboptimal for N ≤ 50, leading to a measurement of a flatter slope for the median TTS [33].”
Background
Research works printed but not linked: 2
- Kondratyev A, Giorgidze G (2017) Evolutionary algos for mva optimisation. Risk 30(12):136–141
- Markowitz H (1952) Portfolio selection. J Financ 7(1):77–91
Cited by
Sorted by citations
Items 201–235 of 235
Osaba, E., & Villar-Rodríguez, E. (2025) · Frontiers in Physics · doi:10.3389/fphy.2025.1468348
Relaxation-assisted reverse annealing on nonnegative/binary matrix factorization
Haba, R., Ohzeki, M., & Tanaka, K. (2025) · PLoS ONE · doi:10.1371/journal.pone.0323232 · Cited by 2
Solving Portfolio Optimization Problems using Adiabatic Quantum ComputingPreprint
Kolodziejczyk, B. (2025) · Research Square · doi:10.21203/rs.3.rs-6986668/v1
Optimization Methods in Machine Drawings
Kulkarni, A. J. (2025) · Springer eBooks · doi:10.1007/978-981-96-5257-0_9
Fast numerical solver of Ising optimization problems via pruning and domain selection
Li, L., Dong, D., & Pan, Y. (2025) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2025.107945
The Art of Quantum Computing for Finance: Brief Overview and ProspectsPreprint
Mengara, O. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5373357
Unveiling Privacy Risks in Quantum Optimization Services
Leśniak, M., Wroński, M., Syta, E., & Kutyłowski, M. (2025) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/3708821.3736213
The Art of Quantum Computing for Finance: Brief Overview and ProspectsPreprint
Mengara, O. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5362526
Efficient Construction of Feasible Solutions in Column Generation Using Quantum Annealing
Takabayashi, T., Maruyama, N., Yoshihara, T., Haba, R., & Ohzeki, M. (2025) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.94.094005 · Cited by 1
SAPO: Improving the Scalability and Accuracy of Quantum Linear Solver for Portfolio Optimization
Zhu, T., Lu, L., Chen, J., Chen, Y., Chen, H., Xi, M., Zhang, J., Sun, X., & Yin, J. (2025) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac63849.2025.11133130
Reformulation of One-Hot Constraints in Combinational Optimization
Katayama, N., & Ohzeki, M. (2025) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.94.104003
Quantum Artificial Intelligence for Critical Infrastructure: A Survey and Vision
Chen, S. Y.-C., & Chen, K. (2025) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn64981.2025.11227684
Gunjan, A., & Bhattacharyya, S. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00338-5 · Cited by 1
Taghavi, M., & Vahidi, J. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00335-8 · Cited by 5
Kuo, S., Lee, K.-L., Shen, J., & Chou, Y. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00245
Deshmukh, S. A., Sethi, N., & Rathore, N. P. S. (2025) · IEEE International Conference on Advances in Computing Research on Science Engineering and Technology (ACROSET) · doi:10.1109/acroset66531.2025.11280975
Gunjan, A., & Bhattacharyya, S. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-33136-7.00007-4
Lamba, C. S., khanna, E., & Aadrian, A. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6510395
Supervised learning in binary dynamical physical systems through energy minimization
Laydevant, J. (2022) · theses.fr (ABES) · doi:10.70675/efd1c35czdc85z40bdzb5d3zd973c7dde220
Performance evaluation and control improvements for solving optimization problems on NISQ platforms
Gilbert, V. (2024) · theses.fr (ABES) · doi:10.70675/81f9c638z5867z40e4zaed8ze9824ff5a163
Quantum Computing for Operations Research : A special approach for Project Scheduling
Armas, L. F. P. (2024) · theses.fr (ABES) · doi:10.70675/cf991df2zcbd5z4574z9f45z6f05451dcf70
Quantum-Classical Hybrid Algorithm Using Quantum Annealing for Multi-Objective Job Shop Scheduling
Sawamura, K., Araki, K., Maruyama, N., Haba, R., & Ohzeki, M. (2026) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.95.054002 · Cited by 7
Audio Source Separation via Nonnegative Binary Matrix Factorization Using D-Wave Quantum Annealer
Sasajima, T., Koshikawa, A. S., & Ohzeki, M. (2026) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.95.064006
Curato, G., Ponzi, M., Chiatello, E., & Giorgetti, R. (2026) · APS Open Science · doi:10.1103/hj46-qw5t
Analytical Dimensions and Performance Evaluation of the Quantum Approximate Optimization Algorithm
Trigueros, B., Roig, P., Alcaraz, S., & Gilly, K. (2026) · 2026 International Conference on Integrated Intelligence and Cognitive Engineering (ICIICE) · doi:10.1109/iciice69672.2026.11565281
Portfolio Optimization Using Quantum Computing
Bharad, S. V., Sutar, S. R., Babhulgaonkar, A., & Jadhav, S. M. (2026) · 2026 International Conference on Sustainable and Futuristic Technologies (ICSFT) · doi:10.1109/icsft67370.2026.11566093
Large-scale portfolio optimization with variational neural annealing
Anonymous, Javanparast, B., Goerz, D., & Inack, E. M. (2026) · Physical review. E · doi:10.1103/p22k-x7p6 · Cited by 1
Extending the computational reach of quantum annealing using reverse annealing
Menger, L. J., Lippert, T., & Jattana, M. S. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00562-3
Dijital Varlıklar ve Yapay Zekâ Çağında Yatırım Analizi Yeni Nesil Portföy Yönetimi Stratejileri
Sarı, B. (2026) · Akademisyen Kitabevi eBooks · doi:10.37609/akya.4273
Energy Gap of Quantum Spin Glasses: A Projection Quantum Monte Carlo Study
Brodoloni, L., Astrakharchik, G. E., Giorgini, S., & Pilati, S. (2026) · Physical Review Letters · doi:10.1103/fm8m-kz13
QUANG, T. N., Matsuyama, K., Shimizu, K., Sugano, H., Kurimoto, E., Suzuki, J., Chen, Z., Waidyasooriya, H. M., Kosei, N., Hariyama, M., et al. (2026) · IEEE Access · doi:10.1109/access.2026.3717906
Reproducible QUBO-QAOA Benchmark for Cardinality-Constrained Mean-Variance Portfolio Selection
Kılıç, A., & Erkalkan, E. (2026) · 2026 6th International Conference on Electrical, Computer and Energy Technologies (ICECET) · doi:10.1109/icecet65726.2026.11632298
Lu, Y.-C., & Chen, T.-H. (2026) · International Conference on Big Data Computing Service and Applications · doi:10.1109/bigdataservice70481.2026.00030
Ningshen, N., Jindal, V., Dhiman, S., & Bedi, P. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7369007
Quantum Algorithms for Trading: A Survey of Speedups, Thresholds, and Dequantization
Laura, L., Parrillo, M., Pascucci, A., Rossi, M., & Rughetti, V. (2026) · Information · doi:10.3390/info17090908
Metadata
- Authors
- Venturelli, D., & Kondratyev, A.
- Affiliations
- Research Institute for Advanced Computer Science (US)
- Corresponding author
- Venturelli, Davide
- ORCID
- Venturelli, Davide
- Venue
- Quantum Machine Intelligence
- Published
- 2019-04-26
- Volume
- 1
- Issue
- 1-2
- Pages
- 17-30
- ISSN
- 2524-4906 (ISSN-L)
- 2524-4914
- OpenAlex
- W2897628955
- Cited by
- 233
- References
- 44
- Citations by year
- 2026: 21 · 2025: 44 · 2024: 38 · 2023: 32 · 2022: 29 · 2021: 34 · 2020: 23 · 2019: 11
- FWCI
- 11.42
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Quantum Machine Intelligence (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation (164883)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Social Sciences › Decision Sciences › Management Science and Operations Research › Risk and Portfolio Optimization
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Keywords
- portfolio optimization, mean-variance portfolio, D-Wave quantum annealer, hybrid quantum-classical algorithms, greedy local search, solution time
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
