Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing
We construct a nearest-neighbor interaction whose ground states encode the solutions to the NP-complete problem “independent set” for cubic planar graphs. The important difference to previously used Hamiltonians in adiabatic quantum computing is that ...
Visualization of the Quantum Fourier Transform Using a Quantum Computer Simulator
The quantum Fourier transform (QFT) is a key subroutine of quantum algorithms for factoring and simulation and is the heart of the hidden-subgroup problem, the solution of which is expected to lead to the development of new quantum algorithms. The QFT ...
An Explicit Universal Gate-Set for Exchange-Only Quantum Computation
A single physical interaction might not be universal for quantum computation in general. It has been shown, however, that in some cases it can achieve universal quantum computation over a subspace. For example, by encoding logical qubits into arrays of ...
