Fetching the paper…
Reading the bibliography…
Quantum error mitigation (QEM) is a class of promising techniques capable of reducing the computational error of variational quantum algorithms tailored for current noisy intermediate-scale quantum computers.
1909
Earlier work this paper cites.
M. A. Hanson, “On sufficiency of the Kuhn-Tucker conditions,” J. Math. Analysis and Applications , vol. 80, no. 2, pp. 545–550, Apr. 1981
1981
Earlier work this paper cites.
S. M. Kay, Fundamentals of statistical signal processing: Estimation theory , 1st ed. Prentice-Hall, Inc., 1993
1993
Earlier work this paper cites.
P. W. Shor, “Algorithms for quantum computation: Discrete logarithms and factoring,” in Proc. 35th Annual Symp. Foundations of Computer Science , Santa Fe, New Mexico, USA, Nov. 1994, pp. 124–134
1994
Earlier work this paper cites.
J. J. Moré and D. J. Thuente, “Line search algorithms with guaranteed sufficient decrease,” ACM Trans. Math. Software (TOMS) , vol. 20, no. 3, pp. 286–307, Sep. 1994
1994
Earlier work this paper cites.
L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proc. 28th Annual ACM Symp. Theory of Computing , Philadelphia, Pennsylvania, USA, May 1996, pp. 212–219
1996
Earlier work this paper cites.
G. Brassard and P. Hoyer, “An exact quantum polynomial-time algorithm for Simon’s problem,” in Proc. 5th Israeli Symp. Theory Comput. Syst. Ramat-Gan, Israel: IEEE, Jun. 1997, pp. 12–23
1997
Earlier work this paper cites.
A. R. Calderbank, E. M. Rains, P. M. Shor, and N. J. A. Sloane, “Quantum error correction via codes over GF ( 4 ) (4) ,” IEEE Trans. Inf. Theory , vol. 44, no. 4, pp. 1369–1387, Jul. 1998
1998
Earlier work this paper cites.
C. H. Bennett and P. W. Shor, “Quantum information theory,” IEEE Trans. Inf. Theory , vol. 44, no. 6, pp. 2724–2742, Oct. 1998
1998
Earlier work this paper cites.
L. K. Grover, “Quantum computers can search rapidly by using almost any transformation,” Phys. Rev. Lett. , vol. 80, no. 19, p. 4329, 1998
1998
Earlier work this paper cites.
S. Verdu et al. , Multiuser detection . Cambridge university press, 1998
1998
Earlier work this paper cites.
M. A. Hanson, “Invexity and the Kuhn-Tucker theorem,” J. Math. Analysis and Applications , vol. 236, no. 2, pp. 594–604, Aug. 1999
1999
Earlier work this paper cites.
H. Buhrman, R. Cleve, J. Watrous, and R. De Wolf, “Quantum fingerprinting,” Phys. Rev. Lett. , vol. 87, no. 16, p. 167902, Sep. 2001
2001
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, “A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem,” Science , vol. 292, no. 5516, pp. 472–475, 2001
2001
Earlier work this paper cites.
A. K. Ekert, C. M. Alves, D. K. L. Oi, M. Horodecki, P. Horodecki, and L. C. Kwek, “Direct estimations of linear and nonlinear functionals of a quantum state,” Phys. Rev. Lett. , vol. 88, p. 217901, May 2002
2002
Earlier work this paper cites.
M. Van Hoeij, “Factoring polynomials and the knapsack problem,” J. Number theory , vol. 95, no. 2, pp. 167–189, Aug. 2002
2002
Earlier work this paper cites.
S. Boyd, S. P. Boyd, and L. Vandenberghe, Convex optimization . Cambridge university press, 2004
2004
Earlier work this paper cites.
2005
Earlier work this paper cites.
2007
Earlier work this paper cites.
D. Aharonov and M. Ben-Or, “Fault-tolerant quantum computation with constant error rate,” SIAM J. Comput. , vol. 38, no. 4, p. 1207–1282, Jul. 2008
2008
Cited alongside, same era.
2010
Cited alongside, same era.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information , 2nd ed. New York, NY, USA: Cambridge University Press, 2011
2011
Cited alongside, same era.
2011
Cited alongside, same era.
N. Moll, P. Barkoutsos, L. S. Bishop et al. , “Quantum optimization using variational algorithms on near-term quantum devices,” Quantum Science and Technology , vol. 3, no. 3, pp. 1–17, Jun. 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
S. Endo, S. C. Benjamin, and Y. Li, “Practical quantum error mitigation for near-future applications,” Phys. Rev. X , vol. 8, no. 3, pp. 1–21, Jul. 2018
2018
Later among the works it cites.
X. Bonet-Monroig, R. Sagastizabal, M. Singh, and T. E. O’Brien, “Low-cost error mitigation by symmetry verification,” Phys. Rev. A , vol. 98, no. 6, p. 062339, Dec. 2018
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
Z. Babar, S. X. Ng, and L. Hanzo, “Near-capacity code design for entanglement-assisted classical communication over quantum depolarizing channels,” IEEE Trans. Commun. , vol. 61, no. 12, pp. 4801–4807, Dec. 2013
2013
Cited alongside, same era.
D. Pastor and Q.-T. Nguyen, “Random distortion testing and optimality of thresholding tests,” IEEE Trans. Signal Process. , vol. 61, no. 16, pp. 4161–4171, 2013
2013
Cited alongside, same era.
M. Syed, P. Pardalos, and J. Principe, “Invexity of the minimum error entropy criterion,” IEEE Signal Process. Lett. , vol. 20, no. 12, pp. 1159–1162, Dec. 2013
2013
Cited alongside, same era.
P. Botsinis, S. X. Ng, and L. Hanzo, “Fixed-complexity quantum-assisted multi-user detection for CDMA and SDMA,” IEEE Trans. Commun. , vol. 62, no. 3, pp. 990–1000, Mar. 2014
2014
Cited alongside, same era.
P. J. Love, J. L. O’Brien, A. Aspuru-Guzik, A. Peruzzo, M.-h. Yung, X.-Q. Zhou, P. Shadbolt, and J. McClean, “A variational eigenvalue solver on a photonic quantum processor,” Nature Commun. , vol. 5, no. 1, pp. 1–7, Jul. 2014
2014
Cited alongside, same era.
2014
Cited alongside, same era.
M. Wildemeersch, T. Q. S. Quek, M. Kountouris, A. Rabbachin, and C. H. Slump, “Successive interference cancellation in heterogeneous networks,” IEEE Trans. Commun. , vol. 62, no. 12, pp. 4440–4453, Dec. 2014
2014
Cited alongside, same era.
2018
Later among the works it cites.
F. Arute, K. Arya, R. Babbush et al. , “Quantum supremacy using a programmable superconducting processor,” Nature , vol. 574, no. 7779, pp. 505–510, Oct. 2019
2019
Later among the works it cites.
Z. Babar, D. Chandra, H. V. Nguyen, P. Botsinis, D. Alanis, S. X. Ng, and L. Hanzo, “Duality of quantum and classical error correction codes: Design principles and examples,” IEEE Commun. Surv. Tuts. , vol. 21, no. 1, pp. 970–1010, 1st quart. 2019
2019
Later among the works it cites.
C. Song, J. Cui, H. Wang, J. Hao, H. Feng, and Y. Li, “Quantum computation with universal error mitigation on a superconducting quantum processor,” Science Advances , vol. 5, no. 9, 2019
2019
Later among the works it cites.
R. Sagastizabal, X. Bonet-Monroig, M. Singh, M. A. Rol, C. Bultink, X. Fu, C. Price, V. Ostroukh, N. Muthusubramanian, A. Bruno et al. , “Experimental error mitigation via symmetry verification in a variational quantum eigensolver,” Phys. Rev. A , vol. 100, no. 1, p. 010302, Jan. 2019
2019
Later among the works it cites.
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, pp. 1–45, Feb. 2019
2019
Later among the works it cites.
C.-F. Liu, M. Bennis, M. Debbah, and H. V. Poor, “Dynamic task offloading and resource allocation for ultra-reliable low-latency edge computing,” IEEE Trans. Commun. , vol. 67, no. 6, pp. 4132–4150, Jun. 2019
2019
Later among the works it cites.
H.-S. Zhong, H. Wang, Y.-H. Deng, M.-C. Chen, L.-C. Peng, Y.-H. Luo, J. Qin, D. Wu, X. Ding, Y. Hu, P. Hu, X.-Y. Yang, W.-J. Zhang, H. Li, Y. Li, X. Jiang, L. Gan, G. Yang, L. You, Z. Wang, L. Li, N.-L. Liu, C.-Y. Lu, and J.-W. Pan, “Quantum computational advantage using photons,” Science , vol. 370, no. 6523, pp. 1460–1463, 2020
2020
Later among the works it cites.
A. Lowe, M. H. Gordon, P. Czarnik, A. Arrasmith, P. J. Coles, and L. Cincio, “Unified approach to data-driven quantum error mitigation,” Phys. Rev. Research , vol. 3, no. 3, p. 033098, Jul. 2021
2021
Closest in time.
B. Koczor, “Exponential error suppression for near-term quantum devices,” Phys. Rev. X , vol. 11, p. 031057, Sep. 2021
2021
Closest in time.
2021
Closest in time.
S. Endo, Z. Cai, S. C. Benjamin, and X. Yuan, “Hybrid quantum-classical algorithms and quantum error mitigation,” J. Phys. Society Japan , vol. 90, no. 3, p. 032001, Feb. 2021
2021
Closest in time.
A. Uvarov and J. Biamonte, “On barren plateaus and cost function locality in variational quantum algorithms,” Journal of Physics A: Mathematical and Theoretical , Apr. 2021
2021
Closest in time.