2018/02/04 by Wolfgang Lechner, Lechner, Wolfgang · 2 citations
Physics and Astronomy · #FOS: Physical sciences #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.1802.01157
arxiv created 2018/03/01 · arxiv updated 2018/03/02
The quantum approximate optimization algorithm (QAOA) has been introduced as a heuristic digital quantum computing scheme to find approximate solutions of combinatorial problems with shallow circuits. We present a scheme to parallelize this approach for arbitrary all-to-all connected problem graphs in a layout of quantum bits (qubits) with nearest neighbor interactions. The protocol consisting of single qubit operations that encode the optimization problem and all interactions are problem-independent pair-wise CNOT gates among nearest neighbors. This allows for a parallelizable implementation in quantum devices with a square lattice geometry. The basis of this proposal is a lattice gauge model which also introduces additional parameters and protocols for QAOA to improve the efficiency.