Related papers: Disorder-assisted graph coloring on quantum anneal…
Quantum annealing aims to solve combinatorial optimization problems mapped on to Ising interactions between quantum spins. A critical factor that limits the success of a quantum annealer is its sensitivity to noise, and intensive research…
We report a linear-scaling numerical method for exploring nonequilibrium electron dynamics in systems of arbitrary complexity. Based on the Chebyshev expansion of the time evolution of the single-particle density matrix, the method gives…
We show a significant reduction of errors for an architecture of quantum annealers (QA) where bosonic modes mediate the interaction between qubits. These systems have a large redundancy in the subspace of solutions, supported by arbitrarily…
Scalable quantum computing and communication requires the protection of quantum information from the detrimental effects of decoherence and noise. Previous work tackling this problem has relied on the original circuit model for quantum…
This article aims to study the linear and nonlinear optical response of inversion symmetric graphene quantum dots (GQDs) in the presence of on-site disorder or vacancies. The presence of disorder or vacancy breaks the special inversion…
We report on a case study in programming an early quantum annealer to attack optimization problems related to operational planning. While a number of studies have looked at the performance of quantum annealers on problems native to their…
Graph partitioning is a fundamental combinatorial optimization problem that attracts a lot of attention from theoreticians and practitioners due to its broad applications. From multilevel graph partitioning to more general-purpose…
Traditional simulated annealing utilizes thermal fluctuations for convergence in optimization problems. Quantum tunneling provides a different mechanism for moving between states, with the potential for reduced time scales. We compare…
The design of a good algorithm to solve NP-hard combinatorial approximation problems requires specific domain knowledge about the problems and often needs a trial-and-error problem solving approach. Graph coloring is one of the essential…
We propose a scheme to distribute graph states over quantum networks in the presence of noise in the channels and in the operations. The protocol can be implemented efficiently for large graph sates of arbitrary (complex) topology. We…
Quantum annealing is a heuristic algorithm that solves combinatorial optimization problems, and D-Wave Systems Inc. has developed hardware implementation of this algorithm. However, in general, we cannot embed all the logical variables of a…
Quantum annealing, as currently implemented in hardware, cannot fairly sample all ground states. Graph minor embedding, which maps a problem to the hardware graph of quantum annealers, affects sampling all states. In this study, we…
We demonstrate that a quantum annealer can be used to solve the NP-complete problem of graph partitioning into subgraphs containing Hamiltonian cycles of constrained length. We present a method to find a partition of a given directed graph…
Liquid-state NMR quantum computer has demonstrated the possibility of quantum computation and supported its development. Using NMR quantum computer techniques, we observed phase decoherence under two kinds of artificial noise fields; one a…
We investigate the disorder-driven phase transition from a fractional quantum Hall state to an Anderson insulator using quantum entanglement methods. We find that the transition is signaled by a sharp increase in the sensitivity of a…
Quantum Annealing (QA) is a quantum computing paradigm for solving combinatorial optimization problems formulated as Quadratic Unconstrained Binary Optimization (QUBO) problems. An essential step in QA is minor embedding, which maps the…
Prior work showed the efficacy of pausing midanneal: such a pause improved the probability of success by orders of magnitude in a class of native problem instances and improved the time to solution in a class of embedded problem instances.…
We introduce and explore a family of vertex-coloring problems which, surprisingly enough, have not been considered before despite stemming from the problem of Wi-Fi channel assignment. Given a spectrum of colors, endowed with a matrix of…
In alloys exhibiting substitutional disorder, the variety of atomic environments manifests itself as a `disorder broadening' in their core level binding energy spectra. Disorder broadening can be measured experimentally, and in principle…
Disorder in condensed matter and atomic physics is responsible for a great variety of fascinating quantum phenomena, which are still challenging for understanding, not to mention the relevant dynamical control. Here we introduce proof of…