Practical designs for permutation symmetric problem Hamiltonians on hypercubes
Abstract
We present a method to experimentally realize large-scale permutation-symmetric Hamiltonians for continuous-time quantum protocols such as quantum walk and adiabatic quantum computation. In particular, the method can be used to perform an encoded continuous-time quantum search on a hypercube graph with 2^n vertices encoded into 2n qubits. We provide details for a realistically achievable implementation in Rydberg atomic systems. Although the method is perturbative, the realization is always achieved at second order in perturbation theory, regardless of the size of the mapped system. This highly efficient mapping provides a natural set of problems which are tractable both numerically and analytically, thereby providing a powerful tool for benchmarking quantum hardware and experimentally investigating the physics of continuous-time quantum protocols.
Keywords
Cite
@article{arxiv.1812.07885,
title = {Practical designs for permutation symmetric problem Hamiltonians on hypercubes},
author = {Ben Dodds and Viv Kendon and Charles S. Adams and Nicholas Chancellor},
journal= {arXiv preprint arXiv:1812.07885},
year = {2019}
}
Comments
9 pages 4 figures, accepted by PRA, v2 matches accepted version