Related papers: Disorder-assisted graph coloring on quantum anneal…

Graph workloads pose a particularly challenging problem for query optimizers. They typically feature large queries made up of entirely many-to-many joins with complex correlations. This puts significant stress on traditional cardinality…

Quantum annealing (QA) has emerged as a powerful technique to solve optimization problems by taking advantages of quantum physics. In QA process, a bottleneck that may prevent QA to scale up is minor embedding step in which we embed…

Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that play an important role in networking, computational biology, and biochemistry. We show an explicit construction…

The glued-trees problem is the only example known to date for which quantum annealing provides an exponential speedup, albeit by partly using excited state evolution, in an oracular setting. How robust is this speedup to noise on the…

Two main obstacles for observing quantum advantage in noisy intermediate-scale quantum computers (NISQ) are the finite precision effects due to control errors, or disorders, and decoherence effects due to thermal fluctuations. It has been…

The entanglement dynamics of arrays of qubits is analysed in the presence of some general sources of noise and disorder. In particular, we consider linear chains of Josephson qubits in experimentally realistic conditions. Electromagnetic…

This work shows that minimizing the depth of a quantum circuit composed of commuting operations reduces to a vertex coloring problem on an appropriately constructed graph, where gates correspond to vertices and edges encode…

Neutral atom arrays provide a versatile platform to implement coherent quantum annealing as an approach to solving hard combinatorial optimization problems. Here we present and experimentally demonstrate an efficient encoding scheme based…

We propose a novel protocol for quantum illumination: a quantum-enhanced noise radar. A two-mode squeezed state, which exhibits continuous-variable entanglement between so-called signal and idler beams, is used as input to the radar system.…

The \emph{Square Colouring} of a graph $G$ refers to colouring of vertices of a graph such that any two distinct vertices which are at distance at most two receive different colours. In this paper, we initiate the study of a related…

Quantum metrology overcomes standard precision limits and plays a central role in science and technology. Practically it is vulnerable to imperfections such as decoherence. Here, we demonstrate quantum metrology for noisy channels such that…

In this paper, we initiate the study of quantum algorithms in the Graph Drawing research area. We focus on two foundational drawing standards: 2-level drawings and book layouts. Concerning $2$-level drawings, we consider the problems of…

Transport phenomena on a quantum scale appear in a variety of systems, ranging from photosynthetic complexes to engineered quantum devices. It has been predicted that the efficiency of quantum transport can be enhanced through dynamic…

Disorder masks much of the rich physics in two-dimensional electronic systems, with charged impurities often the limiting factor. In graphene, progress in reducing disorder has largely stagnated since boron nitride encapsulation was…

Symmetries are a key tool in understanding quantum systems, and, among many other things, can be exploited to increase the efficiency of numerical simulations of quantum dynamics. Disordered systems usually feature reduced symmetries and…

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…

Anomaly detection in complex domains poses significant challenges due to the need for extensive labeled data and the inherently imbalanced nature of anomalous versus benign samples. Graph-based machine learning models have emerged as a…

A method to suppress noise, which is one of the major obstacles to obtain an optimal solution in quantum annealers, is proposed. We generalize the conventionally used Hamiltonian, i.e., the transverse field Hamiltonian, by introducing an…

While quantum computing proposes promising solutions to computational problems not accessible with classical approaches, due to current hardware constraints, most quantum algorithms are not yet capable of computing systems of practical…

Quantum computing (QC) promises theoretical advantages, benefiting computational problems that would not be efficiently classically simulatable. However, much of this theoretical speedup depends on the quantum circuit design solving the…