Automatically Translating Quantum Programs from a Subset of Common Gates to an Adiabatic Representation

@inproceedings{Regan2019AutomaticallyTQ,
  title={Automatically Translating Quantum Programs from a Subset of Common Gates to an Adiabatic Representation},
  author={Malcolm Regan and Brody Eastwood and Mahita Nagabhiru and Frank Mueller},
  booktitle={RC},
  year={2019}
}
Adiabatic computing with two degrees of freedom of 2-local Hamiltonians has been theoretically shown to be equivalent to the gate model of universal quantum computing. But today’s quantum annealers, namely D-Wave’s 2000Q platform, only provide a 2-local Ising Hamiltonian abstraction with a single degree of freedom. This raises the question what subset of gate programs can be expressed as quadratic unconstrained binary problems (QUBOs) on the D-Wave. The problem is of interest because gate-based… 

References

SHOWING 1-5 OF 5 REFERENCES

Adiabatic quantum computation is equivalent to standard quantum computation

The model of adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its exact computational power has been unknown, so this result implies that the adiABatic computation model and the standard quantum circuit model are polynomially equivalent.

Adiabatic Quantum Transistors

We describe a many-body quantum system that can be made to quantum compute by the adiabatic application of a large applied field to the system. Prior to the application of the field, quantum

Experimental signature of programmable quantum annealing.

This experiment uses groups of eight superconducting flux qubits with programmable spin-spin couplings, embedded on a commercially available chip with >100 functional qubits, and suggests that programmable quantum devices, scalable with currentsuperconducting technology, implement quantum annealing with a surprising robustness against noise and imperfections.

Open Quantum Assembly Language

OpenQASM represents universal physical circuits over the CNOT plus SU(2) basis with straight-line code that includes measurement, reset, fast feedback, and gate subroutines that is used to implement experiments with low depth quantum circuits.

Boosting integer factoring performance via quantum annealing offsets

  • Tech. rep.
  • 2016