English
Related papers

Related papers: Rydberg Quantum Wires for Maximum Independent Set …

200 papers

Arrays of Rydberg atoms interacting via dipole-dipole interactions offer a powerful platform for probing quantum many-body physics. However, these intrinsic interactions also determine and constrain the models -- and parameter regimes…

Quantum Gases · Physics 2025-12-16 Mingsheng Tian , Rhine Samajdar , Bryce Gadway

Here, we explore the combination of sub-wavelength, two-dimensional atomic arrays and Rydberg interactions as a powerful platform to realize strong, coherent interactions between individual photons with high fidelity. In particular, the…

Quantum Physics · Physics 2022-01-05 Mariona Moreno-Cardoner , Daniel Goncalves , Darrick E. Chang

Reconfigurable intelligent surface (RIS) is considered as a promising solution for next-generation wireless communication networks due to a variety of merits, e.g., customizing the communication environment. Therefore, deploying multiple…

Signal Processing · Electrical Eng. & Systems 2023-02-09 Mengbing Liu , Chongwen Huang , Marco Di Renzo , Merouane Debbah , Chau Yuen

The complexity of classical computational problems in graph classes defined by forbidding induced subgraphs is one of the central topics of algorithmic graph theory. Recently, there has been a growing interest in the complexity of such…

Data Structures and Algorithms · Computer Science 2026-04-28 Paweł Rafał Bieliński , Marta Piecyk , Paweł Rzążewski

Rydberg atom arrays are a front-running platform for quantum processors. A major challenge threatening the scalability of this platform is the limited qubit connectivity due to the finite range of interatomic interactions. We explore an…

Quantum Physics · Physics 2025-11-07 Ivan V. Dudinets , Stanislav S. Straupe , Aleksey K. Fedorov , Oleg V. Lychkovskiy

Quantum computers have the potential to solve important problems which are fundamentally intractable on a classical computer. The underlying physics of quantum computing platforms supports using multi-valued logic, which promises a boost in…

Quantum Physics · Physics 2024-06-07 Kevin Mato , Stefan Hillmich , Robert Wille

The maximum independent set problem is one of the most important problems in graph algorithms and has been extensively studied in the line of research on the worst-case analysis of exact algorithms for NP-hard problems. In the weighted…

Data Structures and Algorithms · Computer Science 2021-08-31 Sen Huang , Mingyu Xiao , Xiaoyu Chen

Demonstrating quantum advantage for combinatorial optimization requires more than standalone algorithmic results; it calls for end-to-end case studies that integrate problem modelling, quantum execution, and classical refinement into…

Successful execution of a quantum information processing (QIP) task on a quantum processing device depends on the availability of high-quality entangling gates. Two important goals in the design and implementation of any entangling gate are…

Quantum Physics · Physics 2022-09-20 David C. Spierings , Edwin Tham , Aharon Brodutch , Ilia Khait

The current noisy intermediate-scale quantum (NISQ) era is characterized by substantial errors and noise, which limit the practical feasibility of deep, many-qubit circuits. To address these constraints, quantum circuit cutting has emerged…

Quantum Physics · Physics 2026-04-28 Yuval Idan , Eitan Zahavi , Elad Mentovich , Eliahu Cohen , Shmuel Zaks

Whether or not the problem of finding maximal independent sets (MIS) in hypergraphs is in (R)NC is one of the fundamental problems in the theory of parallel computing. Unlike the well-understood case of MIS in graphs, for the hypergraph…

Data Structures and Algorithms · Computer Science 2014-08-14 Ioana O. Bercea , Navin Goyal , David G. Harris , Aravind Srinivasan

Diagnosing the minimal set of faults capable of explaining a set of given observations, e.g., from sensor readouts, is a hard combinatorial optimization problem usually tackled with artificial intelligence techniques. We present the mapping…

Ising machines (IM) are physics-inspired alternatives to von Neumann architectures for solving hard optimization tasks. By mapping binary variables to coupled Ising spins, IMs can naturally solve unconstrained combinatorial optimization…

Emerging Technologies · Computer Science 2025-08-01 Corentin Delacour

Motivated by far-reaching applications ranging from quantum simulations of complex processes in physics and chemistry to quantum information processing, a broad effort is currently underway to build large-scale programmable quantum systems.…

We have numerically simulated quantum tomography of single-qubit and two-qubit quantum gates with qubits represented by mesoscopic ensembles containing random numbers of atoms. Such ensembles of strongly interacting atoms in the regime of…

The maximum independent set problem is known to be NP-hard in the class of subcubic graphs, i.e. graphs of vertex degree at most 3. We present a polynomial-time solution in a subclass of subcubic graphs generalizing several previously known…

Data Structures and Algorithms · Computer Science 2018-10-26 Ararat Harutyunyan , Michael Lampis , Vadim Lozin , Jérôme Monnot

Quantum simulators employing cold atoms are among the most promising approaches to tackle quantum many-body problems. Nanophotonic structures are widely employed to engineer the bandstructure of light and are thus investigated as a means to…

Quantum Physics · Physics 2021-07-08 Katharina Brechtelsbauer , Daniel Malz

This paper investigates a fluid reconfigurable intelligent surface (FRIS)-assisted Rydberg Atomic REceiver (RARE) architecture under magnitude-only heterodyne readout. We show that, unlike conventional coherent systems, the optimal…

Signal Processing · Electrical Eng. & Systems 2026-04-14 Hong-Bae Jeon , Kai-Kit Wong , Chan-Byoung Chae

We introduce a novel hybrid quantum-classical variational optimization method for unconstrained binary combinatorial optimization problems on gate-model quantum computers, integrating a custom variational ansatz, staged feedback-based dual…

We give a quantum algorithm for a novel type of black-box problem: identifying a hidden $d$-regular base graph $G$ on $n$ vertices from oracle access to an obfuscated version of it, rather than traversing it. From $G$ we build the spired…

Quantum Physics · Physics 2026-05-13 Pawel Wocjan
‹ Prev 1 8 9 10 Next ›