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

• URL: http://arxiv.org/abs/2505.17842v1
• Date: Fri, 23 May 2025 12:57:02 GMT
• Title: Non-Local Phase Estimation with a Rydberg-Superconducting Qubit Hybrid
• Authors: Juan C. Boschero, Niels M. P. Neumann, Ward van der Schoot, Frank Phillipson,
• Abstract summary: We implement the Quantum Phase Estimation algorithm on a superconducting-resonator-atom hybrid system.<n>In addition, Hamiltonian dynamics are studied to analyze noise sources, after which quantum optimal control (GRAPE) is used to optimize gate construction.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Performance-centric roadmap for building a superconducting quantum computer [0.0]
  We identify four distinct phases for quantum hardware and enabling technology development.<n>The aim is to improve performance as we scale and increase the algorithmic complexity the quantum hardware is capable of running.
  arXiv  Detail & Related papers  (2025-06-29T10:25:50Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Q-Fusion: Diffusing Quantum Circuits [2.348041867134616]
  We propose a diffusion-based algorithm leveraging the LayerDAG framework to generate new quantum circuits.<n>Our results demonstrate that the proposed model consistently generates 100% valid quantum circuit outputs.
  arXiv  Detail & Related papers  (2025-04-29T14:10:10Z)
• Quantum Circuit Design using a Progressive Widening Enhanced Monte Carlo Tree Search [0.7639610349097473]
  This article proposes a gradient-free Monte Carlo Tree Search (MCTS) technique to automate the process of quantum circuit design.<n>Compared to previous MCTS research, our technique reduces the number of quantum circuit evaluations by a factor of 10 up to 100.<n>The resulting quantum circuits exhibit up to three times fewer CNOT gates, which is important for implementation on noisy quantum hardware.
  arXiv  Detail & Related papers  (2025-02-06T10:52:11Z)
• Benchmarking Variational Quantum Eigensolvers for Entanglement Detection in Many-Body Hamiltonian Ground States [37.69303106863453]
  Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. We use a specific class of VQA named variational quantum eigensolvers (VQEs) to benchmark them at entanglement witnessing and entangled ground state detection. Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
  arXiv  Detail & Related papers  (2024-07-05T12:06:40Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Digital Quantum Simulation of Cavity Quantum Electrodynamics: Insights from Superconducting and Trapped Ion Quantum Testbeds [0.016994625126740815]
  We simulate open Cavity Quantum Electrodynamical (CQED) systems for applications in optical quantum communication, simulation and computing.<n>Results can be used as a recipe for efficient and platform-specific quantum simulation of cavity-emitter systems on contemporary and future quantum computers.
  arXiv  Detail & Related papers  (2024-04-05T02:25:49Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• 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)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Calculating the ground state energy of benzene under spatial deformations with noisy quantum computing [0.0]
  We calculate the ground state energy of benzene under spatial deformations by using the variational quantum eigensolver (VQE) By combining our advanced simulation platform with real quantum computers, we provided an analysis of how the noise, inherent to quantum computers, affects the results.
  arXiv  Detail & Related papers  (2022-03-10T10:28:59Z)
• The Variational Quantum Eigensolver: a review of methods and best practices [3.628860803653535]
  The variational quantum eigensolver (or VQE) uses the variational principle to compute the ground state energy of a Hamiltonian. This review aims to provide an overview of the progress that has been made on the different parts of the algorithm.
  arXiv  Detail & Related papers  (2021-11-09T14:40:18Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.