Quantum Circuit for Random Forest Prediction
- URL: http://arxiv.org/abs/2312.16877v1
- Date: Thu, 28 Dec 2023 08:07:11 GMT
- Title: Quantum Circuit for Random Forest Prediction
- Authors: Liliia Safina, Kamil Khadieva, Ilnar Zinnatullina, and Aliya Khadieva
- Abstract summary: We present a quantum circuit for a binary classification prediction algorithm using a random forest model.
One of our goals is reducing the number of basic quantum gates (elementary gates)
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this work, we present a quantum circuit for a binary classification
prediction algorithm using a random forest model. The quantum prediction
algorithm is presented in our previous works. We construct a circuit and
implement it using qiskit tools (python module for quantum programming). One of
our goals is reducing the number of basic quantum gates (elementary gates). The
set of basic quantum gates which we use in this work consists of single-qubit
gates and a controlled NOT gate. The number of CNOT gates in our circuit is
estimated by $O(2^{n+2h+1})$ , when trivial circuit decomposition techniques
give $O(4^{|X|+n+h+2})$ CNOT gates, where $n$ is the number of trees in a
random forest model, $h$ is a tree height and $|X|$ is the length of attributes
of an input object $X$. The prediction process returns an index of the
corresponding class for the input $X$.
Related papers
- Quantum hashing algorithm implementation [0.0]
We implement a quantum hashing algorithm which is based on a fingerprinting technique presented by Ambainis and Frievalds, 1988, on gate-based quantum computers.
We consider 16-qubit and 27-qubit IBMQ computers with the special graphs of qubits representing nearest neighbor architecture that is not Linear Nearest Neighbor (LNN) one.
arXiv Detail & Related papers (2024-07-14T09:41:16Z) - Lower $T$-count with faster algorithms [3.129187821625805]
We contribute to the $T$-count reduction problem by proposing efficient $T$-counts with low execution times.
We greatly improve the complexity of TODD, an algorithm currently providing the best $T$-count reduction on various quantum circuits.
We propose another algorithm which has an even lower complexity and that achieves a better or equal $T$-count than the state of the art on most quantum circuits evaluated.
arXiv Detail & Related papers (2024-07-11T17:31:20Z) - Polynomial-depth quantum algorithm for computing matrix determinant [46.13392585104221]
We propose an algorithm for calculating the determinant of a square matrix, and construct a quantum circuit realizing it.
Each row of the matrix is encoded as a pure state of some quantum system.
The admitted matrix is therefore arbitrary up to the normalization of quantum states of those systems.
arXiv Detail & Related papers (2024-01-29T23:23:27Z) - Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
We simulate the logical Hadamard gate in the surface code under a circuit-level noise model.
Our paper is the first to do this for a unitary gate on a quantum error-correction code.
arXiv Detail & Related papers (2023-12-18T19:00:00Z) - Constant-depth circuits for Uniformly Controlled Gates and Boolean
functions with application to quantum memory circuits [42.979881926959486]
We propose two types of constant-depth constructions for implementing Uniformly Controlled Gates.
We obtain constant-depth circuits for the quantum counterparts of read-only and read-write memory devices.
arXiv Detail & Related papers (2023-08-16T17:54:56Z) - On the average-case complexity of learning output distributions of
quantum circuits [55.37943886895049]
We show that learning the output distributions of brickwork random quantum circuits is average-case hard in the statistical query model.
This learning model is widely used as an abstract computational model for most generic learning algorithms.
arXiv Detail & Related papers (2023-05-09T20:53:27Z) - Homomorphic Encryption of the k=2 Bernstein-Vazirani Algorithm [0.4511923587827301]
We find an application of this scheme to quantum homomorphic encryption (QHE) which is an important cryptographic technology useful for delegated quantum computation.
We develop QHE schemes with perfect security, $mathcalF$-homomorphism, no interaction between server and client, and quasi-compactness bounded by $O(M)$ where M is the number of gates $T$ in the circuit.
arXiv Detail & Related papers (2023-03-30T14:49:15Z) - $i$-QER: An Intelligent Approach towards Quantum Error Reduction [5.055934439032756]
We introduce $i$-QER, a scalable machine learning-based approach to evaluate errors in a quantum circuit.
The $i$-QER predicts possible errors in a given quantum circuit using supervised learning models.
It cuts the large quantum circuit into two smaller sub-circuits using an error-influenced fragmentation strategy.
arXiv Detail & Related papers (2021-10-12T20:45:03Z) - Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task.
Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate.
The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
arXiv Detail & Related papers (2021-06-06T13:15:25Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05: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.