Related papers: Bifurcation-based quantum annealing with nested sp…
We model quantum measurement of a two-level system $\mu$. Previous obstacles for understanding the measurement process are removed by basing the analysis of the interaction between $\mu$ and the measurement device on quantum field theory.…
We propose a mechanical qubit based on buckling nanobars--a NEMS so small as to be quantum coherent.To establish buckling nanobars as legitimate candidates for qubits, we calculate the effective buckling potential that produces the…
We revisit the evidence for quantum annealing in the D-Wave One device (DW1) based on the study of random Ising instances. Using the probability distributions of finding the ground states of such instances, previous work found agreement…
Bipartite entanglement in the ground state of a chain of $N$ quantum spins can be quantified either by computing pairwise concurrence or by dividing the chain into two complementary subsystems. In the latter case the smaller subsystem is…
Quantum state classification and entanglement quantification are of significant importance in the fundamental research of quantum information science and various quantum applications. Traditional methods, such as quantum state tomography,…
We solve a model that has basic features that are desired for quantum annealing computations: entanglement in the ground state, controllable annealing speed, ground state energy separated by a gap during the whole evolution, and a…
Quantifying entanglement is an important task by which the resourcefulness of a quantum state can be measured. Here, we develop a quantum algorithm that tests for and quantifies the separability of a general bipartite state by using the…
Entanglement of a quantum system depends upon relative phase in complicated ways, which no single measurement can reflect. Because of this, entanglement witnesses are necessarily limited in applicability and/or utility. We propose here a…
Quantum annealing has been demonstrated with superconducting qubits. Such a quantum annealer has been used to solve combinatorial optimization problems. Moreover, it serves as a quantum simulator for investigating the properties of quantum…
In the quest to reboot computing, quantum annealing (QA) is an interesting candidate for a new capability. While it has not demonstrated an advantage over classical computing on a real-world application, many important regions of the QA…
Quantum annealing is analogous to simulated annealing with a tunneling mechanism substituting for thermal activation. Its performance has been tested in numerical simulation with mixed conclusions. There is a class of optimization problems…
Modern quantum annealers can find high-quality solutions to combinatorial optimisation objectives given as quadratic unconstrained binary optimisation (QUBO) problems. Unfortunately, obtaining suitable QUBO forms in computer vision remains…
Recent developments in quantum annealing techniques have been indicating potential advantage of quantum annealing for solving NP-hard optimization problems. In this article we briefly indicate and discuss the beneficial features of quantum…
Exploiting quantum properties to outperform classical ways of information-processing is an outstanding goal of modern physics. A promising route is quantum simulation, which aims at implementing relevant and computationally hard problems in…
Quantum annealing processors typically control qubits in unison, attenuating quantum fluctuations uniformly until the applied system Hamiltonian is diagonal in the computational basis. This simplifies control requirements, allowing…
The Variational Quantum Algorithms (VQAs) are hybrid quantum-classical algorithms and they can be used in the Nosiy Intermadiate Scale Quantum (NISQ) devises. The Variational Quantum Eigensolver (VQE) was suggested as a first VQA. VQE is…
We consider a system of two spins that are coupled via an isotropic Heisenberg Hamiltonian. For the first time, a two-step method for the preparation of an arbitrary quantum state of two qubits in the form of the Schmidt decomposition is…
Quantum annealing (QA) is an algorithm to find the ground state of the problem Hamiltonian by using an adiabatic time evolution. An approach to evaluate adiabaticity in the experiment by applying spectroscopic techniques has recently been…
Quantum annealing is a general strategy for solving difficult optimization problems with the aid of quantum adiabatic evolution. Both analytical and numerical evidence suggests that under idealized, closed system conditions, quantum…
We develop a hybrid type of quantum annealing in which we control temperature and quantum field simultaneously. We study the efficiency of proposed quantum annealing and find a good schedule of changing thermal fluctuation and quantum…