Scalable Quantum State Preparation for Encoding Genomic Data with Matrix Product States

• URL: http://arxiv.org/abs/2508.06184v1
• Date: Fri, 08 Aug 2025 10:02:53 GMT
• Title: Scalable Quantum State Preparation for Encoding Genomic Data with Matrix Product States
• Authors: Floyd M. Creevey, Hitham T. Hassan, James McCafferty, Lloyd C. L. Hollenberg, Sergii Strelchuk,
• Abstract summary: This study presents a method for producing scalable quantum circuits to encode genomic data using the Matrix Product State (MPS) formalism.<n>The method is illustrated by encoding the genome of the bacteriophage $Phi X174$ into a 15-qubit state, and analysing the trade-offs between MPS bond dimension, reconstruction error, and the resulting circuit complexity.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As quantum computing hardware advances, the need for algorithms that facilitate the loading of classical data into the quantum states of these devices has become increasingly important. This study presents a method for producing scalable quantum circuits to encode genomic data using the Matrix Product State (MPS) formalism. The method is illustrated by encoding the genome of the bacteriophage $\Phi X174$ into a 15-qubit state, and analysing the trade-offs between MPS bond dimension, reconstruction error, and the resulting circuit complexity. This study proposes methods for optimising encoding circuits with standard benchmark datasets for the emerging field of quantum bioinformatics. The results for circuit generation and simulation on HPC and on current quantum hardware demonstrate the viability and utility of the encoding.

Related papers

• Efficient State Preparation for Quantum Machine Learning [0.8609132348927196]
  We introduce the Matrix Product State representation of quantum systems.<n>We show how it may be used to construct circuits which encode a desired state.<n>This encoding does not hinder classification accuracy and is indeed exhibits an increased robustness against classical adversarial attacks.
  arXiv  Detail & Related papers  (2026-01-14T10:43:50Z)
• Implementation of a quantum sequence alignment algorithm for quantum bioinformatics [0.0]
  The paper adapts the original QSA algorithm proposed in 2000 to current capabilities and limitations of NISQ-era quantum computers.<n>The implementation is tested in a simulated quantum computer environment to validate the approach and refine the GASP data-loading circuit designs.
  arXiv  Detail & Related papers  (2025-06-28T06:31:24Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Minimal Quantum Reservoirs with Hamiltonian Encoding [72.27323884094953]
  We investigate a minimal architecture for quantum reservoir computing based on Hamiltonian encoding.<n>This approach circumvents many of the experimental overheads typically associated with quantum machine learning.
  arXiv  Detail & Related papers  (2025-05-28T16:50:05Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks.<n>We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings.<n>We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Classification of the Fashion-MNIST Dataset on a Quantum Computer [0.0]
  Conventional methods for encoding classical data into quantum computers are too costly and limit the scale of feasible experiments on current hardware. We propose an improved variational algorithm that prepares the encoded data using circuits that fit the native gate set and topology of currently available quantum computers. We deploy simple quantum variational classifiers trained on the encoded dataset on a current quantum computer ibmq-kolkata and achieve moderate accuracies.
  arXiv  Detail & Related papers  (2024-03-04T19:01:14Z)
• KetGPT -- Dataset Augmentation of Quantum Circuits using Transformers [1.236829197968612]
  Quantum algorithms, represented as quantum circuits, can be used as benchmarks for assessing the performance of quantum systems. Random circuits are, however, not representative benchmarks as they lack the inherent properties of real quantum algorithms. This research aims to enhance the existing quantum circuit datasets by generating what we refer to as realistic-looking' circuits.
  arXiv  Detail & Related papers  (2024-02-20T20:02:21Z)
• Drastic Circuit Depth Reductions with Preserved Adversarial Robustness by Approximate Encoding for Quantum Machine Learning [0.5181797490530444]
  We implement methods for the efficient preparation of quantum states representing encoded image data using variational, genetic and matrix product state based algorithms. Results show that these methods can approximately prepare states to a level suitable for QML using circuits two orders of magnitude shallower than a standard state preparation implementation.
  arXiv  Detail & Related papers  (2023-09-18T01:49:36Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.