Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantum-inspired classification via efficient simulation of Helstrom measurement

Published 22 Mar 2024 in quant-ph, math-ph, and math.MP | (2403.15308v1)

Abstract: The Helstrom measurement (HM) is known to be the optimal strategy for distinguishing non-orthogonal quantum states with minimum error. Previously, a binary classifier based on classical simulation of the HM has been proposed. It was observed that using multiple copies of the sample data reduced the classification error. Nevertheless, the exponential growth in simulation runtime hindered a comprehensive investigation of the relationship between the number of copies and classification performance. We present an efficient simulation method for an arbitrary number of copies by utilizing the relationship between HM and state fidelity. Our method reveals that the classification performance does not improve monotonically with the number of data copies. Instead, it needs to be treated as a hyperparameter subject to optimization, achievable only through the method proposed in this work. We present a Quantum-Inspired Machine Learning binary classifier with excellent performance, providing such empirical evidence by benchmarking on eight datasets and comparing it with 13 hyperparameter optimized standard classifiers.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (25)
  1. P. Wittek, Quantum Machine Learning: What Quantum Computing Means to Data Mining (Academic Press, Boston, 2014).
  2. V. Dunjko and H. J. Briegel, Reports on Progress in Physics 81, 074001 (2018).
  3. M. Schuld and F. Petruccione, Machine Learning with Quantum Computers, 2nd ed., Quantum Science and Technology (Springer International Publishing, 2021).
  4. C. W. Helstrom, Journal of Statistical Physics  (1969), 10.1007/BF01007479.
  5. J. Watrous, The Theory of Quantum Information (Cambridge University Press, 2018).
  6. J. Bae and L.-C. Kwek, Journal of Physics A: Mathematical and Theoretical 48, 083001 (2015).
  7. R. Giuntini, H. Freytes, D. K. Park, C. Blank, F. Holik, K. L. Chow,  and G. Sergioli, “Quantum state discrimination for supervised classification,”  (2021), arXiv:2104.00971 [quant-ph] .
  8. S. Lloyd, M. Schuld, A. Ijaz, J. Izaac,  and N. Killoran, “Quantum embeddings for machine learning,”  (2020), arXiv:2001.03622 [quant-ph] .
  9. R. LaRose and B. Coyle, Phys. Rev. A 102, 032420 (2020).
  10. T. Hur, I. F. Araujo,  and D. K. Park, “Neural quantum embedding: Pushing the limits of quantum supervised learning,”  (2023), arXiv:2311.11412 [quant-ph] .
  11. A. Barenco, A. Berthiaume, D. Deutsch, A. Ekert, R. Jozsa,  and C. Macchiavello, “Stabilisation of quantum computations by symmetrisation,”  (1996), arXiv:quant-ph/9604028 [quant-ph] .
  12. T. Chen and C. Guestrin, in Proceedings of the 22nd acm sigkdd international conference on knowledge discovery and data mining (2016) pp. 785–794.
  13. U. M. L. Repository, “Echocardiogram,”  (1989).
  14. U. M. L. Repository, “Hepatitis,”  (1988).
  15. K. N. Markelle Kelly, Rachel Longjohn, https://archive.ics.uci.edu  (2023).
  16. R. Fisher, “Iris,”  (1988).
  17. M. Little, “Parkinsons,” UCI Machine Learning Repository (2008), DOI: 10.24432/C59C74.
  18. U. M. L. Repository, “Wine,”  (1991).
  19. K. Napierala and J. Stefanowski, Journal of Intelligent Information Systems  (2016), 10.1007/s10844-015-0368-1.
  20. P. Hausladen and W. K. Wootters, Journal of Modern Optics 41, 2385 (1994), https://doi.org/10.1080/09500349414552221 .
  21. E. Z. Cruzeiro, C. D. Mol, S. Massar,  and S. Pironio, “Quantum-inspired classification based on quantum state discrimination,”  (2023), arXiv:2303.15353 [quant-ph] .
  22. H. He and E. A. Garcia, IEEE Transactions on Knowledge and Data Engineering 21, 1263 (2009).
  23. N. V. Chawla, “Data mining for imbalanced datasets: An overview,” in Data Mining and Knowledge Discovery Handbook, edited by O. Maimon and L. Rokach (Springer US, Boston, MA, 2005) pp. 853–867.
  24. D. R. Wilson and T. R. Martinez, JAIR  (1997).
  25. C. M. Bishop, Pattern Recognition and Machine Learning (Information Science and Statistics) (Springer-Verlag, Berlin, Heidelberg, 2006).
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.