Fetching the paper…
Reading the bibliography…
Quantum annealing (QA) and Quantum Alternating Operator Ansatz (QAOA) are both heuristic quantum algorithms intended for sampling optimal solutions of combinatorial optimization problems.
“Comparison of QAOA with Quantum and Simulated Annealing”
Michael Streif and Martin Leib · 1901
Earlier work this paper cites.
“Pegasus: The second connectivity graph for large-scale quantum annealing hardware”
Nike Dattani, Szilard Szalay and Nick Chancellor · 1901
Earlier work this paper cites.
“Optimization by simulated annealing”
Scott Kirkpatrick, C Gelatt and Mario Vecchi · 1983
Earlier work this paper cites.
“Quantum annealing in the transverse Ising model”
Tadashi Kadowaki and Hidetoshi Nishimori · 1998
Earlier work this paper cites.
“Quantum simulation of a three-body-interaction Hamiltonian on an NMR quantum computer”
C.. Tseng et al · 1999
Earlier work this paper cites.
“Dynamical Decoupling of Open Quantum Systems”
Lorenza Viola, Emanuel Knill and Seth Lloyd · 1999
Earlier work this paper cites.
“Matplotlib: A 2D graphics environment”
J.. Hunter · 2007
Earlier work this paper cites.
“Mathematical foundation of quantum annealing”
Satoshi Morita and Hidetoshi Nishimori · 2008
Earlier work this paper cites.
“Colloquium: Quantum annealing and analog quantum computation”
Arnab Das and Bikas Chakrabarti · 2008
Earlier work this paper cites.
“Transformation of General Binary MRF Minimization to the First-Order Case”
Hiroshi Ishikawa · 2010
Earlier work this paper cites.
“Robustness of dynamical decoupling sequences”
Mustafa Ahmed Ahmed, Gonzalo. “’Alvarez and Dieter Suter · 2013
Earlier work this paper cites.
“Entanglement in a Quantum Annealing Processor”
T. Lanting et al · 2014
Earlier work this paper cites.
“A Quantum Approximate Optimization Algorithm”
Edward Farhi, Jeffrey Goldstone and Sam Gutmann · 2014
Earlier work this paper cites.
“Evidence for quantum annealing with more than one hundred qubits”
Sergio Boixo et al · 2014
Earlier work this paper cites.
“Quantum Supremacy through the Quantum Approximate Optimization Algorithm”
Edward Farhi and Aram Harrow · 2016
Earlier work this paper cites.
“Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics versus quantum approaches”
Salvatore Mandr“‘a et al · 2016
Earlier work this paper cites.
“Colloquium: Protecting quantum information against environmental noise”
Dieter Suter and Gonzalo. “’Alvarez · 2016
Earlier work this paper cites.
“Circuit design for multi-body interactions in superconducting quantum annealing systems with applications to a scalable architecture”
Nicholas Chancellor, Stefan Zohren and Paul Warburton · 2017
Earlier work this paper cites.
“Open Quantum Assembly Language”
Andrew. Cross, Lev. Bishop, John. Smolin and Jay. Gambetta · 2017
Earlier work this paper cites.
“Demonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing”
Tameem Albash and Daniel. Lidar · 2018
Cited alongside, same era.
“Quantum annealing for prime factorization”
Shuxian Jiang et al · 2018
Cited alongside, same era.
“Demonstration of Fidelity Improvement Using Dynamical Decoupling with Superconducting Qubits”
Bibek Pokharel, Namit Anand, Benjamin Fortman and Daniel. Lidar · 2018
Cited alongside, same era.
“From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz”
Stuart Hadfield et al · 2019
Cited alongside, same era.
“Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers”
Jeffrey Marshall, Davide Venturelli, Itay Hen and Eleanor. Rieffel · 2019
Cited alongside, same era.
“Perspectives of quantum annealing: methods and implementations”
“Coherent quantum annealing in a programmable 2000-qubit Ising chain”
Andrew King et al · 2022
Later among the works it cites.
“Scaling quantum approximate optimization on near-term hardware”
Phillip. Lotshaw et al · 2022
Later among the works it cites.
“On the Emerging Potential of Quantum Annealing Hardware for Combinatorial Optimization”
Byron Tasseff et al · 2022
Later among the works it cites.
“Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware”
Johannes Weidenfeller et al · 2022
Later among the works it cites.
“Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer”
Pradeep Niroula et al · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Philipp Hauke et al · 2020
Cited alongside, same era.
“The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover”
Jeremy Cook, Stephan Eidenbenz and Andreas Bärtschi · 2020
Cited alongside, same era.
“XY mixers: Analytical and numerical results for the quantum alternating operator ansatz”
Zhihui Wang, Nicholas. Rubin, Jason. Dominy and Eleanor. Rieffel · 2020
Cited alongside, same era.
“Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator”
Guido Pagano et al · 2020
Cited alongside, same era.
“Topological and Subsystem Codes on Low-Degree Graphs with Flag Qubits”
Christopher Chamberland et al · 2020
Cited alongside, same era.
“Embedding algorithms for quantum annealers with chimera and pegasus connection topologies”
Stefanie Zbinden, Andreas B“”artschi, Hristo Djidjev and Stephan Eidenbenz · 2020
Cited alongside, same era.
“Scaling advantage over path-integral Monte Carlo in quantum simulation of geometrically frustrated magnets”
Andrew King et al · 2021
Cited alongside, same era.
Dylan Herman et al · 2022
Later among the works it cites.
“Qiskit/qiskit: Qiskit 0.34.1”
Matthew Treinish et al · 2022
Later among the works it cites.
“QAOA of the Highest Order”
Colin Campbell and Edward Dahl · 2022
Later among the works it cites.
“Quantum annealing algorithms for Boolean tensor networks”
Elijah Pelofske et al · 2022
Later among the works it cites.
“Evidence for Super-Polynomial Advantage of QAOA over Unstructured Search”
John Golden, Andreas Bärtschi, Stephan Eidenbenz and Daniel O’Malley · 2022
Later among the works it cites.
“Effects of Dynamical Decoupling and Pulse-Level Optimizations on IBM Quantum Computers”
Siyuan Niu and Aida Todri-Sanial · 2022
Later among the works it cites.
“Mitiq: A software package for error mitigation on noisy quantum computers”
Ryan LaRose et al · 2022
Later among the works it cites.
“Dynamical decoupling for superconducting qubits: a performance survey”
Nic Ezzell et al · 2022
Later among the works it cites.
“Parallel quantum annealing”
Elijah Pelofske, Georg Hahn and Hristo. Djidjev · 2022
Later among the works it cites.
“Optimization Applications as Quantum Performance Benchmarks”
Thomas Lubinski et al · 2023
Closest in time.
“Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers”
Elijah Pelofske, Andreas Bärtschi and Stephan Eidenbenz · 2023
Closest in time.
“Scalable error mitigation for noisy quantum circuits produces competitive expectation values”
Youngseok Kim et al · 2023
Closest in time.
“Multi-round QAOA and advanced mixers on a trapped-ion quantum computer”
Yingyue Zhu et al · 2058
Closest in time.