Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

387
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
387
Stability of Equilibrium Configuration: Problem Solving01:13

Stability of Equilibrium Configuration: Problem Solving

1.1K
The stability of equilibrium configurations is an important concept in physics, engineering, and other related fields. In simple terms, it refers to the tendency of an object or system to return to its equilibrium position after being disturbed. The stability of an equilibrium configuration can be analyzed by considering the potential energy function of the system and examining its behavior near the equilibrium point.
Problem-solving in the context of the stability of equilibrium configuration...
1.1K
Application of Linearization and Approximation01:29

Application of Linearization and Approximation

129
A drone flying through complex terrain often relies on more than one sensing method to estimate small changes in altitude. Along with direct measurements, air pressure provides a useful indirect indicator of vertical movement. Atmospheric pressure decreases as altitude increases, and this relationship is commonly described using an exponential model. Although accurate, converting pressure measurements into altitude values requires calculations that are too complex to perform repeatedly during...
129
Linearization and Approximation01:26

Linearization and Approximation

144
Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...
144
Propagation of Uncertainty from Random Error00:59

Propagation of Uncertainty from Random Error

2.1K
An experiment often consists of more than a single step. In this case, measurements at each step give rise to uncertainty. Because the measurements occur in successive steps, the uncertainty in one step necessarily contributes to that in the subsequent step. As we perform statistical analysis on these types of experiments, we must learn to account for the propagation of uncertainty from one step to the next. The propagation of uncertainty depends on the type of arithmetic operation performed on...
2.1K
Randomized Experiments01:13

Randomized Experiments

9.3K
The randomization process involves assigning study participants randomly to experimental or control groups based on their probability of being equally assigned. Randomization is meant to eliminate selection bias and balance known and unknown confounding factors so that the control group is similar to the treatment group as much as possible. A computer program and a random number generator can be used to assign participants to groups in a way that minimizes bias.
Simple randomization
Simple...
9.3K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation.

NPJ quantum information·2026
Same author

Author Correction: Quantum computational finance for martingale asset pricing in incomplete markets.

Scientific reports·2024
Same author

Quantum computational finance for martingale asset pricing in incomplete markets.

Scientific reports·2024
Same author

Quantum machine learning.

Nature·2017
Same author

Room-Temperature Micron-Scale Exciton Migration in a Stabilized Emissive Molecular Aggregate.

Nano letters·2016
Same author

Enhanced energy transport in genetically engineered excitonic networks.

Nature materials·2015
Same journal

Quantum annealing for enhanced feature selection in single-cell RNA sequencing data analysis.

Quantum machine intelligence·2026
Same journal

Benchmarking the operation of quantum heuristics and Ising machines: scoring parameter setting strategies on optimization applications.

Quantum machine intelligence·2025
Same journal

Unsupervised beyond-standard-model event discovery at the LHC with a novel quantum autoencoder.

Quantum machine intelligence·2025
Same journal

SARS-CoV-2 spike and ACE2 entanglement-like binding.

Quantum machine intelligence·2023
Same journal

Quantum transfer learning for breast cancer detection.

Quantum machine intelligence·2022
Same journal

Quantum-accessible reinforcement learning beyond strictly epochal environments.

Quantum machine intelligence·2021
See all related articles

Related Experiment Video

Updated: Mar 17, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

1.2K

Hybrid Quantum-Classical Algorithm for Robust Optimization via Stochastic-Gradient Online Learning.

Debbie Lim1,2, Joao F Doriguello1,3, Patrick Rebentrost1,4

  • 1Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore, 117543 Singapore.

Quantum Machine Intelligence
|March 16, 2026
PubMed
Summary
This summary is machine-generated.

This study enhances robust optimization algorithms with quantum computing, achieving similar guarantees for stochastic problems and offering quadratic speedups for complex models in finance and engineering.

Keywords:
Online learningQuantum computingRobust optimization

Related Experiment Videos

Last Updated: Mar 17, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

1.2K

Area of Science:

  • Optimization Theory
  • Quantum Computing
  • Applied Mathematics

Background:

  • Robust convex optimization addresses uncertainty in variables and parameters.
  • Online meta-algorithms are crucial for dynamic decision-making.
  • Existing algorithms provide guarantees but can be computationally intensive.

Purpose of the Study:

  • To analyze the performance of the online robust optimization meta-algorithm with stochastic subgradients.
  • To develop a hybrid quantum-classical version of the robust optimization algorithm.
  • To demonstrate potential speedups and applications in finance and engineering.

Main Methods:

  • Analysis of stochastic subgradients within the online robust optimization framework.
  • Development of a hybrid quantum-classical algorithm.
  • Leveraging quantum subroutines like state preparation, norm estimation, and multi-sampling.

Main Results:

  • The online robust optimization meta-algorithm maintains its guarantee with stochastic subgradients.
  • A hybrid quantum-classical algorithm achieves up to a quadratic improvement in dimension.
  • Successful application to robust linear and semidefinite programs.

Conclusions:

  • Quantum enhancements offer significant speedups for robust optimization problems.
  • The hybrid algorithm is applicable to critical areas like finance and engineering.
  • This work bridges quantum computing and robust optimization for practical challenges.