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:quant-ph/0512082 · Journal of Fixed Point Theory and Applications

Qubit complexity of continuous problems

Anargyros Papageorgiou, Joseph F. Traub

Published Dec 1, 2009• 8 citations
arXivHTMLPDF
DOI
10.1007/s11784-009-0132-7

Related papers

Quantum Algorithms and Complexity for Continuous Problems

Anargyros Papageorgiou, Joseph F. Traub

Springer eBooks•Nov 2, 2011•0 citations

Resonant Quantum Search with Monitor Qubits*

Frank A. Wilczek, Hong-Ye Hu, Biao Wu

We present an algorithm for the generalized search problem (searching k marked items among N items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity O ( N / k ) as the Grover algorithm. A natural extension of the algorithm, incorporating auxiliary “monitor” qubits, can determine k precisely, if it is unknown. The time complexity of our counting algorithm is O ( N ) , similar to the best quantum approximate counting algorithm, or better, given appropriate physical resources.

arXiv:2002.09522•Chinese Physics Letters•May 1, 2020•7 citations

Computational complexity and applications of quantum algorithm

Satoshi Iriyama, Makoto Ohya

Applied Mathematics and Computation•Jun 24, 2011•2 citations

Resonant Quantum Search with Monitor Qubits

Frank A. Wilczek, Wilczek, F, Biao Wu +3 more

© 2020 Chinese Physical Society and IOP Publishing Ltd. We present an algorithm for the generalized search problem (searching k marked items among N items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity as the Grover algorithm. A natural extension of the algorithm, incorporating auxiliary "monitor"qubits, can determine k precisely, if it is unknown. The time complexity of our counting algorithm is O(√N), similar to the best quantum approximate counting algorithm, or better, given appropriate physical resources.

•Jan 1, 2020•7 citations

Computational Complexity and Quantum Computing

Marco O. Lanzagorta, Jeffrey K. Uhlmann

Synthesis lectures on quantum computing•Jan 1, 2008•0 citations

Guided Reward Design in Continuous Reinforcement Learning for Quantum Control

Shumin Zhou, Hailan Ma, Sen Kuang +1 more

Reinforcement learning has been intensively applied to tackle complex quantum control problems owing to its adaptability in dynamic environments. However, commonly used reinforcement learning algorithms are restricted to selecting actions from a discrete action space, which may result in inaccurate control. In order to surpass this constraint, we propose an improved continuous reinforcement learning algorithm that can generate control policies in a continuous action space, enabling precise control of quantum systems. Moreover, a guided reward function design method is proposed to guide the learning process toward higher fidelity. Numerical results demonstrate that the proposed continuous reinforcement learning algorithm with a guided reward function can capably prepare states on one-qubit and two-qubit systems.

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics•Oct 1, 2023•0 citations
We present an algorithm for the generalized search problem (searching k marked items among N items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity O ( N / k ) as the Grover algorithm. A natural extension of the algorithm, incorporating auxiliary “monitor” qubits, can determine k precisely, if it is unknown. The time complexity of our counting algorithm is O ( N ) , similar to the best quantum approximate counting algorithm, or better, given appropriate physical resources.
© 2020 Chinese Physical Society and IOP Publishing Ltd. We present an algorithm for the generalized search problem (searching k marked items among N items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity as the Grover algorithm. A natural extension of the algorithm, incorporating auxiliary "monitor"qubits, can determine k precisely, if it is unknown. The time complexity of our counting algorithm is O(√N), similar to the best quantum approximate counting algorithm, or better, given appropriate physical resources.
Reinforcement learning has been intensively applied to tackle complex quantum control problems owing to its adaptability in dynamic environments. However, commonly used reinforcement learning algorithms are restricted to selecting actions from a discrete action space, which may result in inaccurate control. In order to surpass this constraint, we propose an improved continuous reinforcement learning algorithm that can generate control policies in a continuous action space, enabling precise control of quantum systems. Moreover, a guided reward function design method is proposed to guide the learning process toward higher fidelity. Numerical results demonstrate that the proposed continuous reinforcement learning algorithm with a guided reward function can capably prepare states on one-qubit and two-qubit systems.