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:2403.14647

Performing Non-Local Phase Estimation with a Rydberg-Superconducting Qubit Hybrid

Juan Carlos Boschero

Published Feb 22, 2024• 3 citations
arXivHTMLPDF

Abstract

Distributed quantum computation is the key to high volume computation in the NISQ era. This investigation explores the key aspects necessary for the construction of a quantum network by numerically simulating the execution of the distributed phase estimation algorithm in a proposed novel superconducting-resonator-atom hybrid system. The phase estimation algorithm is used to estimate the phase or eigenvalue of a given unitary operator and is a sub-process of many other known quantum algorithms such as Shor's algorithm and the quantum counting algorithm . An entangling gate between two qubits is utilised in the distributed phase estimation algorithm, called an E2 gate which provides the possibility to transfer quantum information from one quantum computer to another, which was numerically shown to have a construction time of 17ns at a fidelity of 93%. This investigation analytically derives the Hamiltonian dynamics as well as the noise sources of each system and utilizes quantum optimal control (QOC), namely the gradient ascent pulse engineering (GRAPE) algorithm, to minimize fidelity error in the corresponding systems gate construction. The GRAPE algorithm showed very accurate engineering of Rydberg atom single and multi-qubit gates with fidelities higher than 90% while the flux qubit suffered greatly from noise with multi-qubit gate fidelities lower than 90%. The C-shunt factor was shown to decrease the noise of the flux qubit which in turn increased the probability of accurately estimating the phase using 4 counting qubits. A trade off was observed between the number of time steps in the descent/ascent and the number of GRAPE iterations ran on the optimisation for low C-shunt factors $0<ζ<1000$. For $ζ= 1000$, the GRAPE algorithm showed effectiveness for a large number of time steps and large amount of GRAPE iterations by reaching estimation accuracies greater than 90%.

DOI
10.48550/arxiv.2403.14647

Related papers

Non-Local Phase Estimation with a Rydberg-Superconducting Qubit Hybrid

Juan Carlos Boschero, Niels M. P. Neumann, Ward van der Schoot +1 more

Distributed quantum computing (DQC) is crucial for high-volume quantum processing in the NISQ era. Many different technologies are utilized to implement a quantum computer, each with a different advantages and disadvantages. Various research is performed on how to implement DQC within a certain technology, but research on DQC between different technologies is rather limited. In this work, we contribute to this latter research line, by implementing the Quantum Phase Estimation algorithm on a superconducting-resonator-atom hybrid system. This system combines a Rydberg atom qubit, as well as a superconducting flux qubit system to perform the algorithm. In addition, Hamiltonian dynamics are studied to analyze noise sources, after which quantum optimal control (GRAPE) is used to optimize gate construction. The results show tradeoffs between GRAPE step size, iterations and noise level.

IEEE International Conference on Quantum Software (QSW)•Jul 7, 2025•0 citations

Distributed Phase Estimation Algorithm and Distributed Shor's Algorithm

Ligang Xiao, Daowen Qiu, Le Luo +1 more

Shor's algorithm is one of the most significant quantum algorithms. Shor's algorithm can factor large integers with a certain success probability in polynomial time. However, Shor's algorithm requires an unbearable amount of qubits in the NISQ (Noisy Intermediate-scale Quantum) era. To reduce the resources required for Shor's algorithm, in this paper we first propose a new distributed phase estimation algorithm. Our distributed phase estimation algorithm does not require quantum communication and it reduces the number of qubits of a single node compared to the traditional phase estimation algorithm (non-iterative version). Then we apply our distributed phase estimation algorithm to form a distributed order-finding algorithm for Shor's algorithm. Compared with the traditional Shor's algorithm (non-iterative version), the maximum number of qubits required by a single node of our dristributed order-finding algorithm is reduced by $(2-\dfrac{2}{k})L-\log_2k-O(1)$ when factoring an $L$-bit integer ($k$ is the number of compute nodes). The communication complexity of our distributed order-finding algorithm is $O(kL)$.

arXiv:2304.12100•Apr 24, 2023•17 citations

An Improved Implementation Approach for Quantum Phase Estimation on Quantum Computers

Hamed Mohammadbagherpoor, Young-Hyun Oh, Patrick Dreher +3 more

Quantum phase estimation (QPE) is one of the core algorithms for quantum computing. It has been extensively studied and applied in a variety of quantum applications such as the Shor's factoring algorithm, quantum sampling algorithms and the calculation of the eigenvalues of unitary matrices. The QPE algorithm has been combined with Kitaev's algorithm and the inverse quantum Fourier transform (IQFT) which are utilized as a fundamental component of such quantum algorithms. In this paper, we explore the computational challenges of implementing QPE algorithms on noisy intermediate-scale quantum (NISQ) machines using the IBM Q Experience (e.g., the IBMQX4, 5-qubit quantum computing hardware platform). Our experimental results indicate that the accuracy of finding the phase using these QPE algorithms is severely constrained by the NISQ computer's physical characteristics such as coherence time and error rates. To mitigate these physical limitations, we propose implementing a modified solution by reducing the number of controlled rotation gates and phase shift operations, thereby increasing the accuracy of the finding phase in near-term quantum computers.

arXiv:1910.11696•IEEE International Conference on Rebooting Computing (ICRC)•Nov 1, 2019•57 citations

Accelerating quantum optimal control through iterative gradient-ascent pulse engineering

Yuquan Chen, Yajie Hao, Ze Wu +6 more

Quantum optimal control, a powerful toolbox for engineering an optimal control field modulation that most precisely implements a desired quantum operation in the best way possible, has evolved into one of the cornerstones for enabling quantum technologies. The gradient ascent pulse engineering (GRAPE) algorithm is a widely used method in quantum optimal control, which has achieved great success in different physical platforms. However, its computational complexity increases exponentially with the number of qubits, making it challenging to be implemented for large-scale quantum systems. To mitigate this issue, we present the iterative GRAPE algorithm (iGRAPE), which reduces the optimization problem into a series of lower-dimensional subproblems by incorporating disentanglement operations. Our numerical simulations on physical platforms such as nuclear magnetic resonance and superconducting quantum systems demonstrate that iGRAPE significantly enhances state preparation speed. Specifically, compared to GRAPE, iGRAPE achieves up to a five-fold acceleration in preparing Greenberger--Horne--Zeilinger states using a 12-qubit implementation, and up to a 13-fold acceleration for arbitrary state preparation with eight qubits. To further validate our findings, we conduct experimental validation of iGRAPE on a four-qubit nuclear magnetic resonance system. Overall, iGRAPE offers an efficient solution for implementing optimal control in large-scale quantum systems, holding great potential for advancing quantum technologies during the noisy intermediate-scale quantum era.

arXiv:2212.02806•Physical Review A•Nov 7, 2023•15 citations

Superconducting Qubit Gates Robust to Parameter Fluctuations

Emily Wright, Leo Van Damme, Niklas J. Glaser +14 more

State-of-the-art single-qubit gates on superconducting transmon qubits can achieve the fidelities required for error-corrected computations. However, parameter fluctuations due to qubit instabilities, environmental changes, and control inaccuracies make it difficult to maintain this performance. To mitigate the effects of these parameter variations, we numerically derive gates robust to amplitude and frequency errors using gradient ascent pulse engineering (GRAPE). We analyze how fluctuations in qubit frequency, drive amplitude, and coherence affect gate performance over time. The robust pulses suppress coherent errors from drive amplitude drifts over 15 times more than a Gaussian pulse with derivative removal by adiabatic gate (DRAG) corrections. Furthermore, the robust gates, originally designed to compensate for quasi-static errors, also demonstrate resilience to stochastic, time-dependent noise, which is reflected in the dephasing time. They suppress added errors during increases in dephasing by up to 1.7 times more than DRAG.

quant-pharXiv:2511.22580•Physical Review Applied•Nov 28, 2025•4 citations

HIGH-FIDELITY CONTROL OF SUPERCONDUCTING QUBITS: OPTIMIZED PULSE STRATEGIES FOR QUANTUM COMPUTING APPLICATIONS IN AFRICA

Kenneth Ugo Udeze

This study explores high-fidelity control methods for superconducting qubits, focusing on their potential applications in addressing technological challenges in Africa. We evaluate three pulse optimization techniques—Gaussian-shaped pulses, Gradient Ascent Pulse Engineering (GRAPE), and Chopped Random-Basis (CRAB)—for achieving robust quantum gate operations. Through numerical simulations, CRAB emerges as the most balanced approach, delivering high fidelity (0.927) with moderate computational cost (9 seconds), while Gaussian pulses demonstrate superior noise resilience (1.000 fidelity under noise). These findings highlight the feasibility of adapting advanced quantum control methods for resource-constrained settings, with implications for quantum-enhanced solutions in African healthcare, agriculture, and logistics. The study underscores the need for localized quantum research infrastructure to bridge the global technological divide.

International Journal of Applied and Advanced Engineering Research•Aug 27, 2025•0 citations
Distributed quantum computation is the key to high volume computation in the NISQ era. This investigation explores the key aspects necessary for the construction of a quantum network by numerically simulating the execution of the distributed phase estimation algorithm in a proposed novel superconducting-resonator-atom hybrid system. The phase estimation algorithm is used to estimate the phase or eigenvalue of a given unitary operator and is a sub-process of many other known quantum algorithms such as Shor's algorithm and the quantum counting algorithm . An entangling gate between two qubits is utilised in the distributed phase estimation algorithm, called an E2 gate which provides the possibility to transfer quantum information from one quantum computer to another, which was numerically shown to have a construction time of 17ns at a fidelity of 93%. This investigation analytically derives the Hamiltonian dynamics as well as the noise sources of each system and utilizes quantum optimal control (QOC), namely the gradient ascent pulse engineering (GRAPE) algorithm, to minimize fidelity error in the corresponding systems gate construction. The GRAPE algorithm showed very accurate engineering of Rydberg atom single and multi-qubit gates with fidelities higher than 90% while the flux qubit suffered greatly from noise with multi-qubit gate fidelities lower than 90%. The C-shunt factor was shown to decrease the noise of the flux qubit which in turn increased the probability of accurately estimating the phase using 4 counting qubits. A trade off was observed between the number of time steps in the descent/ascent and the number of GRAPE iterations ran on the optimisation for low C-shunt factors 0<ζ<10000<ζ<10000<ζ<1000. For ζ=1000ζ= 1000ζ=1000, the GRAPE algorithm showed effectiveness for a large number of time steps and large amount of GRAPE iterations by reaching estimation accuracies greater than 90%.
Distributed quantum computing (DQC) is crucial for high-volume quantum processing in the NISQ era. Many different technologies are utilized to implement a quantum computer, each with a different advantages and disadvantages. Various research is performed on how to implement DQC within a certain technology, but research on DQC between different technologies is rather limited. In this work, we contribute to this latter research line, by implementing the Quantum Phase Estimation algorithm on a superconducting-resonator-atom hybrid system. This system combines a Rydberg atom qubit, as well as a superconducting flux qubit system to perform the algorithm. In addition, Hamiltonian dynamics are studied to analyze noise sources, after which quantum optimal control (GRAPE) is used to optimize gate construction. The results show tradeoffs between GRAPE step size, iterations and noise level.
Shor's algorithm is one of the most significant quantum algorithms. Shor's algorithm can factor large integers with a certain success probability in polynomial time. However, Shor's algorithm requires an unbearable amount of qubits in the NISQ (Noisy Intermediate-scale Quantum) era. To reduce the resources required for Shor's algorithm, in this paper we first propose a new distributed phase estimation algorithm. Our distributed phase estimation algorithm does not require quantum communication and it reduces the number of qubits of a single node compared to the traditional phase estimation algorithm (non-iterative version). Then we apply our distributed phase estimation algorithm to form a distributed order-finding algorithm for Shor's algorithm. Compared with the traditional Shor's algorithm (non-iterative version), the maximum number of qubits required by a single node of our dristributed order-finding algorithm is reduced by (2−2k)L−log⁡2k−O(1)(2-\dfrac{2}{k})L-\log_2k-O(1)(2−k2​)L−log2​k−O(1) when factoring an LLL-bit integer (kkk is the number of compute nodes). The communication complexity of our distributed order-finding algorithm is O(kL)O(kL)O(kL).
Quantum phase estimation (QPE) is one of the core algorithms for quantum computing. It has been extensively studied and applied in a variety of quantum applications such as the Shor's factoring algorithm, quantum sampling algorithms and the calculation of the eigenvalues of unitary matrices. The QPE algorithm has been combined with Kitaev's algorithm and the inverse quantum Fourier transform (IQFT) which are utilized as a fundamental component of such quantum algorithms. In this paper, we explore the computational challenges of implementing QPE algorithms on noisy intermediate-scale quantum (NISQ) machines using the IBM Q Experience (e.g., the IBMQX4, 5-qubit quantum computing hardware platform). Our experimental results indicate that the accuracy of finding the phase using these QPE algorithms is severely constrained by the NISQ computer's physical characteristics such as coherence time and error rates. To mitigate these physical limitations, we propose implementing a modified solution by reducing the number of controlled rotation gates and phase shift operations, thereby increasing the accuracy of the finding phase in near-term quantum computers.
Quantum optimal control, a powerful toolbox for engineering an optimal control field modulation that most precisely implements a desired quantum operation in the best way possible, has evolved into one of the cornerstones for enabling quantum technologies. The gradient ascent pulse engineering (GRAPE) algorithm is a widely used method in quantum optimal control, which has achieved great success in different physical platforms. However, its computational complexity increases exponentially with the number of qubits, making it challenging to be implemented for large-scale quantum systems. To mitigate this issue, we present the iterative GRAPE algorithm (iGRAPE), which reduces the optimization problem into a series of lower-dimensional subproblems by incorporating disentanglement operations. Our numerical simulations on physical platforms such as nuclear magnetic resonance and superconducting quantum systems demonstrate that iGRAPE significantly enhances state preparation speed. Specifically, compared to GRAPE, iGRAPE achieves up to a five-fold acceleration in preparing Greenberger--Horne--Zeilinger states using a 12-qubit implementation, and up to a 13-fold acceleration for arbitrary state preparation with eight qubits. To further validate our findings, we conduct experimental validation of iGRAPE on a four-qubit nuclear magnetic resonance system. Overall, iGRAPE offers an efficient solution for implementing optimal control in large-scale quantum systems, holding great potential for advancing quantum technologies during the noisy intermediate-scale quantum era.
State-of-the-art single-qubit gates on superconducting transmon qubits can achieve the fidelities required for error-corrected computations. However, parameter fluctuations due to qubit instabilities, environmental changes, and control inaccuracies make it difficult to maintain this performance. To mitigate the effects of these parameter variations, we numerically derive gates robust to amplitude and frequency errors using gradient ascent pulse engineering (GRAPE). We analyze how fluctuations in qubit frequency, drive amplitude, and coherence affect gate performance over time. The robust pulses suppress coherent errors from drive amplitude drifts over 15 times more than a Gaussian pulse with derivative removal by adiabatic gate (DRAG) corrections. Furthermore, the robust gates, originally designed to compensate for quasi-static errors, also demonstrate resilience to stochastic, time-dependent noise, which is reflected in the dephasing time. They suppress added errors during increases in dephasing by up to 1.7 times more than DRAG.
This study explores high-fidelity control methods for superconducting qubits, focusing on their potential applications in addressing technological challenges in Africa. We evaluate three pulse optimization techniques—Gaussian-shaped pulses, Gradient Ascent Pulse Engineering (GRAPE), and Chopped Random-Basis (CRAB)—for achieving robust quantum gate operations. Through numerical simulations, CRAB emerges as the most balanced approach, delivering high fidelity (0.927) with moderate computational cost (9 seconds), while Gaussian pulses demonstrate superior noise resilience (1.000 fidelity under noise). These findings highlight the feasibility of adapting advanced quantum control methods for resource-constrained settings, with implications for quantum-enhanced solutions in African healthcare, agriculture, and logistics. The study underscores the need for localized quantum research infrastructure to bridge the global technological divide.