Quantum approximate optimization of finite-state bosonic systems

Shakib Daryanoosh1

  • 1Curtin University, Curtin Centre for Optimisation and Decision Science, Whadjuk Country, Perth 6102, Australia.

Physical Review. E
|March 20, 2026
PubMed
Summary

This study introduces a new method for quantum computing using the Quantum Approximate Optimization Algorithm (QAOA) to efficiently map complex problems onto quantum hardware. The approach successfully rules out infeasible states, improving performance for quantum simulations.

Related Concept Videos

The Quantum-Mechanical Model of an Atom02:45

The Quantum-Mechanical Model of an Atom

Shortly after de Broglie published his ideas that the electron in a hydrogen atom could be better thought of as being a circular standing wave instead of a particle moving in quantized circular orbits, Erwin Schrödinger extended de Broglie’s work by deriving what is now known as the Schrödinger equation. When Schrödinger applied his equation to hydrogen-like atoms, he was able to reproduce Bohr’s expression for the energy and, thus, the Rydberg formula governing hydrogen spectra.
61.3K
Equilibrium Conditions for a Particle01:23

Equilibrium Conditions for a Particle

When an object is in equilibrium, it is either at rest or moving with a constant velocity. There are two types of equilibrium: static and dynamic. Static equilibrium occurs when an object is at rest, while dynamic equilibrium occurs when an object is moving with a constant velocity. In both cases, there must be a balance of forces acting on the object.
To understand the concept of equilibrium, let us first consider the forces acting on an object. When different forces act on an object, they can...
2.5K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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...
390
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
394
Maxwell-Boltzmann Distribution: Problem Solving01:20

Maxwell-Boltzmann Distribution: Problem Solving

Individual molecules in a gas move in random directions, but a gas containing numerous molecules has a predictable distribution of molecular speeds, which is known as the Maxwell-Boltzmann distribution, f(v).
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
3.1K
BIBO stability of continuous and discrete -time systems01:24

BIBO stability of continuous and discrete -time systems

System stability is a fundamental concept in signal processing, often assessed using convolution. For a system to be considered bounded-input bounded-output (BIBO) stable, any bounded input signal must produce a bounded output signal. A bounded input signal is one where the modulus does not exceed a certain constant at any point in time.
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
1.1K