Quick Navigation

Topics

Quantum Optimization Quantum Machine Learning

Global Optimum Search in Quantum Deep Learning

arXiv
Authors: Lanston Hau Man Chu, Tejas Bhojraj, Rui Huang

Year

2020

Paper ID

21603

Status

Preprint

Abstract Read

~2 min

Abstract Words

67

Citations

N/A

Abstract

This paper aims to solve machine learning optimization problem by using quantum circuit. Two approaches, namely the average approach and the Partial Swap Test Cut-off method (PSTC) was proposed to search for the global minimum/maximum of two different objective functions. The current cost is O\(sqrt{|Θ|} N\), but there is potential to improve PSTC further to O\(sqrt{|Θ|} cdot sublinear \ N\) by enhancing the checking process.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #21603 #67338 Provably Quantum-Secure Microgr... #67328 Faster and Better Quantum Softw... #67313 Digitized Counterdiabatic Quant... #67310 Women for Quantum -- Manifesto ...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.