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

arXiv:1802.07521

Approaching the Quantum Speed Limit with Global-Local Optimization

Sørensen, Jens Jakob, Mikel Aranburu, Till Heinzel, Jacob Friis Sherson

Published Feb 21, 2018• 3 citations
arXivHTMLPDF

Abstract

We propose a Global-Local optimization algorithm for quantum control that combines standard local search methodologies with evolutionary algorithms. This allows us to find faster solutions to a set of problems relating to ultracold control of Bose-Einstein condensates.
DOI
10.48550/arxiv.1802.07521

Related papers

Globally optimal control of quantum dynamics

Denys I. Bondar, Llorenç Balada Gaggioli, Georgios Korpas +3 more

Optimization of constrained quantum control problems powers quantum technologies. This task becomes very difficult when these control problems are nonconvex and plagued with dense local extrema. For such problems, current optimization methods must be repeated many times to find good solutions, each time requiring many simulations of the system. Here, we present (QCPOP), a method that eliminates this problem by directly finding globally optimal solutions. The resulting increase in speed, which can be a thousandfold or more, makes it possible to solve problems that were previously intractable. This remarkable advance is due to global optimization methods recently developed for polynomial functions. We demonstrate the power of this method by showing that it obtains an optimal solution in a single run for a problem in which local extrema are so dense that gradient methods require thousands of runs to reach a similar fidelity. Since QCPOP is able to find the global optimum for quantum control, we expect that it will not only enhance the utility of quantum control by making it much easier to find the necessary protocols, but also provide a key tool for understanding the precise limits of quantum technologies. Finally, we note that the ability to cast quantum control as polynomial optimization resolves an open question regarding the computability of exact solutions to quantum control problems.

arXiv:2209.05790•Physical Review Research•Nov 21, 2025•5 citations

Improving Quantum Genetic Algorithms through Recursive Search Space Exploration

Giovanni Acampora, Autilia Vitiello

Recently, quantum computing has emerged as a new paradigm that promises to improve artificial intelligence techniques. One of the research fields that is certainly benefiting from this new computational paradigm is evolutionary optimization. In literature, efforts have been already made to run evolutionary algorithms on quantum computers using quantum effects such as superposition and entanglement to converge towards sub-optimal solutions of hard problems. However, the performance of these quantum evolutionary approaches is limited by the number of qubits available on current quantum devices. This limitation is more noticeable in the case of continuous optimization problems, where the search space is potentially infinite. This paper presents a recursive algorithmic structure that embodies a quantum evolutionary algorithm to overcome the limitations mentioned above. The result is an innovative and efficient approach in the context of quantum evolutionary optimization.

IEEE Congress on Evolutionary Computation (CEC)•Jun 30, 2024•0 citations

Optimal Control at the Quantum Speed Limit

Tommaso Caneva, Michael Murphy, Tommaso Calarco +4 more

Optimal control theory is a promising candidate for a drastic improvement of the performance of quantum information tasks. We explore its ultimate limit in paradigmatic cases, and demonstrate that it coincides with the maximum speed limit allowed by quantum evolution.

arXiv:0902.4193•Physical Review Letters•Dec 7, 2009•509 citations

Adaptive Hybrid Quantum-Inspired Optimization for Enhanced Global Search Efficiency

Annam Rupa

In this paper a new optimization algorithm named Adaptive Hybrid Quantum-Inspired Optimization Algorithm (AHQSOA) is presented for solving the complex optimization problems effectively. Stochastic traditional algorithms typically fail to come to be stuck in local optimum solutions and they need quite few iterations for converging. Our method integrates two quantum-inspired methodology: Quantum Particle Swarm Optimization (QPSO) for searching a large set solutions based on properties of quantum mechanics - superposition, point are located as randomly as possible, and Quantum Evolutionary Algorithms (QEA) for refining potential solutions by mutation and crossover operation. An adaptive tuning component based on the reinforcement learning dynamically adjusts the algorithm’s parameters, thus balancing the exploration in the wide interval and exploitation in the precise interval. Assessed on the commonly used benchmark functions like Sphere, Rosenbrock, Rastrigin, AHQSOA exhibits faster convergence (only 400 iterations in comparison to 1200 in standard methods), global search superiority (94% whereas 75–87% the traditional methods), and low computational simplicity. These results show all of our algorithm are nicer and faster and more efficient and robust makes for it a good candidate as for high dimensional and complex optimization problems.

Journal of Information Systems Engineering & Management•Apr 3, 2025•1 citation

Remote optimization of an ultracold atoms experiment by experts and citizen scientists

Robert K. Heck, Oana Vuculescu, Jens Jakob Sørensen +17 more

We introduce a remote interface to control and optimize the experimental production of Bose-Einstein condensates (BECs) and find improved solutions using two distinct implementations. First, a team of theoreticians used a remote version of their dressed chopped random basis optimization algorithm (RedCRAB), and second, a gamified interface allowed 600 citizen scientists from around the world to participate in real-time optimization. Quantitative studies of player search behavior demonstrated that they collectively engage in a combination of local and global searches. This form of multiagent adaptive search prevents premature convergence by the explorative behavior of low-performing players while high-performing players locally refine their solutions. In addition, many successful citizen science games have relied on a problem representation that directly engaged the visual or experiential intuition of the players. Here we demonstrate that citizen scientists can also be successful in an entirely abstract problem visualization. This is encouraging because a much wider range of challenges could potentially be opened to gamification in the future.

arXiv:1709.02230•Proceedings of the National Academy of Sciences•Nov 9, 2018•78 citations

Optimal driving of Bose-Einstein condensates in optical cavities

Tommaso Caneva, Tommaso Calarco, Simone Montangero

We apply quantum optimal control to enhance the performance of the experimental setup of Ref. [1], speeding up the system dynamics at time scales of the order of the quantum speed limit. We perform a fast crossing of the quantum phase transition the system undergoes under realistic experimental conditions, and we present a new scaling-based strategy to compute optimal pulses for systems at the thermodynamical limit.

AIP conference proceedings•Jan 1, 2014•0 citations
Optimization of constrained quantum control problems powers quantum technologies. This task becomes very difficult when these control problems are nonconvex and plagued with dense local extrema. For such problems, current optimization methods must be repeated many times to find good solutions, each time requiring many simulations of the system. Here, we present (QCPOP), a method that eliminates this problem by directly finding globally optimal solutions. The resulting increase in speed, which can be a thousandfold or more, makes it possible to solve problems that were previously intractable. This remarkable advance is due to global optimization methods recently developed for polynomial functions. We demonstrate the power of this method by showing that it obtains an optimal solution in a single run for a problem in which local extrema are so dense that gradient methods require thousands of runs to reach a similar fidelity. Since QCPOP is able to find the global optimum for quantum control, we expect that it will not only enhance the utility of quantum control by making it much easier to find the necessary protocols, but also provide a key tool for understanding the precise limits of quantum technologies. Finally, we note that the ability to cast quantum control as polynomial optimization resolves an open question regarding the computability of exact solutions to quantum control problems.
Recently, quantum computing has emerged as a new paradigm that promises to improve artificial intelligence techniques. One of the research fields that is certainly benefiting from this new computational paradigm is evolutionary optimization. In literature, efforts have been already made to run evolutionary algorithms on quantum computers using quantum effects such as superposition and entanglement to converge towards sub-optimal solutions of hard problems. However, the performance of these quantum evolutionary approaches is limited by the number of qubits available on current quantum devices. This limitation is more noticeable in the case of continuous optimization problems, where the search space is potentially infinite. This paper presents a recursive algorithmic structure that embodies a quantum evolutionary algorithm to overcome the limitations mentioned above. The result is an innovative and efficient approach in the context of quantum evolutionary optimization.
In this paper a new optimization algorithm named Adaptive Hybrid Quantum-Inspired Optimization Algorithm (AHQSOA) is presented for solving the complex optimization problems effectively. Stochastic traditional algorithms typically fail to come to be stuck in local optimum solutions and they need quite few iterations for converging. Our method integrates two quantum-inspired methodology: Quantum Particle Swarm Optimization (QPSO) for searching a large set solutions based on properties of quantum mechanics - superposition, point are located as randomly as possible, and Quantum Evolutionary Algorithms (QEA) for refining potential solutions by mutation and crossover operation. An adaptive tuning component based on the reinforcement learning dynamically adjusts the algorithm’s parameters, thus balancing the exploration in the wide interval and exploitation in the precise interval. Assessed on the commonly used benchmark functions like Sphere, Rosenbrock, Rastrigin, AHQSOA exhibits faster convergence (only 400 iterations in comparison to 1200 in standard methods), global search superiority (94% whereas 75–87% the traditional methods), and low computational simplicity. These results show all of our algorithm are nicer and faster and more efficient and robust makes for it a good candidate as for high dimensional and complex optimization problems.
We introduce a remote interface to control and optimize the experimental production of Bose-Einstein condensates (BECs) and find improved solutions using two distinct implementations. First, a team of theoreticians used a remote version of their dressed chopped random basis optimization algorithm (RedCRAB), and second, a gamified interface allowed 600 citizen scientists from around the world to participate in real-time optimization. Quantitative studies of player search behavior demonstrated that they collectively engage in a combination of local and global searches. This form of multiagent adaptive search prevents premature convergence by the explorative behavior of low-performing players while high-performing players locally refine their solutions. In addition, many successful citizen science games have relied on a problem representation that directly engaged the visual or experiential intuition of the players. Here we demonstrate that citizen scientists can also be successful in an entirely abstract problem visualization. This is encouraging because a much wider range of challenges could potentially be opened to gamification in the future.