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 $Φ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.
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 Φ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.
Preparing arbitrary quantum states requires exponential resources. Matrix Product States (MPS) admit more efficient constructions, particularly when accuracy is traded for circuit complexity. Existing approaches to MPS preparation mostly rely on heuristic circuits that are deterministic but quickly saturate in accuracy, or on variational optimization methods that reach high fidelities but scale poorly. This work introduces an end-to-end MPS preparation framework that combines the strengths of both strategies within a single pipeline. Heuristic staircase-like and brick wall disentangler circuits provide warm-start initializations for variational optimization, enabling high-fidelity state preparation for large systems. Target MPSs are either specified as physical quantum states or constructed from classical datasets via amplitude encoding, using step-by-step singular value decompositions or tensor cross interpolation. The framework incorporates entanglement-based qubit reordering, reformulated as a quadratic assignment problem, and low-level optimizations that reduce depths by up to 50% and CNOT counts by 33%. We evaluate the full pipeline on datasets of varying complexity across systems of 19-50 qubits and identify trade-offs between fidelity, gate count, and circuit depth. Optimized brick wall circuits typically achieve the lowest depths, while the optimized staircase-like circuits minimize gate counts. Overall, our results provide principled and scalable protocols for preparing MPSs as quantum circuits, supporting utility-scale applications on near-term quantum devices.
Abstract Preparing arbitrary quantum states requires exponential resources. Matrix product states (MPS) admit more efficient constructions, particularly when accuracy is traded for circuit complexity. Existing approaches to MPS preparation mostly rely on heuristic circuits that are deterministic but quickly saturate in accuracy, or on variational optimization methods that reach high fidelities but scale poorly. This work introduces an end-to-end MPS preparation framework that combines the strengths of both strategies within a single pipeline. Heuristic staircase-like and brick wall disentangler circuits provide warm-start initializations for variational optimization, enabling high-fidelity state preparation for large systems. Target MPSs are either specified as physical quantum states or constructed from classical datasets via amplitude encoding, using step-by-step singular value decompositions or tensor cross interpolation. The framework incorporates entanglement-based qubit reordering, reformulated as a quadratic assignment problem, and low-level optimizations that reduce depths by up to 50 % and CNOT counts by 33 % . We evaluate the full pipeline on datasets of varying complexity across systems of 19–50 qubits and identify trade-offs between fidelity, gate count, and circuit depth. Optimized brick wall circuits typically achieve the lowest depths, while the optimized staircase-like circuits minimize gate counts. Overall, our results provide principled and scalable protocols for preparing MPSs as quantum circuits, supporting utility-scale applications on near-term quantum devices.
Simulating quantum error correction (QEC) circuits including non-Clifford gates at scale is important to accelerate progress toward fault-tolerant quantum computing. Here we demonstrate that matrix product state (MPS) techniques can handle many QEC circuits exactly and without restriction on gate types. Crucially, we find that MPS efficiency depends sensitively on implementation choices, and we introduce a series of targeted optimizations that reduce bond dimensions and simulation time by several orders of magnitude compared to naive approaches. We illustrate this with examples including: (a) a rotated surface code quantum memory up to distance 11, (b) logical Bell-state preparation up to distance 9, (c) a 15-to-1 magic-state distillation circuit including hundreds of QEC rounds that we optimize to be simulated with only 11 logical qubits (187 physical qubits) and a maximal bond dimension of 64 in under 40 seconds, and (d) a narrow, deep random circuit that scales linearly with the number of T gates. These results demonstrate the importance of circuit-level optimizations and position MPS as a valuable complement to near-Clifford simulators for QEC circuits.
Efficient encoding of classical data into quantum circuits is a critical challenge that directly impacts the scalability of quantum algorithms. In this work, we present an automated compilation framework for resource-aware quantum data loading tailored to a given input vector and target error tolerance. By explicitly exploiting the trade-off between exact and approximate state preparation, our approach systematically partitions the total error budget between precision and approximation errors, thereby minimizing quantum resource costs. The framework supports a comprehensive suite of state-of-the-art methods, including multiplexer-based loaders, quantum read-only memory (QROM) constructions, sparse encodings, matrix product states (MPS), Fourier series loaders (FSL), and Walsh transform-based diagonal operators. We demonstrate the effectiveness of our framework across several applications, where it consistently uncovers non-obvious, resource-efficient strategies enabled by controlled approximation. In particular, we analyze a computational fluid dynamics workflow where the automated selection of MPS state preparation and Walsh transform-based encoding, combined with a novel Walsh-based measurement technique, leads to resource reductions of over four orders of magnitude compared to previous approaches. We also introduce two independent advances developed through the framework: a more efficient circuit for d-diagonal matrices, and an optimized block encoding for kinetic energy operators. Our results underscore the indispensable role of automated, approximation-aware compilation in making large-scale quantum algorithms feasible on resource-constrained hardware.
Data encoding is a key step in almost all ap-plications of quantum computation, but one that is not very well understood in general. Extensively researched in quantum machine learning, it is pivotal to exploiting the speedups offered by quantum algorithms. Failure to efficiently represent data risks weakening or nullifying prospective quantum advantages. While naive methods, such as basis encoding, will almost always work, they are extremely inefficient in terms of qubit use, rendering them infeasible for near-term applications. We focus on data encoding for genomics, a deeply data-driven field with computationally intensive algorithms throughout, from the initial DNA sequencing to pangenome assembly and more. We first examine the compressibility of genomic data from an information-theoretic perspective and how compression affects the quantum state preparation complexity. Here, there are two opposing forces at work: compression reduces data size but at the cost of the beneficial structure within the data. We review some standard approaches to data encoding in the context of genomics data from considering both the preparation complexity in terms of gate counts, qubit use, and depth, as well as the usefulness of the resulting states. We also present some new data encoding methods designed specifically for genomics that have a low-depth preparation circuits while still maintaining the essential features the algorithms require.
Encoding classical data in a quantum state is a key prerequisite of many quantum algorithms. Recently, matrix product state (MPS) methods emerged as the most promising approach for constructing shallow quantum circuits approximating input functions, including probability distributions, with only linear number of gates. We derive rigorous asymptotic expansions for the decay of entanglement across bonds in the MPS representation depending on the smoothness of the input function, real or complex. We also consider the dependence of the entanglement on localization properties and function support. Based on these analytical results, we construct an improved MPS-based algorithm yielding shallow and accurate encoding quantum circuits. By using tensor cross interpolation, we are able to construct utility-scale quantum circuits in a compute- and memory-efficient way. We validate our methods by loading heavy-tailed distributions, including Lévy, important in finance, but they apply to any smooth function inputs. We test the performance of the resulting quantum circuits by executing and sampling from them on IBM quantum devices, for up to 156 qubits.