Related papers: Rydberg Quantum Wires for Maximum Independent Set …
In quantum computing, the connectivity of qubits placed on two-dimensional chips limits the scalability and functionality of solid-state quantum computers. This paper presents two approaches to constructing complex quantum networks from…
Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems. We introduce a graph neural network architecture for solving such optimization problems. The architecture is generic; it works for…
Rydberg atom arrays constitute a promising quantum information platform, where control over several hundred qubits has been demonstrated. Further scaling could significantly benefit from coupling to integrated optical or electronic devices,…
Strong interactions can amplify quantum effects such that they become important on macroscopic scales. Controlling these coherently on a single particle level is essential for the tailored preparation of strongly correlated quantum systems…
Distributed quantum computing leverages the collective power of multiple quantum devices to perform computations exceeding the capabilities of individual quantum devices. A currently studied technique to enable this distributed approach is…
Integer programming (IP) is an NP-hard combinatorial optimization problem that is widely used to represent a diverse set of real-world problems spanning multiple fields, such as finance, engineering, logistics, and operations research. It…
Measurement-based quantum computing relies on the rapid creation of large-scale entanglement in a register of stable qubits. Atomic arrays are well suited to store quantum information, and entanglement can be created using highly-excited…
Given a graph $G$, the NP-hard Maximum Planar Subgraph problem asks for a planar subgraph of $G$ with the maximum number of edges. The only known non-trivial exact algorithm utilizes Kuratowski's famous planarity criterion and can be…
The design of a good algorithm to solve NP-hard combinatorial approximation problems requires specific domain knowledge about the problems and often needs a trial-and-error problem solving approach. Graph coloring is one of the essential…
Combinatorial optimization is considered a promising class of problems in which quantum computers can show significant advantages. However, problems of practical relevance typically have more variables than current or foreseeable quantum…
We describe the zero-temperature phase diagram of a model of a two-dimensional square-lattice array of neutral atoms, excited into Rydberg states and interacting via strong van der Waals interactions. Using the density-matrix…
The success of machine learning solutions for reasoning about discrete structures has brought attention to its adoption within combinatorial optimization algorithms. Such approaches generally rely on supervised learning by leveraging…
Spin models are the prime example of simplified manybody Hamiltonians used to model complex, real-world strongly correlated materials. However, despite their simplified character, their dynamics often cannot be simulated exactly on…
Simulating $\mathrm{U(1)}$ quantum gauge theories with spatial dimension greater than one is of great physical significance yet has not been achieved experimentally. Here we propose a simple realization of $\mathrm{U(1)}$ gauge theory on…
Quantum-mechanical phenomena are playing an increasing role in information processing, as transistor sizes approach the nanometer level, and quantum circuits and data encoding methods appear in the securest forms of communication.…
We consider an inverse problem for a finite graph $(X,E)$ where we are given a subset of vertices $B\subset X$ and the distances $d_{(X,E)}(b_1,b_2)$ of all vertices $b_1,b_2\in B$. The distance of points $x_1,x_2\in X$ is defined as the…
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…
We revisit the recent polynomial-time algorithm for the MAX WEIGHT INDEPENDENT SET (MWIS) problem in bounded-degree graphs that do not contain a fixed graph whose every component is a subdivided claw as an induced subgraph [Abrishami,…
Resource allocation of wide-area internet networks is inherently a combinatorial optimization problem that if solved quickly, could provide near real-time adaptive control of internet-protocol traffic ensuring increased network efficacy and…
Neutral atom technology has steadily demonstrated significant theoretical and experimental advancements, positioning itself as a front-runner platform for running quantum algorithms. One unique advantage of this technology lies in the…