• Corpus ID: 119310437

Reducing multi-qubit interactions in adiabatic quantum computation without adding auxiliary qubits. Part 2: The"split-reduc"method and its application to quantum determination of Ramsey numbers

@inproceedings{Okada2015ReducingMI,
  title={Reducing multi-qubit interactions in adiabatic quantum computation without adding auxiliary qubits. Part 2: The"split-reduc"method and its application to quantum determination of Ramsey numbers},
  author={Emile Okada and Richard Tanburn and Nikesh S. Dattani},
  year={2015}
}
Quantum annealing has recently been used to determine the Ramsey numbers R(m,2) for 4 ≤ m ≤ 8 and R(3,3) [Bian et al. (2013) PRL 111, 130505]. This was greatly celebrated as the largest experimental implementation of an adiabatic evolution algorithm to that date. However, in that computation, more than 66% of the qubits used were auxiliary qubits, so the sizes of the Ramsey number Hamiltonians used were tremendously smaller than the full 128-qubit capacity of the device used. The reason these… 

Figures and Tables from this paper

Minimizing minor embedding energy: an application in quantum annealing
TLDR
This work confirms experimentally that the ground-state probability is maximised when the minor embedding energy is minimised, and develops an analytical lower bound on $|F|$ which satisfies this constraint and is a tighter bound than that previously derived by Choi.
Quadratization in discrete optimization and quantum mechanics
TLDR
This book explores quadratizations for pseudo-Boolean optimization, perturbative gadgets used in QMA completeness theorems, and also non-perturbative k-local to 2-local transformations used for quantum mechanics, quantum annealing and universal adiabatic quantum computing.
Prime factorization algorithm based on parameter optimization of Ising model
This paper provides a new (second) way, which is completely different from Shor’s algorithm, to show the optimistic potential of a D-Wave quantum computer for deciphering RSA and successfully
General Hamiltonian Representation of ML Detection Relying on the Quantum Approximate Optimization Algorithm
TLDR
The maximum likelihood (ML) detection problem for general constellations is solved by appropriately adapting the QAOA, which gives rise to a new paradigm in communication systems.
Factoring on a quantum annealing computer
TLDR
The goal is to be able to factor all positive integers N < 1,000 on a D-Wave 2000 qubit processor by minimizing (N - (pxq))^2 by using one routine that calls the interface software dw.
Factoring semi-primes with (quantum) SAT-solvers
TLDR
This paper finds no evidence that this is a viable path toward factoring large numbers, even for scalable fault-tolerant quantum computers, as well as for various quantum annealing or other special purpose quantum hardware.
Quantum annealing for systems of polynomial equations
TLDR
An iterative annealing process is defined and its efficacy in solving a linear system to a tolerance of 10−8 is demonstrated, and the scaling behavior for general systems of linear equations with respect to problem size, condition number, and search precision is discussed.
Embedding quadratization gadgets on Chimera and Pegasus graphs
TLDR
All known quadratizations of cubic and quartic terms in binary optimization problems are grouped into six and seven unique graphs respectively and a minor embedding of these graphs is performed onto the well-known Chimera graph, and the brand new Pegasus graph.

References

SHOWING 1-10 OF 10 REFERENCES
Discrete Applied Mathematics
TLDR
Significant progress has been made with solution of location problems and in preprocessing and decomposition for discrete optimization and on the application of techniques from combinational optimization to nonlinear problems.
Physical Review Letters 111
  • 130505
  • 2013
and N
  • S. Dattani, Physical Review A (in preparation)
  • 2015
and N
  • Dattani, Physical Review A (submitted)
  • 2015
Physical Review Letters 108
  • 130501
  • 2012
and J
  • A. Bilmes, in Advances in Neural Information Processing Systems
  • 2011
Physical Review Letters 108
  • 010501
  • 2012
Mathematical Programming 118
  • 237
  • 2007
North-Holland Mathematics Studies
  • North-Holland Mathematics Studies, Vol. 59
  • 1981
Science 345
  • 420
  • 2014