Extending the Q-score to an Application-level Quantum Metric Framework

P. Erdös and A. Rényi, “On random graphs,” Publ. Math. Debrecen , vol. 6, pp. 290–297, 1959. [Online]. Available: https://api.semanticscholar.org/CorpusID:253789267

1959

Earlier work this paper cites.

P. Erdős and A. Rényi, “On the evolution of random graphs,” Publ. Math. Inst. Hung. Acad. Sci , vol. 5, no. 1, pp. 17–60, 1960. [Online]. Available: https://doi.org/10.1515/9781400841356.38

1960

Earlier work this paper cites.

D. W. Matula, “The largest clique size in a random graph,” Department of Computer Science, Southern Methodist University Dallas, Texas, Tech. Rep., 1976

1976

Earlier work this paper cites.

F. Glover, “Tabu search—part I,” ORSA Journal on Computing , vol. 1, no. 3, pp. 190–206, Aug. 1989. [Online]. Available: https://doi.org/10.1287/ijoc.1.3.190

1989

Earlier work this paper cites.

——, “Tabu search—part II,” ORSA Journal on Computing , vol. 2, no. 1, pp. 4–32, Feb. 1990. [Online]. Available: https://doi.org/10.1287/ijoc.2.1.4

1990

Earlier work this paper cites.

J. I. Cirac and P. Zoller, “Quantum computations with cold trapped ions,” Phys. Rev. Lett. , vol. 74, pp. 4091–4094, May 1995. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.74.4091

1995

Earlier work this paper cites.

A. Y. Kitaev, “Quantum computations: algorithms and error correction,” Russian Mathematical Surveys , vol. 52, no. 6, pp. 1191–1249, Dec. 1997. [Online]. Available: https://doi.org/10.1070/rm1997v052n06abeh002155

1997

Earlier work this paper cites.

T. Kadowaki and H. Nishimori, “Quantum annealing in the transverse Ising model,” Phys. Rev. E , vol. 58, pp. 5355–5363, Nov 1998. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevE.58.5355

1998

Earlier work this paper cites.

E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, “Quantum computation by adiabatic evolution,” 2000

2000

Earlier work this paper cites.

D. Aharonov, “A simple proof that Toffoli and Hadamard are quantum universal,” 2003. [Online]. Available: https://arxiv.org/abs/quant-ph/0301040

2003

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, pp. S347–S352, Sep. 2005. [Online]. Available: https://doi.org/10.1088/1464-4266/7/10/021

2005

Earlier work this paper cites.

D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev, “Adiabatic quantum computation is equivalent to standard quantum computation,” SIAM Journal on Computing , vol. 37, no. 1, pp. 166–194, Jan. 2007. [Online]. Available: https://doi.org/10.1137/s0097539705447323

2007

Earlier work this paper cites.

V. E. Manucharyan, J. Koch, L. I. Glazman, and M. H. Devoret, “Fluxonium: Single Cooper-pair circuit free of charge offsets,” Science , vol. 326, no. 5949, pp. 113–116, 2009. [Online]. Available: https://www.science.org/doi/abs/10.1126/science.1175552

2009

Earlier work this paper cites.

A. A. Houck, J. Koch, M. H. Devoret, S. M. Girvin, and R. J. Schoelkopf, “Life after charge noise: recent results with transmon qubits,” Quantum Information Processing , vol. 8, no. 2-3, pp. 105–115, Feb. 2009. [Online]. Available: https://doi.org/10.1007/s11128-009-0100-6

2009

Earlier work this paper cites.

A. Politi, J. Matthews, M. Thompson, and J. O'Brien, “Integrated quantum photonics,” IEEE Journal of Selected Topics in Quantum Electronics , vol. 15, no. 6, pp. 1673–1684, 2009. [Online]. Available: https://doi.org/10.1109/jstqe.2009.2026060

2009

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,” Phys. Rev. A , vol. 80, p. 012304, Jul 2009. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.80.012304

2009

Cited alongside, same era.

J. M. Chow, J. M. Gambetta, A. D. Córcoles, S. T. Merkel, J. A. Smolin, C. Rigetti, S. Poletto, G. A. Keefe, M. B. Rothwell, J. R. Rozen, M. B. Ketchen, and M. Steffen, “Universal quantum gate set approaching fault-tolerant thresholds with superconducting qubits,” Phys. Rev. Lett. , vol. 109, p. 060501, Aug 2012. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.109.060501

2012

Cited alongside, same era.

R. Barends, J. Kelly, A. Megrant, D. Sank, E. Jeffrey, Y. Chen, Y. Yin, B. Chiaro, J. Mutus, C. Neill, P. O’Malley, P. Roushan, J. Wenner, T. C. White, A. N. Cleland, and J. M. Martinis, “Coherent Josephson qubit suitable for scalable quantum integrated circuits,” Phys. Rev. Lett. , vol. 111, p. 080502, Aug 2013. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.111.080502

2013

Cited alongside, same era.

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. [Online]. Available: https://arxiv.org/abs/2110.03137

Original

2021

Later among the works it cites.

S. Martiel, T. Ayral, and C. Allouche, “Benchmarking quantum coprocessors in an application-centric, hardware-agnostic, and scalable way,” IEEE Transactions on Quantum Engineering , vol. 2, p. 1–11, 2021. [Online]. Available: http://dx.doi.org/10.1109/TQE.2021.3090207

2021

Later among the works it cites.

Y. Dong and L. Lin, “Random circuit block-encoded matrix and a proposal of quantum linpack benchmark,” Physical Review A , vol. 103, no. 6, Jun. 2021. [Online]. Available: http://dx.doi.org/10.1103/PhysRevA.103.062412

2021

Later among the works it cites.

A. R. Haverly, “A comparison of quantum algorithms for the maximum clique problem,” Master’s thesis, Rochester Institute of Technology., 5 2021

2021

Later among the works it cites.