Paper

Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor

Boixo, Sergio, Quintana, Chris, Gidney, Craig, Megrant, Anthony, Yao, Z Jamie, Vainsencher, Amit, Buell, David A, Ho, Alan, Smelyanskiy, Vadim, Eppens, Daniel, Graff, Rob, Niu, Murphy Yuezhen, Mutus, Josh, Collins, Roberto, Lindmark, Mike, Sung, Kevin J, Martinis, John M, McEwen, Matt, Zalcman, Adam, Kelly, Julian, O'Brien, Thomas E, Xiao Mi, Sank, Daniel, White, Theodore, Neukart, Florian, Dunsworth, Andrew, Skolik, Andrea, Hong, Sabrina, Ryan Babbush, Harrigan, Matthew P, Arute, Frank, Zhou, Leo, Kafri, Dvir, Ostby, Eric, Farhi, Edward, O'Gorman, Bryan, Landhuis, David, Leib, Martin, Kostritsa, Fedor, Broughton, Michael, Streif, Michael, Fowler, Austin, Roushan, Pedram, Habegger, Steve, Huang, Trent, Putterman, Harald, Bacon, Dave, Atalaya, Juan, McClean, Jarrod R, Martin, Orion, Burkett, Brian, Arya, Kunal, Bardin, Joseph C, Lucero, Erik, Kim, Seon, Strain, Doug, Chiaro, Ben, Ioffe, L B, Isakov, Sergei V, Mruczkiewicz, Wojciech, Korotkov, Alexander N, Courtney, William, Petukhov, Andre, Yeh, Ping, Rubin, Nicholas C, Neven, Hartmut, Bushnell, Nicholas, Chen, Yu, Brooks Foxen, Giustina, Marissa, Demura, Sean, Klimov, Paul V

2021

Overview

We demonstrate the application of the Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems with the quantum approximate optimization algorithm (QAOA). Like past QAOA experiments, we study performance for problems defined on the (planar) connectivity graph of our hardware; however, we also apply the QAOA to the Sherrington-Kirkpatrick model and MaxCut, both high dimensional graph problems for which the QAOA requires significant compilation. Experimental scans of the QAOA energy landscape show good agreement with theory across even the largest instances studied (23 qubits) and we are able to perform variational optimization successfully. For problems defined on our hardware graph we obtain an approximation ratio that is independent of problem size and observe, for the first time, that performance increases with circuit depth. For problems requiring compilation, performance decreases with problem size but still provides an advantage over random guessing for circuits involving several thousand gates. This behavior highlights the challenge of using near-term quantum computers to optimize problems on graphs differing from hardware connectivity. As these graphs are more representative of real world instances, our results advocate for more emphasis on such problems in the developing tradition of using the QAOA as a holistic, device-level benchmark of quantum processors.

• Publisher: Cornell University Library, arXiv.org
• Subject: Algorithms / Circuits / Computer simulation / Hardware / Ising model / Microprocessors / Optimization / Quantum computers / Qubits (quantum computing) / Superconductivity