Matthew P Harrigan
Research Areas
Authored Publications
Sort By
Stable quantum-correlated many-body states through engineered dissipation
Sara Shabani
Dripto Debroy
Jerome Lloyd
Alexios Michailidis
Andrew Dunsworth
Bill Huggins
Markus Hoffmann
Alexis Morvan
Josh Cogan
Ben Curtin
Guifre Vidal
Bob Buckley
Tom O'Brien
John Mark Kreikebaum
Rajeev Acharya
Joonho Lee
Ningfeng Zhu
Shirin Montazeri
Sergei Isakov
Jamie Yao
Clarke Smith
Rebecca Potter
Sean Harrington
Jeremy Hilton
Paula Heu
Alexei Kitaev
Alex Crook
Fedor Kostritsa
Kim Ming Lau
Dmitry Abanin
Trent Huang
Aaron Shorter
Steve Habegger
Gina Bortoli
Charles Rocque
Vladimir Shvarts
Alfredo Torres
Anthony Megrant
Charles Neill
Michael Hamilton
Dar Gilboa
Lily Laws
Nicholas Bushnell
Ramis Movassagh
Mike Shearn
Wojtek Mruczkiewicz
Desmond Chik
Leonid Pryadko
Xiao Mi
Brooks Foxen
Frank Arute
Alejo Grajales Dau
Yaxing Zhang
Lara Faoro
Alexander Lill
JiunHow Ng
Justin Iveland
Marco Szalay
Orion Martin
Juhwan Yoo
Michael Newman
William Giang
Alex Opremcak
Amanda Mieszala
William Courtney
Andrey Klots
Wayne Liu
Pavel Laptev
Charina Chou
Paul Conner
Rolando Somma
Vadim Smelyanskiy
Benjamin Chiaro
Grayson Young
Tim Burger
ILYA Drozdov
Agustin Di Paolo
Jimmy Chen
Marika Kieferova
Michael Broughton
Negar Saei
Juan Atalaya
Markus Ansmann
Pavol Juhas
Murray Ich Nguyen
Yuri Lensky
Roberto Collins
Élie Genois
Jindra Skruzny
Igor Aleiner
Yu Chen
Reza Fatemi
Leon Brill
Ashley Huff
Doug Strain
Monica Hansen
Noah Shutty
Ebrahim Forati
Dave Landhuis
Kenny Lee
Ping Yeh
Kunal Arya
Henry Schurkus
Cheng Xing
Cody Jones
Edward Farhi
Raja Gosula
Andre Petukhov
Alexander Korotkov
Ani Nersisyan
Christopher Schuster
George Sterling
Kostyantyn Kechedzhi
Trond Andersen
Alexandre Bourassa
Kannan Sankaragomathi
Vinicius Ferreira
Science, 383 (2024), pp. 1332-1337
Preview abstract
Engineered dissipative reservoirs have the potential to steer many-body quantum systems toward correlated steady states useful for quantum simulation of high-temperature superconductivity or quantum magnetism. Using up to 49 superconducting qubits, we prepared low-energy states of the transverse-field Ising model through coupling to dissipative auxiliary qubits. In one dimension, we observed long-range quantum correlations and a ground-state fidelity of 0.86 for 18 qubits at the critical point. In two dimensions, we found mutual information that extends beyond nearest neighbors. Lastly, by coupling the system to auxiliaries emulating reservoirs with different chemical potentials, we explored transport in the quantum Heisenberg model. Our results establish engineered dissipation as a scalable alternative to unitary evolution for preparing entangled many-body states on noisy quantum processors.
View details
Expressing and Analyzing Quantum Algorithms with Qualtran
Anurudh Peduri
Charles Yuan
arXiv::2409.04643 (2024)
Preview abstract
Quantum computing's transition from theory to reality has spurred the need for novel software tools to manage the increasing complexity, sophistication, toil, and chance for error of quantum algorithm development. We present Qualtran, an open-source library for representing and analyzing quantum algorithms. Using carefully chosen abstractions and data structures, we can simulate and test algorithms, automatically generate information-rich diagrams, and tabulate resource requirements. Qualtran offers a \emph{standard library} of algorithmic building blocks that are essential for modern cost-minimizing compilations. Its capabilities are showcased through the re-analysis of key algorithms in Hamiltonian simulation, chemistry, and cryptography. The resulting architecture-independent resource counts can be forwarded to our implementation of cost models to estimate physical costs like wall-clock time and number of physical qubits assuming a surface-code architecture. Qualtran provides a foundation for explicit constructions and reproducible analysis, fostering greater collaboration within the quantum algorithm development community. We believe tools like Qualtran will accelerate progress in the field.
View details
Dynamics of magnetization at infinite temperature in a Heisenberg spin chain
Tomaž Prosen
Vedika Khemani
Rhine Samajdar
Jesse Hoke
Sarang Gopalakrishnan
Andrew Dunsworth
Bill Huggins
Markus Hoffmann
Alexis Morvan
Josh Cogan
Ben Curtin
Guifre Vidal
Bob Buckley
Tom O'Brien
John Mark Kreikebaum
Rajeev Acharya
Joonho Lee
Ningfeng Zhu
Shirin Montazeri
Sergei Isakov
Jamie Yao
Clarke Smith
Rebecca Potter
Sean Harrington
Jeremy Hilton
Paula Heu
Alexei Kitaev
Alex Crook
Fedor Kostritsa
Kim Ming Lau
Dmitry Abanin
Trent Huang
Aaron Shorter
Steve Habegger
Steven Martin
Gina Bortoli
Seun Omonije
Richard Ross Allen
Charles Rocque
Vladimir Shvarts
Alfredo Torres
Anthony Megrant
Charles Neill
Michael Hamilton
Dar Gilboa
Lily Laws
Nicholas Bushnell
Kyle Anderson
Ramis Movassagh
David Rhodes
Mike Shearn
Wojtek Mruczkiewicz
Desmond Chik
Leonid Pryadko
Xiao Mi
Brooks Foxen
Frank Arute
Alejo Grajales Dau
Yaxing Zhang
Lara Faoro
Alexander Lill
Gordon Hill
JiunHow Ng
Justin Iveland
Marco Szalay
Orion Martin
Juan Campero
Juhwan Yoo
Michael Newman
William Giang
Gonzalo Garcia
Alex Opremcak
Amanda Mieszala
William Courtney
Andrey Klots
Wayne Liu
Pavel Laptev
Paul Conner
Rolando Somma
Vadim Smelyanskiy
Benjamin Chiaro
Grayson Young
Tim Burger
ILYA Drozdov
Agustin Di Paolo
Jimmy Chen
Marika Kieferova
Hung-Shen Chang
Michael Broughton
Negar Saei
Juan Atalaya
Markus Ansmann
Pavol Juhas
Murray Ich Nguyen
Yuri Lensky
Roberto Collins
Élie Genois
Jindra Skruzny
Yu Chen
Reza Fatemi
Leon Brill
Seneca Meeks
Ashley Huff
Doug Strain
Monica Hansen
Noah Shutty
Ebrahim Forati
Doug Thor
Dave Landhuis
Kenny Lee
Ping Yeh
Kunal Arya
Henry Schurkus
Cheng Xing
Cody Jones
Edward Farhi
Vlad Sivak
Raja Gosula
Andre Petukhov
Clint Earle
Alexander Korotkov
Ani Nersisyan
Christopher Schuster
George Sterling
Trond Andersen
Alexandre Bourassa
Salvatore Mandra
Kannan Sankaragomathi
Vinicius Ferreira
Science, 384 (2024), pp. 48-53
Preview abstract
Understanding universal aspects of quantum dynamics is an unresolved problem in statistical mechanics. In particular, the spin dynamics of the one-dimensional Heisenberg model were conjectured as to belong to the Kardar-Parisi-Zhang (KPZ) universality class based on the scaling of the infinite-temperature spin-spin correlation function. In a chain of 46 superconducting qubits, we studied the probability distribution of the magnetization transferred across the chain’s center, P(M). The first two moments of P(M) show superdiffusive behavior, a hallmark of KPZ universality. However, the third and fourth moments ruled out the KPZ conjecture and allow for evaluating other theories. Our results highlight the importance of studying higher moments in determining dynamic universality classes and provide insights into universal behavior in quantum systems.
View details
Measurement-induced entanglement and teleportation on a noisy quantum processor
Vedika Khemani
Matteo Ippoliti
Andrew Dunsworth
Bill Huggins
Markus Hoffmann
Alexis Morvan
Josh Cogan
Ben Curtin
Guifre Vidal
Bob Buckley
Tom O'Brien
John Mark Kreikebaum
Rajeev Acharya
Joonho Lee
Ningfeng Zhu
Shirin Montazeri
Sergei Isakov
Jamie Yao
Clarke Smith
Rebecca Potter
Jeremy Hilton
Paula Heu
Alexei Kitaev
Alex Crook
Fedor Kostritsa
Kim Ming Lau
Dmitry Abanin
Trent Huang
Aaron Shorter
Steve Habegger
Gina Bortoli
Seun Omonije
Charles Rocque
Vladimir Shvarts
Alfredo Torres
Anthony Megrant
Charles Neill
Michael Hamilton
Dar Gilboa
Lily Laws
Nicholas Bushnell
Ramis Movassagh
Mike Shearn
Wojtek Mruczkiewicz
Desmond Chik
Leonid Pryadko
Xiao Mi
Brooks Foxen
Frank Arute
Alejo Grajales Dau
Yaxing Zhang
Alexander Lill
JiunHow Ng
Justin Iveland
Marco Szalay
Orion Martin
Juhwan Yoo
Michael Newman
William Giang
Alex Opremcak
Amanda Mieszala
William Courtney
Andrey Klots
Wayne Liu
Pavel Laptev
Paul Conner
Rolando Somma
Vadim Smelyanskiy
Jesse Hoke
Benjamin Chiaro
Grayson Young
Tim Burger
ILYA Drozdov
Agustin Di Paolo
Jimmy Chen
Marika Kieferova
Michael Broughton
Negar Saei
Juan Atalaya
Markus Ansmann
Pavol Juhas
Murray Ich Nguyen
Yuri Lensky
Daniel Eppens
Roberto Collins
Jindra Skruzny
Yu Chen
Reza Fatemi
Leon Brill
Ashley Huff
Doug Strain
Monica Hansen
Noah Shutty
Ebrahim Forati
Dave Landhuis
Kenny Lee
Ping Yeh
Kunal Arya
Henry Schurkus
Cheng Xing
Cody Jones
Edward Farhi
Raja Gosula
Andre Petukhov
Alexander Korotkov
Ani Nersisyan
Christopher Schuster
George Sterling
Kostyantyn Kechedzhi
Trond Andersen
Alexandre Bourassa
Kannan Sankaragomathi
Vinicius Ferreira
Nature, 622 (2023), 481–486
Preview abstract
Measurement has a special role in quantum theory: by collapsing the wavefunction, it can enable phenomena such as teleportation and thereby alter the ‘arrow of time’ that constrains unitary evolution. When integrated in many-body dynamics, measurements can lead to emergent patterns of quantum information in space–time that go beyond the established paradigms for characterizing phases, either in or out of equilibrium. For present-day noisy intermediate-scale quantum (NISQ) processors, the experimental realization of such physics can be problematic because of hardware limitations and the stochastic nature of quantum measurement. Here we address these experimental challenges and study measurement-induced quantum information phases on up to 70 superconducting qubits. By leveraging the interchangeability of space and time, we use a duality mapping to avoid mid-circuit measurement and access different manifestations of the underlying phases, from entanglement scaling to measurement-induced teleportation. We obtain finite-sized signatures of a phase transition with a decoding protocol that correlates the experimental measurement with classical simulation data. The phases display remarkably different sensitivity to noise, and we use this disparity to turn an inherent hardware limitation into a useful diagnostic. Our work demonstrates an approach to realizing measurement-induced physics at scales that are at the limits of current NISQ processors.
View details
Purification-Based Quantum Error Mitigation of Pair-Correlated Electron Simulations
Christian Gogolin
Vincent Elfving
Fotios Gkritsis
Oumarou Oumarou
Gian-Luca R. Anselmetti
Masoud Mohseni
Andrew Dunsworth
William J. Huggins
Markus Rudolf Hoffmann
Alexis Morvan
Josh Godfrey Cogan
Ben Curtin
Guifre Vidal
Bob Benjamin Buckley
Trevor Johnathan Mccourt
Thomas E O'Brien
John Mark Kreikebaum
Rajeev Acharya
Joonho Lee
Ningfeng Zhu
Shirin Montazeri
Sergei Isakov
Jamie Yao
Clarke Smith
Rebecca Potter
Sean Harrington
Jeremy Patterson Hilton
Alex Crook
Fedor Kostritsa
Kim Ming Lau
Dmitry Abanin
Trent Huang
Aaron Shorter
Steve Habegger
Richard Ross Allen
Vladimir Shvarts
Alfredo Torres
Stefano Polla
Anthony Megrant
Charles Neill
Michael C. Hamilton
Dar Gilboa
Lily MeeKit Laws
Nicholas Bushnell
Kyle Anderson
Ramis Movassagh
Mike Shearn
Wojtek Mruczkiewicz
Desmond Chun Fung Chik
Xiao Mi
Brooks Riley Foxen
Frank Carlton Arute
Alejandro Grajales Dau
Yaxing Zhang
Lara Faoro
Alexander T. Lill
Jiun How Ng
Justin Thomas Iveland
Marco Szalay
Orion Martin
Juhwan Yoo
Michael Newman
William Giang
Alex Opremcak
William Courtney
Andrey Klots
Wayne Liu
Pavel Laptev
Paul Conner
Rolando Diego Somma
Vadim Smelyanskiy
Benjamin Chiaro
Grayson Robert Young
Tim Burger
Ilya Drozdov
Jimmy Chen
Marika Kieferova
Michael Blythe Broughton
Juan Atalaya
Markus Ansmann
Pavol Juhas
Murray Nguyen
Daniel Eppens
Roberto Collins
Jindra Skruzny
Igor Aleiner
Yu Chen
Reza Fatemi
Leon Brill
Ashley Anne Huff
Doug Strain
Ebrahim Forati
Dave Landhuis
Kenny Lee
Ping Yeh
Kunal Arya
Cody Jones
Edward Farhi
Andre Gregory Petukhov
Alexander Korotkov
Ani Nersisyan
Christopher Schuster
Kostyantyn Kechedzhi
Trond Ikdahl Andersen
Alexandre Bourassa
Kannan Aryaperumal Sankaragomathi
Nature Physics (2023)
Preview abstract
An important measure of the development of quantum computing platforms has been the simulation of increasingly complex physical systems. Prior to fault-tolerant quantum computing, robust error mitigation strategies are necessary to continue this growth. Here, we study physical simulation within the seniority-zero electron pairing subspace, which affords both a computational stepping stone to a fully correlated model, and an opportunity to validate recently introduced ``purification-based'' error-mitigation strategies. We compare the performance of error mitigation based on doubling quantum resources in time (echo verification) or in space (virtual distillation), on up to 20 qubits of a superconducting qubit quantum processor. We observe a reduction of error by one to two orders of magnitude below less sophisticated techniques (e.g. post-selection); the gain from error mitigation is seen to increase with the system size. Employing these error mitigation strategies enables the implementation of the largest variational algorithm for a correlated chemistry system to-date. Extrapolating performance from these results allows us to estimate minimum requirements for a beyond-classical simulation of electronic structure. We find that, despite the impressive gains from purification-based error mitigation, significant hardware improvements will be required for classically intractable variational chemistry simulations.
View details
Noise-resilient Majorana Edge Modes on a Chain of Superconducting Qubits
Zijun Chen
Brooks Foxen
Masoud Mohseni
Emily Mount
Joao Basso
Andrew Dunsworth
William J. Huggins
Yuan Su
Markus Rudolf Hoffmann
Alexis Morvan
Guifre Vidal
Bob Benjamin Buckley
Thomas E O'Brien
John Mark Kreikebaum
Rajeev Acharya
Joonho Lee
Shirin Montazeri
Sergei Isakov
Jamie Yao
Rebecca Potter
Jeremy Patterson Hilton
Alexei Kitaev
Alex Crook
Fedor Kostritsa
Kim Ming Lau
Dmitry Abanin
Trent Huang
Steve Habegger
Alexa Rubinov
Vladimir Shvarts
Anthony Megrant
Charles Neill
Dar Gilboa
Nicholas Bushnell
Mike Shearn
Wojtek Mruczkiewicz
Xiao Mi
Frank Carlton Arute
Alejandro Grajales Dau
Yaxing Zhang
Lara Faoro
Justin Thomas Iveland
Marco Szalay
Orion Martin
Juhwan Yoo
Michael Newman
William Giang
Alex Opremcak
William Courtney
Andrey Klots
Wayne Liu
Pavel Laptev
Paul Conner
Vadim Smelyanskiy
Benjamin Chiaro
Bernardo Meurer Costa
Michael Blythe Broughton
Juan Atalaya
Daniel Eppens
Roberto Collins
Igor Aleiner
Yu Chen
Reza Fatemi
Leon Brill
Ashley Anne Huff
Doug Strain
Ebrahim Forati
Dave Landhuis
Kenny Lee
Ping Yeh
Kunal Arya
Michel Henri Devoret
Cody Jones
Edward Farhi
Andre Gregory Petukhov
Alexander Korotkov
Christopher Schuster
Kostyantyn Kechedzhi
Trond Ikdahl Andersen
Alexandre Bourassa
Kannan Aryaperumal Sankaragomathi
Science (2022) (to appear)
Preview abstract
Inherent symmetry of a quantum system may protect its otherwise fragile states. Leveraging such protection requires testing its robustness against uncontrolled environmental interactions. Using 47 superconducting qubits, we implement the kicked Ising model which exhibits Majorana edge modes (MEMs) protected by a $\mathbb{Z}_2$-symmetry. Remarkably, we find that any multi-qubit Pauli operator overlapping with the MEMs exhibits a uniform decay rate comparable to single-qubit relaxation rates, irrespective of its size or composition. This finding allows us to accurately reconstruct the exponentially localized spatial profiles of the MEMs. Spectroscopic measurements further indicate exponentially suppressed hybridization between the MEMs over larger system sizes, which manifests as a strong resilience against low-frequency noise. Our work elucidates the noise sensitivity of symmetry-protected edge modes in a solid-state environment.
View details
What the foundations of quantum computer science teach us about chemistry
Joonho Lee
Hsin-Yuan Huang
William J. Huggins
Thomas E O'Brien
Journal of Chemical Physics, 155 (2021), pp. 150901
Preview abstract
With the rapid development of quantum technology, one of the leading applications that has been identified is the simulation of chemistry. Interestingly, even before full scale quantum computers are available, quantum computer science has exhibited a remarkable string of results that directly impact what is possible in chemical simulation, even with a quantum computer. Some of these results even impact our understanding of chemistry in the real world. In this perspective, we take the position that direct chemical simulation is best understood as a digital experiment. While on one hand this clarifies the power of quantum computers to extend our reach, it also shows us the limitations of taking such an approach too directly. Leveraging results that quantum computers cannot outpace the physical world, we build to the controversial stance that some chemical problems are best viewed as problems for which no algorithm can deliver their solution in general, known in computer science as undecidable problems. This has implications for the predictive power of thermodynamic models and topics like the ergodic hypothesis. However, we argue that this perspective is not defeatist, but rather helps shed light on the success of existing chemical models like transition state theory, molecular orbital theory, and thermodynamics as models that benefit from data. We contextualize recent results showing that data-augmented models are more powerful rote simulation. These results help us appreciate the success of traditional chemical theory and anticipate new models learned from experimental data. Not only can quantum computers provide data for such models, but they can extend the class and power of models that utilize data in fundamental ways. These discussions culminate in speculation on new ways for quantum computing and chemistry to interact and our perspective on the eventual roles of quantum computers in the future of chemistry.
View details
Low-Depth Mechanisms for Quantum Optimization
Masoud Mohseni
Vadim Smelyanskiy
PRX Quantum, 3 (2021), pp. 030312
Preview abstract
One of the major application areas of interest for both near-term and fault-tolerant quantum computers is the optimization of classical objective functions. In this work, we develop intuitive constructions for a large class of these algorithms based on connections to simple dynamics of quantum systems, quantum walks, and classical continuous relaxations. We focus on developing a language and tools connected with kinetic energy on a graph for understanding the physical mechanisms of success and failure to guide algorithmic improvement. This physical language, in combination with uniqueness results related to unitarity, allow us to identify some potential pitfalls from kinetic energy fundamentally opposing the goal of optimization. This is connected to effects from wavefunction confinement, phase randomization, and shadow defects lurking in the objective far away from the ideal solution. As an example, we explore the surprising deficiency of many quantum methods in solving uncoupled spin problems and how this is both predictive of performance on some more complex systems while immediately suggesting simple resolutions. Further examination of canonical problems like the Hamming ramp or bush of implications show that entanglement can be strictly detrimental to performance results from the underlying mechanism of solution in approaches like QAOA. Kinetic energy and graph Laplacian perspectives provide new insights to common initialization and optimal solutions in QAOA as well as new methods for more effective layerwise training. Connections to classical methods of continuous extensions, homotopy methods, and iterated rounding suggest new directions for research in quantum optimization. Throughout, we unveil many pitfalls and mechanisms in quantum optimization using a physical perspective, which aim to spur the development of novel quantum optimization algorithms and refinements.
View details
Tuning Quantum Information Scrambling on a 53-Qubit Processor
Jeffrey Marshall
Salvatore Mandra
Masoud Mohseni
Andrew Dunsworth
Alan Ho
Matt Trevithick
Eric Ostby
Alan Derk
Rami Barends
Bálint Pató
Josh Mutus
Trevor Mccourt
Thomas E O'Brien
Sergei Isakov
Jamie Yao
Sean Harrington
Jeremy Patterson Hilton
Fedor Kostritsa
Trent Huang
Vladimir Shvarts
Nicholas Redd
Anthony Megrant
Charles Neill
Nicholas Bushnell
Wojtek Mruczkiewicz
Xiao Mi
Brooks Riley Foxen
Frank Carlton Arute
Marco Szalay
Orion Martin
Michael Newman
Alex Opremcak
William Courtney
Pavel Laptev
Vadim Smelyanskiy
Benjamin Chiaro
Jimmy Chen
Michael Blythe Broughton
Juan Atalaya
Daniel Eppens
Roberto Collins
Igor Aleiner
Yu Chen
Doug Strain
Dave Landhuis
Ping Yeh
Kunal Arya
Cody Jones
Edward Farhi
Andre Gregory Petukhov
Alexander Korotkov
Kostyantyn Kechedzhi
Alexandre Bourassa
arXiv (2021)
Preview abstract
As entanglement in a quantum system grows, initially localized quantum information is spread into the exponentially many degrees of freedom of the entire system. This process, known as quantum scrambling, is computationally intensive to study classically and lies at the heart of several modern physics conundrums. Here, we characterize scrambling of different quantum circuits on a 53-qubit programmable quantum processor by measuring their out-of-time-order correlators (OTOCs). We observe that the spatiotemporal spread of OTOCs, as well as their circuit-to-circuit fluctuation, unravel in detail the time-scale and extent of quantum scrambling. Comparison with numerical results indicates a high OTOC measurement accuracy despite the large size of the quantum system. Our work establishes OTOC as an experimental tool to diagnose quantum scrambling at the threshold of being classically inaccessible.
View details
Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
Michael Streif
Florian Neukart
Andrea Skolik
Martin Leib
Ben Chiaro
Bryan O'Gorman
A.G. Petukhov
Masoud Mohseni
Andrew Dunsworth
Rami Barends
Amit Vainsencher
John Martinis
Josh Mutus
Bob Benjamin Buckley
Thomas E O'Brien
Sergei Isakov
Jamie Yao
Fedor Kostritsa
Steve Habegger
Anthony Megrant
Charles Neill
Nicholas Bushnell
Harry Putterman
Wojtek Mruczkiewicz
Xiao Mi
Leo Zhou
Brooks Riley Foxen
Frank Carlton Arute
Marco Szalay
Orion Martin
William Courtney
Pavel Laptev
Vadim Smelyanskiy
Jimmy Chen
Mike Lindmark
Michael Blythe Broughton
Juan Atalaya
Roberto Collins
Yu Chen
Kevin Jeffery Sung
Doug Strain
Rob Graff
Dave Landhuis
Kunal Arya
Cody Jones
Edward Farhi
Alexander Korotkov
Kostyantyn Kechedzhi
Nature Physics (2021)
Preview abstract
Faster algorithms for combinatorial optimization could prove transformative for diverse areas such as logistics, finance and machine learning. Accordingly, the possibility of quantum enhanced optimization has driven much interest in quantum technologies. Here 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 native to our hardware; however, we also apply the QAOA to the Sherrington–Kirkpatrick model and MaxCut, non-native problems that require extensive compilation to implement. For hardware-native problems, which are classically efficient to solve on average, we obtain an approximation ratio that is independent of problem size and observe that performance increases with circuit depth. For problems requiring compilation, performance decreases with problem size. Circuits involving several thousand gates still present an advantage over random guessing but not over some efficient classical algorithms. Our results suggest that it will be challenging to scale near-term implementations of the QAOA for problems on non-native graphs. As these graphs are closer to real-world instances, we suggest more emphasis should be placed on such problems when using the QAOA to benchmark quantum processors.
View details
