Published July 27, 2023
| Version v1
Preprint
Open
Data from "Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem"
Authors/Creators
-
Ruslan Shaydulin1
-
Changhao Li1
-
Shouvanik Chakrabarti1
-
Matthew DeCross2
-
Dylan Herman1
-
Niraj Kumar1
-
Jeffrey Larson3
-
Danylo Lykov1
-
Pierre Minssen1
-
Yue Sun1
-
Yuri Alexeev3
- Joan M. Dreiling2
- John P. Gaebler2
- Thomas M. Gatterman2
- Justin A. Gerber2
- Kevin Gilmore2
- Dan Gresh2
- Nathan Hewitt2
- Chandler V. Horst2
-
Shaohan Hu1
- Jacob Johansen2
- Mitchell Matheny2
- Tanner Mengle2
- Michael Mills2
- Steven A. Moses2
- Brian Neyenhuis2
- Peter Siegfried2
-
Romina Yalovetzky1
-
Marco Pistoia1
- 1. JPMorgan Chase
- 2. Quantinuum
- 3. Argonne National Laboratory
Description
Data from the paper "Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem"