Abstract

With quantum computers entering a new phase of maturity and quantum algorithms covering a growing range of applications, it is important that the two meet at some point in the middle. Currently, the two meet only by toy-problem implementations for some algorithms. In this work, we extend a recently proposed distance-based classifier and give explicit quantum circuit implementations, and we give a method to overcome restrictions on the data, present in the original work.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.