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

• URL: http://arxiv.org/abs/2403.14647v1
• Date: Thu, 22 Feb 2024 16:11:48 GMT
• Title: Performing Non-Local Phase Estimation with a Rydberg-Superconducting Qubit Hybrid
• Authors: Juan Carlos Boschero,
• Abstract summary: We numerically simulate the execution of the distributed phase estimation algorithm in a proposed novel superconducting-resonator-atom hybrid system. An entangling gate between two qubits is utilised in the distributed phase estimation algorithm, called an E2 gate. The GRAPE algorithm showed very accurate engineering of Rydberg atom single and multi-qubit gates with fidelities higher than 90%.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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<\zeta<1000$. For $\zeta = 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%.

Related papers

• T-Count Optimizing Genetic Algorithm for Quantum State Preparation [0.05999777817331316]
  We present and utilize a genetic algorithm for state preparation circuits consisting of gates from the Clifford + T gate set. Our algorithm does automatically generate fault tolerantly implementable solutions where the number of the most error prone components is reduced.
  arXiv  Detail & Related papers  (2024-06-06T12:26:14Z)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Error Mitigation-Aided Optimization of Parameterized Quantum Circuits: Convergence Analysis [42.275148861039895]
  Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy processors. gate noise due to imperfections and decoherence affects the gradient estimates by introducing a bias. Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits. QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently small.
  arXiv  Detail & Related papers  (2022-09-23T10:48:04Z)
• On proving the robustness of algorithms for early fault-tolerant quantum computers [0.0]
  We introduce a randomized algorithm for the task of phase estimation and give an analysis of its performance under two simple noise models. We calculate that the randomized algorithm can succeed with arbitrarily high probability as long as the required circuit depth is less than 0.916 times the dephasing scale.
  arXiv  Detail & Related papers  (2022-09-22T21:28:12Z)
• Dual-Frequency Quantum Phase Estimation Mitigates the Spectral Leakage of Quantum Algorithms [76.15799379604898]
  Quantum phase estimation suffers from spectral leakage when the reciprocal of the record length is not an integer multiple of the unknown phase. We propose a dual-frequency estimator, which approaches the Cramer-Rao bound, when multiple samples are available.
  arXiv  Detail & Related papers  (2022-01-23T17:20:34Z)
• Multistate Transition Dynamics by Strong Time-Dependent Perturbation in NISQ era [0.0]
  We develop a quantum computing scheme utilizing McLachlan variational principle in a hybrid quantum-classical algorithm. Results for transition probabilities are obtained with accuracy better than 1%, as established by comparison to the benchmark data.
  arXiv  Detail & Related papers  (2021-12-13T00:49:15Z)
• Low depth amplitude estimation on a trapped ion quantum computer [5.443245599372994]
  Amplitude estimation is a fundamental quantum algorithmic primitive that enables quantum computers to achieve quadratic speedups. Recent works have succeeded in somewhat reducing the necessary resources for such algorithms, by trading off some of the speedup for lower depth circuits. We report the results of an experimental demonstration of amplitude estimation on a state-of-the-art trapped ion quantum computer.
  arXiv  Detail & Related papers  (2021-09-20T16:57:19Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.