Related papers: Hardware-Efficient Rydberg Atomic Quantum Solvers …
Although quantum computing hardware has evolved significantly in recent years, spurred by increasing industrial and government interest, the size limitation of current generation quantum computers remains an obstacle when applying these…
Atom chips are a promising candidate for a scalable architecture for quantum information processing provided a universal set of gates can be implemented with high fidelity. The difficult part in achieving universality is the entangling…
Emerging quantum processors provide an opportunity to explore new approaches for solving traditional problems in the post Moore's law supercomputing era. However, the limited number of qubits makes it infeasible to tackle massive real-world…
Quantum computing has the potential to accelerate various domains: scientific computation, machine learning, and optimization. Recently, Rydberg atom quantum computing has emerged as a promising quantum computing technology, especially with…
Some of the computational limitations in solving the nuclear many-body problem could be overcome by utilizing quantum computers. The nuclear shell-model calculations providing deeper insights into the properties of atomic nuclei, is one…
We describe the experimental implementation of a recently proposed quantum algorithm involving quantum entanglement at the level of two qubits using NMR. The algorithm solves a generalisation of the Deutsch problem and distinguishes between…
State-of-the-art noisy intermediate-scale quantum devices (NISQ), although imperfect, enable computational tasks that are manifestly beyond the capabilities of modern classical supercomputers. However, present quantum computations are…
We propose a scalable implementation of Grover's quantum search algorithm in a trapped-ion quantum information processor. The system is initialized in an entangled Dicke state by using simple adiabatic techniques. The…
NP-hard problems such as the maximum clique or minimum vertex cover problems, two of Karp's 21 NP-hard problems, have several applications in computational chemistry, biochemistry and computer network security. Adiabatic quantum annealers…
We describe and analyze an architecture for quantum optimization to solve maximum independent set (MIS) problems using neutral atom arrays trapped in optical tweezers. Optimizing independent sets is one of the paradigmatic, NP-hard problems…
Variational quantum algorithms have found success in the NISQ era owing to their hybrid quantum-classical approach which mitigate the problems of noise in quantum computers. In our study we introduce the dynamic ansatz in the Variational…
Over the past decade, the rapid advancement of deep learning and big data applications has been driven by vast datasets and high-performance computing systems. However, as we approach the physical limits of semiconductor fabrication in the…
Rydberg atoms stand out as a highly promising platform for realizing quantum computation with significant advantages in constructing high-fidelity quantum gates. Floquet frequency modulation (FFM), in Rydberg-atom systems, provides a unique…
Graph embedding is a recurrent problem in quantum computing, for instance, quantum annealers need to solve a minor graph embedding in order to map a given Quadratic Unconstrained Binary Optimization (QUBO) problem onto their internal…
Quantum algorithms for unstructured search problems rely on the preparation of a uniform superposition, traditionally achieved through Hadamard gates. However, this incidentally creates an auxiliary search space consisting of nonsensical…
We propose a quantum algorithm for approximately counting the number of solutions to planar 2-satisfiability (2SAT) formulas natively on neutral atom quantum computers. Our algorithm maps Boolean variables to atomic registers arranged in…
In the last decade, public and industrial research funding has moved quantum computing from the early promises of Shor's algorithm through experiments to the era of noisy intermediate scale quantum devices (NISQ) for solving real-world…
Following Feynman and as elaborated on by Lloyd, a universal quantum simulator (QS) is a controlled quantum device which reproduces the dynamics of any other many particle quantum system with short range interactions. This dynamics can…
We propose a quantum algorithm for closest pattern matching which allows us to search for as many distinct patterns as we wish in a given string (database), requiring a query function per symbol of the pattern alphabet. This represents a…
Simulating quantum circuits using classical computers can accelerate the development and validation of quantum algorithms. Our newly developed algorithm, variational quantum search (VQS), has shown an exponential advantage over Grover's…