It remains unclear whether quantum machine learning (QML) has real advantages when dealing with practical and meaningful tasks. Encoding classical data into quantum states is one of the key steps in QML. Amplitude encoding has been widely used owing to its remarkable efficiency in encoding a number of 2n classical data into n qubits simultaneously. However, the theoretical impact of amplitude encoding on QML has not been thoroughly investigated. In this work we prove that under some broad and typical data assumptions, the average of encoded quantum states via amplitude encoding tends to concentrate towards a specific state. This concentration phenomenon severely constrains the capability of quantum classifiers as it leads to a loss barrier phenomenon, namely, the loss function has a lower bound that cannot be improved by any optimization algorithm. In addition, via numerical simulations, we reveal a counterintuitive phenomenon of amplitude encoding: as the amount of training data increases, the training error may increase rather than decrease, leading to reduced decrease in prediction accuracy on new data. Our results highlight the limitations of amplitude encoding in QML and indicate that more efforts should be devoted to finding more efficient encoding strategies to unlock the full potential of QML.
Abstract We present an improved version of a quantum amplitude encoding scheme that encodes the N entries of a unit classical vector v=(v1,..,vN) v = ( v 1 , . . , v N ) into the amplitudes of a quantum state. Our approach has a quadratic speed-up with respect to the original one. We also describe several generalizations, including to complex entries of the input vector and a parameter M that determines the parallelization. The number of qubits required for the state preparation scales as O(MlogN) O ( M log N ) . The runtime, which depends on the data density ρ and on the parallelization paramater M , scales as O(ρ1MNlog(M+1)) O ( 1 ρ N M log ( M + 1 ) ) , which in the most parallel version ( M=N M = N ) is always less or equal than O(NlogN) O ( N log N ) . By analysing the data density, we prove that the average runtime is O(log1.5N) O ( log 1.5 N ) for input vectors that are uniformly sampled on the N -sphere. We present numerical evidence that this favourable runtime behaviour also holds for real-world data, such as radar satellite images. This is promising as it allows for an input-to-output advantage of the quantum Fourier transform.
Quantum computers can handle integer factorization and discrete logarithms more efficiently than their classical counterparts, which poses a threat to classical publickey cryptography. Also, quantum encryption systems and postquantum cryptography are gaining increasing attention due to the data vulnerability of classical systems. Hence, quantumnative encryption schemes are urgently needed. This work utilizes Quantum Permutation Pad (QPP), and it can be considered as an enhanced quantum extension of One Time Pad. A 2-qubit QPP is used to encrypt and decrypt an audio file using lowdepth gate permutations. The data file is segmented into 4bit blocks, each block is encoded as quantum states by using both basis and amplitude encoding, then encrypted with 2-qubit permutation circuits (depth≤5). The key needed for the permutation index is distributed by using the Greenberger-Horne-Zeilinger (GHZ)-based Quantum Secret Sharing scheme prior to the encoding stage. IBM Qiskit simulations showed that QPP can be a lightweight encryption scheme for NISQ devices.