Pith. sign in

REVIEW 3 major objections 6 minor 141 references

Quantum Computing for Energy Management: A Semi Non-Technical Guide for Practitioners

T0 review · 3 major / 6 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read No quantum speedup is demonstrated or apparent for energy management, and practitioners should plan around quantum-inspired methods.

desk verdict A readable, honest practitioner survey that needs corrections on complexity-theory claims before it can be fully trusted. read the letter →

arxiv 2411.11901 v1 pith:AJ5JTFJE submitted 2024-11-15 quant-ph

Jirawat Tangpanitanon This is my paper · ORCID
classification quant-ph
keywords quantumcomputingenergymanagementdistributedresourcesmachinelearningoptimizationQUBOquantum-inspiredalgorithmsspeedup
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This chapter is a practitioner's guide to choosing, formulating, and operating quantum-computing use cases in energy management, and its central claim is deliberately deflationary: there is no demonstrated, and as far as the author can see no apparent, quantum speedup for machine learning or optimization in this domain. The author reviews the candidate routes—quantum machine learning built on HHL-type subroutines, variational algorithms, and QUBO-based optimization—and finds each blocked by missing theoretical guarantees, noisy hardware, or costly data-loading overheads such as QRAM. The guide's practical conclusion is that near-term value is likelier to come from quantum-inspired algorithms and hardware, careful selection of strategic and tactical problems, and honest end-to-end accounting of speedups. A reader should care because the energy transition is a decades-long planning problem, and over- or under-investing in quantum technology now has real financial consequences.

What carries the argument

The argument is carried by the distinction between strong quantum speedup, meaning provably beating any known classical algorithm, and merely quantum-enhanced performance, meaning beating a particular classical model, together with the complexity classes $P$, $BQP$, and $NP$-hard. The named working objects are the QUBO formulation, binary variables minimizing a quadratic cost and equivalent to an Ising model, and the transformation protocol from MILP to QUBO via binary encoding and Lagrange multipliers, which converts hard constraints into soft quadratic penalties. These objects do the work of showing why hardware-driven formulations can make real problems harder, why coefficient growth becomes a communication bottleneck, and why current quantum optimizers cannot be guaranteed to outperform classical solvers.

What would settle it

A falsifying observation would be a published end-to-end benchmark on a realistic energy-management problem, such as day-ahead unit commitment or EV-charging placement, in which a quantum or quantum-inspired pipeline beats the best known classical solver by a provable super-polynomial gap after including data-loading, queueing, and communication costs; even a rigorous speedup proof for one energy-relevant problem class would weaken the no-apparent-speedup claim.

Watch

Extended reading notes

Core claim

The author's central finding is that, for energy management applications, no quantum speedup is currently apparent and no theoretical guarantee of speedup exists for quantum optimization. The speedups promised by quantum machine learning apply to limited settings, often when the learning data originates from quantum systems, and they require fault-tolerant hardware and QRAM; variational and annealing approaches that run on noisy near-term devices have no proven separation from classical heuristics. On the optimization side, the standard practice of translating MILP problems into QUBO form introduces infeasibility risks, dense all-to-all couplings, and coefficient counts that grow quadratically, so a medium instance with $10^5$ variables can become a QUBO with more than $10^{10}$ coefficients. The author therefore channels practitioners toward strategic-phase problems with one-time capital costs, toward distributed-generation use cases with room for improvement, and toward quantum-inspired methods such as tensor networks, digital annealers, and heuristic searches as the realistic near-term path.

Load-bearing premise

The conclusion that no quantum speedup is apparent rests on the assumption that the papers cited are a representative sample of the literature, an assumption the author himself flags when he says the references serve as examples and do not necessarily encompass the entirety of existing work.

Editorial extensions

If this is right

  • Near-term energy-management pilots should expect to compare quantum and quantum-inspired methods against mature classical solvers, not to claim provable advantage over them.
  • Strategic planning, with its long horizons, non-recurring costs, and large MILP models, is the phase most worth exploring for quantum optimization because it leaves room for improvement and can be treated as a one-time capital investment.
  • Real-time operational use of quantum resources is the hardest to justify: the cost is recurring, decisions are constrained by physical operations, and a classical feedback loop may do just as well.
  • MILP-to-QUBO translations can produce infeasible soft-constraint solutions and astronomical coefficient counts, so practitioners should prefer problems that are natively QUBO, such as quadratic assignment or max-cut, or design bespoke mappings.
  • New super-polynomial quantum advantages for formula coloring, polynomial intersection, and max-XORSAT are not yet energy-management results, but mapping them onto grid problems is the chapter's suggested avenue for future research.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the author's negative assessment holds, the economically rational default for an energy company is to keep classical and quantum-inspired optimization in production and treat full quantum computing as a monitored long-term option rather than a procurement target for near-term advantage.
  • The strong-speedup standard the author uses is stricter than the pragmatic standard of beating the incumbent solver in a real deployment, so quantum-enhanced results could exist even while strong speedups do not; the practical recommendation therefore does not follow automatically from the complexity-theory claim.
  • A concrete extension would be a benchmark suite of representative energy-management MILPs, including unit commitment, EV-charging placement, and storage scheduling, where tensor-network, digital-annealer, and classical MILP solvers are compared with full end-to-end costs; the guide's advice predicts quantum-inspired methods will be at least competitive while no fully quantum method shows a strong
  • The chapter's emphasis on communication overhead suggests a testable rule: any claimed speedup for data-intensive energy quantum machine learning should be discounted by the cost of loading classical data into QRAM or transmitting QUBO coefficients, and published end-to-end runtimes should include those steps.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. This book chapter is a practitioner-oriented guide to assessing and developing quantum computing use cases in energy management. It surveys candidate applications in quantum machine learning and quantum optimization, discusses the trade-offs among strategic, tactical, and operational planning phases, and compares fully quantum, quantum-inspired, NISQ, and fault-tolerant approaches. The central practical message is that while no clear quantum speedup has been established for energy-management ML or optimization tasks, practitioners should nevertheless engage with the field, particularly through quantum-inspired methods and careful use-case selection. The chapter also includes practical remarks on hardware availability, cost, communication overhead, and debugging.

Significance. If its claims are accepted, the chapter provides a useful, accessible decision-making framework for energy practitioners entering the quantum computing space, and it correctly emphasizes well-known limitations such as QRAM overhead, barren plateaus, and the MILP-to-QUBO expansion blow-up. The author is careful to distinguish quantum-enhanced from quantum-advantage claims and to acknowledge that absence of evidence is not evidence of absence. The chapter also explicitly credits the value of quantum-inspired methods and includes many recent references. However, the central negative conclusion—that no apparent quantum speedup exists for energy management—rests on a non-exhaustive reference base, and the chapter contains several technical inaccuracies in its complexity-theory exposition that need correction.

major comments (3)
  1. [§21.2.1.2 (and §21.1)] The statement that 'BQP does not include or overlap with NP-hard problems' is not an established result. The relationships among BQP, NP, and NP-hard are open; it is unknown whether NP is contained in BQP, and it is unknown whether BQP contains any NP-hard problem. The correct statement is that no efficient quantum algorithm for NP-hard problems is currently known and that it is conjectured, but not proven, that quantum computers cannot solve NP-hard problems. Because this statement is used to support the chapter's conclusion about quantum optimization speedups, it should be revised to reflect the open question.
  2. [§21.1 and §21.2.1.1–§21.2.1.2] The chapter explicitly disclaims completeness in §21.1 ('the references mentioned serve as examples and do not necessarily encompass the entirety of the existing literature'), yet §21.2.1.1 and §21.2.1.2 assert that 'there is currently no apparent ... quantum speedup' and 'there is currently no theoretical guarantee of quantum speedup.' These assertions function as general statements about the state of the art, not just about the cited examples. The disclaimed non-exhaustive survey is therefore in tension with the strength of the negative claims. I recommend either broadening the survey to cover relevant recent directions (e.g., quantum amplitude estimation for stochastic power-flow studies or Grover-based exact search) or explicitly restricting the conclusion to the sampled literature, for instance by writing 'in the surveyed literature, no speedup was apparent to the author.'
  3. [§21.1] The sentence 'fundamentally there exists certain computational problems that can be efficiently solved by a quantum computer but not by any imaginable classical computers' presents an open conjecture as a fact. The strict containment BQP ⊋ P is not proven; it is widely believed but unknown. For a practitioner guide, the formulation should be hedged—for example, 'it is believed that there exist problems feasible for quantum computers but not for classical ones'—to avoid a technically false impression.
minor comments (6)
  1. [§21.3.2] The claim that simulating an N-qubit system 'generally requires O(2^N) classical resources to store quantum states and O(4^N) for quantum gates' is misleading. State-vector storage requires O(2^N) amplitudes, and applying a dense N-qubit unitary costs O(4^N), but typical quantum circuits are composed of local gates acting on a few qubits, each of which costs O(2^N) or O(2^N poly) when applied to a state vector. The text should distinguish sparse gate-by-gate simulation from dense unitary multiplication.
  2. [§21.4.0.3] When stating that the number of QUBO coefficients grows quadratically with the number of decision variables, the example 'several gigabytes of data in many real-world scenarios' is underspecified. For a medium MILP with 10^5 variables (as mentioned in §21.2.1.2), the dense QUBO would have 10^10 coefficients, which at 64-bit precision is about 80 GB; adding this concrete estimate would strengthen the communication-overhead point.
  3. [§21.1] There is a typo: 'Forth' should be 'Fourth' in the list of reasons for not dismissing quantum computing.
  4. [§21.2.1.1] The sentence 'Currently, there are theoretical foundation proving quantum advantage for QML' contains grammatical errors; it should read 'there are theoretical foundations proving quantum advantage for QML.'
  5. [§21.3.1] The paragraph lists 'two primary types of fully quantum methods' (gate-based and quantum annealing) but then immediately introduces analog quantum computers as a third type. This is not contradictory, but the wording 'two primary types' could confuse readers; consider saying 'two widely available types' or 'two types that are the focus of this chapter.'
  6. [Abstract] The abstract contains a typo: 'artificial intellience' should be 'artificial intelligence.'

Circularity Check

0 steps flagged · score 1.0 of 10

No circular derivation found: the chapter is an externally grounded survey, and the sole self-citation is an illustrative explainability example that is not load-bearing.

full rationale

The paper is a literature review and practitioner guide; its central negative claims about quantum speedup in energy-management ML and optimization rest on external sources (e.g., Refs. [55]-[66], [88]-[90]) and on standard complexity-theoretic facts (BQP does not contain NP-hard problems), not on any result derived from its own assumptions. The only self-citation is Ref. [126] (Tangpanitanon et al., 'Explainable natural language processing with matrix product states'), used in Section 21.3.1 merely as an example that SVD can clarify long-range correlations in tensor-network models; this supports a side remark about explainability and does not feed into the speedup conclusions. The author explicitly disclaims exhaustiveness of the reference list in Section 21.1 ('the references mentioned serve as examples and do not necessarily encompass the entirety of the existing literature'), and the ML speedup claim is expressly qualified ('at least to the author') in Section 21.2.1.1. That acknowledged completeness limitation is an epistemic risk about the evidence base, not a circularity: no equation is fitted and renamed as a prediction, no uniqueness theorem is imported from the author's prior work, and no ansatz is smuggled in via self-citation. The QUBO/MILP/QAP/MaxCut formulas (21.1)-(21.5) are standard definitions used for exposition, not predictions derived from the chapter's conclusions. Accordingly, the derivation chain is self-contained in the sense relevant to circularity analysis, and the residual concern belongs under correctness/completeness risk rather than circularity.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

No free parameters or invented entities; this is a review. The main unstated premises are the representativeness of the literature and some unproven complexity-theoretic relationships.

assumptions (3)
  • standard math Quantum computing background: BQP contains P, and superposition and entanglement can provide computational speedups for certain problems.
    Invoked throughout Sections 21.1 and 21.2 as domain background, with no derivation needed.
  • domain assumption The complexity class BQP does not contain or overlap with NP-hard problems.
    Stated as fact in Section 21.2.1.2, but it is an open conjecture whether NP is contained in BQP.
  • domain assumption The selected references are representative of the full literature on quantum computing for energy management.
    The negative conclusion depends on the comprehensiveness of the survey, which the author acknowledges is non-exhaustive in Section 21.1.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quantum Computing for Energy Management: A Semi Non-Technical Guide for Practitioners." pith.science (2026). https://pith.science/paper/AJ5JTFJE

@misc{pith2026241111901,
  author       = {Pith},
  title        = {Pith review of: Quantum Computing for Energy Management: A Semi Non-Technical Guide for Practitioners},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AJ5JTFJE}},
  note         = {Machine review of arXiv:2411.11901}
}
read the original abstract

The pursuit of energy transition necessitates the coordination of several technologies, including more efficient and cost-effective distributed energy resources (DERs), smart grids, carbon capture, utilization, and storage (CCUS), energy-efficient technologies, Internet of Things (IoT), edge computing, artificial intellience (AI) and nuclear energy, among others. Quantum computing is an emerging paradigm for information processing at both hardware and software levels, by exploiting quantum mechanical properties to solve certain computational tasks exponentially faster than classical computers. This chapter will explore the opportunities and challenges of using quantum computing for energy management applications, enabling the more efficient and economically optimal integration of DERs such as solar PV rooftops, energy storage systems, electric vehicles (EVs), and EV charging stations into the grid

Figures

Figures reproduced from arXiv: 2411.11901 by the authors.

Figure 21
Figure 21. A diagram illustrating the typical decision-making process for [PITH_FULL_IMAGE:figures/full_fig_p002_21.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

141 extracted references · 51 canonical work pages

  1. [1]

    Distributed energy resources and benefits to the environment

    Akorede MF, Hizam H, Pouresmaeil E. Distributed energy resources and benefits to the environment. Renewable and Sustainable Energy Re- views. 2010;14(2):724–734. Available from: https://www.sciencedirect. com/science/article/pii/S1364032109002561

    2010

  2. [2]

    Review of optimization tech- niques applied for the integration of distributed generation from renewable energy sources

    Abdmouleh Z, Gastli A, Ben-Brahim L, et al. Review of optimization tech- niques applied for the integration of distributed generation from renewable energy sources. Renewable Energy. 2017;113:266–280. Available from: https://www.sciencedirect.com/science/article/pii/S0960148117304822

    2017

  3. [3]

    Multi-objective planning of distributed energy resources: A review of the state-of-the-art

    Alarcon-Rodriguez A, Ault G, Galloway S. Multi-objective planning of distributed energy resources: A review of the state-of-the-art. Renewable and Sustainable Energy Reviews. 2010;14(5):1353–1366. Available from: https://www.sciencedirect.com/science/article/pii/S1364032110000146

    2010

  4. [4]

    Towards a transac- tive energy system for integration of distributed energy resources: Home energy management, distributed optimal power flow, and peer- to-peer energy trading

    Guerrero J, Gebbran D, Mhanna S, et al. Towards a transac- tive energy system for integration of distributed energy resources: Home energy management, distributed optimal power flow, and peer- to-peer energy trading. Renewable and Sustainable Energy Reviews. 2020;132:110000. Available from: https://www.sciencedirect.com/science/ article/pii/S1364032120302914

    2020

  5. [5]

    A comprehensive re- view on microgrid and virtual power plant concepts employed for dis- tributed energy resources scheduling in power systems

    Nosratabadi SM, Hooshmand RA, Gholipour E. A comprehensive re- view on microgrid and virtual power plant concepts employed for dis- tributed energy resources scheduling in power systems. Renewable and Sustainable Energy Reviews. 2017;67:341–363. Available from: https: //www.sciencedirect.com/science/article/pii/S1364032116305160

    2017

  6. [6]

    Review of optimized layout of elec- tric vehicle charging infrastructures

    Tao Y , Huang M, Chen Y , et al. Review of optimized layout of elec- tric vehicle charging infrastructures. Journal of Central South Uni- versity. 2021;28:3268–3278. Available from: https://doi.org/10.1007/ s11771-021-4842-3. REFERENCES 17

    2021

  7. [7]

    Review of peer-to-peer energy trad- ing: Advances and challenges

    Zedan M, Nour M, Shabib G, et al. Review of peer-to-peer energy trad- ing: Advances and challenges. e-Prime - Advances in Electrical Engi- neering, Electronics and Energy. 2024;10:100778. Available from: https: //www.sciencedirect.com/science/article/pii/S2772671124003589

    2024

  8. [8]

    Quantum Computation and Quantum Information

    Nielsen MA, Chuang IL. Quantum Computation and Quantum Information. Cambridge University Press; 2010

    2010

Show all 141 references
  1. [9]

    Computational advantage of quantum random sampling

    Hangleiter D, Eisert J. Computational advantage of quantum random sampling. Rev Mod Phys. 2023 Jul;95:035001. Available from: https: //link.aps.org/doi/10.1103/RevModPhys.95.035001

    2023 doi

  2. [10]

    Simulating physics with computers

    Feynman RP. Simulating physics with computers. International Journal of Theoretical Physics. 1982;21(6-7):467–488

    1982

  3. [11]

    Quantum Computing 40 Years Later

    Preskill J. Quantum Computing 40 Years Later. 2nd ed. Feynman Lectures on Computation. CRC Press; 2023

    2023

  4. [12]

    Quantum Supremacy Using a Pro- grammable Superconducting Processor

    Arute F, Arya K, Babbush R, et al. Quantum Supremacy Using a Pro- grammable Superconducting Processor. Nature. 2019;574:505–510. Avail- able from: https://www.nature.com/articles/s41586-019-1666-5#citeas

    2019

  5. [13]

    The emerging commercial landscape of quantum computing

    MacQuarrie ER, Simon C, Simmons S, et al. The emerging commercial landscape of quantum computing. Nature Reviews Physics. 2020;2:596–

    2020

  6. [14]

    State of Quantum Computing: Build- ing a Quantum Economy

    Jaya Baloo ea. State of Quantum Computing: Build- ing a Quantum Economy. World Economic Forum. 2022;Available from: https://www.weforum.org/publications/ state-of-quantum-computing-building-a-quantum-economy/

    2022

  7. [15]

    Quantum cloud computing: Trends and challenges

    Golec M, Hatay ES, Golec M, et al. Quantum cloud computing: Trends and challenges. Journal of Economy and Technology. 2024;2:190–

    2024

  8. [16]

    Quantum Cloud Comput- ing: A Review, Open Problems, and Future Directions; 2024

    Nguyen HT, Krishnan P, Krishnaswamy D, et al.. Quantum Cloud Comput- ing: A Review, Open Problems, and Future Directions; 2024. Available from: https://arxiv.org/abs/2404.11420

    2024 arXiv

  9. [17]

    A Survey of Quantum Computing for Finance; 2022

    Herman D, Googin C, Liu X, et al.. A Survey of Quantum Computing for Finance; 2022. Available from: https://arxiv.org/abs/2201.02773

    2022 arXiv

  10. [18]

    Quantum Computing for Finance: State-of-the-Art and Future Prospects

    Egger DJ, Gambella C, Marecek J, et al. Quantum Computing for Finance: State-of-the-Art and Future Prospects. IEEE Transactions on Quantum En- gineering. 2020;1:1–24

    2020

  11. [19]

    Quantum computing for finance: Overview and prospects

    Or ´us R, Mugel S, Lizaso E. Quantum computing for finance: Overview and prospects. Reviews in Physics. 2019;4:100028. Available from: https: //www.sciencedirect.com/science/article/pii/S2405428318300571

    2019

  12. [20]

    Quantum computing for energy systems optimization: Challenges and opportunities

    Ajagekar A, You F. Quantum computing for energy systems optimization: Challenges and opportunities. Energy. 2019;179:76–89. Available from: https://www.sciencedirect.com/science/article/pii/S0360544219308254

    2019

  13. [21]

    Quantum computing and quantum artificial intel- ligence for renewable and sustainable energy: A emerging prospect to- wards climate neutrality

    Ajagekar A, You F. Quantum computing and quantum artificial intel- ligence for renewable and sustainable energy: A emerging prospect to- wards climate neutrality. Renewable and Sustainable Energy Reviews. 18 AI in Digitalization and Energy Management 2022;165:112493. Available...

    2022

  14. [22]

    Quantum Computing Opportunities in Renewable Energy

    Giani A, Eldredge Z. Quantum Computing Opportunities in Renewable Energy. SN Computer Science. 2021;2(393)

    2021

  15. [23]

    Quantum Computing and Sim- ulations for Energy Applications: Review and Perspective

    Paudel HP, Syamlal M, Crawford SE, et al. Quantum Computing and Sim- ulations for Energy Applications: Review and Perspective. ACS Engi- neering Au. 2022;2(3):151–196. Available from: https://doi.org/10.1021/ acsengineeringau.1c00033

    2022

  16. [24]

    Quantum compu- tation in power systems: An overview of recent advances

    Golestan S, Habibi MR, Mousazadeh Mousavi SY , et al. Quantum compu- tation in power systems: An overview of recent advances. Energy Reports. 2023;9:584–596. Available from: https://www.sciencedirect.com/science/ article/pii/S2352484722025720

    2023

  17. [25]

    Opportunities for Quantum Computing within Net- Zero Power System Optimization

    Morstyn T, Wang X. Opportunities for Quantum Computing within Net- Zero Power System Optimization. Joule. 2024;8(6):1619–1640. Available from: https://www.cell.com/joule/fulltext/S2542-4351(24)00155-7

    2024

  18. [26]

    Quantum computing in power systems

    Zhou Y , Tang Z, Nikmehr N, et al. Quantum computing in power systems. iEnergy. 2022;1(2):170–187

    2022

  19. [27]

    Quantum computing for smart grid applications

    Ullah M, Eskandarpour R, Zheng H, et al. Quantum computing for smart grid applications. IET Generation, Transmission & Distribution. 2022;16(23):4239–4257

    2022

  20. [28]

    Exploring Potential Applica- tions of Ising Machines for Power System Operations

    Kirihara K, Imai H, Kuroda E, et al. Exploring Potential Applica- tions of Ising Machines for Power System Operations. IEEE Access. 2023;11:68004–68017

    2023

  21. [29]

    Quantum-Enhanced Grid of the Future: A Primer

    Eskandarpour R, Bahadur Ghosh KJ, Khodaei A, et al. Quantum-Enhanced Grid of the Future: A Primer. IEEE Access. 2020;8:188993–189002

    2020

  22. [30]

    Quantum Algorithms for Quan- tum Chemistry and Quantum Materials Science

    Bauer B, Bravyi S, Motta M, et al. Quantum Algorithms for Quan- tum Chemistry and Quantum Materials Science. Chemical Reviews. 2020;120(22):12685–12717. Available from: https://doi.org/10.1021/acs. chemrev.9b00829

    2020 doi

  23. [31]

    Formulating and Solving Routing Problems on Quantum Computers

    Harwood S, Gambella C, Trenev D, et al. Formulating and Solving Routing Problems on Quantum Computers. IEEE Transactions on Quantum Engi- neering. 2021;2:1–17

    2021

  24. [32]

    A Systematic Literature Review of Quantum Computing for Routing Problems

    Osaba E, Villar-Rodriguez E, Oregi I. A Systematic Literature Review of Quantum Computing for Routing Problems. IEEE Access. 2022;10:55805– 55817

    2022

  25. [33]

    Applying the Quantum Ap- proximate Optimization Algorithm to the Tail-Assignment Problem

    Vikst ˚al P, Gr ¨onkvist M, Svensson M, et al. Applying the Quantum Ap- proximate Optimization Algorithm to the Tail-Assignment Problem. Phys Rev Appl. 2020 Sep;14:034009. Available from: https://link.aps.org/doi/10. 1103/PhysRevApplied.14.034009

    2020

  26. [34]

    Quantum Computing and Supply Chain Management: A New Era of Optimization

    Hassan A, Bhattacharya P, Dutta PK, et al., editors. Quantum Computing and Supply Chain Management: A New Era of Optimization. IGI Global; 2024

    2024

  27. [35]

    Quantum Computing in Telecommunication—A Survey

    Phillipson F. Quantum Computing in Telecommunication—A Survey. Mathematics. 2023;11(15). Available from: https://www.mdpi.com/ 2227-7390/11/15/3423. REFERENCES 19

    2023

  28. [36]

    Quantum Computing in Insurance Capital Modelling; 2023

    Tamturk M. Quantum Computing in Insurance Capital Modelling; 2023. Available from: https://www.mdpi.com/2227-7390/11/3/658

    2023

  29. [37]

    Toward the institutionalization of quantum computing in pharmaceutical research

    Zinner M, Dahlhausen F, Boehme P, et al. Toward the institutionalization of quantum computing in pharmaceutical research. Drug Discovery To- day. 2022;27(2):378–383. Available from: https://www.sciencedirect.com/ science/article/pii/S135964462100444X

    2022

  30. [38]

    Quantum error correction for beginners

    Devitt SJ, Munro WJ, Nemoto K. Quantum error correction for beginners. Reports on Progress in Physics. 2013 jun;76(7):076001. Available from: https://dx.doi.org/10.1088/0034-4885/76/7/076001

    2013 doi

  31. [39]

    Logical quantum processor based on reconfigurable atom arrays

    Bluvstein D, Evered SJ, Geim AA, et al. Logical quantum processor based on reconfigurable atom arrays. Nature. 2024;626(7997):58–65

    2024

  32. [40]

    Early Fault-Tolerant Quantum Computing

    Katabarwa A, Gratsea K, Caesura A, et al. Early Fault-Tolerant Quantum Computing. PRX Quantum. 2024 Jun;5:020101. Available from: https: //link.aps.org/doi/10.1103/PRXQuantum.5.020101

    2024 doi

  33. [41]

    Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules

    Kim IH, Liu YH, Pallister S, et al. Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules. Phys Rev Res. 2022 Apr;4:023019. Available from: https: //link.aps.org/doi/10.1103/PhysRevResearch.4.023019

    2022 doi

  34. [42]

    Pathways for sustainable energy transition

    Chen B, Xiong R, Li H, et al. Pathways for sustainable energy transition. Journal of Cleaner Production. 2019;228:1564–1571. Available from: https: //www.sciencedirect.com/science/article/pii/S0959652619314738

    2019

  35. [43]

    Defining the quantum workforce landscape: a review of global quantum education initiatives

    Kaur M, Venegas-Gomez A. Defining the quantum workforce landscape: a review of global quantum education initiatives. Optical Engineering. 2022;61(8):081806

    2022

  36. [44]

    Tensor Networks for Dimension- ality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives

    Cichocki A, Phan AH, Zhao Q, et al. Tensor Networks for Dimension- ality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives. Foundations and Trends® in Machine Learning. 2017;9(6):431–673. Available from: http://dx.doi.org/10.1561/220000006

    2017 doi

  37. [45]

    Towards quantum machine learning with tensor networks

    Huggins W, Patil P, Mitchell B, et al. Towards quantum machine learning with tensor networks. Quantum Science and Technology. 2019;4(2):024001. Available from: https://iopscience.iop.org/article/10. 1088/2058-9565/aaea94/meta

    2019

  38. [46]

    Digital Annealer for High- Speed Solving of Combinatorial optimization Problems and Its Applica- tions

    Matsubara S, Takatsu M, Miyazawa T, et al. Digital Annealer for High- Speed Solving of Combinatorial optimization Problems and Its Applica- tions. In: 2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC); 2020. p. 667–672

    2020

  39. [47]

    Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network: Toward quantum soft computing

    Goto H. Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network: Toward quantum soft computing. Scientific Reports. 2016;6:21686

    2016

  40. [48]

    Quantum Algorithm Implemen- tations for Beginners

    J A, Adedoyin A, Ambrosiano J, et al. Quantum Algorithm Implemen- tations for Beginners. ACM Transactions on Quantum Computing. 2022 Jul;3(4):1–92. Available from: http://dx.doi.org/10.1145/3517340

    2022 doi

  41. [49]

    Quantum algorithms: an overview

    Montanaro A. Quantum algorithms: an overview. npj Quantum Information. 2016;2(1):15023. Available from: https://doi.org/10.1038/npjqi.2015.23. 20 AI in Digitalization and Energy Management

    2016 doi

  42. [50]

    Quantum algorithms: A survey of applications and end-to-end complexities; 2023

    Dalzell AM, McArdle S, Berta M, et al.. Quantum algorithms: A survey of applications and end-to-end complexities; 2023. Available from: https: //arxiv.org/abs/2310.03011

    2023 arXiv

  43. [51]

    Trends in tools and approaches for modelling the energy transition

    Chang M, Thellufsen JZ, Zakeri B, et al. Trends in tools and approaches for modelling the energy transition. Applied Energy. 2021;290:116731. Available from: https://www.sciencedirect.com/science/ article/pii/S0306261921002476

    2021

  44. [52]

    Applications of reinforcement learn- ing in energy systems

    Perera ATD, Kamalaruban P. Applications of reinforcement learn- ing in energy systems. Renewable and Sustainable Energy Reviews. 2021;137:110618. Available from: https://www.sciencedirect.com/science/ article/pii/S1364032120309023

    2021

  45. [53]

    Wind, Solar, and Photovoltaic Renewable Energy Systems with and without Energy Storage Optimization: A Survey of Advanced Machine Learning and Deep Learning Techniques

    Abualigah L, Zitar R, Almotairi K, et al. Wind, Solar, and Photovoltaic Renewable Energy Systems with and without Energy Storage Optimization: A Survey of Advanced Machine Learning and Deep Learning Techniques. Energies. 2022;15(2):578

    2022

  46. [54]

    Real-Time Optimal Power Flow

    Tang Y , Dvijotham K, Low S. Real-Time Optimal Power Flow. IEEE Trans- actions on Smart Grid. 2017;8(6):2963–2973

    2017

  47. [55]

    Challenges and opportunities in quan- tum machine learning

    Cerezo M, Verdon G, Huang H, et al. Challenges and opportunities in quan- tum machine learning. Nature Computational Science. 2022;2:567–576

    2022

  48. [56]

    Quantum machine learning

    Biamonte J, Wittek P, Pancotti N, et al. Quantum machine learning. Nature. 2017;549:195–202

    2017

  49. [57]

    An introduction to quantum machine learning

    Schuld M, Sinayskiy I, Petruccione F. An introduction to quantum machine learning. Contemporary Physics. 2014;56(2):172–185

    2014

  50. [58]

    Quantum algorithm for data fitting

    Wiebe N, Braun D, Lloyd S. Quantum algorithm for data fitting. Physical review letters. 2012;109(5):050505

    2012

  51. [59]

    Quantum Boltzmann Machine

    Amin MH, Andriyash E, Rolfe J, et al. Quantum Boltzmann Machine. Phys Rev X. 2018 May;8:021050. Available from: https://link.aps.org/doi/10. 1103/PhysRevX.8.021050

    2018

  52. [60]

    Quantum principal component analysis

    Lloyd S, Mohseni M, Rebentrost P. Quantum principal component analysis. Nature Physics. 2014;10:631–633

    2014

  53. [61]

    Quantum support vector machine for big data classification

    Rebentrost P, Mohseni M, Lloyd S. Quantum support vector machine for big data classification. Physical review letters. 2014;113(13):130503

    2014

  54. [62]

    Quantum inference on Bayesian networks

    Low GH, Yoder TJ, Chuang IL. Quantum inference on Bayesian networks. Phys Rev A. 2014 Jun;89:062315. Available from: https://link.aps.org/doi/ 10.1103/PhysRevA.89.062315

    2014 doi

  55. [63]

    Quantum Perceptron Models

    Kapoor A, Wiebe N, Svore K. Quantum Perceptron Models. In: Lee D, Sugiyama M, Luxburg U, et al., editors. Advances in Neural In- formation Processing Systems. vol. 29. Curran Associates, Inc.; 2016. Available from: https://proceedings.neurips.cc/paper files/paper/2016/file/ d4...

    2016

  56. [64]

    Quantum-Enhanced Machine Learning

    Dunjko V , Taylor JM, Briegel HJ. Quantum-Enhanced Machine Learning. Phys Rev Lett. 2016 Sep;117:130501. Available from: https://link.aps.org/ doi/10.1103/PhysRevLett.117.130501

    2016 doi

  57. [65]

    An approximate Fourier transform useful in quantum fac- toring; 2002

    Coppersmith D. An approximate Fourier transform useful in quantum fac- toring; 2002. Available from: https://arxiv.org/abs/quant-ph/0201067. REFERENCES 21

    2002 arXiv

  58. [66]

    Quantum Algorithm for Linear Systems of Equations

    Harrow AW, Hassidim A, Lloyd S. Quantum Algorithm for Linear Systems of Equations. Phys Rev Lett. 2009 Oct;103:150502. Available from: https: //link.aps.org/doi/10.1103/PhysRevLett.103.150502

    2009 doi

  59. [67]

    HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids

    Jing H, Li Y , Brandsema MJ, et al. HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids. Applied Energy. 2024;361:122878. Available from: https://www.sciencedirect.com/ science/article/pii/S0306261924002617

    2024

  60. [68]

    Noise-resilient quantum power flow

    Feng F, Zhou YF, Zhang P. Noise-resilient quantum power flow. iEnergy. 2023;2(1):63–70

    2023

  61. [69]

    Quantum Comput- ing for Power Flow Algorithms: Testing on real Quantum Computers; 2022

    Sævarsson B, Chatzivasileiadis S, J ´ohannsson H, et al.. Quantum Comput- ing for Power Flow Algorithms: Testing on real Quantum Computers; 2022. Available from: https://arxiv.org/abs/2204.14028

    2022 arXiv

  62. [70]

    Experimental Quantum Com- puting to Solve Network DC Power Flow Problem; 2021

    Eskandarpour R, Ghosh K, Khodaei A, et al.. Experimental Quantum Com- puting to Solve Network DC Power Flow Problem; 2021. Available from: https://arxiv.org/abs/2106.12032

    2021 arXiv

  63. [71]

    Quantum Power Flow

    Feng F, Zhou Y , Zhang P. Quantum Power Flow. IEEE Transactions on Power Systems. 2021;36(4):3810–3812

    2021

  64. [72]

    Quantum Computing Solution of DC Power Flow; 2020

    Eskandarpour R, Ghosh K, Khodaei A, et al.. Quantum Computing Solution of DC Power Flow; 2020. Available from: https://arxiv.org/abs/2010.02442

    2020 arXiv

  65. [73]

    Quantum Random Access Memory

    Giovannetti V , Lloyd S, Maccone L. Quantum Random Access Memory. Phys Rev Lett. 2008 Apr;100:160501. Available from: https://link.aps.org/ doi/10.1103/PhysRevLett.100.160501

    2008 doi

  66. [74]

    Variational Quantum Algorithms

    Cerezo M, Arrasmith A, Babbush R, et al. Variational Quantum Algorithms. Nature Reviews Physics. 2021;3:625–644

    2021

  67. [75]

    Quantum Computing in the NISQ Era and Beyond

    Preskill J. Quantum Computing in the NISQ Era and Beyond. Quantum. 2018;2:79

    2018

  68. [76]

    Short-term photovoltaic power fore- casting based on hybrid quantum gated recurrent unit

    Jeong SG, Do QV , Hwang WJ. Short-term photovoltaic power fore- casting based on hybrid quantum gated recurrent unit. ICT Express. 2024;10(3):608–613. Available from: https://www.sciencedirect.com/ science/article/pii/S2405959523001637

    2024

  69. [77]

    Photovoltaic power fore- casting using quantum machine learning; 2023

    Sagingalieva A, Komornyik S, Senokosov A, et al.. Photovoltaic power fore- casting using quantum machine learning; 2023. Available from: https: //arxiv.org/abs/2312.16379

    2023

  70. [78]

    Forecasting solar irradiance with hybrid classical–quantum models: A comprehensive evaluation of deep learning and quantum-enhanced techniques

    Sushmit MM, Mahbubul IM. Forecasting solar irradiance with hybrid classical–quantum models: A comprehensive evaluation of deep learning and quantum-enhanced techniques. Energy Conversion and Management. 2023;294:117555. Available from: https://www.sciencedirect.com/science/ ar...

    2023

  71. [79]

    Application of Quan- tum Neural Network for Solar Irradiance Forecasting: A Case Study Using the Folsom Dataset, California

    Oliveira Santos V , Marinho FP, Costa Rocha PA, et al. Application of Quan- tum Neural Network for Solar Irradiance Forecasting: A Case Study Using the Folsom Dataset, California. Energies. 2024;17:3580

    2024

  72. [80]

    Quantum Computing Approach to Smart Grid Stability Forecasting

    Hangun B, Eyecioglu O, Altun O. Quantum Computing Approach to Smart Grid Stability Forecasting. In: 2024 12th International Conference on Smart Grid (icSmartGrid); 2024. p. 840–843. 22 AI in Digitalization and Energy Management

    2024

  73. [81]

    Training Variational Quantum Algorithms Is NP-Hard

    Bittel L, Kliesch M. Training Variational Quantum Algorithms Is NP-Hard. Phys Rev Lett. 2021 Sep;127:120502. Available from: https://link.aps.org/ doi/10.1103/PhysRevLett.127.120502

    2021 doi

  74. [82]

    Barren Plateaus in Quantum Neural Network Training Landscapes

    McClean JR, Boixo S, Smelyanskiy VN, et al. Barren Plateaus in Quantum Neural Network Training Landscapes. Nature Communications. 2018;9

    2018

  75. [83]

    Supervised quantum machine learning models are kernel meth- ods; 2021

    Schuld M. Supervised quantum machine learning models are kernel meth- ods; 2021. Available from: https://arxiv.org/abs/2101.11020

    2021 arXiv

  76. [84]

    Exponential separations between classical and quan- tum learners; 2023

    Gyurik C, Dunjko V . Exponential separations between classical and quan- tum learners; 2023. Available from: https://arxiv.org/abs/2306.16028

    2023 arXiv

  77. [85]

    Exponential quantum advantages in learn- ing quantum observables from classical data; 2024

    Molteni R, Gyurik C, Dunjko V . Exponential quantum advantages in learn- ing quantum observables from classical data; 2024. Available from: https: //arxiv.org/abs/2405.02027

    2024 arXiv

  78. [86]

    A rigorous and robust quantum speed-up in supervised machine learning

    Liu Y , Arunachalam S, Temme K. A rigorous and robust quantum speed-up in supervised machine learning. Nature Physics. 2021;17:1013–1017

    2021

  79. [87]

    Introduction to Operations Research

    Hillier FS, Lieberman GJ. Introduction to Operations Research. McGraw- Hill; 2015

    2015

  80. [88]

    An In-Principle Super-Polynomial Quantum Advantage for Approximating Combinatorial Optimization Problems via Computational Learning Theory

    Pirnay N, et al. An In-Principle Super-Polynomial Quantum Advantage for Approximating Combinatorial Optimization Problems via Computational Learning Theory. Science Advances. 2024;10

    2024

  81. [89]

    Optimization by Decoded Quantum Interferometry; 2024

    Jordan SP, Shutty N, Wootters M, et al.. Optimization by Decoded Quantum Interferometry; 2024. Available from: https://arxiv.org/abs/2408.08292

    2024

  82. [90]

    Challenges and Opportunities in Quantum Optimization

    Abbas A, Ambainis A, Augustino B, et al. Challenges and Opportunities in Quantum Optimization. Nature Reviews Physics. 2024

    2024

  83. [91]

    A Tutorial on Formulating and Using QUBO Models; 2019

    Glover F, Kochenberger G, Du Y . A Tutorial on Formulating and Using QUBO Models; 2019. Available from: https://arxiv.org/abs/1811.11538

    2019 arXiv

  84. [92]

    Quantum Algorithms for Mixed Bi- nary Optimization Applied to Transaction Settlement

    Braine L, Egger DJ, Glick J, et al. Quantum Algorithms for Mixed Bi- nary Optimization Applied to Transaction Settlement. IEEE Transactions on Quantum Engineering. 2021;2:1–8

    2021

  85. [93]

    Quantum annealing with inequality constraints: the set cover problem; 2023

    Djidjev HN. Quantum annealing with inequality constraints: the set cover problem; 2023. Available from: https://arxiv.org/abs/2302.11185

    2023 arXiv

  86. [94]

    On the Computational Viability of Quantum Optimization for PMU Placement; 2020

    Jones EB, Kapit E, Chang CY , et al.. On the Computational Viability of Quantum Optimization for PMU Placement; 2020. Available from: https: //arxiv.org/abs/2001.04489

    2020 arXiv

  87. [95]

    A Quantum Optimization Algorithm for Opti- mal Electric Vehicle Charging Station Placement for Intercity Trips; 2024

    Radvand T, Talebpour A. A Quantum Optimization Algorithm for Opti- mal Electric Vehicle Charging Station Placement for Intercity Trips; 2024. Available from: https://arxiv.org/abs/2410.16231

    2024 arXiv

  88. [96]

    Hybrid quantum-classical solution for electric vehicle charger placement problem

    Rao PU, Sodhi B. Hybrid quantum-classical solution for electric vehicle charger placement problem. Soft Computing. 2023;27:13347–13363

    2023

  89. [97]

    A Hybrid Quantum- Classical Approach to the Electric Mobility Problem

    Veshchezerova M, Somov M, Bertsche D, et al. A Hybrid Quantum- Classical Approach to the Electric Mobility Problem. In: 2023 IEEE In- ternational Conference on Quantum Computing and Engineering (QCE). vol. 01; 2023. p. 636–641

    2023

  90. [98]

    A Quantum Approach to the Problem of Charging Electric Cars on a Motorway

    R ´o˙zycki R, J ´ozefowska J, Kurowski K, et al. A Quantum Approach to the Problem of Charging Electric Cars on a Motorway. Energies. 2023;16(442). REFERENCES 23

    2023

  91. [99]

    Towards an Optimal Hybrid Algorithm for EV Charging Stations Placement using Quantum Annealing and Ge- netic Algorithms

    Chandra A, Lalwani J, Jajodia B. Towards an Optimal Hybrid Algorithm for EV Charging Stations Placement using Quantum Annealing and Ge- netic Algorithms. In: 2022 International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT); 2022. p. 1–6

    2022

  92. [100]

    Quantum-Powered Battery Scheduling in Modern Distribution Grids [Ph.D

    Ehsani D. Quantum-Powered Battery Scheduling in Modern Distribution Grids [Ph.D. thesis]. University of Denver; 2024. Electronic Theses and Dissertations, 2370. Available from: https://digitalcommons.du.edu/etd/ 2370

    2024

  93. [101]

    Leveraging Knapsack QAOA Approach for Optimal Electric Vehicle Charging

    Kea K, Huot C, Han Y . Leveraging Knapsack QAOA Approach for Optimal Electric Vehicle Charging. IEEE Access. 2023;11:109964–109973

    2023

  94. [102]

    Application benchmark for quantum optimization on electromobility use case

    Federer M, M ¨ussig D, Klaiber S, et al. Application benchmark for quantum optimization on electromobility use case. In: 2022 IEEE Vehicle Power and Propulsion Conference (VPPC); 2022. p. 1–6

    2022

  95. [103]

    Incentivizing Demand-Side Re- sponse Through Discount Scheduling Using Hybrid Quantum Optimization

    Bucher D, N ¨ußlein J, O’Meara C, et al. Incentivizing Demand-Side Re- sponse Through Discount Scheduling Using Hybrid Quantum Optimization. IEEE Transactions on Quantum Engineering. 2024;5:1–15. Available from: http://dx.doi.org/10.1109/TQE.2024.3407236

    2024

  96. [104]

    Efficient Quantum So- lution for the Constrained Tactical Capacity Problem for Distributed Elec- tricity Generation

    van der Linde SG, van der Schoot W, Phillipson F. Efficient Quantum So- lution for the Constrained Tactical Capacity Problem for Distributed Elec- tricity Generation. In: Krieger UR, Eichler G, Erfurth C, et al., editors. Innovations for Community Services. Cham: Springer Natu...

  97. [105]

    A quantum computing approach for minimum loss problems in electrical distribution networks

    Silva FFC, Carvalho PMS, Ferreira LAFM. A quantum computing approach for minimum loss problems in electrical distribution networks. Scientific Reports. 2023;13:10777

    2023

  98. [106]

    Power flow analysis using quantum and digital annealers: a discrete combinatorial optimization approach

    Kaseb Z, M ¨oller M, Vergara PP, et al. Power flow analysis using quantum and digital annealers: a discrete combinatorial optimization approach. Sci- entific Reports. 2024;14:23216

    2024

  99. [107]

    Solving Power Grid Opti- mization Problems with Rydberg Atoms; 2024

    Bauer N, Yeter-Aydeniz K, Kokkas E, et al.. Solving Power Grid Opti- mization Problems with Rydberg Atoms; 2024. Available from: https: //arxiv.org/abs/2404.11440

    2024 arXiv

  100. [108]

    Evaluating Quantum Optimization for Dynamic Self-Reliant Community Detection; 2024

    Bucher D, Porawski D, Wimmer B, et al.. Evaluating Quantum Optimization for Dynamic Self-Reliant Community Detection; 2024. Available from: https://arxiv.org/abs/2407.06773

    2024 arXiv

  101. [109]

    Quantum Approximate Optimization Algorithm- Enabled DER Disturbance Analysis of Networked Microgrids

    Jing H, Wang Y , Li Y , et al. Quantum Approximate Optimization Algorithm- Enabled DER Disturbance Analysis of Networked Microgrids. In: 2022 IEEE Energy Conversion Congress and Exposition (ECCE); 2022. p. 1–5

    2022

  102. [110]

    A Tutorial on Quantum Approximate Optimization Algo- rithm (QAOA): Fundamentals and Applications

    Choi J, Kim J. A Tutorial on Quantum Approximate Optimization Algo- rithm (QAOA): Fundamentals and Applications. In: 2019 International Conference on Information and Communication Technology Convergence (ICTC); 2019. p. 138–142

    2019

  103. [111]

    Quantum annealing for industry applications: introduction and review

    Yarkoni S, Raponi E, B ¨ack T, et al. Quantum annealing for industry applications: introduction and review. Reports on Progress in Physics. 2022;85(10):104001. 24 AI in Digitalization and Energy Management

    2022

  104. [112]

    A solution to the unit commitment prob- lem—a review

    Saravanan B, Das S, Sikri S, et al. A solution to the unit commitment prob- lem—a review. Frontiers in Energy. 2013;7:223–236

    2013

  105. [113]

    Optimal dynamic economic dispatch of genera- tion: A review

    Xia X, Elaiw AM. Optimal dynamic economic dispatch of genera- tion: A review. Electric Power Systems Research. 2010;80(8):975–

    2010

  106. [114]

    Adapting Quantum Approximation Optimization Algorithm (QAOA) for Unit Commitment

    Koretsky S, Gokhale P, Baker JM, et al. Adapting Quantum Approximation Optimization Algorithm (QAOA) for Unit Commitment. In: 2021 IEEE International Conference on Quantum Computing and Engineering (QCE)

    2021

  107. [115]

    Quantum Distributed Unit Commit- ment: An Application in Microgrids

    Nikmehr N, Zhang P, Bragin MA. Quantum Distributed Unit Commit- ment: An Application in Microgrids. IEEE Transactions on Power Systems. 2022;37(5):3592–3603

    2022

  108. [116]

    Learning Infused Quantum-Classical Distributed Optimization Technique for Power Generation Scheduling

    Mahroo R, Kargarian A. Learning Infused Quantum-Classical Distributed Optimization Technique for Power Generation Scheduling. IEEE Transac- tions on Quantum Engineering. 2023;4:1–14

    2023

  109. [117]

    Regional energy planning through SWOT analysis and strategic planning tools.: Impact on renewables devel- opment

    Terrados J, Almonacid G, Hontoria L. Regional energy planning through SWOT analysis and strategic planning tools.: Impact on renewables devel- opment. Renewable and Sustainable Energy Reviews. 2007;11(6):1275–

    2007

  110. [118]

    Enterprise frame- work for renewable energy

    Seetharaman A, Sandanaraj LL, Moorthy MK, et al. Enterprise frame- work for renewable energy. Renewable and Sustainable Energy Re- views. 2016;54:1368–1381. Available from: https://www.sciencedirect. com/science/article/pii/S136403211501206X

    2016

  111. [119]

    Strategic Bidding for a Virtual Power Plant in the Day-Ahead and Real-Time Markets: A Price-Taker Robust Optimization Approach

    Rahimiyan M, Baringo L. Strategic Bidding for a Virtual Power Plant in the Day-Ahead and Real-Time Markets: A Price-Taker Robust Optimization Approach. IEEE Transactions on Power Systems. 2016;31(4):2676–2687

    2016

  112. [120]

    Trading strategy optimization for a prosumer in continuous double auction-based peer-to-peer market: A prediction- integration model

    Chen K, Lin J, Song Y . Trading strategy optimization for a prosumer in continuous double auction-based peer-to-peer market: A prediction- integration model. Applied Energy. 2019;242:1121–1133. Available from: https://www.sciencedirect.com/science/article/pii/S0306261919305045

    2019

  113. [121]

    Electric Vehicle Route Optimization Consid- ering Time-of-Use Electricity Price by Learnable Partheno-Genetic Algo- rithm

    Yang H, Yang S, Xu Y , et al. Electric Vehicle Route Optimization Consid- ering Time-of-Use Electricity Price by Learnable Partheno-Genetic Algo- rithm. IEEE Transactions on Smart Grid. 2015;6(2):657–666

    2015

  114. [122]

    A new approach to scheduling in man- ufacturing for power consumption and carbon footprint reduction

    Fang K, Uhan N, Zhao F, et al. A new approach to scheduling in man- ufacturing for power consumption and carbon footprint reduction. Jour- nal of Manufacturing Systems. 2011;30(4):234–240. Selected Papers of 39th North American Manufacturing Research Conference. Available from...

    2011

  115. [123]

    Optimal Regulation of Vir- tual Power Plants

    Dall’Anese E, Guggilam SS, Simonetto A, et al. Optimal Regulation of Vir- tual Power Plants. IEEE Transactions on Power Systems. 2018;33(2):1868– 1881

    2018

  116. [124]

    Tensor Networks in a Nutshell; 2017

    Biamonte J, Bergholm V . Tensor Networks in a Nutshell; 2017. Available from: https://arxiv.org/abs/1708.00006. REFERENCES 25

    2017 arXiv

  117. [125]

    Tensor Networks Meet Neural Networks: A Survey and Future Perspectives; 2023

    Wang M, Pan Y , Xu Z, et al.. Tensor Networks Meet Neural Networks: A Survey and Future Perspectives; 2023. Available from: https://arxiv.org/abs/ 2302.09019

    2023 arXiv

  118. [126]

    Explainable natural lan- guage processing with matrix product states

    Tangpanitanon J, Mangkang C, Bhadola P, et al. Explainable natural lan- guage processing with matrix product states. New Journal of Physics. 2022;24

    2022

  119. [127]

    A quantum-inspired classical algorithm for recommendation sys- tems

    Tang E. A quantum-inspired classical algorithm for recommendation sys- tems. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. ACM; 2019. Available from: http://dx.doi.org/10. 1145/3313276.3316310

    2019

  120. [128]

    Quantum-inspired algorithms in practice

    Arrazola JM, Delgado A, Bardhan BR, et al. Quantum-inspired algorithms in practice. Quantum. 2020 Aug;4:307. Available from: https://doi.org/10. 22331/q-2020-08-13-307

    2020

  121. [129]

    Quantum-inspired metaheuristic algorithms: com- prehensive survey and classification

    Gharehchopogh FS. Quantum-inspired metaheuristic algorithms: com- prehensive survey and classification. Artificial Intelligence Review. 2023;56:5479–5543

    2023

  122. [130]

    Quantum-inspired genetic algorithms

    Narayanan A, Moore M. Quantum-inspired genetic algorithms. In: Pro- ceedings of IEEE International Conference on Evolutionary Computation

  123. [131]

    Quantum-Inspired Particle Swarm Op- timization for Valve-Point Economic Load Dispatch

    Meng K, Wang HG, Dong Z, et al. Quantum-Inspired Particle Swarm Op- timization for Valve-Point Economic Load Dispatch. IEEE Transactions on Power Systems. 2010;25(1):215–222

    2010

  124. [132]

    Fault-tolerant quantum computation

    Shor PW. Fault-tolerant quantum computation. In: Proceedings of 37th Conference on Foundations of Computer Science; 1996. p. 56–65

    1996

  125. [133]

    Efficient Quantum Circuit Simulation by Ten- sor Network Methods on Modern GPUs

    Pan F, Gu H, Kuang L, et al. Efficient Quantum Circuit Simulation by Ten- sor Network Methods on Modern GPUs. ACM Transactions on Quantum Computing. 2024;Accepted on 31 August 2024

    2024

  126. [134]

    Programmable quan- tum simulations of spin systems with trapped ions

    Monroe C, Campbell WC, Duan LM, et al. Programmable quan- tum simulations of spin systems with trapped ions. Rev Mod Phys. 2021 Apr;93:025001. Available from: https://link.aps.org/doi/10.1103/ RevModPhys.93.025001

    2021

  127. [135]

    Neutral atom quantum computing hardware: performance and end-user perspective

    Wintersperger K, Dommert F, Ehmer T, et al. Neutral atom quantum computing hardware: performance and end-user perspective. EPJ Quan- tum Technology. 2023;10:32. Available from: https://doi.org/10.1140/epjqt/ s40507-023-00190-1

    2023 doi

  128. [136]

    Quantum computational advantage using photons

    Zhong HS, Wang H, Deng YH, et al. Quantum computational advantage using photons. Science. 2020;370(6523):1460–1463. Available from: https: //www.science.org/doi/abs/10.1126/science.abe8770

    2020 doi

  129. [137]

    Superconduct- ing Qubits: Current State of Play [Journal Article]

    Kjaergaard M, Schwartz ME, Braum ¨uller J, et al. Superconduct- ing Qubits: Current State of Play [Journal Article]. Annual Re- view of Condensed Matter Physics. 2020;11(V olume 11, 2020):369–395. Available from: https://www.annualreviews.org/content/journals/10.1146/ annurev-...

    2020

  130. [199]

    Available from: https://www.sciencedirect.com/science/article/pii/ S2949948824000271

  131. [598]

    Available from: https://doi.org/10.1038/s42254-020-00247-5

    doi

  132. [986]

    Available from: https://www.sciencedirect.com/science/article/pii/ S0378779610000027

  133. [1287]

    Available from: https://www.sciencedirect.com/science/article/pii/ S1364032105001000

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.