Quantum annealing is a promising approach to heuristically solving difficult combinatorial optimization problems. However, the connectivity limitations in current devices lead to an exponential degradation of performance on general problems. We propose an architecture for a quantum annealer that achieves full connectivity and full programmability while using a number of physical resources only linear in the number of spins. We do so by application of carefully engineered periodic modulations of oscillator-based qubits, resulting in a Floquet Hamiltonian in which all the interactions are tunable. This flexibility comes at the cost of the coupling strengths between qubits being smaller than they would be compared with direct coupling, which increases the demand on coherence times with increasing problem size. We analyze a specific hardware proposal of our architecture based on Josephson parametric oscillators. Our results show how the minimum-coherence-time requirements imposed by our scheme scale, and we find that the requirements are not prohibitive for fully connected problems with up to at least 1000 spins. Our approach could also have impact beyond quantum annealing, since it readily extends to bosonic quantum simulators, and would allow the study of models with arbitrary connectivity between lattice sites.

量子退火是一种有启发性的方法，可以启发式地解决组合优化难题。但是，当前设备的连接限制导致一般问题上性能的指数下降。我们提出了一种量子退火炉的体系结构，该体系结构可实现完全的连接性和完全的可编程性，同时使用许多自旋数线性的物理资源。我们通过应用精心设计的基于振荡器的量子位的周期性调制来实现，从而产生了所有相互作用都是可调的Floquet哈密顿量。这种灵活性的代价是，量子位之间的耦合强度要小于直接耦合所要比的强度，这就增加了对相干时间的需求，并增加了问题的大小。我们基于Josephson参数振荡器分析了我们架构的特定硬件建议。我们的结果表明了我们的方案规模对最小相干时间的要求是如何确定的，并且我们发现，对于至少有1000次旋转的完全连接的问题，这些要求并不是禁止性的。我们的方法还可能会超出量子退火的影响，因为它很容易扩展到Bosonic量子仿真器，并将允许研究晶格位置之间具有任意连通性的模型。