Pith. sign in

REVIEW 4 major objections 4 minor 92 references

Q-RESTORE: Quantum-Driven Framework for Resilient and Equitable Transportation Network Restoration

T0 review · 4 major / 4 minor · reviewed 2026-08-10 · deepseek-v4-flash

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

Pith's one-line read Q-RESTORE claims a hybrid quantum solver can plan post-disaster road repairs in about 8.7 seconds while restoring low-income areas first.

desk verdict The equity term in Q-RESTORE is constant in the restoration variables, so the paper's own equations contradict the central equity claim; the framework needs a rewrite, not a referee. read the letter →

arxiv 2501.11197 v1 pith:6QU3BCNN submitted 2025-01-20 cs.MA cs.ET

Daniel Udekwe , Ruimin Ke , Jiaqing Lu , Qian-wen Guo This is my paper · ORCID
classification cs.MAcs.ET
keywords Q-RESTOREquantumannealinghybridsolvertransportationnetworkrestorationequityGinicoefficientgeneticalgorithmpost-disasterrecovery
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

Q-RESTORE is a proposed framework for post-disaster transportation network restoration that casts link-recovery choices as a constrained quadratic optimization problem and solves it with a hybrid quantum-classical annealer. The paper claims this solver produces restoration plans in roughly 8.7 seconds regardless of budget size, where a genetic algorithm needs more than 600 seconds, and that the plans consistently give more restored capacity to links serving low-income neighborhoods. The intended payoff is practical: emergency managers could recompute equitable recovery plans in near real time as damage reports change, instead of waiting on slow population-based search. A sympathetic reading is that quantum hybrid optimization is being positioned as a decision-support tool that can put equity on the same objective function as traffic efficiency.

What carries the argument

The carrying object is the Hamiltonian of a constrained quadratic model, $H(x) = \mu D + (1-\mu) E + \lambda_1(\sum_a M_a(C^1_a) - B)^2 + \lambda_2 \sum_a \max(0, C^0_a + C^1_a - C_a)^2$, in which $D$ is a recovery-deficiency index built from BPR travel times and $E$ is a Gini-coefficient equity term over zone incomes. The hybrid solver anneals a transverse-field Hamiltonian that interpolates from a uniform superposition to this problem Hamiltonian, with classical post-processing enforcing constraints. The genetic algorithm comparison uses the same fitness pieces $R_j = \mu D_j + (1-\mu) E_j + \rho_j$ with tournament selection, one-point crossover, and budget-preserving mutation, so the two solvers are claimed to differ only in how the same objective is searched.

What would settle it

Re-run the Q-RESTORE optimization with all zone incomes set equal, or with the income labels randomly permuted; a genuinely equity-sensitive objective must change which links are restored, while the objective as written in Eq. (7) yields identical restoration plans. Alternatively, evaluate $E$ from Eq. (7) for two different feasible restoration solutions and observe that the value is unchanged, which would contradict the reported dependence of allocations on $\mu$.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that the hybrid quantum solver, applied to a bi-objective restoration problem on the Sioux Falls network, maximizes recovery per dollar while putting equity first: links in low-income zones receive the largest restored capacities at every tested budget, and only after those are served do average- and high-income links receive capacity. The reported runtimes are 8.75, 8.75, 8.75 and 8.75 seconds for budgets of 75, 150, 225 and 300, against 665.0, 665.9, 677.7 and 674.7 seconds for the genetic algorithm. The paper interprets the flat runtime and the rising low-income share as evidence that a hybrid quantum annealer can handle the constraint-heavy restoration search faster than evolutionary search and with an equity-oriented allocation policy.

Load-bearing premise

The load-bearing premise is that the equity term in the objective actually determines which links get restored; as written, $E = \frac{1}{2N^2\bar{I}}\sum_{r,s}|I_r - I_s|$ depends only on neighborhood incomes, not on the restoration variables, so it cannot by itself produce the reported low-income-first allocation.

Editorial extensions

If this is right

  • If the 8.7-second runtime is representative, restoration plans can be re-optimized on the fly as new damage assessments arrive, shrinking the gap between data collection and decision.
  • Because runtime stays flat across budgets from 75 to 300, the paper's claim implies that the hybrid solver's cost is dominated by fixed annealing and post-processing overhead, not by the number of links restored.
  • An equity-first allocation rule follows directly: spend early budget on low-income-serving links, then extend to average- and high-income links as the budget grows, which is a concrete policy recipe for recovery funds.
  • The GA comparison implies that population-based evolutionary search is the relevant classical bottleneck, so future classical baselines should be judged on the same budget-utilization and equity criteria, not only solution time.
  • If the framework scales to larger cities, the solver still needs a fixed demand matrix and link-capacity inputs, meaning the practical constraint is data update frequency rather than optimization compute time.

Reading between the lines

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

  • The equity term $E$ in Eq. (7) depends only on fixed zone incomes $I_r$ and $I_s$, not on the restored capacities $C^1_a$; if that is the objective the solver actually received, changing $\mu$ could not change the optimal link choices, so the reported $\mu$-sweep likely requires a different or augmented equity formulation.
  • A direct test of the equity mechanism is to permute the income labels on the 24 zones and rerun the optimization: a genuinely equity-driven objective must shift restored capacities accordingly, while the constant-$E$ version would leave them unchanged.
  • The speed comparison is against a single GA configuration with population 50, mutation rate 0.1, and tournament size 3; a tuned or warm-started GA might close much of the 600-second gap, so the headline result should be read as 'this hybrid solver beats this GA setup,' not as a general quantum-classical advantage.
  • For deployment, the useful output is not one plan but a frontier: re-running the solver with several $\mu$ values traces the trade-off between travel-time recovery and equity, and each frontier point is cheap enough to show to decision makers in real time.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 4 minor

Summary. Q-RESTORE proposes a hybrid quantum-classical optimization framework for post-disaster transportation network restoration, using a bi-objective objective that weights a recovery deficiency index D against a Gini-based equity measure E. The model is tested on a 24-zone Sioux Falls network with up to 25 damaged links, comparing D-Wave's hybrid solver with a genetic algorithm across budget levels. The paper claims that the quantum solver runs in about 8.7 seconds versus over 600 seconds for the GA, and that the equity term causes restoration to prioritize low-income neighborhoods, with low-income communities served first and higher-income areas receiving more capacity only as budgets grow.

Significance. If the central claims were correct, the paper would contribute a useful demonstration of hybrid quantum solvers for a socially relevant infrastructure restoration problem. The manuscript deserves credit for stating its model explicitly and for using literature-based BPR constants and stated income thresholds rather than fitting parameters to a desired outcome; the runtime comparison is also a concrete, falsifiable claim. However, the equity mechanism that motivates the entire study is not present in the model as written: the equity term is constant in the restoration variables, so it cannot produce the reported mu-dependent allocations. The significance of the paper therefore depends on a reformulation and a complete rerun of the experiments, rather than on local corrections.

major comments (4)
  1. [Section III-A, Eqs. (7) and (21); Figure 5b] The equity term E is constant in the decision variables. Eq. (7) defines E = 1/(2N^2 \bar I) \sum_{r,s} |I_r - I_s|, and Eq. (21) replaces the absolute value with u_{r,s} = (I_r - I_s)^2; neither expression contains C_a^1. Substituting into Eq. (3) gives R = \mu D + (1-\mu) E_0 with E_0 a fixed number for the given zoning, so the term (1-\mu)E_0 shifts the objective value but cannot change the argmin over C_a^1 at a fixed budget B, because neither the objective coefficient of C_a^1 nor the feasible set depends on \mu. Figure 5b, which reports different restored capacities per income group as \mu goes from 0.0 to 1.0, is therefore incompatible with the stated model. The low-income prioritization shown in Figure 5a, if observed, must come from the mobility term D or from network topology, not from the equity term as defined. This invalidates the paper's central claim that the framework targets the connectivity needs of different income communities through an equity-aware objective.
  2. [Section IV-A and Table III caption] The reported experimental setting is internally inconsistent. The text states that "a single value of \mu = 0.2 is used in the resilience measure" while Table III is captioned "RECOVERY CAPACITIES ... FOR \mu = 0.5 ACROSS VARIOUS BUDGET LEVELS," and Figure 5b uses \mu = 0.0, 0.25, 0.75, and 1.0. The reader cannot determine which objective was actually optimized for the headline results, and the discrepancy compounds the issue raised about the equity term.
  3. [Tables II and III] The "Maximum recovery capacity" entries in Table III do not match the capacities of the same link numbers in Table II. For example, link 7 is listed with maximum recovery 6.81 instead of 46.81, link 10 with 9.82 instead of 9.04, link 43 with 7.02 instead of 27.02, and link 45 with 4.42 instead of 9.64 (the value 4.42 appears in Table II for link 57). If these are post-disaster residual capacities, the paper does not state how they were computed; if they are not, several of the numerical results, including the equity percentages and the sum totals, are based on data other than the stated network parameters.
  4. [Section IV and Section III-C] The experiments are not reproducible from the manuscript: no code, data files, D-Wave solver parameters (such as \lambda_1, \lambda_2, number of reads, or time limit), or random seeds are provided. This matters because both the hybrid solver and the GA are stochastic, and the central quantitative claims (restoration values, runtime, and equity percentages) depend on these choices. The paper should at minimum report the full set of hyperparameters and, ideally, make the code and data available.
minor comments (4)
  1. [Section III-D, Eq. (35)] The penalty formula is written as \rho = (c_a - B) \times \rho when the restoration cost exceeds the budget, which is self-referential and dimensionally inconsistent; a distinct symbol and a max(0,\cdot) or absolute-value expression are needed.
  2. [Section III-B and Table I] The budget is defined in units of veh/h and is then treated as a capacity sum in Eq. (18); the equivalence between monetary budget and capacity units is stated only in prose and should be made precise in the model.
  3. [Section III-D, Eqs. (37)-(39)] The symbol p is used both for the crossover point and for a random probability in the mutation operator, and the index i is used for individuals while appearing elsewhere in quantum-mechanical contexts; the notation should be disambiguated.
  4. [Figures 4 and 5] The figure captions and text refer to low-, average-, and high-income nodes, but the figures do not identify node numbers or link numbers, making it difficult to verify the claimed income-based allocation pattern from the figures alone.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular derivation found: the central equity claim rests on an internal inconsistency (Eq. 7 is constant in the decision variables), not on a self-referential prediction or fitted parameter.

full rationale

The paper's derivation chain is not circular in the sense of fitting a parameter to a target result or importing a conclusion through self-citation. The BPR constants (alpha=0.15, beta=4), Sioux Falls link/demand data, and income categorizations are stated external inputs; the quantum/GA runtimes and restored capacities are reported as measured outputs. The one critical problem is Eq. (7): E is defined only from fixed zone incomes, so in Eq. (23) the (1-mu)E term is an additive constant with respect to C_a^1. For a fixed budget, this leaves the minimizer independent of mu, which makes the mu-dependent allocations in Fig. 5b impossible under the stated Hamiltonian. That is a serious mathematical/consistency flaw in the paper's equity claim, but it is not a circularity: the equations do not assume the conclusion; they fail to imply it. The co-authored survey [28] appears in a general citation list and is not load-bearing. Therefore the circularity score is 0, with the equity issue noted as a correctness risk rather than a circular step.

Assumptions & free parameters 4 free parameters · 5 assumptions · 0 invented entities

The framework's equity mechanism rests on Eq (7), which is a constant Gini of incomes; the optimization therefore does not trade off equity against efficiency as claimed. The remaining assumptions (UE, fixed demand, uniform costs) are standard simplifications, but the undisclosed damage scenario and solver parameters mean the reported numbers cannot be independently checked.

free parameters (4)
  • Equity weight mu used in experiments = 0.2 in text, 0.5 in Table III
    Chosen by hand; the reported results are shown for specific mu values (Section IV), and Figure 5b sweeps mu, but the objective Eq (3) makes mu irrelevant because E is constant.
  • Income group normalization factors = 0.6, 1.0, 1.5
    Low and high income approximated as 60% and 150% of average income (Section III-A); these values are assumed, not derived from data.
  • Hamiltonian penalty weights lambda1, lambda2 = not reported
    Used in Eq (27)-(28) to enforce constraints; values are never specified, so the CQM actually submitted to D-Wave is not fully defined.
  • GA population, mutation rate, tournament size, penalty multiplier = 50, 0.1, 3, 7000
    Chosen without tuning analysis; these affect GA runtime and solution quality (Section III-D).
assumptions (5)
  • domain assumption User equilibrium (UE) describes traveler response after restoration
    Lower-level problem Eq (13)-(17) assumes travelers reach UE; a standard but strong behavioral assumption.
  • domain assumption Demand is fixed before and after the disaster and never exceeds supply
    Stated in Section III-B; removes demand elasticity and congestion-induced rerouting effects.
  • domain assumption Uniform restoration cost per unit capacity across all links
    Stated in Section III-B; converts budget constraint Eq (4) into simple capacity sum Eq (18), which may not reflect real repair costs.
  • standard math BPR function with alpha=0.15, beta=4
    Standard travel time function and constants from literature, used in Eq (12)-(14).
  • domain assumption The D-Wave hybrid solver's returned solution is a valid optimum for the submitted CQM
    The paper treats the solver output as optimizing Eq (30), but no optimality gap or verification against exact solutions is provided (Section III-C).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Q-RESTORE: Quantum-Driven Framework for Resilient and Equitable Transportation Network Restoration." pith.science (2026). https://pith.science/paper/6QU3BCNN

@misc{pith2026250111197,
  author       = {Pith},
  title        = {Pith review of: Q-RESTORE: Quantum-Driven Framework for Resilient and Equitable Transportation Network Restoration},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/6QU3BCNN}},
  note         = {Machine review of arXiv:2501.11197}
}
read the original abstract

Efficient and socially equitable restoration of transportation networks post disasters is crucial for community resilience and access to essential services. The ability to rapidly recover critical infrastructure can significantly mitigate the impacts of disasters, particularly in underserved communities where prolonged isolation exacerbates vulnerabilities. Traditional restoration methods prioritize functionality over computational efficiency and equity, leaving low-income communities at a disadvantage during recovery. To address this gap, this research introduces a novel framework that combines quantum computing technology with an equity-focused approach to network restoration. Optimization of road link recovery within budget constraints is achieved by leveraging D Wave's hybrid quantum solver, which targets the connectivity needs of low, average, and high income communities. This framework combines computational speed with equity, ensuring priority support for underserved populations. Findings demonstrate that this hybrid quantum solver achieves near instantaneous computation times of approximately 8.7 seconds across various budget scenarios, significantly outperforming the widely used genetic algorithm. It offers targeted restoration by first aiding low-income communities and expanding aid as budgets increase, aligning with equity goals. This work showcases quantum computing's potential in disaster recovery planning, providing a rapid and equitable solution that elevates urban resilience and social sustainability by aiding vulnerable populations in disasters.

Figures

Figures reproduced from arXiv: 2501.11197 by the authors.

Figure 1
Figure 1. Fundamental units in classical and quantum computing are the bit [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. The upper-level problem involves a public authority de￾termining which roadway links in the network should be restored and what proportion of capacity should be recovered for each, given a limited financial budget, after a disaster. The objective of the public authority is to minimize the total recovery deficiency index and inequity measures (Gini index), or a combination of both. Since these two objectives often co… view at source ↗
Figure 2
Figure 2. Link capacity variation before, during, and after a disaster event [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figures from the paper (3 more)
Figure 3
Figure 3. Figure 3: Sioux Falls transportation network representation (a) Real-world city network (b) Simplified abstract transportation network model [PITH_FULL_IMAGE:figures/full_fig_p005_3.png]
Figure 4
Figure 4. Figure 4: Restored link capacities for different budget sizes: (a) Budget size = 75 (b) Budget size = 150 (c) Budget size = 225 (d) Budget size = 300 [PITH_FULL_IMAGE:figures/full_fig_p010_4.png]
Figure 5
Figure 5. Figure 5: Comparison of restored capacities across income groups: (a) Under different budget sizes (b) Across varying values of [PITH_FULL_IMAGE:figures/full_fig_p011_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

92 extracted references · 65 canonical work pages

  1. [1]

    Transportation technologies, sharing economy, and teleactivities: Implications for built environment and travel,

    K. Mouratidis, S. Peters, and B. van Wee, “Transportation technologies, sharing economy, and teleactivities: Implications for built environment and travel,” Transportation Research Part D: Transport and Environ- ment, vol. 92, p. 102716, 2021

    2021

  2. [2]

    Connected urban growth: public- private collaborations for transforming urban mobility,

    D. Canales, S. Bouton, E. Trimble, J. Thayne, L. Da Silva, S. Shas- try, S. Knupfer, and M. Powell, “Connected urban growth: public- private collaborations for transforming urban mobility,” Coalition for Urban Transitions. London and Washington, DC. Available at: http://newclimateeconomy. net/content/cities-working-papers. Coalition for Urban Transitions ...

    2017

  3. [3]

    The sustainable mobility paradigm,

    D. Banister, “The sustainable mobility paradigm,” Transport policy , vol. 15, no. 2, pp. 73–80, 2008

    2008

  4. [4]

    Ageing in a low-density urban city: Transportation mobility as a social equity issue,

    G. Adorno, N. Fields, C. Cronley, R. Parekh, and K. Magruder, “Ageing in a low-density urban city: Transportation mobility as a social equity issue,” Ageing & Society , vol. 38, no. 2, pp. 296–320, 2018

    2018

  5. [5]

    The economics of urban density,

    G. Duranton and D. Puga, “The economics of urban density,” Journal of economic perspectives , vol. 34, no. 3, pp. 3–26, 2020

    2020

  6. [6]

    The future of transportation: Sustainable mobility solutions,

    R. Zahid, “The future of transportation: Sustainable mobility solutions,” Journal of Social Signs Review , vol. 1, no. 1, pp. 56–64, 2023

    2023

  7. [7]

    Bike-sharing, car-sharing, e-scooters, and uber: Who are the shared mobility users and where do they live?

    K. Mouratidis, “Bike-sharing, car-sharing, e-scooters, and uber: Who are the shared mobility users and where do they live?” Sustainable Cities and Society, vol. 86, p. 104161, 2022

    2022

  8. [8]

    Urban smart public transport studies: a review and prospect,

    M. Xu, T. Liu, S.-P. Zhong, and Y . Jiang, “Urban smart public transport studies: a review and prospect,” J. Transp. Syst. Eng. Inf. Technol. , vol. 22, no. 2, pp. 91–108, 2022

    2022

Show all 92 references
  1. [9]

    Smart mobility and public transport: Opportunities and challenges in rural and urban areas,

    S. Porru, F. E. Misso, F. E. Pani, and C. Repetto, “Smart mobility and public transport: Opportunities and challenges in rural and urban areas,” Journal of traffic and transportation engineering (English edition) , vol. 7, no. 1, pp. 88–97, 2020

    2020

  2. [10]

    “mobility as a service

    C. O. Cruz and J. M. Sarmento, ““mobility as a service” platforms: A critical path towards increasing the sustainability of transportation systems,” Sustainability, vol. 12, no. 16, p. 6368, 2020

    2020

  3. [11]

    Rodrigue, The geography of transport systems

    J.-P. Rodrigue, The geography of transport systems . Routledge, 2020

    2020

  4. [12]

    A survey on shortest path routing algorithms for public transport travel,

    S. M. Kumari and N. Geethanjali, “A survey on shortest path routing algorithms for public transport travel,” Global Journal of Computer Science and Technology, vol. 9, no. 5, pp. 73–76, 2010

    2010

  5. [13]

    Data, ai and governance in maas–leading to sustainable mobility?

    E. Servou, F. Behrendt, and M. Horst, “Data, ai and governance in maas–leading to sustainable mobility?” Transportation research inter- disciplinary perspectives, vol. 19, p. 100806, 2023

    2023

  6. [14]

    Billion-dollar weather and climate disasters: Overview,

    National Oceanic and Atmospheric Administration, “Billion-dollar weather and climate disasters: Overview,” 2023, accessed: 2024-10-30. [Online]. Available: https://www.ncei.noaa.gov/access/billions/

    2023

  7. [15]

    Data-driven urbanism, digital platforms and the planning of maas in times of deep uncertainty: What does it mean for cavs?

    I. Banerjee, P. Jittrapirom, and J. S. Dangschat, “Data-driven urbanism, digital platforms and the planning of maas in times of deep uncertainty: What does it mean for cavs?” AVENUE21. Planning and Policy Con- siderations for an Age of Automated Mobility , pp. 431–460, 2023

    2023

  8. [16]

    A scientometric review of global research on smart disaster management,

    S. Neelam and S. K. Sood, “A scientometric review of global research on smart disaster management,” IEEE Transactions on Engineering Management, vol. 68, no. 1, pp. 317–329, 2020

    2020

  9. [17]

    Optimum post-disruption restoration under uncertainty for enhancing critical infrastructure resilience,

    Y .-P. Fang and G. Sansavini, “Optimum post-disruption restoration under uncertainty for enhancing critical infrastructure resilience,” Reliability Engineering & System Safety , vol. 185, pp. 1–11, 2019

    2019

  10. [18]

    A heuristic approach to an interdependent restoration planning and crew routing problem,

    N. Tajik, K. Barker, A. D. Gonz ´alez, and A. Ermagun, “A heuristic approach to an interdependent restoration planning and crew routing problem,” Computers & Industrial Engineering , vol. 161, p. 107626, 2021

    2021

  11. [19]

    The potential and challenges of quantum technology in modern era,

    K. A. Hossain, “The potential and challenges of quantum technology in modern era,” Scientific Research Journal, vol. 11, no. 6, 2023

    2023

  12. [20]

    M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information. Cambridge university press, 2010

    2010

  13. [21]

    Variational quantum algorithms,

    M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio et al. , “Variational quantum algorithms,” Nature Reviews Physics , vol. 3, no. 9, pp. 625– 644, 2021

    2021

  14. [22]

    Quantum computing review: A decade of research,

    S. K. Sood et al., “Quantum computing review: A decade of research,” IEEE Transactions on Engineering Management , vol. 71, pp. 6662– 6676, 2023

    2023

  15. [23]

    Quantum computing in the nisq era and beyond,

    J. Preskill, “Quantum computing in the nisq era and beyond,” Quantum, vol. 2, p. 79, 2018

    2018

  16. [24]

    The effect of superposition and entanglement on hybrid quantum machine learning for weather forecasting

    B. Ogur and I. Yilmaz, “The effect of superposition and entanglement on hybrid quantum machine learning for weather forecasting.” Quantum Inf. Comput., vol. 23, no. 3&4, pp. 181–194, 2023

    2023

  17. [25]

    Quantum computing and industrial information integration: A review,

    Y . Lu, A. Sigov, L. Ratkin, L. A. Ivanov, and M. Zuo, “Quantum computing and industrial information integration: A review,” Journal of Industrial Information Integration , p. 100511, 2023

    2023

  18. [26]

    Quantum computation: Algorithms and applications,

    C.-H. Cho, C.-Y . Chen, K.-C. Chen, T.-W. Huang, M.-C. Hsu, N.-P. Cao, B. Zeng, S.-G. Tan, and C.-R. Chang, “Quantum computation: Algorithms and applications,” Chinese Journal of Physics , vol. 72, pp. 248–269, 2021

    2021

  19. [27]

    Quantum computing for transport network design problems,

    V . V . Dixit and C. Niu, “Quantum computing for transport network design problems,” Scientific Reports, vol. 13, no. 1, p. 12267, 2023

    2023

  20. [28]

    Quantum computing in intelligent transportation systems: A survey,

    Y . Zhuang, T. Azfar, Y . Wang, W. Sun, X. C. Wang, Q. V . Guo, and R. Ke, “Quantum computing in intelligent transportation systems: A survey,” arXiv preprint arXiv:2406.00862 , 2024

    2024 arXiv

  21. [29]

    Urban quantum leap: A comprehensive review and analysis of quantum technologies for smart cities,

    A. B. Bonab, M. Fedele, V . Formisano, and I. Rudko, “Urban quantum leap: A comprehensive review and analysis of quantum technologies for smart cities,” Cities, vol. 140, p. 104459, 2023

    2023

  22. [30]

    Genetic algorithm optimization problems,

    S. Sivanandam, S. Deepa, S. Sivanandam, and S. Deepa, “Genetic algorithm optimization problems,” Introduction to genetic algorithms , pp. 165–209, 2008

    2008

  23. [31]

    Multiobjective construction schedule optimization using modified niched pareto genetic algorithm,

    K. Kim, J. Walewski, and Y . K. Cho, “Multiobjective construction schedule optimization using modified niched pareto genetic algorithm,” Journal of Management in Engineering , vol. 32, no. 2, p. 04015038, 2016

    2016

  24. [32]

    On the scalability of genetic algorithms to very large-scale feature selection,

    A. Moser and M. Narasimha Murty, “On the scalability of genetic algorithms to very large-scale feature selection,” in Real-World Ap- plications of Evolutionary Computing: EvoWorkshops 2000: EvoIASP , EvoSCONDI, EvoTel, EvoSTIM, EvoRob, and EvoFlight Edinburgh, Scotland, UK, Ap...

    2000

  25. [33]

    Social equity in urban resilience planning,

    S. Meerow, P. Pajouhesh, and T. R. Miller, “Social equity in urban resilience planning,” Local Environment, vol. 24, no. 9, pp. 793–808, 2019

    2019

  26. [34]

    Litman, Evaluating transportation equity

    T. Litman, Evaluating transportation equity . Victoria Transport Policy Institute Victoria, BC, Canada, 2017

    2017

  27. [35]

    Access to opportunity through equitable transportation: Lessons from four metropolitan regions,

    C. Stacy, Y . Su, E. Noble, A. Stern, K. Blagg, M. Rainer, and R. Ezike, “Access to opportunity through equitable transportation: Lessons from four metropolitan regions,” 2020

    2020

  28. [36]

    Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization,

    P. G. Saghand and H. Charkhgard, “Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization,” Computers & Operations Research , vol. 137, p. 105549, 2022

    2022

  29. [37]

    A review on genetic algorithm: past, present, and future,

    S. Katoch, S. S. Chauhan, and V . Kumar, “A review on genetic algorithm: past, present, and future,” Multimedia tools and applications , vol. 80, pp. 8091–8126, 2021

    2021

  30. [38]

    Adaptation in natural and artificial systems (john h. holland),

    J. R. Sampson, “Adaptation in natural and artificial systems (john h. holland),” 1976

    1976

  31. [39]

    Mitchell, An introduction to genetic algorithms

    M. Mitchell, An introduction to genetic algorithms . MIT press, 1998

    1998

  32. [40]

    Genetic algorithms in search, optimization, and machine learning,

    D. E. Golberg, “Genetic algorithms in search, optimization, and machine learning,” Addion wesley, vol. 1989, no. 102, p. 36, 1989

    1989

  33. [41]

    Quantum computing: progress and prospects,

    M. Horowitz and E. Grumbling, “Quantum computing: progress and prospects,” 2019

    2019

  34. [42]

    A language and hardware independent approach to quantum–classical computing,

    A. J. McCaskey, E. F. Dumitrescu, D. Liakh, M. Chen, W.-c. Feng, and T. S. Humble, “A language and hardware independent approach to quantum–classical computing,” SoftwareX, vol. 7, pp. 245–254, 2018

    2018

  35. [43]

    Analo- gies between quantum and classical computing,

    D. Dragoman, M. Dragoman, D. Dragoman, and M. Dragoman, “Analo- gies between quantum and classical computing,” Quantum-Classical Analogies, pp. 247–278, 2004

    2004

  36. [44]

    Quantum computing and the analog/digital distinction,

    J. Schr ¨oter, C. Ernst, and M. Warnke, “Quantum computing and the analog/digital distinction,” Grey Room, no. 86, pp. 28–49, 2022

    2022

  37. [45]

    The power of entanglement,

    H. Weinfurter, “The power of entanglement,” Physics world , vol. 18, no. 1, p. 47, 2005

    2005

  38. [46]

    Quan- tum entanglement,

    R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, “Quan- tum entanglement,” Reviews of modern physics , vol. 81, no. 2, p. 865, 2009. 13

    2009

  39. [47]

    Entanglement-assisted quantum networks: Mechan- ics, enabling technologies, challenges, and research directions,

    Z. Li, K. Xue, J. Li, L. Chen, R. Li, Z. Wang, N. Yu, D. S. Wei, Q. Sun, and J. Lu, “Entanglement-assisted quantum networks: Mechan- ics, enabling technologies, challenges, and research directions,” IEEE Communications Surveys & Tutorials , 2023

    2023

  40. [48]

    Elementary gates for quantum computation,

    A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, “Elementary gates for quantum computation,” Physical review A , vol. 52, no. 5, p. 3457, 1995

    1995

  41. [49]

    Algorithms for quantum computation: discrete logarithms and factoring,

    P. W. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” in Proceedings 35th annual symposium on foundations of computer science . Ieee, 1994, pp. 124–134

    1994

  42. [50]

    A fast quantum mechanical algorithm for database search,

    L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , 1996, pp. 212–219

    1996

  43. [51]

    An improved quantum fourier transform algorithm and applications,

    L. Hales and S. Hallgren, “An improved quantum fourier transform algorithm and applications,” in Proceedings 41st Annual Symposium on Foundations of Computer Science . IEEE, 2000, pp. 515–525

    2000

  44. [52]

    Optimal quantum phase estimation,

    U. Dorner, R. Demkowicz-Dobrzanski, B. J. Smith, J. S. Lundeen, W. Wasilewski, K. Banaszek, and I. A. Walmsley, “Optimal quantum phase estimation,” Physical review letters , vol. 102, no. 4, p. 040403, 2009

    2009

  45. [53]

    Variational quantum eigensolver with fewer qubits,

    J.-G. Liu, Y .-H. Zhang, Y . Wan, and L. Wang, “Variational quantum eigensolver with fewer qubits,” Physical Review Research, vol. 1, no. 2, p. 023025, 2019

    2019

  46. [54]

    A quantum approximate optimization algorithm,

    E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,” arXiv preprint arXiv:1411.4028 , 2014

    2014 arXiv

  47. [55]

    Quantum walk algorithm for element distinctness,

    A. Ambainis, “Quantum walk algorithm for element distinctness,” SIAM Journal on Computing , vol. 37, no. 1, pp. 210–239, 2007

    2007

  48. [56]

    Reconsider hhl algorithm and its related quantum machine learning algorithms,

    C. Shao, “Reconsider hhl algorithm and its related quantum machine learning algorithms,” arXiv preprint arXiv:1803.01486 , 2018

    2018 arXiv

  49. [57]

    Experimental boson sampling,

    M. Tillmann, B. Daki ´c, R. Heilmann, S. Nolte, A. Szameit, and P. Walther, “Experimental boson sampling,” Nature photonics , vol. 7, no. 7, pp. 540–544, 2013

    2013

  50. [58]

    Mathematical foundation of quantum annealing,

    S. Morita and H. Nishimori, “Mathematical foundation of quantum annealing,” Journal of Mathematical Physics , vol. 49, no. 12, 2008

    2008

  51. [59]

    Quantum algorithms and simulation for parallel and distributed quantum comput- ing,

    R. Parekh, A. Ricciardi, A. Darwish, and S. DiAdamo, “Quantum algorithms and simulation for parallel and distributed quantum comput- ing,” in 2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) . IEEE, 2021, pp. 9–19

    2021

  52. [60]

    Evolution of quantum comput- ing: Theoretical and innovation management implications for emerging quantum industry,

    M. Coccia, S. Roshani, and M. Mosleh, “Evolution of quantum comput- ing: Theoretical and innovation management implications for emerging quantum industry,” IEEE Transactions on Engineering Management , vol. 71, pp. 2270–2280, 2022

    2022

  53. [61]

    Systematic information management in quantum computing: Progress and challenges,

    V . Sood and R. P. Chauhan, “Systematic information management in quantum computing: Progress and challenges,” IEEE Transactions on Engineering Management, 2023

    2023

  54. [62]

    Quantum supremacy using a programmable superconducting processor,

    F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell et al. , “Quantum supremacy using a programmable superconducting processor,” Nature, vol. 574, no. 7779, pp. 505–510, 2019

    2019

  55. [63]

    The ibm quantum computer and the ibm quantum experience,

    A. C. Santos, “The ibm quantum computer and the ibm quantum experience,” arXiv preprint arXiv:1610.06980 , 2016

    2016 arXiv

  56. [64]

    Quantumpath : A quantum software development platform,

    J. L. Hevia Oliver, G. Peterssen Nodarse, and M. Piattini, “Quantumpath : A quantum software development platform,” Software: Practice and Experience, vol. 52, 12 2021

    2021

  57. [65]

    Comparison of d-wave quantum anneal- ing and classical simulated annealing for local minima determination,

    Y . Koshka and M. A. Novotny, “Comparison of d-wave quantum anneal- ing and classical simulated annealing for local minima determination,” IEEE Journal on Selected Areas in Information Theory , vol. 1, no. 2, pp. 515–525, 2020

    2020

  58. [66]

    Towards quantum-algorithms-as-a-service,

    M. De Stefano, D. Di Nucci, F. Palomba, D. Taibi, and A. De Lucia, “Towards quantum-algorithms-as-a-service,” in Proceedings of the 1st International Workshop on Quantum Programming for Software Engi- neering, 2022, pp. 7–10

    2022

  59. [67]

    Present landscape of quantum computing,

    V . Hassija, V . Chamola, V . Saxena, V . Chanana, P. Parashari, S. Mum- taz, and M. Guizani, “Present landscape of quantum computing,” IET Quantum Communication, vol. 1, no. 2, pp. 42–48, 2020

    2020

  60. [68]

    Scheme for reducing decoherence in quantum computer memory,

    P. W. Shor, “Scheme for reducing decoherence in quantum computer memory,” Physical review A , vol. 52, no. 4, p. R2493, 1995

    1995

  61. [69]

    Approaches to quantum error correction,

    J. Kempe, “Approaches to quantum error correction,” in Quantum Decoherence: Poincar´e Seminar 2005 . Springer, 2006, pp. 85–123

    2005

  62. [70]

    Combined error correction techniques for quantum computing architectures,

    M. S. Byrd and D. A. Lidar, “Combined error correction techniques for quantum computing architectures,” journal of modern optics , vol. 50, no. 8, pp. 1285–1297, 2003

    2003

  63. [71]

    Superconducting circuits for quantum information: an outlook,

    M. H. Devoret and R. J. Schoelkopf, “Superconducting circuits for quantum information: an outlook,” Science, vol. 339, no. 6124, pp. 1169–1174, 2013

    2013

  64. [72]

    The future of quantum computing with superconducting qubits,

    S. Bravyi, O. Dial, J. M. Gambetta, D. Gil, and Z. Nazario, “The future of quantum computing with superconducting qubits,” Journal of Applied Physics, vol. 132, no. 16, 2022

    2022

  65. [73]

    Materials challenges and opportunities for quantum computing hardware,

    N. P. De Leon, K. M. Itoh, D. Kim, K. K. Mehta, T. E. Northup, H. Paik, B. Palmer, N. Samarth, S. Sangtawesin, and D. W. Steuerman, “Materials challenges and opportunities for quantum computing hardware,”Science, vol. 372, no. 6539, p. eabb2823, 2021

    2021

  66. [74]

    Variational quantum algorithm with information sharing,

    C. N. Self, K. E. Khosla, A. W. Smith, F. Sauvage, P. D. Haynes, J. Knolle, F. Mintert, and M. Kim, “Variational quantum algorithm with information sharing,” npj Quantum Information , vol. 7, no. 1, p. 116, 2021

    2021

  67. [75]

    A software methodology for compiling quantum programs,

    T. H ¨aner, D. S. Steiger, K. Svore, and M. Troyer, “A software methodology for compiling quantum programs,” Quantum Science and Technology, vol. 3, no. 2, p. 020501, 2018

    2018

  68. [76]

    Quantum computing: Vision and challenges,

    S. S. Gill, O. Cetinkaya, S. Marrone, E. F. Combarro, D. Claudino, D. Haunschild, L. Schlote, H. Wu, C. Ottaviani, X. Liu et al., “Quantum computing: Vision and challenges,” arXiv preprint arXiv:2403.02240 , 2024

    2024 arXiv

  69. [77]

    Exploring potential applications of quantum computing in transportation modelling,

    C. H. Cooper, “Exploring potential applications of quantum computing in transportation modelling,” IEEE Transactions on Intelligent Trans- portation Systems, vol. 23, no. 9, pp. 14 712–14 720, 2021

    2021

  70. [78]

    Intelligent bus operation optimization by integrat- ing cases and data driven based on business chain and enhanced quantum genetic algorithm,

    H. Lin and C. Tang, “Intelligent bus operation optimization by integrat- ing cases and data driven based on business chain and enhanced quantum genetic algorithm,” IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 7, pp. 9869–9882, 2021

    2021

  71. [79]

    A quantum-inspired genetic algorithm for dynamic continuous network design problem,

    D.-Y . Lin and S. Waller, “A quantum-inspired genetic algorithm for dynamic continuous network design problem,” Transportation Letters, vol. 1, no. 1, pp. 81–93, 2009

    2009

  72. [80]

    A dual approximation-based quantum- inspired genetic algorithm for the dynamic network design problem,

    D.-Y . Lin, P.-H. Lin, and M. Ng, “A dual approximation-based quantum- inspired genetic algorithm for the dynamic network design problem,” Transportation Letters, vol. 11, no. 3, pp. 158–173, 2019

    2019

  73. [81]

    Optimizing resource utilization during the recovery of civil infrastructure systems,

    W. Orabi, A. B. Senouci, K. El-Rayes, and H. Al-Derham, “Optimizing resource utilization during the recovery of civil infrastructure systems,” Journal of management in engineering , vol. 26, no. 4, pp. 237–246, 2010

    2010

  74. [82]

    Application of quantum genetic optimization of lvq neural network in smart city traffic network prediction,

    F. Zhang, T.-Y . Wu, Y . Wang, R. Xiong, G. Ding, P. Mei, and L. Liu, “Application of quantum genetic optimization of lvq neural network in smart city traffic network prediction,” IEEE access, vol. 8, pp. 104 555– 104 564, 2020

    2020

  75. [83]

    A dakota boomtown: Sioux falls, 1877-1880,

    G. D. Olson, “A dakota boomtown: Sioux falls, 1877-1880,” Great Plains Quarterly, vol. 24, no. 1, pp. 17–30, 2004

    2004

  76. [84]

    An optimal schedule for urban road network repair based on the greedy algorithm,

    G. Lu, Y . Xiong, C. Ding, and Y . Wang, “An optimal schedule for urban road network repair based on the greedy algorithm,” PLoS one, vol. 11, no. 10, p. e0164780, 2016

    2016

  77. [85]

    A modified active set algorithm for transportation discrete network design bi-level problem,

    X. Wang and P. M. Pardalos, “A modified active set algorithm for transportation discrete network design bi-level problem,” Journal of Global Optimization, vol. 67, pp. 325–342, 2017

    2017

  78. [86]

    Transportation infrastructure restoration opti- mization considering mobility and accessibility in resilience measures,

    T. Zhao and Y . Zhang, “Transportation infrastructure restoration opti- mization considering mobility and accessibility in resilience measures,” Transportation Research Part C: Emerging Technologies , vol. 117, p. 102700, 2020

    2020

  79. [87]

    A scalable control system for a superconducting adiabatic quantum optimization processor,

    M. Johnson, P. Bunyk, F. Maibaum, E. Tolkacheva, A. Berkley, E. Chap- ple, R. Harris, J. Johansson, T. Lanting, I. Perminov et al., “A scalable control system for a superconducting adiabatic quantum optimization processor,” Superconductor Science and Technology , vol. 23, no. ...

    2010

  80. [88]

    Next-generation topol- ogy of d-wave quantum processors,

    K. Boothby, P. Bunyk, J. Raymond, and A. Roy, “Next-generation topol- ogy of d-wave quantum processors,” arXiv preprint arXiv:2003.00133 , 2020

    2003 arXiv

  81. [89]

    Quantum annealing-infused microgrids formation: Distribution system restoration and resilience enhancement,

    N. Nikmehr, P. Zhang, H. Zheng, T.-C. Wei, G. He, and Y . A. Shamash, “Quantum annealing-infused microgrids formation: Distribution system restoration and resilience enhancement,” IEEE Transactions on Power Systems, 2024

    2024

  82. [90]

    Genetic algorithm–based method for the deadline problem in repetitive construction projects considering soft logic,

    Y . Huang, X. Zou, and L. Zhang, “Genetic algorithm–based method for the deadline problem in repetitive construction projects considering soft logic,” Journal of Management in Engineering , vol. 32, no. 4, p. 04016002, 2016

    2016

  83. [91]

    Hybrid genetic algorithm with simu- lated annealing for resource-constrained project scheduling,

    ¨O. H. Bettemir and R. Sonmez, “Hybrid genetic algorithm with simu- lated annealing for resource-constrained project scheduling,” Journal of Management in Engineering , vol. 31, no. 5, p. 04014082, 2015

    2015

  84. [92]

    Improvement of maneuverability within a multiagent fuzzy transportation system with the use of parallel biobjective real-coded genetic algorithm,

    A. S. Akopov, L. A. Beklaryan, and M. Thakur, “Improvement of maneuverability within a multiagent fuzzy transportation system with the use of parallel biobjective real-coded genetic algorithm,” IEEE Transactions on Intelligent Transportation Systems , vol. 23, no. 8, pp. 12 64...

    2021

Pith tools

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