Related papers: Frustration-Enhanced Quantum Annealing Correction …
Quantum computing allows for the manipulation of highly correlated states whose properties quickly go beyond the capacity of any classical method to calculate. Thus one natural problem which could lend itself to quantum advantage is the…
Quantum annealing is a proposed combinatorial optimization technique meant to exploit quantum mechanical effects such as tunneling and entanglement. Real-world quantum annealing-based solvers require a combination of annealing and classical…
Quantum circuits implementing fault-tolerant quantum error correction (QEC) for the three qubit bit-flip code and five-qubit code are studied. To describe the effect of noise, we apply a model based on a generalized effective Hamiltonian…
Recently, an unconditional advantage has been demonstrated for the process of charging of a quantum battery in a collisional model. Motivated by the question of whether such an advantage could be observed experimentally, we consider a model…
We assess the prospects for algorithms within the general framework of quantum annealing (QA) to achieve a quantum speedup relative to classical state of the art methods in combinatorial optimization and related sampling tasks. We argue for…
We investigate obtaining intermediate quantum states during the quantum annealing process to address the limitation of the linear weighted sum method in multi-objective optimization, which inherently fails to reach non-convex regions of the…
Data scarcity remains a central challenge in materials discovery, where finding meaningful descriptors and tuning models for generalization is critical but inherently a discrete optimization problem prone to multiple local minima…
Quantum Tunneling is ubiquitous across different fields, from quantum chemical reactions, and magnetic materials to quantum simulators and quantum computers. While simulating the real-time quantum dynamics of tunneling is infeasible for…
Recent theoretical and experimental studies have suggested that quantum Monte Carlo (QMC) simulation can behave similarly to quantum annealing (QA). The theoretical analysis was based on calculating transition rates between local minima, in…
We propose and compare Constraint Programming (CP) and Quantum Annealing (QA) approaches for rolling stock assignment optimisation considering necessary maintenance tasks. In the CP approach, we model the problem with an Alldifferent…
Ising spin Hamiltonians are often used to encode a computational problem in their ground states. Quantum Annealing (QA) computing searches for such a state by implementing a slow time-dependent evolution from an easy-to-prepare initial…
Quantum annealing aims to provide a faster method for finding the minima of complicated functions, compared to classical computing, so there is an increasing interest in the relaxation dynamics of quantum spin systems. Moreover, it is known…
This article addresses the development of quantum communication methods in the context of emerging quantum computing threats and emphasizes the importance of key reconciliation in quantum communication systems. The study focuses on the…
The sensitivity afforded by quantum sensors is limited by decoherence. Quantum error correction (QEC) can enhance sensitivity by suppressing decoherence, but it has a side-effect: it biases a sensor's output in realistic settings. If…
Incorporating protection against quantum errors into adiabatic quantum computing (AQC) is an important task due to the inevitable presence of decoherence. Here we investigate an error-protected encoding of the AQC Hamiltonian, where qubit…
The quantum phase transitions provide a paradigm for studying collective quantum phenomena that are a result of competing non-commuting interactions. This paper will study the ground state properties and quantum critical dynamics of the…
In this review, after providing the basic physical concept behind quantum annealing (or adiabatic quantum computation), we present an overview of some recent theoretical as well as experimental developments pointing to the issues which are…
We report the first results for the computation of relativistic effects in quantum many-body systems using quantum annealers. An average accuracy of 98.9% in the fine structure splitting of boron-like ions with respect to experiments has…
To gain better insight into the complexity theory of quantum annealing, we propose and solve a class of spin systems which contain bottlenecks of the kind expected to dominate the runtime of quantum annealing as it tries to solve difficult…
Quantum annealers (QAs) are specialized quantum computers that minimize objective functions over discrete variables by physically exploiting quantum effects. Current QA platforms allow for the optimization of quadratic objectives defined…