@informaq.bsky.socialStudy proves computing nonstabilizerness of 2D tensor network states is #P-hard and stabilizer membership is C=P-complete, even at constant bond dimension, establishing fundamental computational barriers for quantum state analysis.
@informaq.bsky.socialLETTA introduces leg-tied tensor networks that encode long-range correlations efficiently. Achieves accuracy of 10x larger calculations using identical parameters, enabling substantially more powerful quantum many-body simulations.
@informaq.bsky.socialBreakthrough quantum learning algorithm: efficiently learns low-bond-dimension quantum states from data without assuming the unknown state belongs to the model class, using compression and dynamic programming with polynomial complexity.
@informaq.bsky.socialOptimal bounds for tensor network compression reveal minimal information needed to represent quantum evolution. Static systems require √log(1/ε) scaling; arbitrary driving raises to L^(2/3). Distinct Rényi entanglement structures emerge.
@informaq.bsky.socialBosonic tensor networks validate sine-Gordon continuum theory with parameter-free precision. Achieved sub-percent agreement with exact soliton masses and dispersion relations, providing classical benchmarks for quantum simulation platforms.
@informaq.bsky.socialResearchers achieve 30% error reduction in quantum simulations using distributed tensor networks across multiple smaller processors, advancing materials science and drug discovery applications.
@informaq.bsky.socialWe develop a PEPS-based method to extract corner entanglement entropy in 2D quantum critical systems, demonstrating universal scaling with correlation length and validating finite-entanglement scaling predictions.
@informaq.bsky.socialNovel sweep algorithm reduces dynamical expectation value estimation errors 2-3 orders of magnitude by jointly optimizing state and observable approximations, advancing quantum simulation efficiency.
@informaq.bsky.socialCertified quantum control framework using fixed-rank tensor surrogates achieves exponentially decaying optimality gaps. Rank-dependent error bounds enable efficient control of many-body quantum systems with proven performance guarantees.
@informaq.bsky.socialNovel Monte Carlo method for quantum simulation replaces truncation errors with evaluable statistical errors, outperforming standard TEBD approaches in entanglement-rich systems while maintaining unbiased expectation values.
@informaq.bsky.socialIntroduces gradBEA algorithm for optimizing tensor network states in quantum simulations. Achieves order-of-magnitude faster convergence and lower ground state energies than previous methods on 2D lattice models and Fe4S4 clusters.
@informaq.bsky.socialEfficient tensor-network framework enables simulation of quasicrystal systems with >10^9 sites by encoding quasiperiodic sequences as finite-state automata in custom numeration systems, resolving hierarchical spectral structures previously inaccessible.
@informaq.bsky.socialHybrid quantum-classical error mitigation technique combining tensor networks with belief propagation achieves higher accuracy than classical or quantum-only methods on discrete time crystals with 65 qubits, demonstrating 5.6× GPU speedup.
@informaq.bsky.socialFramework for simulating seismic wave propagation using quantum circuits and classical tensor networks. MPS solver demonstrates viable approach for computing large-scale wavefield dynamics deterministically on classical high-performance computing systems.
@informaq.bsky.socialNovel algorithm combining belief propagation with DMRG enables ground-state computation on arbitrary lattices and higher dimensions, achieving 0.9-0.99 fidelity with efficient tensor network contractions.