Quantum annealing has the potential to find low energy solutions of NP-hard problems that can be expressed as quadratic unconstrained binary optimization problems. However, the …
E Pelofske - arXiv preprint arXiv:2301.03009, 2023 - arxiv.org
Quantum annealing is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. Quantum …
We present\emph {Noise-Directed Adaptive Remapping}(NDAR), a heuristic meta-algorithm for approximately solving binary optimization problems by leveraging certain types of noise …
Quantum annealing is a novel type of analog computation that aims to use quantum- mechanical fluctuations to search for optimal solutions for Ising problems. Quantum …
Quantum annealers are specialized quantum computers for solving combinatorial optimization problems using special characteristics of quantum computing (QC), such as …
Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or quadratic …
We show strong positive spatial correlations in the qubits of a D-Wave 2000Q quantum annealing chip that are connected to qubits outside their own unit cell. By simulating the …
Recently, a Hamiltonian dynamics simulation was performed on a kicked ferromagnetic 2D transverse field Ising model with a connectivity graph native to the 127 qubit heavy-hex IBM …
With the advent of exascale computing, effective load balancing in massively parallel software applications is critically important for leveraging the full potential of high …