Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

European Journal of Operational Research

Discrete optimization: A quantum revolution?

Stefan Creemers, Luis Fernando Pérez Armas

Published Dec 18, 2024• 10 citations
Publisher
DOI
10.1016/j.ejor.2024.12.016

Related papers

Discrete optimization: A quantum revolution (Part II)

Stefan Creemers, Luis Fernando Pérez Armas

•Jan 1, 2023•1 citation

Discrete optimization: Limitations of existing quantum algorithms

Stefan Creemers, Luis Fernando Pérez Armas

•Jan 1, 2023•4 citations

Kant's Copernican Revolution

Daegene Song

A number of philosophers and scientists have discussed the possibility of inseparability between the subject (i.e., the observer) and the object (i.e., the observed universe). In particular, it has recently been proposed that this inseparability may be obtained through the discrete physical universe being filled with the observer's continuous consciousness through quantum evolution with time going backwards. The proposal of a universe view with interwoven matter and mind through cyclical time bears a resemblance to Immanuel Kant's discussion of the Copernican Revolution in philosophy, where the priority shifted from the object to the subject.

arXiv:physics/0703034•NeuroQuantology•Jan 1, 2019•1 citation

A Tour of Adiabatic Quantum Computing

Nicholas R. Allgood

Different types and approaches for using quantum mechanical events for computation have developed quickly with the quantum technology revolution. One of these, adiabatic quantum computing, uses the adiabatic theorem as a paradigm for computation. According to the adiabatic theorem, if conditions gradually change and a system is permitted to adjust its configuration (changing the probability density), the associated eigenstate will be of the final Hamiltonian if the system starts in an eigenstate of its initial Hamiltonian. Simply put, a quantum mechanical system that is subjected to rapidly changing and varying conditions, there isn’t enough time for a function to adapt which leaves the spatial probability density unchanged. A closely related optimization process that utilizes the adiabatic theorem known as quantum annealing, finds a global minimum over a candidate set of solutions by processing quantum fluctuations. Quantum annealing is used primarily in combinatorial optimization problems where the search space is large and discrete, containing multiple local minima.

IntechOpen eBooks•Sep 11, 2023•0 citations

Quantum Approaches for Discrete Optimization.

Ojas Parekh

•Feb 3, 2020•0 citations

Quantum Algorithms for Discrete Optimization

Sergio Boixo, Rolando D. Somma

•Jan 1, 2015•0 citations
A number of philosophers and scientists have discussed the possibility of inseparability between the subject (i.e., the observer) and the object (i.e., the observed universe). In particular, it has recently been proposed that this inseparability may be obtained through the discrete physical universe being filled with the observer's continuous consciousness through quantum evolution with time going backwards. The proposal of a universe view with interwoven matter and mind through cyclical time bears a resemblance to Immanuel Kant's discussion of the Copernican Revolution in philosophy, where the priority shifted from the object to the subject.
Different types and approaches for using quantum mechanical events for computation have developed quickly with the quantum technology revolution. One of these, adiabatic quantum computing, uses the adiabatic theorem as a paradigm for computation. According to the adiabatic theorem, if conditions gradually change and a system is permitted to adjust its configuration (changing the probability density), the associated eigenstate will be of the final Hamiltonian if the system starts in an eigenstate of its initial Hamiltonian. Simply put, a quantum mechanical system that is subjected to rapidly changing and varying conditions, there isn’t enough time for a function to adapt which leaves the spatial probability density unchanged. A closely related optimization process that utilizes the adiabatic theorem known as quantum annealing, finds a global minimum over a candidate set of solutions by processing quantum fluctuations. Quantum annealing is used primarily in combinatorial optimization problems where the search space is large and discrete, containing multiple local minima.