Related papers: SAT Strikes Back: Parameter and Path Relations in …

We develop and implement automated methods for optimizing quantum circuits of the size and type expected in quantum computations that outperform classical computers. We show how to handle continuous gate parameters and report a collection…

With the increasing rise of publicly available high level quantum computing languages, the field of Quantum Computing has reached an important milestone of separation of software from hardware. Consequently, the study of Quantum Algorithms…

Quantum circuit synthesis is the task of decomposing a given quantum operator into a sequence of elementary quantum gates. Since the finite target gate set cannot exactly implement any given operator, approximation is often necessary. Model…

Quantum performance simulators can provide practical metrics for the effectiveness of executing theoretical quantum information processing protocols on physical hardware. In this work we present a scheme to simulate the performance of fault…

Quantum dots must be tuned precisely to provide a suitable basis for quantum computation. A scalable platform for quantum computing can only be achieved by fully automating the tuning process. One crucial step is to trap the appropriate…

Many search-based quantum algorithms that achieve a theoretical speedup are not practically relevant since they require extraordinarily long coherence times, or lack the parallelizability of their classical counterparts.This raises the…

Precise nanofabrication represents a critical challenge to developing semiconductor quantum-dot qubits for practical quantum computation. Here, we design and train a convolutional neural network to interpret in-line scanning electron…

Current quantum devices execute specific tasks that are hard for classical computers and have the potential to solve problems such as quantum simulation of material science and chemistry, even without error correction. For practical…

Quantum computing is rapidly emerging as a new computing paradigm with the potential to improve decision-making, optimization, and simulation across industries. For industrial engineering (IE) and operations research (OR), this shift…

Practically relevant problems of quadratic optimization often contain multidimensional arrays of variables interconnected by linear constraints, such as equalities and inequalities. The values of each variable depend on its specific meaning…

Quantum optimization holds promise for addressing classically intractable combinatorial problems, yet a standardized framework for benchmarking its performance, particularly in terms of solution quality, computational speed, and scalability…

Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivalently, the problem is to decide whether a particular type of…

Path-following algorithms are frequently used in composite optimization problems where a series of subproblems, with varying regularization hyperparameters, are solved sequentially. By reusing the previous solutions as initialization,…

We describe an approach for characterizing the process of quantum gates using quantum process tomography, by first modeling them in an extended Hilbert space, which includes non-qubit degrees of freedom. To prevent unphysical processes from…

While there are various approaches to benchmark physical processors, recent findings have focused on computational phase transitions. This is due to several factors. Importantly, the hardest instances appear to be well-concentrated in a…

Going as far as possible at SAT problem solving is the main aim of our work. For this sake we have made use of quantum computing from its two, on practice, main models of computation. They have required some reformulations over the former…

Quantum mechanics owes much of its extraordinary success to a Hilbertian program of mathematical formalization. Yet, the formalism remains poorly aligned with the practical limitations of computations in finite dimensions and under finite…

Quantum computing has made tremendous improvements in both software and hardware that have sparked interest in academia and industry to realize quantum computing applications. To this end, several steps are necessary: The underlying problem…

We elucidate physical aspects of path signatures by formulating randomised path developments within the framework of matrix models in quantum field theory. Using tools from physics, we introduce a new family of randomised path developments…

Calculating bounds of properties of many-body quantum systems is of paramount importance, since they guide our understanding of emergent quantum phenomena and complement the insights obtained from estimation methods. Recent semidefinite…