Discriminating Non-Isomorphic Graphs with an Experimental Quantum Annealer
Preprint
Abstract
We demonstrate experimentally the ability of a quantum annealer to distinguish between sets of non-isomorphic graphs that share the same classical Ising spectrum. Utilizing the pause-and-quench features recently introduced into D-Wave quantum annealing processors, which allow the user to probe the quantum Hamiltonian realized in the middle of an anneal, we show that obtaining thermal averages of diagonal observables of classically indistinguishable non-isomorphic graphs encoded into transverse-field Ising Hamiltonians enable their discrimination. We discuss the significance of our results in the context of the graph isomorphism problem.Keywords
All Related Versions
This publication has 31 references indexed in Scilit:
- Reverse quantum annealing approach to portfolio optimization problemsQuantum Machine Intelligence, 2019
- Observation of topological phenomena in a programmable lattice of 1,800 qubitsNature, 2018
- Unraveling Quantum Annealers using Classical HardnessScientific Reports, 2015
- Hearing the Shape of the Ising Model with a Programmable Superconducting-Flux AnnealerScientific Reports, 2014
- Evidence for quantum annealing with more than one hundred qubitsNature Physics, 2014
- Experimental signature of programmable quantum annealingNature Communications, 2013
- Quantum annealing with manufactured spinsNature, 2011
- The bivariate Ising polynomial of a graphDiscrete Applied Mathematics, 2009
- Minor-embedding in adiabatic quantum computation: I. The parameter setting problemQuantum Information Processing, 2008
- The Graph Isomorphism Problem1993