Qubit
Qubit
| N | | ‘1’
0 1 CNOT 1
| | ‘1’
〉 〉 〉 1
0
| 〉 〉
01 0
〉0 0
1 0 0
0
0 0 0 0
0 0
1 1
0 0 1 0
0 0 0 1 CNOT =
σx I = 1 0 0 0 1 0 0 0
0 1 0 0 0 1 0 0
0 0 0 1
0 0 1 0
Quantum Computing Circuits
Transpilation
Quantum Amplitude Amplification
Primarily used in Grover search algorithm to find out a data item from unsorted
database in polynomial time within O(√N) iterations
- The prime example is the support-vector machine (SVM) which is a successful machine
learning estimator framework based on an efficient implementation of implicit feature
mapping using a kernel function.
- The kernel function is implemented as a function of the inner product of the base data
vectors, rather than a function of explicitly transformed feature vectors, in what is
called the "kernel trick".
- Quantum feature maps are an integral component in some QML that can be used in SVM
(typically called QSVM) and a variety of kernel-based estimators; variational quantum
algorithms and quantum neural networks.
- The goal QML is to discover quantum models that are capable of finding patterns in
data that are intractable to model using classical methods, leading to quantum
advantage (Biamonte 2018, Liu 2021).
- A step in this direction is to find quantum feature maps and kernels that are
inefficient to compute classically and are required for high model performance on
data patterns of sufficient complexity (Havlicek 2018).
ey, M.Ghosh, S.S. Kundu, & A. Chakrabarti, (2020). QDLC - The Quantum Development Life Cycle. ArXiv, abs/2010.08053.
Future Direction
Thank You!