Quantum-parallel vectorized data encodings and computations on
trapped-ions and transmons QPUs
- URL: http://arxiv.org/abs/2301.07841v1
- Date: Thu, 19 Jan 2023 01:26:32 GMT
- Title: Quantum-parallel vectorized data encodings and computations on
trapped-ions and transmons QPUs
- Authors: Jan Balewski, Mercy G. Amankwah, Roel Van Beeumen, E. Wes Bethel,
Talita Perciano, Daan Camps
- Abstract summary: We introduce two new data encoding schemes, QCrank and QBArt.
QCrank encodes a sequence of real-valued data as rotations of the data qubits, allowing for high storage density.
QBArt embeds a binary representation of the data in the computational basis, requiring fewer quantum measurements.
- Score: 0.3262230127283452
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Compact quantum data representations are essential to the emerging field of
quantum algorithms for data analysis. We introduce two new data encoding
schemes, QCrank and QBArt, which have a high degree of quantum parallelism
through uniformly controlled rotation gates. QCrank encodes a sequence of
real-valued data as rotations of the data qubits, allowing for high storage
density. QBArt directly embeds a binary representation of the data in the
computational basis, requiring fewer quantum measurements and lending itself to
well-understood arithmetic operations on binary data. We present several
applications of the proposed encodings for different types of data. We
demonstrate quantum algorithms for DNA pattern matching, Hamming weight
calculation, complex value conjugation, and retrieving an O(400) bits image,
all executed on the Quantinuum QPU. Finally, we use various cloud-accessible
QPUs, including IBMQ and IonQ, to perform additional benchmarking experiments.
Related papers
- Supervised binary classification of small-scale digits images with a trapped-ion quantum processor [56.089799129458875]
We show that a quantum processor can correctly solve the basic classification task considered.
With the increase of the capabilities quantum processors, they can become a useful tool for machine learning.
arXiv Detail & Related papers (2024-06-17T18:20:51Z) - Quantum Resonant Dimensionality Reduction and Its Application in Quantum Machine Learning [2.7119354495508787]
We propose a quantum resonant dimension reduction (QRDR) algorithm based on the quantum resonant transition to reduce the dimension of input data.
After QRDR, the dimension of input data $N$ can be reduced into desired scale $R$, and the effective information of the original data will be preserved.
Our algorithm has the potential to be utilized in a variety of computing fields.
arXiv Detail & Related papers (2024-05-21T09:26:18Z) - Quadratic speed-ups in quantum kernelized binary classification [1.3812010983144802]
Several quantum machine learning algorithms that use quantum kernels as a measure of similarities between data have emerged to perform binary classification on datasets encoded as quantum states.
We propose new quantum circuits for the QKCs in which the number of qubits is reduced by one, and the circuit depth is reduced linearly with respect to the number of sample data.
We verify the quadratic speed-up over previous methods through numerical simulations on the Iris dataset.
arXiv Detail & Related papers (2024-03-26T07:39:48Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Quantum Imitation Learning [74.15588381240795]
We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL.
We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL)
Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
arXiv Detail & Related papers (2023-04-04T12:47:35Z) - Delegated variational quantum algorithms based on quantum homomorphic
encryption [69.50567607858659]
Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices.
The private data of clients may be leaked to quantum servers in such a quantum cloud model.
A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
arXiv Detail & Related papers (2023-01-25T07:00:13Z) - Iterative Qubits Management for Quantum Index Searching in a Hybrid
System [56.39703478198019]
IQuCS aims at index searching and counting in a quantum-classical hybrid system.
We implement IQuCS with Qiskit and conduct intensive experiments.
Results demonstrate that it reduces qubits consumption by up to 66.2%.
arXiv Detail & Related papers (2022-09-22T21:54:28Z) - Compact quantum kernel-based binary classifier [2.0684234025249717]
We present the simplest quantum circuit for constructing a kernel-based binary classifier.
The number of qubits is reduced by two and the number of steps is reduced linearly.
Our design also provides a straightforward way to handle an imbalanced data set.
arXiv Detail & Related papers (2022-02-04T14:30:53Z) - Investigation of Quantum Support Vector Machine for Classification in
NISQ era [0.0]
We investigate quantum support vector machine (QSVM) algorithm and its circuit version on present quantum computers.
We compute the efficiency of the QSVM circuit implementation method by encoding training and testing data sample in quantum circuits.
We highlight the technical difficulties one would face while applying the QSVM algorithm on current NISQ era devices.
arXiv Detail & Related papers (2021-12-13T18:59:39Z) - Benchmarking Small-Scale Quantum Devices on Computing Graph Edit
Distance [52.77024349608834]
Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical.
In this paper we present a comparative study of two quantum approaches to computing GED.
arXiv Detail & Related papers (2021-11-19T12:35:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.