Multivariate quantum state preparation with optimized tensor networks

• URL: http://arxiv.org/abs/2609.09304v1
• Date: Tue, 08 Sep 2026 18:01:11 GMT
• Title: Multivariate quantum state preparation with optimized tensor networks
• Abstract summary: We introduce SCENT, a protocol that utilizes efficiently-computable pairwise entanglement metrics to determine a suitable tree tensor network (TTN) structure.<n>We then apply these optimized TTNs to state preparation, introducing an approximate circuit compilation method.<n>We demonstrate this quantum state-preparation pipeline on archetypal state-preparation problems in quantum chemistry and financial portfolio optimization.
• Score: 0.11744028458220425
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantics tensor trains are attracting intense interest for quantum-inspired computing and quantum state preparation. These methods, which approximate continuum functions by representing their amplitude encoding as a matrix product state (MPS), are exceedingly powerful for univariate functions but rapidly become challenging when handling multivariate functions, since the linear chain topology leads to a large distance between highly-entangled qubits. We overcome this limitation by introducing SCENT (Spectral Clustering for Entanglement miNimizing Trees). SCENT is a protocol that utilizes efficiently-computable pairwise entanglement metrics to determine a suitable tree tensor network (TTN) structure, which can then be efficiently approximated using tensor cross-interpolation (TCI); we find that it substantially outperforms MPS methods and improves upon previous TTN methods. We then apply these optimized TTNs to state preparation, introducing an approximate circuit compilation method based on environment-tensor methods without significantly conceding overall accuracy. Importantly, the inherent gauge freedom of TTNs can be directly exploited in this method, resulting in higher fidelity at a given circuit depth. We demonstrate this quantum state-preparation pipeline on archetypal state-preparation problems in quantum chemistry and financial portfolio optimization. In our flagship demonstration, we encode a 20-variable probability distribution with long-ranged, non-nearest neighbor inter-variable correlations in a 200-qubit state-preparation circuit with infidelity $7.44\times 10^{-9}$ using only 43284 CNOTs; depth and fidelity can be traded, allowing the same distribution to be prepared to infidelity $10^{-3}$ with as few as 5584 CNOTs.

Related papers

• Quantum-Enhanced Learning Framework for Intelligent and AI-Native 6G Wireless Networks [28.680231795970837]
  We introduce Quantumer, a hybrid TinyML--quantum framework that integrates multi-scale dilated convolutions and scaled dot-product attention.<n>We also present QuantiblentLayer, a four-qubit variational circuit that maps compact traffic representations into Hilbert-space features.<n>By transferring these quantum-assisted embeddings into an energy-efficient, lightweight transformer, Quantumer achieves strong detection performance with minimal compute and memory overhead.
  arXiv  Detail & Related papers  (2026-09-06T20:13:42Z)
• Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning [38.502127166117674]
  We propose gated QKAN-FWP, a fast-weight framework that integrates FWP with Quantum-inspired Kolmogorov-Arnold Network (QKAN)<n>We use single-qubit data re-uploading circuits as learnable nonlinear activation, known as DatA Re-Uploading ActivatioN (DARUAN)<n>We evaluate the framework across time-series benchmarks, MiniGrid reinforcement learning, and highlight real-world solar cycle forecasting as our main practical result.
  arXiv  Detail & Related papers  (2026-05-07T13:04:09Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• QuEPT: Quantized Elastic Precision Transformers with One-Shot Calibration for Multi-Bit Switching [38.68820743653054]
  QuEPT is an efficient post-training scheme that reconstructs block-wise multi-bit errors with one-shot calibration on a small data slice.<n>It can dynamically adapt to various predefined bit-widths by cascading different low-rank adapters.<n>It supports real-time switching between uniform quantization and mixed precision quantization without repeated optimization.
  arXiv  Detail & Related papers  (2026-02-13T04:28:06Z)
• Scalable Preparation of Matrix Product States with Sequential and Brick Wall Quantum Circuits [0.0]
  Matrix Product States (MPS) admit more efficient constructions when accuracy is traded for circuit complexity.<n>This work introduces an end-to-end MPS preparation framework that combines the strengths of both strategies within a single pipeline.
  arXiv  Detail & Related papers  (2026-02-12T15:07:11Z)
• Reinforcement Learning for Optimizing Large Qubit Array based Quantum Sensor Circuits [0.0]
  This paper presents an engineering integration of reinforcement learning with tensor-network-based simulation (MPS) for scalable circuit optimization.<n>Our reinforcement learning agent learns to restructure circuits to maximize Quantum Fisher Information (QFI) and entanglement entropy.<n> Experimental results show consistent improvements, with QFI values approaching 1, entanglement entropy in the 0.8-1.0 range, and up to 90% reduction in depth and gate count.
  arXiv  Detail & Related papers  (2025-08-28T22:51:28Z)
• Distributed Tensor Network Library for Quantum Computing Emulation [0.0]
  HPC tensor network packages tackle this issue with a procedure called circuit slicing.<n>We present a novel alternative approach, where individual tensors are both broadcast and scattered.<n>We showcase its capabilities on ARCHER2, by emulating two well-known algorithms.
  arXiv  Detail & Related papers  (2025-05-09T15:17:42Z)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• 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)
• Unimon qubit [42.83899285555746]
  Superconducting qubits are one of the most promising candidates to implement quantum computers. Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
  arXiv  Detail & Related papers  (2022-03-11T12:57:43Z)
• Optimized fermionic SWAP networks with equivalent circuit averaging for QAOA [2.3362993651992863]
  We optimize the execution of fermionic SWAP networks for Quantum Approximate Optimization Algorithm (QAOA) We introduce Equivalent Circuit Averaging, which randomizes over degrees of freedom in the quantum circuit compilation. We observe a 60% average reduction in error (total variation distance) for QAOA of depth p = 1 on four transmon qubits on a superconducting quantum processor.
  arXiv  Detail & Related papers  (2021-11-08T15:32:05Z)

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.