Hardware-Efficient Rydberg Atomic Quantum Solvers for NP Problems
- URL: http://arxiv.org/abs/2507.22686v1
- Date: Wed, 30 Jul 2025 13:48:57 GMT
- Title: Hardware-Efficient Rydberg Atomic Quantum Solvers for NP Problems
- Authors: Shuaifan Cao, Xiaopeng Li,
- Abstract summary: We construct a generic quantum solver for NP problems based on Grover's search algorithm, specifically tailored for Rydberg-atom quantum computing platforms.<n>We design the quantum oracles in the search algorithm using parallelizable single-qubit and multi-qubit entangling gates in the Rydberg atom system.<n>Our construction indicates that atomic qubits offer favorable circuit depth scaling compared to quantum processors with fixed local connectivity.
- Score: 3.842223753702757
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Developing hardware-efficient implementations of quantum algorithms is crucial in the NISQ era to achieve practical quantum advantage. Here, we construct a generic quantum solver for NP problems based on Grover's search algorithm, specifically tailored for Rydberg-atom quantum computing platforms. We design the quantum oracles in the search algorithm using parallelizable single-qubit and multi-qubit entangling gates in the Rydberg atom system, yielding a unified framework for solving a broad class of NP problems with provable quadratic quantum speedup. We analyze the experimental resource requirements considering the unique qubit connectivity of the dynamically reconfigurable qubits in the optical tweezer array. The required qubit number scales linearly with the problem size, representing a significant improvement over existing Rydberg-based quantum annealing approaches that incur quadratic overhead. These results provide a concrete roadmap for future experimental efforts towards demonstrating quantum advantage in NP problem solving using Rydberg atomic systems. Our construction indicates that atomic qubits offer favorable circuit depth scaling compared to quantum processors with fixed local connectivity.
Related papers
- Quantum Walks on Arbitrary Spatial Networks with Rydberg Atoms [0.0]
We propose a general implementation of staggered quantum walks with Rydberg atoms, with a particular focus on spatial networks.<n>We also present an efficient algorithm for constructing the tessellations required for the staggered quantum walk.
arXiv Detail & Related papers (2025-07-28T17:22:53Z) - Advancing Quantum State Preparation using LimTDD [5.328178128965817]
Quantum state preparation (QSP) is a fundamental task in quantum computing and quantum information processing.<n>We propose a family of efficient QSP algorithms tailored to different numbers of available ancilla qubits.<n>Our algorithms are based on a novel decision diagram that is fundamentally different from the approaches used in previous QSP algorithms.
arXiv Detail & Related papers (2025-07-23T03:34:44Z) - 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) - Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - 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) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional
Networks [124.7972093110732]
We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations.
To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections.
Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
arXiv Detail & Related papers (2022-11-09T21:43:16Z) - Quantum Optimization of Maximum Independent Set using Rydberg Atom
Arrays [39.76254807200083]
We experimentally investigate quantum algorithms for solving the Maximum Independent Set problem.
We find the problem hardness is controlled by the solution degeneracy and number of local minima.
On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions.
arXiv Detail & Related papers (2022-02-18T19:00:01Z) - Demonstration of multi-qubit entanglement and algorithms on a
programmable neutral atom quantum computer [0.0]
Neutral atom hyperfine qubits provide inherent scalability due to their identical characteristics, long coherence times, and ability to be trapped in dense multi-dimensional arrays.
We demonstrate several quantum algorithms on a programmable gate model neutral atom quantum computer in an architecture based on individual addressing of single atoms with tightly focused optical beams scanned across a two-dimensional array of qubits.
arXiv Detail & Related papers (2021-12-29T15:02:43Z) - Quantum amplitude damping for solving homogeneous linear differential
equations: A noninterferometric algorithm [0.0]
This work proposes a novel approach by using the Quantum Amplitude Damping operation as a resource, in order to construct an efficient quantum algorithm for solving homogeneous LDEs.
We show that such an open quantum system-inspired circuitry allows for constructing the real exponential terms in the solution in a non-interferometric.
arXiv Detail & Related papers (2021-11-10T11:25:32Z) - Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg
Atoms [55.41644538483948]
We provide the first complete characterization of sources of error in a neutral-atom quantum computer.
We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace.
Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
arXiv Detail & Related papers (2021-05-27T23:29: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.