Scaling Feedback-Stabilized Quantum Criticality to 100 Qubits via Adaptive Matrix Product States

Angel Jose Toranzo Portela

Published Jan 17, 2026• 0 citations

Abstract

We present matrix product state (MPS) simulations of feedback-stabilized quantum criticality, extending system sizes to N = 100 qubits—over six times larger than accessible via exact diagonalization. Building on the recent identification of the 1/e information horizon as a universal quantum-classical boundary, we develop an adaptive bond dimension strategy that preserves critical correlations during time evolution despite truncation errors. Random quantum circuits with measurement rates adjusted via real-time feedback successfully stabilize the Schmidt concentration across N ∈ {20, 40, 60, 80, 100} qubits. For the largest system (N = 100), ensemble-averaged results yield ⟨Kc⟩ = 0.363±0.003, consistent with the theoretical prediction 1/e = 0.368 within 1.2% (t-test p = 0.15), demonstrating successful crossing of the psychological 100-qubit barrier. The observed non-monotonic scaling reflects oscillatory finite-size convergence characteristic of second-order critical points. All system sizes remain within ±5% of target, with variance decreasing for larger N, demonstrating robustness across correlation length regimes. Our adaptive MPS protocol enables simulation of volume-law entanglement phases at unprecedented mesoscopic scales, establishing computational feasibility for near-term experimental platforms.

DOI: 10.5281/zenodo.18283682

Related papers

Experimental Observation of Measurement-Induced Phase Transitions on NISQ Processors via Feedback-Stabilized Criticality

Angel Jose Toranzo Portela

Measurement-induced phase transitions (MIPT) offer a novel paradigm for exploring quantum criticality, yet their experimental observation remains stifled by the "post-selection problem"—the exponential cost of resolving quantum trajectories. Here, we propose a scalable protocol to observe feedback-stabilized criticality on current Noisy Intermediate-Scale Quantum (NISQ) processors, eliminating the need for post-selection. By coupling local measurements to real-time unitary feedback, we demonstrate that a many-body quantum system can be steered toward the universal 1/e information horizon, effectively turning the measurement back-action from a source of decoherence into a resource for complexity. Extensive numerical simulations incorporating realistic depolarizing noise reveal a robust stability plateau extending to gate error rates of p ≈ 10⁻², compatible with state-of-the-art superconducting architectures such as IBM Heron. Furthermore, we introduce a verification scheme based on classical shadows to efficiently estimate the Schmidt concentration ⟨K_c⟩ without full tomography. Our results establish that thermodynamic error correction is achievable in the NISQ era, providing a blueprint for the first experimental observation of a feedback-induced phase transition at the mesoscopic scale (N ~ 100).

Jan 18, 20260 citations

Optimized Matrix-Product State Simulations of Quantum Error Correction Circuits

Asier Piñeiro Orioli, Chen Zhao, Guido Masella +3 more

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.

quant-pharXiv:2609.03073Sep 4, 20260 citations

An entanglement-aware quantum computer simulation algorithm

Maxime Oliva

The advent of quantum computers promises exponential speed ups in the execution of various computational tasks. While their capabilities are hindered by quantum decoherence, they can be exactly simulated on classical hardware at the cost of an exponential scaling in terms of number of qubits. To circumvent this, quantum states can be represented as matrix product states (MPS), a product of tensors separated by so-called bond dimensions. Limiting bond dimensions growth approximates the state, but also limits its ability to represent entanglement. Methods based on this representation have been the most popular tool at simulating large quantum systems. But how to trust resulting approximate quantum states for such intractable systems sizes ? I propose here a method for inferring the fidelity of an approximate quantum state without direct comparison to its exact counterpart, and use it to design an ``entanglement-aware'' (EA) algorithm for both pure and mixed states. As opposed to state of the art methods which limit bond dimensions up to an arbitrary maximum value, this algorithm receives as input a fidelity, and adapts dynamically its bond dimensions to both local entanglement and noise such that the final quantum state fidelity at least reaches the input fidelity. I show that this algorithm far surpasses standard fixed bond dimension truncation schemes. In particular, a noiseless random circuit of 300 qubits and depth 75 simulated using MPS methods takes one week of computation time, while EA-MPS only needs 2 hours to reach similar quantum state fidelity.

arXiv:2307.16870Jul 31, 20230 citations

Detecting Measurement-Induced Entanglement Transitions with Unitary Mirror Circuits

Yariv Yanay, Brian G. Swingle, Charles Tahan

Monitored random circuits, consisting of alternating layers of entangling two-qubit gates and projective single-qubit measurements applied to some fraction p of the qubits, have been a topic of recent interest. In particular, the resulting steady state exhibits a phase transition from highly correlated states with "volume-law" entanglement at p<p_{c} to localized states with "area-law" entanglement at p>p_{c}. It is hard to access this transition experimentally, as it cannot be seen at the ensemble level. Naively, to observe it one must repeat the experiment until the set of measurement results repeats itself, with likelihood that is exponentially small in the number of measurements. To overcome this issue, we present a hybrid quantum-classical algorithm which creates a matrix product state (MPS) based "unitary mirror" of the projected circuit. Polynomial-sized tensor networks can represent quantum states with area-law entanglement, and so the unitary mirror can well approximate the experimental state above p_{c} but fails exponentially below it. The breaking of this mirror can thus pinpoint the critical point. We outline the algorithm and how such results would be obtained. We present a bound on the maximum entanglement entropy of any given state that is well represented by an MPS, and from the bound suggest how the volume-law phase can be bounded. We consider whether the entanglement could similarly be bounded from below where the MPS fails. Finally, we present numerical results for small qubit numbers and for monitored circuits with random Clifford gates.

arXiv:2401.17367Physical Review LettersAug 16, 20242 citations

Scaling Adaptive Non-Local Observable Quantum Super-Resolution via Matrix Product States

Shih-Lung Yu, Ming-Kang Ho, Tai-Yue Li +1 more

This work presents a matrix product state (MPS) simulation framework for adaptive non-local observable variational quantum circuits (ANO-VQCs) in image super-resolution (SR) beyond the practical limits of statevector simulation. Runtime benchmarks on a single NVIDIA RTX 4070 GPU show that, under the tested shallow-circuit setting, MPS completes ANO-VQC forward feature extraction for individual inputs up to 16 x 16 pixels (256 qubits), whereas statevector simulation encounters a memory bottleneck at 6 x 6 inputs (36 qubits) and exact tensor-network (Exact TN) contraction becomes computationally impractical beyond 12 x 12 inputs (144 qubits). For a fixed 7 x 7 input (49 qubits), a bond-dimension sweep over depths L = 1 to L = 4 shows that the required MPS bond dimension increases with circuit depth. Using Exact TN contraction as the reference, the bond dimension required for near-exact agreement increases from chi = 2 at L = 1 to chi = 16 at L = 4. Finally, 7 x 7 to 28 x 28 Fashion-MNIST SR training with chi = 16 shows that the shallow L = 1 model achieves the lowest loss, lowest LPIPS, and highest PSNR and SSIM among the tested depths. These results highlight MPS as a scalable and controllable simulation backend for ANO-VQC image SR and as a practical tool for studying large-scale quantum algorithms.

quant-pharXiv:2607.10280Jul 14, 20260 citations

Adaptive Tensor Network Simulation via Entropy-Feedback PID Control and GPU-Accelerated SVD

Harshni Kumaresan, Gayathri Muruganantham, Lakshmi Rajendran +1 more

Tensor network methods, particularly those based on Matrix Product States (MPS), provide a powerful framework for simulating quantum many-body systems. A persistent computational challenge in these methods is the selection of the bond dimension chi, which controls the trade-off between accuracy and computational cost. Fixed bond dimension strategies either waste resources in low-entanglement regions or lose fidelity in high-entanglement regions. This work introduces an adaptive bond dimension management framework that uses von Neumann entropy feedback coupled with a Proportional-Integral-Derivative (PID) controller to dynamically adjust chi at each bond during simulation. An Exponential Moving Average (EMA) filter stabilizes entropy measurements against transient fluctuations, and a predictive scheduling module anticipates future bond dimension requirements from entropy trends. The per-bond granularity of the allocation ensures that computational resources concentrate where entanglement is largest. The framework integrates GPU-accelerated Singular Value Decomposition (SVD) via CuPy and the cuSOLVER backend, achieving individual SVD speedups of 4.1x at chi=256 and 7.1x at chi=2048 relative to CPU-based NumPy for isolated matrix factorisations (measured on an NVIDIA A100-SXM4-40GB GPU with CuPy 13.4.1 and CUDA 12.8). At the system level, benchmarks on the spin-1/2 antiferromagnetic Heisenberg chain demonstrate a 2.7x reduction in total DMRG wall time compared to fixed-chi simulations, with energy accuracy within 0.1% of the Bethe ansatz solution. Integration with the Density Matrix Renormalization Group (DMRG) algorithm yields ground-state energies per site converging to E/N = -0.4432 for the isotropic Heisenberg model at chi = 128. Validation against Amazon Web Services (AWS) Braket SV1 statevector simulator confirms agreement within 2-5% for small systems.

cs.ETCross-listedarXiv:2604.03960Apr 7, 20260 citations