Renormalization-group-based preparation of matrix product states on up to 80 qubits

• URL: http://arxiv.org/abs/2510.24681v1
• Date: Tue, 28 Oct 2025 17:45:48 GMT
• Title: Renormalization-group-based preparation of matrix product states on up to 80 qubits
• Authors: Moritz Scheer, Alberto Baiardi, Elisa Bäumer Marty, Zhi-Yuan Wei, Daniel Malz,
• Abstract summary: Key challenge for quantum computers is the efficient preparation of many-body entangled states across many qubits.<n>We demonstrate the preparation of matrix product states using a renormalization-group(RG)-based superconducting quantum hardware.
• Score: 1.9573380763700712
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A key challenge for quantum computers is the efficient preparation of many-body entangled states across many qubits. In this work, we demonstrate the preparation of matrix product states (MPS) using a renormalization-group(RG)-based quantum algorithm on superconducting quantum hardware. Compared to sequential generation, it has been shown that the RG-based protocol asymptotically prepares short-range correlated MPS with an exponentially shallower circuit depth (when scaling system size), but it is not yet clear for which system sizes it starts to convey an advantage. We thus apply this algorithm to prepare a class of MPS exhibiting a phase transition between a symmetry-protected topological (SPT) and a trivial phase for systems of up to 80 qubits. We find that the reduced depth of the RG-based circuits makes them more resilient to noise, and that they generally outperform the sequential circuits for large systems, as we showcase by measuring string-order-like local expectation values and energy densities. We thus demonstrate that the RG-based protocol enables large-scale preparation of MPS and, in particular, SPT-ordered states beyond the fixed point.

Related papers

• 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)
• 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)
• Score-Based Turbo Message Passing for Plug-and-Play Compressive Imaging [45.77515171733844]
  We devise an algorithm that integrates a score-based minimum mean-squared error (MMSE) denoiser for compressive image recovery.<n>The resulting algorithm, named score-based turbo message passing (STMP), combines the fast convergence of message passing with the power of score-based generative priors.
  arXiv  Detail & Related papers  (2025-12-16T14:24:12Z)
• Generation of 95-qubit genuine entanglement and verification of symmetry-protected topological phases [65.36609782915427]
  We successfully generate and verify 95-qubit one-dimensional and 72-qubit two-dimensional genuine entangled cluster states.<n>Our results represent a significant advancement in large-scale entanglement generation and topological phase simulation.
  arXiv  Detail & Related papers  (2025-05-04T03:40:34Z)
• Embedding of Tree Tensor Networks into Shallow Quantum Circuits [0.0]
  This study proposes a method to embed Tree Networks (TTNs) into shallow quantum circuits.<n>Our numerical results show that embedding TTNs provides better initial quantum circuits than Matrix Product States (MPS)<n>This study is expected to extend the application of VQAs to two-dimensional systems and those with long-range correlations.
  arXiv  Detail & Related papers  (2025-01-31T02:38:17Z)
• Enhancing Quantum Diffusion Models with Pairwise Bell State Entanglement [35.436358464279785]
  This paper introduces a novel quantum diffusion model designed for Noisy Intermediate-Scale Quantum (NISQ) devices. By leveraging quantum entanglement and superposition, this approach advances quantum generative learning.
  arXiv  Detail & Related papers  (2024-11-24T20:14:57Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation [39.20075231137991]
  We investigate the feasibility of early fault-tolerant quantum algorithms focusing on ground-state energy estimation problems.<n> scaling these methods to larger system sizes reveals three key challenges: the smoothness of the CDF for large supports, the lack of tight lower bounds on the overlap with the true ground state, and the difficulty of preparing high-quality initial states.
  arXiv  Detail & Related papers  (2024-05-06T18:00:03Z)
• Constant-depth preparation of matrix product states with adaptive quantum circuits [1.1017516493649393]
  Matrix product states (MPS) comprise a significant class of many-body entangled states. We show that a diverse class of MPS can be exactly prepared using constant-depth adaptive quantum circuits.
  arXiv  Detail & Related papers  (2024-04-24T18:00:00Z)
• Coarse-grained quantum state tomography with optimal POVM construction [2.985603723386298]
  We introduce a novel approach to reconstruct the target density matrix from a comprehensive set of Positive Operator-Valued Measures (POVM) We improve the robustness and stability of CG state tomography (QST) by optimizing the POVM set to achieve a generalized symmetric informationally complete (GSIC) POVM. We discuss a more efficient construction of N-qubit CG-QST without exponential increases in two-qubit or circuit depth per measurement.
  arXiv  Detail & Related papers  (2024-04-09T13:11:27Z)
• Comparing Classical and Quantum Ground State Preparation Heuristics [44.99833362998488]
  Ground state preparation (GSP) is a crucial component in GSEE algorithms. In this study, we investigated whether in those cases quantum GSP methods could improve the overlap values compared to Hartree-Fock.
  arXiv  Detail & Related papers  (2024-01-10T18:16:36Z)
• An Ultra-fast Quantum Random Number Generation Scheme Based on Laser Phase Noise [21.674114520629555]
  A quantum random number generator based on the laser phase noise is generally limited in speed and implementation complexity. We present an insight to exploit the potential bandwidth of the quantum entropy source and experimentally boost the bandwidth of the corresponding quantum entropy source to 20 GHz. An ultra-fast generation rate of 218 Gbps is demonstrated, setting a new record for laser phase noise based schemes by one order of magnitude.
  arXiv  Detail & Related papers  (2023-11-29T06:15:51Z)
• 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)

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.