Quantum State Preparation by Improved MPS Method

• URL: http://arxiv.org/abs/2508.12821v1
• Date: Mon, 18 Aug 2025 11:04:30 GMT
• Title: Quantum State Preparation by Improved MPS Method
• Authors: Chao Wang, Pengrui Zhou, Xi-Ning Zhuang, Ziwei Cui, Menghan Dou, Zhao-Yun Chen, Guo-Ping Guo,
• Abstract summary: We propose an improved Matrix Product State(MPS) method preparation protocol with an exponential reduction on the circuit depth.<n>By refined utilization of the disentangling principle, we also reduce approximately 33% two-qubit gate count.
• Score: 2.7545275269092806
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Efficient encoding of classical information plays a fundamental role in numerous practical quantum algorithms. However, the preparation of an arbitrary amplitude-encoded state has been proven to be time-consuming, and its deployment on current noisy devices can be challenging. In this work, we propose an improved Matrix Product State(MPS) method preparation protocol with an exponential reduction on the circuit depth, as well as topological adaptability. By refined utilization of the disentangling principle, we also reduce approximately 33% two-qubit gate count. To validate our method, we study various families of functions and distributions with provably bounded MPS rank. Numerical experiments show that our method significantly reduces circuit depth while achieving higher fidelity for states arising in financial and other applications.

Related papers

• Deterministic Ground State Preparation via Power-Cosine Filtering of Time Evolution Operators [0.0]
  We propose a non-variational protocol for ground state preparation using a Power-Cosine quantum signal processing filter.<n>By eschewing complex block-encoding techniques, our method directly utilizes coherent time-evolution operators controlled by a single ancillary qubit.
  arXiv  Detail & Related papers  (2026-02-23T07:01:30Z)
• Quantum State Preparation via Schmidt Spectrum Optimisation [0.0]
  We introduce an efficient algorithm for the systematic design of shallow-depth quantum circuits.<n>The proposed method leverages Schmidt spectrum optimization (SSO) to minimize circuit depth.<n>We demonstrate state-of-the-art shallow-depth performance, improving accuracy by up to an order of magnitude over existing methods.
  arXiv  Detail & Related papers  (2025-12-23T17:27:32Z)
• Classical Simulations of Low Magic Quantum Dynamics [0.1666604949258699]
  We develop algorithms for adaptive quantum circuits that produce states with low levels of magic.<n>These algorithms are particularly well-suited to circuits with high rates of Pauli measurements.<n>We study the dynamics of all-to-all monitored quantum circuits with a sub-extensive rate of T-gates per unit of circuit depth.
  arXiv  Detail & Related papers  (2025-08-27T20:17:15Z)
• FIMA-Q: Post-Training Quantization for Vision Transformers by Fisher Information Matrix Approximation [55.12070409045766]
  Post-training quantization (PTQ) has stood out as a cost-effective and promising model compression paradigm in recent years.<n>Current PTQ methods for Vision Transformers (ViTs) still suffer from significant accuracy degradation, especially under low-bit quantization.
  arXiv  Detail & Related papers  (2025-06-13T07:57:38Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM)<n>We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall.<n>Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• Entanglement scaling in matrix product state representation of smooth functions and their shallow quantum circuit approximations [0.28917933888634956]
  matrix product state (MPS) methods emerged as the most promising approach for constructing shallow quantum circuits.<n>We derive rigorous expansions for the decay of entanglement across bonds in the MPS representation depending on the smoothness of the input function.<n>We construct an improved MPS-based algorithm yielding shallow and accurate encoding quantum circuits.
  arXiv  Detail & Related papers  (2024-12-06T17:31:35Z)
• Optimal Quantum Purity Amplification [2.05170973574812]
  We present the optimal QPA protocol for general quantum systems and global noise.<n>We provide an efficient implementation of the protocol based on generalized quantum phase estimation.<n> Numerical simulations demonstrate the effectiveness of our protocol applied to quantum simulation of Hamiltonian evolution.
  arXiv  Detail & Related papers  (2024-09-26T17:46:00Z)
• 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)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• Engineering Dynamical Sweet Spots to Protect Qubits from 1/$f$ Noise [0.08388591755871733]
  We develop a protocol for engineering dynamical sweet spots which reduce the susceptibility of a qubit to low-frequency noise. Our work provides an intuitive tool to encode quantum information in robust, time-dependent states.
  arXiv  Detail & Related papers  (2020-04-26T19:22:39Z)

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.