Related papers: Rydberg-atom graphs for quadratic unconstrained bi…
The D-Wave quantum annealing machine can quickly find the optimal solution for quadratic unconstrained binary optimization (QUBO). One of the applications where the use of quantum annealing is desired is in problems requiring rapid…
Tomographic reconstruction of the many-body quantum state of a scalable qubit system is of paramount importance in quantum computing technologies. However, conventional approaches which use tomographically orthogonal base measurements…
Current quantum computing devices have different strengths and weaknesses depending on their architectures. This means that flexible approaches to circuit design are necessary. We address this task by introducing a novel space-efficient…
In this paper, we develop a way to encode several NP-Complete problems in Abstract Argumentation to Quadratic Unconstrained Binary Optimization (QUBO) problems. In this form, a solution for a QUBO problem involves minimizing a quadratic…
Rydberg atoms held in optical tweezer arrays combine vibrational and electronic degrees of freedom which can be coupled and manipulated at a microscopic level. This opens opportunities for the quantum simulation of artificial molecular…
Efficient sampling from a classical Gibbs distribution is an important computational problem with applications ranging from statistical physics over Monte Carlo and optimization algorithms to machine learning. We introduce a family of…
We propose a protocol to realize arbitrary state synthesis and unitary operations on a qudit encoded in the collective dressed states of a Rydberg blockaded array of three-level atoms. This system is isomorphic to the Jaynes-Cummings model…
The rapid development of neutral atom quantum hardware provides a unique opportunity to design hardware-centered algorithms for solving real-world problems aimed at establishing quantum utility. In this work, we study the performance of two…
In this paper, we propose a quantum algorithm that supports a real-valued higher-order unconstrained binary optimization (HUBO) problem. This algorithm is based on the Grover adaptive search that originally supported HUBO with integer…
Quadratic Unconstrained Binary Optimization (QUBO) is a combinatorial optimization to find an optimal binary solution vector that minimizes the energy value defined by a quadratic formula of binary variables in the vector. As many NP-hard…
We propose a physical realization of quantum cellular automata (QCA) using arrays of ultracold atoms excited to Rydberg states. The key ingredient is the use of programmable multifrequency couplings which generalize the Rydberg blockade and…
We investigate a quadratic unconstrained binary optimization (QUBO) formulation of the graph isomorphism problem using the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE). For small graph…
We present a review of quantum computation with neutral atom qubits. After an overview of architectural options and approaches to preparing large qubit arrays we examine Rydberg mediated gate protocols and fidelity for two- and multi-qubit…
In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing problem variants considered include graph type, directionally…
Graph partitioning has many applications in powersystems from decentralized state estimation to parallel simulation. Focusing on parallel simulation, optimal grid partitioning minimizes the idle time caused by different simulation times for…
We characterize the set of optimal protocols for two-qubit entangling gates through a mechanism analysis based on quantum pathways, which allows us to compare and rank the different solutions. As an example of a flexible platform with a…
Quantum Approximate Optimization Algorithm (QAOA) is one of the most short-term promising quantum-classical algorithm to solve unconstrained combinatorial optimization problems. It alternates between the execution of a parametrized quantum…
Quantum holonomic gates hold built-in resilience to local noises and provide a promising approach for implementing fault-tolerant quantum computation. We propose to realize high-fidelity holonomic $(N+1)$-qubit controlled gates using…
In this paper, we propose a hybrid framework to solve large-scale permutation-based combinatorial problems effectively using a high-performance quadratic unconstrained binary optimization (QUBO) solver. To do so, transformations are…
Arrays of qubits encoded in the ground-state manifold of neutral atoms trapped in optical (or magnetic) lattices appear to be a promising platform for the realization of a scalable quantum computer. Two-qubit conditional gates between…