Fetching the paper…
Reading the bibliography…
Quantum computers may provide good solutions to combinatorial optimization problems by leveraging the Quantum Approximate Optimization Algorithm (QAOA).
Bas Lodewijks · 1911
Earlier work this paper cites.
Portfolio selection
Harry Markowitz · 1952
Earlier work this paper cites.
An application of combinatorial optimization to statistical physics and circuit layout design
Francisco Barahona, Martin Grötschel, Michael Jünger, and Gerhard Reinelt · 1988
Earlier work this paper cites.
Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
James C. Spall · 1992
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X. Goemans and David P. Williamson · 1995
Earlier work this paper cites.
Limitations of noisy reversible computation, 1996
Dorit Aharonov, Michael Ben-Or, Russell Impagliazzo, and Noam Nisan · 1996
Earlier work this paper cites.
Accelerated second-order stochastic optimization using only function measurements
James C. Spall · 1997
Earlier work this paper cites.
Some optimal inapproximability results
Johan Håstad · 2001
Earlier work this paper cites.
The quantum approximate optimization algorithm needs to see the whole graph: A typical case
Edward Farhi, David Gamarnik, and Sam Gutmann · 2005
Earlier work this paper cites.
Charge-insensitive qubit design derived from the cooper pair box
Jens Koch, Terri M. Yu, Jay Gambetta, Andrew A. Houck, David I. Schuster, Johannes Majer, Alexandre Blais, Michel H. Devoret, Steven M. Girvin, and Robert J. Schoelkopf · 2007
Earlier work this paper cites.
Subsystem fault tolerance with the Bacon-Shor code
Panos Aliferis and Andrew W. Cross · 2007
Earlier work this paper cites.
Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem
Alain Billionnet and Sourour Elloumi · 2007
Earlier work this paper cites.
Inapproximability of the max-cut problem with negative weights
Sung-Pil Hong · 2008
Earlier work this paper cites.
An efficient method to convert arbitrary quantum circuits to ones on a linear nearest neighbor architecture
Yuichi Hirata, Masaki Nakanishi, Shigeru Yamashita, and Yasuhiko Nakashima · 2009
Earlier work this paper cites.
Fully microwave-tunable universal gates in superconducting qubits with linear couplings and fixed transition frequencies
Chad Rigetti and Michel Devoret · 2010
Earlier work this paper cites.
Multibit CkNOT quantum gates via Rydberg blockade
Larry Isenhower, Mark Saffman, and Klaus Mølmer · 2011
Earlier work this paper cites.
Scalable and robust randomized benchmarking of quantum processes
Easwar Magesan, Jay M. Gambetta, and Joseph Emerson · 2011
Earlier work this paper cites.
Characterizing quantum gates via randomized benchmarking
Easwar Magesan, Jay M. Gambetta, and Joseph Emerson · 2012
Earlier work this paper cites.
Surface codes: Towards practical large-scale quantum computation
Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland · 2012
Earlier work this paper cites.
Superconducting circuits for quantum information: An outlook
Michel Devoret and Robert J. Schoelkopf · 2013
Earlier work this paper cites.
Single-qubit gates in frequency-crowded transmon systems
Ron Schutjens, Fadi Abu Dagga, Daniel J. Egger, and Frank K. Wilhelm · 2013
Earlier work this paper cites.
Process verification of two-qubit quantum gates by randomized benchmarking
Antonio D. Córcoles, Jay M. Gambetta, Jerry M. Chow, John A. Smolin, Matthew Ware, Joel Strand, Britton L. T. Plourde, and Matthias Steffen · 2013
Earlier work this paper cites.
Demonstrating a driven reset protocol for a superconducting qubit
Kurtis Geerlings, Zaki Leghtas, Ioan M. Pop, Shyam Shankar, Luigi Frunzio, Robert J. Schoelkopf, Mazyar Mirrahimi, and Michel H. Devoret · 2013
Earlier work this paper cites.
Ising formulations of many NP problems
Andrew Lucas · 2014
Earlier work this paper cites.
Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits
Aaron Lye, Robert Wille, and Rolf Drechsler · 2015
Earlier work this paper cites.
On quadratic unconstrained binary optimization problems defined on chimera graphs
Sanjeeb Dash and Jean-François Puget · 2015
Earlier work this paper cites.
Tunable two-dimensional arrays of single rydberg atoms for realizing quantum ising models
Henning Labuhn, Daniel Barredo, Sylvain Ravets, Sylvain de Léséleuc, Tommaso Macrì, Thierry Lahaye, and Antoine Browaeys · 2016
Earlier work this paper cites.
A heuristic for linear nearest neighbor realization of quantum circuits by swap gate insertion using N N -gate lookahead
Abhoy Kole, Kamalika Datta, and Indranil Sengupta · 2016
Earlier work this paper cites.
Procedure for systematically tuning up cross-talk in the cross-resonance gate
Sarah Sheldon, Easwar Magesan, Jerry M. Chow, and Jay M. Gambetta · 2016
Earlier work this paper cites.
Optimizing variational quantum algorithms using pontryagin’s minimum principle
Zhi-Cheng Yang, Armin Rahmani, Alireza Shabani, Hartmut Neven, and Claudio Chamon · 2017
Earlier work this paper cites.
Practical optimization for hybrid quantum-classical algorithms
Gian Giacomo Guerreschi and Mikhail Smelyanskiy · 2017
Earlier work this paper cites.
Error mitigation for short-depth quantum circuits
Kristan Temme, Sergey Bravyi, and Jay M. Gambetta · 2017
Earlier work this paper cites.
Error mitigation extends the computational reach of a noisy quantum processor
Abhinav Kandala, Kristan Temme, Antonio D. Corcoles, Antonio Mezzacapo, Jerry M. Chow, and Jay M. Gambetta · 2018
Earlier work this paper cites.
An efficient methodology for mapping quantum circuits to the IBM QX architectures
Alwin Zulehner, Alexandru Paler, and Robert Wille · 2018
Earlier work this paper cites.
A novel approach for nearest neighbor realization of 2D quantum circuits
Anirban Bhattacharjee, Chandan Bandyopadhyay, Robert Wille, Rolf Drechsler, and Hafizur Rahaman · 2018
Earlier work this paper cites.
Pulsed reset protocol for fixed-frequency superconducting qubits
Daniel J. Egger, Max Werninghaus, Marc Ganzhorn, Gian Salis, Andreas Fuhrer, Peter Müller, and Stefan Filipp · 2018
Cited alongside, same era.
Optimized cross-resonance gate for coupled transmon systems
Susanna Kirchhoff, Torsten Keßler, Per J. Liebermann, Elie Assémat, Shai Machnes, Felix Motzoi, and Frank K. Wilhelm · 2018
Cited alongside, same era.
For fixed control parameters the quantum approximate optimization algorithm’s objective function value concentrates for typical instances, 2018
Fernando G. S. L. Brandao, Michael Broughton, Edward Farhi, Sam Gutmann, and Hartmut Neven · 2018
Cited alongside, same era.
Gate-efficient simulation of molecular eigenstates on a quantum computer
Marc Ganzhorn, Daniel J. Egger, Panagiotis Kl. Barkoutsos, Pauline Ollitrault, Gian Salis, Nikolaj Moll, Andreas Fuhrer, Peter Mueller, Stefan Woerner, Ivano Tavernelli, and Stefan Filipp · 2019
Cited alongside, same era.
Quantum risk analysis
Stefan Woerner and Daniel J. Egger · 2019
Cited alongside, same era.
Qiskit: An open-source framework for quantum computing
Héctor Abraham and et al · 2021
Later among the works it cites.
Quantum annealing initialization of the quantum approximate optimization algorithm
Stefan H. Sack and Maksym Serbyn · 2021
Later among the works it cites.
Quantifying the impact of precision errors on quantum approximate optimization algorithms
Gregory Quiroz, Paraj Titum, Phillip Lotshaw, Pavel Lougovski, Kevin Schultz, Eugene Dumitrescu, and Itay Hen · 2021
Later among the works it cites.
Simultaneous Perturbation Stochastic Approximation of the Quantum Fisher Information
Julien Gacon, Christa Zoufal, Giuseppe Carleo, and Stefan Woerner · 2021
Later among the works it cites.
Parameter concentrations in quantum approximate optimization
Vishwanathan Akshay, Daniil Rabinovich, Ernesto Campos, and Jacob Biamonte · 2021
Later among the works it cites.
Transferability of optimal qaoa parameters between random graphs
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A quantum engineer’s guide to superconducting qubits
Philip Krantz, Morten Kjaergaard, Fei Yan, Terry P. Orlando, Simon Gustavsson, and William D. Oliver · 2019
Cited alongside, same era.
Three-qubit randomized benchmarking
David C. McKay, Sarah Sheldon, John A. Smolin, Jerry M. Chow, and Jay M. Gambetta · 2019
Cited alongside, same era.
On the Qubit Routing Problem
Alexander Cowtan, Silas Dilkes, Ross Duncan, Alexandre Krajenbrink, Will Simmons, and Seyon Sivarajah · 2019
Cited alongside, same era.
Tackling the qubit mapping problem for NISQ-era quantum devices
Gushu Li, Yufei Ding, and Yuan Xie · 2019
Cited alongside, same era.
Accelerated variational quantum eigensolver
Daochen Wang, Oscar Higgott, and Stephen Brierley · 2019
Cited alongside, same era.
Classical and quantum bounded depth approximation algorithms
Matthew B. Hastings · 2019
Cited alongside, same era.
Quantum computing for finance: State-of-the-art and future prospects
Daniel J. Egger, Claudio Gambella, Jakub Mareček, Scott McFaddin, Martin Mevissen, Rudy Raymond, Aandrea Simonetto, Sefan Woerner, and Elena Yndurain · 2020
Cited alongside, same era.
Alexey Galda, Xiaoyuan Liu, Danylo Lykov, Yuri Alexeev, and Ilya Safro · 2021
Later among the works it cites.
Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware
Nathan Earnest, Caroline Tornow, and Daniel J. Egger · 2021
Later among the works it cites.
Mitigating measurement errors in multiqubit experiments
Sergey Bravyi, Sarah Sheldon, Abhinav Kandala, David C. McKay, and Jay M. Gambetta · 2021
Later among the works it cites.
Embedding overhead scaling of optimization problems in quantum annealing
Mario S. Könz, Wolfgang Lechner, Helmut G. Katzgraber, and Matthias Troyer · 2021
Later among the works it cites.
Simulating the dynamics of braiding of majorana zero modes using an ibm quantum computer
John P. T. Stenger, Nicholas T. Bronn, Daniel J. Egger, and David Pekker · 2021
Later among the works it cites.
Warm-starting quantum optimization
Daniel J. Egger, Jakub Mareček, and Stefan Woerner · 2021
Later among the works it cites.
Classically-inspired mixers for QAOA beat Goemans-Williamson’s Max-Cut at low circuit depths
Reuben Tate, Bryan Gard, Greg Mohler, and Swati Gupta · 2021
Later among the works it cites.
Scalable error mitigation for noisy quantum circuits produces competitive expectation values
Youngseok Kim, Christopher J. Wood, Theodore J. Yoder, Seth T. Merkel, Jay M. Gambetta, Kristan Temme, and Abhinav Kandala · 2021
Later among the works it cites.
Scalable mitigation of measurement errors on quantum computers
Paul D. Nation, Hwajung Kang, Neereja Sundaresan, and Jay M. Gambetta · 2021
Later among the works it cites.
Quantum crosstalk analysis for simultaneous gate operations on superconducting qubits
Peng Zhao, Kehuan Linghu, Zhiyuan Li, Peng Xu, Ruixia Wang, Guangming Xue, Yirong Jin, and Haifeng Yu · 2022
Closest in time.
2QAN: A quantum compiler for 2-local qubit hamiltonian simulation algorithms
Lingling Lao and Dan E. Browne · 2022
Closest in time.
Parameter transfer for quantum approximate optimization of weighted MaxCut
Ruslan Shaydulin, Phillip C. Lotshaw, Jeffrey Larson, James Ostrowski, and Travis S. Humble · 2022
Closest in time.
Optimized swap networks with equivalent circuit averaging for qaoa
Akel Hashim, Rich Rines, Victory Omole, Ravi K. Naik, John Mark Kreikebaum, David I. Santiago, Frederic T. Chong, Irfan Siddiqi, and Pranav Gokhale · 2022
Closest in time.
Squeezing and quantum approximate optimization
Gopal Chandra Santra, Fred Jendrzejewski, Philipp Hauke, and Daniel J. Egger · 2022
Closest in time.
Scaling quantum approximate optimization on near-term hardware
Phillip C. Lotshaw, Thien Nguyen, Anthony Santana, Alexander McCaskey, Rebekah Herrman, James Ostrowski, George Siopsis, and Travis S. Humble · 2022
Closest in time.
Digitized-counterdiabatic quantum approximate optimization algorithm
P. Chandarana, N. N. Hegade, K. Paul, F. Albarrán-Arriagada, E. Solano, A. del Campo, and Xi Chen · 2022
Closest in time.
Counterdiabaticity and the quantum approximate optimization algorithm
Jonathan Wurtz and Peter J. Love · 2022
Closest in time.
Bridging classical and quantum with SDP initialized warm-starts for QAOA
Reuben Tate, Majid Farhadi, Creston Herold, Greg Mohler, and Swati Gupta · 2022
Closest in time.
Well-conditioned multi-product formulas for hardware-friendly hamiltonian simulation
Almudena Carrera Vazquez, Daniel J. Egger, David Ochsner, and Stefan Woerner · 2022
Closest in time.
Probabilistic error cancellation with sparse pauli-lindblad models on noisy quantum processors
Ewout van den Berg, Zlatko K. Minev, Abhinav Kandala, and Kristan Temme · 2022
Closest in time.
Exact and practical pattern matching for quantum circuit optimization
Raban Iten, Romain Moyard, Tony Metger, David Sutter, and Stefan Woerner · 2022
Closest in time.
Characterizing large-scale quantum computers via cycle benchmarking
Alexander Erhard, Joel J. Wallman, Lukas Postler, Michael Meth, Roman Stricker, Esteban A. Martinez, Philipp Schindler, Thomas Monz, Joseph Emerson, and Rainer Blatt · 2041
Closest in time.
Quantum optimization using variational algorithms on near-term quantum devices
Nikolaj Moll, Panagiotis Barkoutsos, Lev S. Bishop, Jerry M. Chow, Andrew Cross, Daniel J. Egger, Stefan Filipp, Andreas Fuhrer, Jay M. Gambetta, Marc Ganzhorn, and et al · 2058
Closest in time.
Mapping quantum circuits on 3D nearest-neighbor architectures
Azim Farghadan and Naser Mohammadzadeh · 2058
Closest in time.
t | | ket ⟩ \rangle : a retargetable compiler for NISQ devices
Seyon Sivarajah, Silas Dilkes, Alexander Cowtan, Will Simmons, Alec Edgington, and Ross Duncan · 2058
Closest in time.
Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz
Jonathan Romero, Ryan Babbush, Jarrod R. McClean, Cornelius Hempel, Peter J. Love, and Alán Aspuru-Guzik · 2058
Closest in time.
Training the quantum approximate optimization algorithm without access to a quantum processing unit
Michael Streif and Martin Leib · 2058
Closest in time.
Qiskit pulse: programming quantum computers through the cloud with pulses
Thomas Alexander, Naoki Kanazawa, Daniel J. Egger, Lauren Capelluto, Christopher J. Wood, Ali Javadi-Abhari, and David C. McKay · 2058
Closest in time.
Filtering variational quantum algorithms for combinatorial optimization
David Amaro, Carlo Modica, Matthias Rosenkranz, Mattia Fiorentini, Marcello Benedetti, and Michael Lubasch · 2058
Closest in time.