Code from "Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem" Article Swipe

PDF

Ruslan Shaydulin , Changhao Li , Shouvanik Chakrabarti , Matthew DeCross , Dylan Herman , Niraj Kumar , Jeffrey Larson , Danylo Lykov , Pierre Minssen , Yue Sun , Yuri Alexeev , Joan Dreiling , John Gaebler , Thomas M. Gatterman , Justin A. Gerber , Kevin Gilmore , Dan Gresh , Nathan Hewitt , Chandler V. Horst , Shaohan Hu , Jacob Johansen , Mitchell Matheny , Tanner Mengle , Michael Mills , Steven A. Moses , Brian Neyenhuis , Peter Siegfried , Romina Yalovetzky , Marco Pistoia ·

YOU? · · 2023 · Open Access · · DOI: https://doi.org/10.5281/zenodo.10935811

Code used to generate the results in the paper "Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem". See https://github.com/jpmorganchase/QOKit for latest version.

Related Topics To Compare & Contrast

Quantum Computing

Computer Science

Algorithm

Theoretical Computer Science

Concepts

Qubit Heuristics Quantum computer Computer science Quantum algorithm Scaling Quantum Optimization problem Algorithm Theoretical computer science Mathematical optimization Mathematics Quantum mechanics Physics Geometry

Metadata

Type: preprint
Language: en
Landing Page: http://arxiv.org/abs/2308.02342
PDF: https://arxiv.org/pdf/2308.02342
OA Status: green
Cited By: 3
References: 83
Related Works: 10
OpenAlex ID: https://openalex.org/W4385644466

All OpenAlex metadata

Raw OpenAlex JSON

No additional metadata available.