Quantum Algorithms for State Preparation and Data Classification based on Stabilizer Codes

• URL: http://arxiv.org/abs/2309.10087v1
• Date: Mon, 18 Sep 2023 19:02:54 GMT
• Title: Quantum Algorithms for State Preparation and Data Classification based on Stabilizer Codes
• Authors: Pejman Jouzdani, H. Arslan Hashim, and Eduardo R. Mucciolo
• Abstract summary: We propose a prototype quantum circuit model for classification of classical data. A quantum neural network (QNN) layer is realized by a stabilizer code which consists of many stabilizers. We also consider the first challenge to most applications of quantum computers, including data classification.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum error correction (QEC) is a way to protect quantum information against noise. It consists of encoding input information into entangled quantum states known as the code space. Furthermore, to classify if the encoded information is corrupted or intact, a step known as syndrome detection is performed. For stabilizer codes, this step consists of measuring a set of stabilizer operators. In this paper, inspired by the QEC approach, and specifically stabilizer codes, we propose a prototype quantum circuit model for classification of classical data. The core quantum circuit can be considered as a \emph{quantum perceptron} where the classification is based on syndrome detection. In this proposal, a quantum perceptron is realized by one stabilizer as part of a stabilizer code, while a quantum neural network (QNN) layer is realized by a stabilizer code which consists of many stabilizers. The concatenation of stabilizer codes results in complex QNNs. The QNN is trained by performing measurements and optimization of a set of parameterized stabilizers. We demonstrate the concept numerically. In this paper we also consider the first challenge to most applications of quantum computers, including data classification, which is to load data into the memory of the quantum computer. This loading amounts to representing the data as a quantum state, i.e., quantum state preparation. An exact amplitude encoding algorithm requires a circuit of exponential depth. We introduce an alternative recursive algorithm which approximates amplitude encoding with only a polynomial number of elementary gates. We name it recursive approximate-scheme algorithm (RASA).

Related papers

• On the practicality of quantum sieving algorithms for the shortest vector problem [42.70026220176376]
  lattice-based cryptography is one of the main candidates of post-quantum cryptography. cryptographic security against quantum attackers is based on lattice problems like the shortest vector problem (SVP) Asymptotic quantum speedups for solving SVP are known and rely on Grover's search.
  arXiv  Detail & Related papers  (2024-10-17T16:54:41Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Variational Quantum Eigensolver for Classification in Credit Sales Risk [0.5524804393257919]
  We take into consideration a quantum circuit which is based on the Variational Quantum Eigensolver (VQE) and so-called SWAP-Test. In the utilized data set, two classes may be observed -- cases with low and high credit risk. The solution is compact and requires only logarithmically increasing number of qubits.
  arXiv  Detail & Related papers  (2023-03-05T23:08:39Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Quantum Entanglement with Self-stabilizing Token Ring for Fault-tolerant Distributed Quantum Computing System [0.0]
  This paper shows how to construct quantum entanglement states of n qubits based on a self-stabilizing token ring algorithm. The entangled states can be applied to the fields of the quantum network, quantum Internet, distributed quantum computing, and quantum cloud.
  arXiv  Detail & Related papers  (2022-09-23T01:20:36Z)
• 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)
• An Optimized Quantum Implementation of ISD on Scalable Quantum Resources [2.274915755738124]
  We show that Prange's ISD algorithm can be implemented rather efficiently on a quantum computer. We leverage the idea of classical co-processors to design hybrid classical-quantum trade-offs.
  arXiv  Detail & Related papers  (2021-12-12T06:01:10Z)
• Single-preparation unsupervised quantum machine learning: concepts and applications [1.7056768055368385]
  We first analyze the connections between all problems, in the classical and quantum frameworks. We then focus on their most challenging versions, involving quantum data and/or quantum processing means. We propose the quite general concept of SIngle-Preparation Quantum Information Processing.
  arXiv  Detail & Related papers  (2021-01-05T10:31:05Z)
• Supervised Learning Using a Dressed Quantum Network with "Super Compressed Encoding": Algorithm and Quantum-Hardware-Based Implementation [7.599675376503671]
  Implementation of variational Quantum Machine Learning (QML) algorithms on Noisy Intermediate-Scale Quantum (NISQ) devices has issues related to the high number of qubits needed and the noise associated with multi-qubit gates. We propose a variational QML algorithm using a dressed quantum network to address these issues. Unlike in most other existing QML algorithms, our quantum circuit consists only of single-qubit gates, making it robust against noise.
  arXiv  Detail & Related papers  (2020-07-20T16:29:32Z)
• 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.