Fetching the paper…
Reading the bibliography…
In this paper, we present QPack, a universal benchmark for Noisy Intermediate-Scale Quantum (NISQ) computers based on Quantum Approximate Optimization Algorithms (QAOA).
R. H. Dicke, “Coherence in spontaneous radiation processes,” Phys. Rev. , vol. 93, pp. 99–110, Jan 1954. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRev.93.99
1954
Earlier work this paper cites.
R. M. Karp, “Reducibility among combinatorial problems.” in Complexity of Computer Computations , ser. The IBM Research Symposia Series, R. E. Miller and J. W. Thatcher, Eds. Plenum Press, New York, 1972, pp. 85–103. [Online]. Available: http://dblp.uni-trier.de/db/conf/coco/cocc1972.htmlKarp72
1972
Earlier work this paper cites.
M. R. Gary and D. S. Johnson, “Computers and intractability: A guide to the theory of np-completeness,” 1979
1979
Earlier work this paper cites.
J. E. Dennis Jr and V. Torczon, “Parallel implementations of the nelder-mead simplex algorithm for unconstrained optimization,” in High Speed Computing , vol. 880. International Society for Optics and Photonics, 1988, pp. 187–191
1988
Earlier work this paper cites.
F. Barahona, M. Grötschel, M. Jünger, and G. Reinelt, “An application of combinatorial optimization to statistical physics and circuit layout design,” Operations Research , vol. 36, no. 3, pp. 493–513, 1988. [Online]. Available: http://www.jstor.org/stable/170992
1988
Earlier work this paper cites.
F. Barahona, M. Grötschel, M. Jünger, and G. Reinelt, “An application of combinatorial optimization to statistical physics and circuit layout design,” Operations Research , vol. 36, pp. 493–513, 05 1988
1988
Earlier work this paper cites.
M. Jerrum and A. Sinclair, “Polynomial-time approximation algorithms for the ising model,” SIAM Journal on computing , vol. 22, no. 5, pp. 1087–1116, 1993
1993
Earlier work this paper cites.
M. J. Powell, “A direct search optimization method that models the objective and constraint functions by linear interpolation,” in Advances in optimization and numerical analysis . Springer, 1994, pp. 51–67
1994
Earlier work this paper cites.
M. X. Goemans and D. P. Williamson, “Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming,” J. ACM , vol. 42, no. 6, p. 1115–1145, Nov. 1995. [Online]. Available: https://doi.org/10.1145/227683.227684
1995
Earlier work this paper cites.
J. Brimberg, “The fermat-weber location problem revisited,” Math. Program. , vol. 71, no. 1, p. 71–76, Nov. 1995. [Online]. Available: https://doi.org/10.1007/BF01592245
1995
Earlier work this paper cites.
J. Emerson, R. Alicki, and K. Życzkowski, “Scalable noise estimation with random unitary operators,” Journal of Optics B: Quantum and Semiclassical Optics , vol. 7, no. 10, p. S347, 2005
2005
Earlier work this paper cites.
J. Poland and T. Zeugmann, “Clustering pairwise distances with missing data: Maximum cuts versus normalized cuts,” in Discovery Science , L. Todorovski, N. Lavrač, and K. P. Jantke, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 197–208
2006
Earlier work this paper cites.
D. Lee and M. Wiswall, “A parallel implementation of the simplex function minimization routine,” Computational Economics , vol. 30, no. 2, pp. 171–187, 2007
2007
Earlier work this paper cites.
E. Knill, D. Leibfried, R. Reichle, J. Britton, R. B. Blakestad, J. D. Jost, C. Langer, R. Ozeri, S. Seidelin, and D. J. Wineland, “Randomized benchmarking of quantum gates,” Physical Review A , vol. 77, no. 1, p. 012307, 2008
2008
Earlier work this paper cites.
C. Dankert, R. Cleve, J. Emerson, and E. Livine, “Exact and approximate unitary 2-designs and their application to fidelity estimation,” Physical Review A , vol. 80, no. 1, p. 012304, 2009
2009
Earlier work this paper cites.
R.-S. Wang and L.-M. Wang, “Maximum cut in fuzzy nature: Models and algorithms,” Journal of Computational and Applied Mathematics , vol. 234, no. 1, pp. 240 – 252, 2010. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0377042709008309
2010
Earlier work this paper cites.
R. Matai, S. Singh, and M. L. Mittal, “Traveling salesman problem: an overview of applications, formulations, and solution approaches,” in Traveling Salesman Problem , D. Davendra, Ed. Rijeka: IntechOpen, 2010, ch. 1. [Online]. Available: https://doi.org/10.5772/12909
2010
Earlier work this paper cites.
T. J. Osborne, “Hamiltonian complexity,” Reports on Progress in Physics , vol. 75, no. 2, p. 022001, Jan 2012. [Online]. Available: http://dx.doi.org/10.1088/0034-4885/75/2/022001
2012
Earlier work this paper cites.
J. Alonso and C. Farhat, “Gradient-based optimization,” 2012. [Online]. Available: http://adl.stanford.edu/aa222/Lecture_Notes_files/chapter3_gradient.pdf
2012
Earlier work this paper cites.
——, “Gradient-free optimization,” 2012. [Online]. Available: http://adl.stanford.edu/aa222/Lecture_Notes_files/chapter6_gradfree.pdf
2012
Earlier work this paper cites.
K. C. Young, M. Sarovar, and R. Blume-Kohout, “Error suppression and error correction in adiabatic quantum computation: Techniques and challenges,” Physical Review X , vol. 3, no. 4, Nov 2013. [Online]. Available: http://dx.doi.org/10.1103/PhysRevX.3.041013
2013
Earlier work this paper cites.
E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,” 2014
2014
Earlier work this paper cites.
K. M. Rudinger and E. Nielsen, “Quantum characterization verification & validation (qcvv) tutorial: Calibration-fee characterization,” Sandia National Lab.(SNL-NM), Albuquerque, NM (United States), Tech. Rep., 2016
2016
Earlier work this paper cites.
Rigetti, “Variational-quantum-eigensolver (vqe),” 2016. [Online]. Available: https://grove-docs.readthedocs.io/en/latest/vqe.html
2016
Earlier work this paper cites.
C. Y.-Y. Lin and Y. Zhu, “Performance of qaoa on typical instances of constraint satisfaction problems with bounded degree,” 2016
2016
Earlier work this paper cites.
L. S. Bishop, S. Bravyi, A. Cross, J. M. Gambetta, and J. Smolin, “Quantum volume,” Quantum Volume. Technical Report , 2017
2017
Earlier work this paper cites.
K. Michielsen, M. Nocon, D. Willsch, F. Jin, T. Lippert, and H. De Raedt, “Benchmarking gate-based quantum computers,” Computer Physics Communications , vol. 220, p. 44–55, Nov 2017. [Online]. Available: http://dx.doi.org/10.1016/j.cpc.2017.06.011
2017
Earlier work this paper cites.
M. Héder, “From nasa to eu: the evolution of the trl scale in public sector innovation,” The Innovation Journal , vol. 22, p. 1, 2017
2017
Earlier work this paper cites.
Z. Jiang, E. G. Rieffel, and Z. Wang, “Near-optimal quantum circuit for grover’s unstructured search using a transverse field,” Physical Review A , vol. 95, no. 6, Jun 2017. [Online]. Available: http://dx.doi.org/10.1103/PhysRevA.95.062317
2017
Earlier work this paper cites.
Z. Abdmouleh, A. Gastli, L. Ben-Brahim, M. Haouari, and N. Al-Emadi, “Review of optimization techniques applied for the integration of distributed generation from renewable energy sources,” Renewable Energy , vol. 113, 05 2017
2017
Earlier work this paper cites.
A. A. Zhukov, E. O. Kiktenko, A. A. Elistratov, W. V. Pogosov, and Y. E. Lozovik, “Quantum communication protocols as a benchmark for programmable quantum computers,” Quantum Information Processing , vol. 18, no. 1, Dec 2018. [Online]. Available: http://dx.doi.org/10.1007/s11128-018-2144-y
2018
Cited alongside, same era.
G. E. Crooks, “Performance of the quantum approximate optimization algorithm on the maximum cut problem,” 2018
2018
Cited alongside, same era.
T. Mai, “Technology readiness level — nasa,” oct 2018. [Online]. Available: https://www.nasa.gov/directorates/heo/scan/engineering/technology/txt_accordion1.html
2018
Cited alongside, same era.
S. C. Endres, C. Sandrock, and W. W. Focke, “A simplicial homology algorithm for lipschitz optimisation,” Journal of Global Optimization , vol. 72, no. 2, pp. 181–217, 2018
2018
Cited alongside, same era.
ATOS, “Atos announces q-score, the only universal metrics to assess quantum performance and superiority,” ATOS , Dec 2020, available: https://atos.net/en/2020/press-release_2020_12_04/atos-announces-q-score-the-only-universal-metrics-to-assess-quantum-performance-and-superiority
2020
Later among the works it cites.
M. Willsch, D. Willsch, F. Jin, H. De Raedt, and K. Michielsen, “Benchmarking the quantum approximate optimization algorithm,” Quantum Information Processing , vol. 19, p. 197, 2020
2020
Later among the works it cites.
A. Sarkar, Z. Al-Ars, and K. Bertels, “Quaser – quantum accelerated de novo dna sequence reconstruction,” 2020
2020
Later among the works it cites.
Qiskit, “Solving combinatorial optimization problems using qaoa,” 2020. [Online]. Available: https://qiskit.org/textbook/ch-applications/qaoa.html
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
V. Gheorghiu, “Quantum++: A modern c++ quantum computing library,” PloS one , vol. 13, no. 12, p. e0208073, 2018
2018
Cited alongside, same era.
M. D. et al., “Airspeed velocity,” 2018. [Online]. Available: https://asv.readthedocs.io/en/stable/index.html
2018
Cited alongside, same era.
R. J. Blume-Kohout and K. Young, “Metrics and benchmarks for quantum processors: State of play.” Sandia National Lab.(SNL-NM), Albuquerque, NM (United States); Sandia …, Tech. Rep., 2019
2019
Cited alongside, same era.
2019
Cited alongside, same era.
A. Erhard, J. J. Wallman, L. Postler, M. Meth, R. Stricker, E. A. Martinez, P. Schindler, T. Monz, J. Emerson, and R. Blatt, “Characterizing large-scale quantum computers via cycle benchmarking,” Nature communications , vol. 10, no. 1, pp. 1–7, 2019
2019
Cited alongside, same era.
S. Ferracin, T. Kapourniotis, and A. Datta, “Accrediting outputs of noisy intermediate-scale quantum computing devices,” New Journal of Physics , vol. 21, no. 11, p. 113038, 2019
2019
Cited alongside, same era.
S. Hadfield, Z. Wang, B. O’Gorman, E. Rieffel, D. Venturelli, and R. Biswas, “From the quantum approximate optimization algorithm to a quantum alternating operator ansatz,” Algorithms , vol. 12, no. 2, p. 34, Feb 2019. [Online]. Available: http://dx.doi.org/10.3390/a12020034
2019
Cited alongside, same era.
S. Khairy, R. Shaydulin, L. Cincio, Y. Alexeev, and P. Balaprakash, “Reinforcement learning for quantum approximate optimization,” vol. 19, 2019
2019
Cited alongside, same era.
A. McCaskey, D. Lyakh, E. Dumitrescu, S. Powers, and T. Humble, “Xacc: a system-level software infrastructure for heterogeneous quantum-classical computing,” Quantum Science and Technology , vol. 5, 01 2020
2020
Later among the works it cites.
V. Akshay, H. Philathong, M. Morales, and J. Biamonte, “Reachability deficits in quantum approximate optimization,” Physical Review Letters , vol. 124, no. 9, Mar 2020. [Online]. Available: http://dx.doi.org/10.1103/PhysRevLett.124.090504
2020
Later among the works it cites.
S. Skiena, “Stony brook algorithm repository,” 2020. [Online]. Available: https://algorist.com/problems/SetPacking.html
2020
Later among the works it cites.
N. J. Guerrero, “Solving combinatorial optimization problems using the quantum approximation optimization algorithm,” 2020
2020
Later among the works it cites.
Y. Ruan, S. Marsh, X. Xue, X. Li, Z. Liu, and J. Wang, “Quantum approximate algorithm for np optimization problems with constraints,” 2020
2020
Later among the works it cites.
J. Ceroni, “Fun graphs with qaoa,” 2016. [Online]. Available: https://lucaman99.github.io/new_blog/2020/mar16.html
2020
Later among the works it cites.
Y. Ruan, S. Marsh, X. Xue, Z. Liu, and J. Wang, “The quantum approximate algorithm for solving traveling salesman problem,” Computers, Materials & Continua , vol. 63, no. 3, pp. 1237–1247, 2020. [Online]. Available: http://www.techscience.com/cmc/v63n3/38872
2020
Later among the works it cites.
L. Zhou, S.-T. Wang, S. Choi, H. Pichler, and M. D. Lukin, “Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices,” Physical Review X , vol. 10, no. 2, Jun 2020. [Online]. Available: http://dx.doi.org/10.1103/PhysRevX.10.021067
2020
Later among the works it cites.
M. Möller and M. Schalkers, “Libket: A cross-platform programming framework for quantum-accelerated scientific computing,” in Computational Science – ICCS 2020 , V. V. Krzhizhanovskaya, G. Závodszky, M. H. Lees, J. J. Dongarra, P. M. A. Sloot, S. Brissos, and J. Teixeira, Eds. Cham: Springer International Publishing, 2020, pp. 451–464
2020
Later among the works it cites.
Q. A. team and collaborators, “qsim,” Sep. 2020. [Online]. Available: https://doi.org/10.5281/zenodo.4023103
2020
Later among the works it cites.
LocalSolver, “Localsolver: Max cut,” 2020. [Online]. Available: https://www.localsolver.com/docs/last/exampletour/maxcut.html
2020
Later among the works it cites.
H. Philathong, V. N. Akshay, K. Samburskaya, and J. Biamonte, “Computational phase transitions: Benchmarking ising machines and quantum optimisers,” 2020
2020
Later among the works it cites.
T. Bergamaschi, “Quantum approximate optimization algorithms on the “traveling salesman problem”,” 2020, available: https://medium.com/mit-6-s089-intro-to-quantum-computing/quantum-approximate-optimization-algorithms-on-the-traveling-salesman-problem-703b8aee6624
2020
Later among the works it cites.
P. Vikstål, M. Grönkvist, M. Svensson, M. Andersson, G. Johansson, and G. Ferrini, “Applying the quantum approximate optimization algorithm to the tail-assignment problem,” Physical Review Applied , vol. 14, no. 3, p. 034009, 2020
2020
Later among the works it cites.
M. P. Quinones and C. Junqueira, “Tailored variational forms for certain linear inequality constraints in quadratic binary optimization problems,” 2020
2020
Later among the works it cites.
G. Pagano, A. Bapat, P. Becker, K. S. Collins, A. De, P. W. Hess, H. B. Kaplan, A. Kyprianidis, W. L. Tan, C. Baldwin, L. T. Brady, A. Deshpande, F. Liu, S. Jordan, A. V. Gorshkov, and C. Monroe, “Quantum approximate optimization of the long-range ising model with a trapped-ion quantum simulator,” 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
M. P. Harrigan and M. et al. optimization of non-planar graph problems on a planar superconducting processor,” Nature Physics , Feb 2021. [Online]. Available: https://doi.org/10.1038/s41567-020-01105-y
2021
Closest in time.
A. Li, S. Stein, S. Krishnamoorthy, and J. Ang, “Qasmbench: A low-level qasm benchmark suite for nisq evaluation and simulation,” 2021
2021
Closest in time.
T. Lubinski, S. Johri, P. Varosy, J. Coleman, L. Zhao, J. Necaise, C. H. Baldwin, K. Mayer, and T. Proctor, “Application-oriented performance benchmarks for quantum computing,” 2021
2021
Closest in time.
L. Bittel and M. Kliesch, “Training variational quantum algorithms is np-hard,” Physical Review Letters , vol. 127, no. 12, p. 120502, 2021
2021
Closest in time.
“Nlopt,” https://readthedocs.org/projects/nlopt/ , accessed: 2021-02-01
2021
Closest in time.
A. Sarkar, Z. Al-Ars, and K. Bertels, “Estimating algorithmic information using quantum computing for genomics applications,” 2021
2021
Closest in time.
V. Akshay, D. Rabinovich, E. Campos, and J. Biamonte, “Parameter concentrations in quantum approximate optimization,” Phys. Rev. A , vol. 104, p. L010401, Jul 2021. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.104.L010401
2021
Closest in time.
A. Galda, X. Liu, D. Lykov, Y. Alexeev, and I. Safro, “Transferability of optimal qaoa parameters between random graphs,” 2021
2021
Closest in time.
J. Choi, S. Oh, S. Park, J.-K. Kim, and J. Kim, “Proper cost hamiltonian design for combinatorial optimization problems: A boolean function approach,” in 2021 International Conference on Information Networking (ICOIN) , 2021, pp. 469–472
2021
Closest in time.