Related Experiment Video
Updated: Mar 21, 2026

Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators
Published on: May 30, 2014
Quantum approximate optimization of finite-state bosonic systems
1Curtin University, Curtin Centre for Optimisation and Decision Science, Whadjuk Country, Perth 6102, Australia.
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.
Area of Science:
- Quantum Computing
- Quantum Information Science
- Computational Physics
Background:
- Many natural problems are described by finite D-dimensional states.
- Mapping these qudit states to multiqubit systems for quantum hardware can lead to exponentially larger, infeasible subspaces.
- Current methods using objective function penalization become inefficient as the infeasible subspace grows.
Purpose of the Study:
- To propose a Hamiltonian-based Quantum Approximate Optimization Algorithm (QAOA) approach to exclude infeasible configuration spaces.
- To investigate different mapping techniques (binary, symmetric, unary) for qudit to multiqubit Hilbert space mapping.
- To apply the developed framework to quantum approximate thermalization and solving the Bose-Hubbard model.
Main Methods:
- Devised appropriate mixing Hamiltonians within the Hamiltonian-based QAOA framework.
- Employed binary, symmetric, and unary mapping techniques to map qudit Hilbert space to multiqubit space.
- Analyzed implementation cost using controlled-NOT gate count for different mapping strategies.
- Applied the method to quantum approximate thermalization and finding the ground state of the Bose-Hubbard model.
Main Results:
- The standard mixing Hamiltonian is optimal for symmetric mapping, minimizing controlled-NOT gate count.
- Binary and unary mapping techniques result in a p-fold increase in gate count for a p-layer QAOA.
- The proposed QAOA framework effectively rules out infeasible configuration spaces.
- Successfully found the ground state of the repulsive Bose-Hubbard model in both strong and weak interaction regimes.
Conclusions:
- The Hamiltonian-based QAOA with specifically designed mixing Hamiltonians offers an efficient method to handle infeasible subspaces in quantum computations.
- Symmetric mapping with standard mixing Hamiltonians presents the most cost-effective implementation strategy in terms of gate count.
- This approach provides a viable framework for complex quantum simulations, including thermalization and condensed matter problems.
Related Concept Videos
The Quantum-Mechanical Model of an Atom
Equilibrium Conditions for a Particle
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...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
Maxwell-Boltzmann Distribution: Problem Solving
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
BIBO stability of continuous and discrete -time systems
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....

