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:2004.03296 · Physical Review Research

Crowdsourcing human common sense for quantum control

Jesper Hasseriis Mohr Jensen, Miroslav Gajdacz, Shaeema Zaman Ahmed, Jakub Herman Czarkowski, Carrie Ann Weidner, Janet Frances Rafner, Jens Jakob Sørensen, Klaus Mølmer, Jacob Friis Sherson

Published Jan 19, 2021• 39 citations
arXivHTMLPDF

Abstract

The authors explore nonexpert citizen contributions for solving a suite of quantum optimal control problems. Their input is gathered through a game where they produce and subsequently improve solutions using an in-game local optimization algorithm.
DOI
10.1103/physrevresearch.3.013057

Related papers

The quantum computer game: citizen science

Sidse Damgaard Hansen, Klaus Mølmer, Jacob Friis Sherson

Bulletin of the American Physical Society•Jun 7, 2013•0 citations

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•79 citations

Quantum Analysis on Task Allocation and Quality Control for Crowdsourcing With Homogeneous Workers

Minghui Xu, Shengling Wang, Qin Hu +2 more

Crowdsourcing has been emerging as a valid problem-solving model that harnesses a large group of contributors to solve a complicated task. However, existing crowdsourcing platforms or systems could suffer from task allocation and quality control problems. In this article, we first prove that there exist two dilemmas while tackling the above issues by using a game-theoretic approach. To overcome this challenge, we are focusing on exploiting quantum crowdsourcing schemes in which the welfare of requestor or worker can be maximized since quantum players share the extended strategy space, and the introduction of entanglement offers a new method of depicting fine-grained relations between players. Specifically, we propose a quantum game model for quota-oriented crowdsourcing game to address dilemmas in task allocation. The result indicates the dilemma based on classical strategy will disappear with the increment of entanglement degree. While in the quality-oriented crowdsourcing game, we adopt a density matrix approach to calculate the optimal payoffs of both sides, which demonstrates the superiority of our quantum strategy. Moreover, our quantum scheme is generic since it is compatible with the schemes from a classical perspective. Hence, our noteworthy quantum crowdsourcing schemes offer a promising alternative route for tackling dilemmas in crowdsourcing scenarios.

IEEE Transactions on Network Science and Engineering•May 26, 2020•9 citations

Low-Depth Mechanisms for Quantum Optimization

Jarrod R. McClean, Matthew P. Harrigan, Masoud Mohseni +6 more

By gaining intuition about the mechanisms by which quantum optimization algorithms solve problems, approaches are identified that substantially improve the performance of quantum algorithms for this task.

arXiv:2008.08615•PRX Quantum•Jul 21, 2021•51 citations

Solving quantum optimal control problems using projection-operator-based Newton steps

Jieqiu Shao, Mantas Naris, John Hauser +1 more

The Quantum Projection Operator-Based Newton Method for Trajectory Optimization (q-pronto) is a numerical method for solving quantum optimal control problems. This paper significantly improves prior versions of the quantum projection operator by introducing a regulator that stabilizes the solution estimate at every iteration. This modification is shown to not only improve the convergence rate of the algorithm, but also steer the solver towards better local minima compared to the unregulated case. Numerical examples showcase how q-pronto can be used to solve multi-input quantum optimal control problems featuring time-varying costs and undesirable populations that ought to be avoided during the transient.

arXiv:2305.17630•Physical Review A•Jan 8, 2024•8 citations

A tutorial on optimal control and reinforcement learning methods for quantum technologies

Luigi Giannelli, Sofia Sgroi, Jonathon Brown +4 more

arXiv:2112.07453•Physics Letters A•Mar 8, 2022•65 citations
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.
Crowdsourcing has been emerging as a valid problem-solving model that harnesses a large group of contributors to solve a complicated task. However, existing crowdsourcing platforms or systems could suffer from task allocation and quality control problems. In this article, we first prove that there exist two dilemmas while tackling the above issues by using a game-theoretic approach. To overcome this challenge, we are focusing on exploiting quantum crowdsourcing schemes in which the welfare of requestor or worker can be maximized since quantum players share the extended strategy space, and the introduction of entanglement offers a new method of depicting fine-grained relations between players. Specifically, we propose a quantum game model for quota-oriented crowdsourcing game to address dilemmas in task allocation. The result indicates the dilemma based on classical strategy will disappear with the increment of entanglement degree. While in the quality-oriented crowdsourcing game, we adopt a density matrix approach to calculate the optimal payoffs of both sides, which demonstrates the superiority of our quantum strategy. Moreover, our quantum scheme is generic since it is compatible with the schemes from a classical perspective. Hence, our noteworthy quantum crowdsourcing schemes offer a promising alternative route for tackling dilemmas in crowdsourcing scenarios.
The Quantum Projection Operator-Based Newton Method for Trajectory Optimization (q-pronto) is a numerical method for solving quantum optimal control problems. This paper significantly improves prior versions of the quantum projection operator by introducing a regulator that stabilizes the solution estimate at every iteration. This modification is shown to not only improve the convergence rate of the algorithm, but also steer the solver towards better local minima compared to the unregulated case. Numerical examples showcase how q-pronto can be used to solve multi-input quantum optimal control problems featuring time-varying costs and undesirable populations that ought to be avoided during the transient.