Fetching the paper…
Reading the bibliography…
In this paper I propose a new method of encoding discrete variables into Ising model qubits for quantum optimization.
x y xy -mixers: analytical and numerical results for qaoa, 2019
Zhihui Wang, Nicholas C. Rubin, Jason M. Dominy, and Eleanor G. Rieffel · 1904
Earlier work this paper cites.
On random graphs
Paul Erdös and Alfréd Rényi · 1959
Earlier work this paper cites.
On the evolution of random graphs
Paul Erdös and Alfréd Rényi · 1960
Earlier work this paper cites.
Uniqueness of colorability and colorability of planar 4-regular graphs are np-complete
David P. Dailey · 1980
Earlier work this paper cites.
Improved approximation algorithms for maxk-cut and max bisection
A. Frieze and M. Jerrum · 1997
Earlier work this paper cites.
Climbing mount scalable: Physical resource requirements for a scalable quantum computer
Robin Blume-Kohout, Carlton M. Caves, and Ivan H. Deutsch · 2002
Earlier work this paper cites.
Python language reference manual
Guido Van Rossum and Fred L Drake · 2003
Earlier work this paper cites.
Graph colouring problems and their applications in scheduling
Dàniel Marx · 2004
Earlier work this paper cites.
Spatial search by quantum walk
Andrew Childs and Jeffrey Goldstone · 2004
Earlier work this paper cites.
Mediated tunable coupling of flux qubits
Alec Maassen van den Brink, A. J. Berkley, and M. Yalowsky · 2005
Earlier work this paper cites.
A guide to NumPy
Travis E Oliphant · 2006
Earlier work this paper cites.
Automated generation of layout and control for quantum circuits
Mark Whitney, Nemanja Isailovic, Yatish Patel, and John Kubiatowicz · 2007
Earlier work this paper cites.
Optimal inapproximability results for max-cut and other 2-variable csps?
Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O’Donnell · 2007
Earlier work this paper cites.
IPython: a system for interactive scientific computing
Fernando Pérez and Brian E Granger · 2007
Earlier work this paper cites.
Matplotlib: A 2d graphics environment
John D Hunter · 2007
Earlier work this paper cites.
Minor-embedding in adiabatic quantum computation: I. the parameter setting problem
Vicky Choi · 2008
Earlier work this paper cites.
How to make the quantum adiabatic algorithm fail
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Daniel Nagaj · 2008
Earlier work this paper cites.
Complexity analysis of a decentralised graph colouring algorithm
K.R. Duffy, N. O’Connell, and A. Sapozhnikov · 2008
Earlier work this paper cites.
Vicky Choi · 2010
Earlier work this paper cites.
Different adiabatic quantum optimization algorithms for the np-complete exact cover and 3SAT problems
Vicky Choi · 2011
Earlier work this paper cites.
Quantum annealing of the graph coloring problem
Olawale Titiloye and Alan Crispin · 2011
Earlier work this paper cites.
Graph coloring with a distributed hybrid quantum annealing algorithm
Olawale Titiloye and Alan Crispin · 2011
Earlier work this paper cites.
Minor-embedding in adiabatic quantum computation: II. minor-universal graph design
Vicky Choi · 2011
Earlier work this paper cites.
Quantum annealing with manufactured spins
M. W. Johnson, M. H. S. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, E. M. Chapple, C. Enderud, J. P. Hilton, K. Karimi, E. Ladizinsky, N. Ladizinsky, T. Oh, I. Perminov, C. Rich, M. C. Thom, E. Tolkacheva, C. J. S. Truncik, S. Uchaikin, J. Wang, and B. Wilsonand G. Rose · 2011
Earlier work this paper cites.
Finding low-energy conformations of lattice protein models by quantum annealing
Alejandro Perdomo-Ortiz, Neil Dickson, Marshall Drew-Brook, Geordie Rose, and Alan Aspuru-Guzik · 2012
Cited alongside, same era.
Quantum annealing algorithm for vehicle scheduling
A. Crispin and A. Syrichas · 2013
Cited alongside, same era.
A quantum approximate optimization algorithm
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Cited alongside, same era.
A quantum approximate optimization algorithm applied to a bounded occurrence constraint problem
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Cited alongside, same era.
Discrete optimization using quantum annealing on sparse Ising models
Z. Bian et al · 2014
Cited alongside, same era.
Forecasting financial crashes with quantum computing
Roman Orus, Samuel Mugel, and Enrique Lizaso · 2018
Later among the works it cites.
Reverse quantum annealing approach to portfolio optimization problems
Davide Venturelli and Alexei Kondratyev · 2018
Later among the works it cites.
Flight gate assignment with a quantum annealer
Tobias Stollenwerk, Elisabeth Lobe, and Martin Jung · 2018
Later among the works it cites.
Introduction to Electricity, Magnetism, and Circuits
Daryl Janzen · 2018
Later among the works it cites.
A quantum walk assisted approximate algorithm for bounded np optimisation problems
Samuel Marsh and Jingbo Wang · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Davide Venturelli, Dominic J. J. Marchand, and Galo Rojo · 2015
Cited alongside, same era.
A quantum annealing architecture with all-to-all connectivity from local interactions
Wolfgang Lechner, Philipp Hauke, and Peter Zoller · 2015
Cited alongside, same era.
Portfolio Optimization: Applications in Quantum Computing
Michael Marzec · 2016
Cited alongside, same era.
A direct mapping of Max k-SAT and high order parity checks to a chimera graph
N. Chancellor, S. Zohren, P. A. Warburton, S. Benjamin, and S. Roberts · 2016
Cited alongside, same era.
A hybrid quantum-classical approach to solving scheduling problems
Tony T. Tran, Minh N. Do, Eleanor G. Rieffel, Jeremy Frank, Zhihui Wang, Bryan O’Gorman, Davide Venturelli, and J. Christopher Beck · 2016
Cited alongside, same era.
Maximum–entropy inference with a programmable annealer
N. Chancellor, S. Szoke, W. Vinci, G. Aeppli, and P. A. Warburton · 2016
Cited alongside, same era.
Stabilisers as a design tool for new forms of Lechner-Hauke-Zoller annealer
Andrea Rocchetto, Simon C. Benjamin, and Ying Li · 2016
Cited alongside, same era.
Later among the works it cites.
Protecting quantum memories using coherent parity check codes
Joschka Roffe, David Headley, Nicholas Chancellor, Dominic Horsman, and Viv Kendon · 2018
Later among the works it cites.
A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
Alastair A. Abbott, Cristian S. Calude, Michael J. Dinneen, and Richard Hua · 2018
Later among the works it cites.
http://tikzit.github.io/ , 2013
Tikzit · 2018
Later among the works it cites.
D-wave systems inc. website
D-Wave · 2019
Closest in time.
Quantum annealing applied to de-conflicting optimal trajectories for air traffic management
T. Stollenwerk, B. O’Gorman, D. Venturelli, S. Mandrà, O. Rodionova, H. Ng, B. Sridhar, E. G. Rieffel, and R. Biswas · 2019
Closest in time.
From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
Stuart Hadfield, Zhihui Wang, Bryan O’Gorman, Eleanor G. Rieffel, Davide Venturelli, and Rupak Biswas · 2019
Closest in time.
Next-generation topology of d-wave quantum processors
Kelly Boothby, Paul Bunyk, Jack Raymond, and Aidan Roy · 2019
Closest in time.
Pegasus: The second connectivity graph for large-scale quantum annealing hardware
Nike Dattani, Szilard Szalay, and Nick Chancellor · 2019
Closest in time.
https://github.com/dwavesystems/dwave_networkx , 2018
D-wave networkx · 2019
Closest in time.
Demonstration of sign and magnitude tunable transverse field in a superconducting flux qubit with microwave dressing
Chunqing Deng · 2019
Closest in time.
Demonstration of nonstoquastic hamiltonian in coupled superconducting flux qubits
I. Ozfidan, C. Deng, A. Y. Smirnov, T. Lanting, R. Harris, L. Swenson, J. Whittaker, F. Altomare, M. Babcock, C. Baron, A. J. Berkley, K. Boothby, H. Christiani, P. Bunyk, C. Enderud, B. Evert, M. Hager, A. Hajda, J. Hilton, S. Huang, E. Hoskinson, M. W. Johnson, K. Jooya, E. Ladizinsky, N. Ladizinsky, R. Li, A. MacDonald, D. Marsden, G. Marsden, T. Medina, R. Molavi, R. Neufeld, M. Nissen, M. Norouzpour, T. Oh, I. Pavlov, I. Perminov, G. Poulin-Lamarre, M. Reis, T. Prescott, C. Rich, Y. Sato, G. Sterling, N. Tsai, M. Volkmann, W. Wilkinson, J. Yao, and M. H. Amin · 2019
Closest in time.
Continuous time hybrid quantum computing
Nicholas Chancellor · 2019
Closest in time.
Finding spin-glass ground states using quantum walks, 2019
Adam Callison, Nicholas Chancellor, Florian Mintert, and Viv Kendon · 2019
Closest in time.
https://www.dwavesys.com/sites/default/files/14-1020A-A_Virtual_Graphs_for_High_Performance_Embedded_Topologies.pdf , 2019
Virtual graphs for high-performance embedded topologies · 2019
Closest in time.
Alexander Cowtan, Silas Dilkes, Ross Duncan, Alexandre Krajenbrink, Will Simmons, and Seyon Sivarajah · 2019
Closest in time.
https://github.com/dwavesystems/minorminer , 2018
minorminer · 2019
Closest in time.
Improving solutions by embedding larger subproblems in a d-wave quantum annealer
Shuntaro Okada, Masayuki Ohzeki, Masayoshi Terabe, and Shinichiro Taguchi · 2019
Closest in time.
Trading off roubstness and opitmality using reverse annealing, 2019
Nicholas Chancellor · 2019
Closest in time.
https://www.dwavesys.com/sites/default/files/14-1018A-A_Reverse_Quantum_Annealing_for_Local_Refinement_of_Solutions.pdf , 2019
Reverse quantum annealing for local refinement of solutions · 2019
Closest in time.