Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Dickson, Neil G."'
An approximate diagonalization method is proposed that combines exact diagonalization and perturbation expansion to calculate low energy eigenvalues and eigenfunctions of a Hamiltonian. The method involves deriving an effective Hamiltonian for each e
Externí odkaz:
http://arxiv.org/abs/1202.2817
Autor:
Dickson, Neil G., Amin, Mohammad H.
It is believed that the presence of anticrossings with exponentially small gaps between the lowest two energy levels of the system Hamiltonian, can render adiabatic quantum optimization inefficient. Here, we present a simple adiabatic quantum algorit
Externí odkaz:
http://arxiv.org/abs/1108.3303
Autor:
Dickson, Neil G.
Publikováno v:
2011 New J. Phys. 13 073011
It was recently shown that, for solving NP-complete problems, adiabatic paths always exist without finite-order perturbative crossings between local and global minima, which could lead to anticrossings with exponentially small energy gaps if present.
Externí odkaz:
http://arxiv.org/abs/1104.2349
Most realistic solid state devices considered as qubits are not true two-state systems but multi-level systems. They can approximately be considered as qubits only if the energy separation of the upper energy levels from the lowest two is very large.
Externí odkaz:
http://arxiv.org/abs/1103.1904
Autor:
Dickson, Neil G., Amin, M. H. S.
It has been recently argued that adiabatic quantum optimization would fail in solving NP-complete problems because of the occurrence of exponentially small gaps due to crossing of local minima of the final Hamiltonian with its global minimum near the
Externí odkaz:
http://arxiv.org/abs/1010.0669
Autor:
Karimi, Kamran, Dickson, Neil G., Hamze, Firas, Amin, M. H. S., Drew-Brook, Marshall, Chudak, Fabian A., Bunyk, Paul I., Macready, William G., Rose, Geordie
Adiabatic quantum optimization offers a new method for solving hard optimization problems. In this paper we calculate median adiabatic times (in seconds) determined by the minimum gap during the adiabatic quantum optimization for an NP-hard Ising spi
Externí odkaz:
http://arxiv.org/abs/1006.4147
CUDA and OpenCL are two different frameworks for GPU programming. OpenCL is an open standard that can be used to program CPUs, GPUs, and other devices from different vendors, while CUDA is specific to NVIDIA GPUs. Although OpenCL promises a portable
Externí odkaz:
http://arxiv.org/abs/1005.2581
This paper presents two conceptually simple methods for parallelizing a Parallel Tempering Monte Carlo simulation in a distributed volunteer computing context, where computers belonging to the general public are used. The first method uses convention
Externí odkaz:
http://arxiv.org/abs/1004.0023
Much of the current focus in high-performance computing is on multi-threading, multi-computing, and graphics processing unit (GPU) computing. However, vectorization and non-parallel optimization techniques, which can often be employed additionally, a
Externí odkaz:
http://arxiv.org/abs/1004.0024
Autor:
Dickson, Neil G.
The problem of space-optimal jump encoding in the x86 instruction set, also known as branch displacement optimization, is described, and a linear-time algorithm is given that uses no complicated data structures, no recursion, and no randomization. Th
Externí odkaz:
http://arxiv.org/abs/0812.4973