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

Floyd M. Creevey; Hitham T. Hassan; James McCafferty; Lloyd C. L. Hollenberg; Sergii Strelchuk

REVIEW

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

Floyd M. Creevey, Hitham T. Hassan, James McCafferty, Lloyd C. L. Hollenberg, Sergii Strelchuk

Quantum Physics · Submitted 8 Aug 2025

Pith's verdict: A plausible but unverifiable application of known MPS-to-circuit data loading to genomics; the Phi X174 demo is the main artifact, and the missing genome-to-amplitude mapping is the load-bearing question.

T0 · AI review

How this review was made: An AI referee (deepseek-v4-flash) read the paper on August 5, 2026 and answered a fixed list of questions about it. T0 is the starting level every paper gets. The levels describe how deeply Pith has checked the paper, never the authors.

T0 AI review An AI read the paper and answered a fixed list of questions.
T1 Audit Automatic checks that the references and files the paper relies on exist and match.
T2 Compute The paper's code or calculations re-run with the same results.
T3 Formal statement The claims written out in a formal math language a computer can read.
T4 Proof Those claims proved, and the proof checked by computer.

How Pith checks papers →

· 3 major objections · 3 minor · Ask about this paper · The compiled record · Read the full review →

Challenge this review Comment (0) Read on arXiv ↗

Cite ▾

arXiv ID2508.06184 (version 2)

Pith IDOAYISZYA, Pith's permanent record of this paper and its review

CitationFloyd M. Creevey, Hitham T. Hassan, James McCafferty, Lloyd C. L. Hollenberg, Sergii Strelchuk. "Scalable Quantum State Preparation for Encoding Genomic Data with Matrix Product States." arXiv:2508.06184 (2025). https://pith.science/paper/OAYISZYA

Cite this reviewBibTeX for Pith's review of this paper

Claim paper

Why Pith says this

Highlight any text to comment on it.

Editor's note

read the letter

The abstract makes a modest, plausible claim: use the standard MPS formalism to convert a genomic sequence into a quantum circuit, with a trade-off analysis between bond dimension, reconstruction error, and circuit complexity. If the full text backs that up, it gives the quantum bioinformatics community a concrete benchmark recipe. The paper deserves credit for identifying a real bottleneck (classical data loading), for building on established MPS machinery rather than inventing new theory, and for proposing standardized benchmark datasets. The 15-qubit Phi X174 demonstration is a useful existence proof, and the authors are appropriately careful in their language—'illustrated,' 'proposes'—rather than overclaiming a breakthrough.

That said, the stress-test hits the right nerve. The abstract does not state how 5,386 base pairs of Phi X174 are mapped into the 32,768 amplitudes of a 15-qubit state. This is not a peripheral detail: the entire circuit is built for whatever vector that mapping produces. If the mapping is arbitrary, lossy, or chosen post hoc, then the demonstration reduces to generic MPS data loading on an arbitrary vector, and the word 'genomic' is decorative. The paper may still be correct, but the burden is on the full text to make the mapping explicit and justify its information-preserving character.

A second concern is the error metric. Reconstruction error must be measured against the exact target state defined by the mapping, not against the MPS approximation itself. The abstract doesn't clarify this, and it's essential for interpreting the reported trade-offs. Also, 15 qubits is small—enough for a proof of concept, but not enough to support the word 'scalable' without simulations at larger sizes. The hardware results are meaningless without context on device noise and error mitigation, which the abstract omits.

These concerns are real but not fatal. They are the kind of questions any competent referee would ask, and they are answerable in the full text. If the mapping and error definitions check out, this would be a worthwhile engineering contribution: not technically deep, but useful for practitioners who need a standard way to load genomic data. If the mapping turns out to be arbitrary, the paper becomes a benchmark artifact for MPS circuit synthesis, which is still something but much less interesting.

My recommendation: send this to peer review, not because the abstract proves anything, but because the claims are checkable and the application is timely. The referee should demand explicit specification of the mapping, the error definition, and evidence beyond 15 qubits. This is a solid candidate for a journal like Quantum Information Processing or similar, provided the full text delivers on what the abstract promises.

Referee report

Major objections (3)

[Abstract] The genome-to-amplitudes mapping is unspecified. Phi X174 has roughly 5,386 base pairs, which must be folded into the 32,768 amplitudes of a 15-qubit state. The information-preserving character of this mapping is load-bearing: if the mapping is lossy, non-injective, or chosen post hoc to yield an MPS-compressible vector, the 'genomic' aspect is decorative and the contribution reduces to generic MPS data loading. The full text must specify the mapping explicitly and justify that the target state faithfully encodes the genomic sequence.
[Abstract] The reconstruction error is not defined. For the trade-off claim to be meaningful, the error must be measured against the exact target state defined by the genome-to-amplitudes mapping, not against the MPS approximation itself. The abstract should state the error metric (e.g., fidelity, trace distance, or ℓ2 norm) and clarify whether it includes both MPS compression error and any additional errors from circuit synthesis or implementation. Without this, the claimed trade-off cannot be separated from trivial effects of changing bond dimension.
[Abstract] The hardware validation is stated only qualitatively. 'Demonstrate the viability and utility' requires quantitative evidence: circuit depth, number of CNOT gates, measured state fidelity or reconstruction error on the actual device, and comparison to the simulator baseline. None of these numbers are visible in the abstract. If the full text provides them, the abstract should summarize at least one representative fidelity figure; if it does not, the hardware claim is unsupported.

How Pith checks papers → · Full audit of this paper →

The paper

The paper claims

The paper claims that using the matrix product state formalism, a genomic sequence can be converted into a quantum circuit whose bond dimension directly controls the trade-off between reconstruction error and circuit complexity, demonstrate

The reading

The paper sets out to show that genomic data can be prepared as quantum states without brute-force circuit depth. Its route is the matrix product state (MPS) formalism, which compresses the target quantum state before decomposing it into a circuit. The demonstration encodes the Phi X174 genome into a 15-qubit state and examines how the MPS bond dimension governs reconstruction error and circuit complexity. The authors report circuit generation and simulation on HPC and on current quantum hardware, and propose the approach as a benchmarkable step for quantum bioinformatics. The reason to care: if this works, data loading for biological sequences becomes a tunable approximation problem rather than an all-or-nothing encoding.

What carries the argument

The central object is the matrix product state (MPS), a tensor-network representation of a quantum state as a chain of local tensors connected by bonds of a chosen dimension. It carries the argument by making compression quality and circuit cost both depend on one knob: the bond dimension. A small bond dimension yields shorter circuits and a coarser approximation; a larger one improves reconstruction at the price of more gates. The paper uses this knob to position each encoding instance on an error-versus-complexity curve.

Extended reading notes

Core claim

On its own terms, the paper's central discovery is that the matrix product state formalism supplies a controllable, scalable route from a genomic sequence to a quantum circuit. The construction fixes a bond dimension for the MPS approximation of the target state, then decomposes the tensor network into one- and two-qubit gates. Because the same bond dimension sets both the approximation error and the number of gates, the method turns data loading into a tuneable trade-off instead of a fixed-depth requirement. The Phi X174 genome, encoded in a 15-qubit state, is the concrete test case, with the paper reporting that circuit generation and simulation succeed both on HPC and on current quantum h

Load-bearing premise

The method only works as genomic encoding if the base sequence is translated into the numbers that define the quantum state in a way that truly keeps the sequence information; if that translation is arbitrary or lossy, the biological part is cosmetic.

Editorial extensions

If this is right

Genome encoding no longer needs circuit depth set by the number of bases; a chosen bond dimension yields a circuit of controlled size.
The Phi X174 15-qubit result provides a concrete benchmark where reconstruction error and gate count are measured as functions of bond dimension.
The MPS pipeline is generic to amplitude data, so other genomic sequences or biological datasets can be loaded through the same circuit-synthesis machinery.
Success on current quantum hardware indicates the approach is usable on near-term devices, not only on fault-tolerant quantum computers.
The paper's proposed role as a standard encoding step would make quantum bioinformatics datasets comparable across implementations.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The abstract leaves open how Phi X174's roughly 5,386 base pairs map onto the 32,768 amplitudes of a 15-qubit state; if the mapping is arbitrary, the biological framing is decorative and the contribution is generic MPS data loading.
A decisive check not visible in the abstract is whether reconstruction error is measured against the exact target state or only against the MPS approximation; these give different numbers when the bond dimension is finite.
The same bond-dimension trade-off could be explored with tree or hierarchical tensor networks, which may yield different error-versus-depth profiles with the same budget.
If the genome-to-amplitude map is chosen to preserve sequence similarity, the loaded states could eventually support quantum comparisons of genomes; this use is not argued in the paper.

Original 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.

The compiled record

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,275 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.38 · human participants 0.03 · controlled comparison 0.06 · randomized assignment 0.01 · states quantitative result 0.79 · compares with prior results 0.12 · mentions code or data availability 0.04.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; show every role.

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.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#	sentence	role	the authors' own work	states the main conclusion	strength
s0	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.	background 1.00	0.04	0.02	asserted 1.00
s1	This study presents a method for producing scalable quantum circuits to encode genomic data using the Matrix Product State (MPS) formalism.	contribution 0.99	0.92	0.16	asserted 1.00
s2	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.	method 0.63	0.95	0.11	asserted 1.00
s3	This study proposes methods for optimising encoding circuits with standard benchmark datasets for the emerging field of quantum bioinformatics.	contribution 0.90	0.70	0.09	asserted 0.90
s4	The results for circuit generation and simulation on HPC and on current quantum hardware demonstrate the viability and utility of the encoding.	result 0.53	0.93	0.68	asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 0.98.

What was examined, and what was not

sources read

arXiv listing abstract v2

not examined

full text
figures and tables
references and citing sentences
relations to other papers

levels run

P abstract

not run

S sections
T body sentences
C citations
R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

References

How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites · 13 sentences without a confident label

Uses the method or tool of 1 paper

The specific form of the MPS used is left-canonical MPS, i.e one for which all $U$ matrices obtained from the decomposition of the state are left-orthonormal, satisfying, [equation] The procedure for producing a left-canonical MPS is described in detail in Ref. [ref] , and is outlined in the Appendix.

The density-matrix renormalization group in the age of matrix product states · Representing quantum states as MPS · 0.91

Compares with 1 paper

The MPS technique produces circuits that scale better than using IBM Qiskit [ref] (v1.1.1) to produce circuits of equivalent algorithmic fidelities, as shown for genome reads up to the length of $ΦX174$ in Figure [ref].

Quantum computing with Qiskit · Circuit Generation and Simulation on HPC · 0.91

Discussion

Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.