{"total":14,"items":[{"citing_arxiv_id":"2606.27493","ref_index":40,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"SU(4) Heisenberg model on the hyperhoneycomb lattice","primary_cat":"cond-mat.str-el","submitted_at":"2026-06-25T19:16:57+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"3D PEPS simulations of the SU(4) Heisenberg model on the hyperhoneycomb lattice extrapolate to a gapless spin-liquid ground state.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.02283","ref_index":58,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Quantum optimal control of the Dicke manifold in dipolar Rydberg atom arrays","primary_cat":"quant-ph","submitted_at":"2026-06-01T14:06:14+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Presents IRD-GrAPE optimal control to generate GHZ, Dicke, and extremal states in dipolar Rydberg arrays by truncating the Hilbert space to capture leakage with linear scaling.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.15899","ref_index":92,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Solving Classical and Quantum Spin Glasses with Deep Boltzmann Quantum States","primary_cat":"cond-mat.dis-nn","submitted_at":"2026-05-15T12:30:07+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Deep Boltzmann Quantum States with natural-gradient optimization and annealing-like training match exact or best-known solutions for large infinite-range Ising spin glasses and solve job shop scheduling instances.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"ergy landscape, which results from energy frustration and competing interactions. It leads to a multitude of local minima that can trap heuristic optimization methods. In particular, Markov Chain Monte Carlo (MCMC) al- gorithms relying on local update rules are effectively non- ergodic in the spin-glass phase and exhibit exponentially slow mixing due to large free-energy barriers [92], neces- sitating more refined schemes [93]. Since most modern NQS architectures rely on Metropolis-based MCMC (lo- cal update rules), they are expected to perform poorly in spin-glass sampling. In the following, we employ DBQS as a variational ansatz. Unlike other NQS architectures, DBQS enable efficient block Gibbs sampling, which, thanks to its global"},{"citing_arxiv_id":"2604.24760","ref_index":28,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Contracting Tensor Networks with Generalized Belief Propagation","primary_cat":"quant-ph","submitted_at":"2026-04-27T17:59:03+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Generalized belief propagation approximates tensor network contractions via hierarchical region messages and fixed-point solutions, demonstrated on Ising, ice, AKLT, and random tensor networks.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.21919","ref_index":47,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Algorithmic Locality via Provable Convergence in Quantum Tensor Networks","primary_cat":"quant-ph","submitted_at":"2026-04-23T17:58:15+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"For PEPS with strong injectivity above a threshold, belief propagation finds fixed points efficiently and cluster-corrected BP approximates observables to 1/poly(N) error in poly(N) time, with local perturbations affecting the fixed point only locally.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"The hardness threshold for esti- mating local observables depictedε h is from Ref. [22]. arXiv:2604.21919v1 [quant-ph] 23 Apr 2026 2 the use ofcluster expansionsfrom lattice statistical me- chanics, which systematically decompose tensor network contractions into contributions from localized excitations or \"clusters\" built on top of the BP fixed points [47, 48]. Despite its empirical success in quantum many-body applications [25, 26, 50-53], the theoretical foundations of TN-BP remain incomplete. The cluster expansion technology only provides guarantees given the existence of a suitable BP fixed-point [47]. In practice, the BP message-passing equations used to compute fixed points of the tensor network are implemented as iterative up-"},{"citing_arxiv_id":"2604.20180","ref_index":13,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Tensor network surrogate models for variational quantum computation","primary_cat":"quant-ph","submitted_at":"2026-04-22T04:53:39+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Tensor network simulations act as effective surrogate models for training QAOA on large 2D lattices, overcoming limits of parameter transfer from small instances and remaining classically feasible with moderate bond dimensions.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.19889","ref_index":27,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Quantum-to-Classical Computability Transition via Negative Markov Chains","primary_cat":"quant-ph","submitted_at":"2026-04-21T18:11:19+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"For unitaries from local or pairwise interactions, depolarizing noise above a critical strength makes open quantum spin chain dynamics exactly classically simulable by halting growth in the negative Markov chain representation.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.15427","ref_index":23,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Tensor Networks with Belief Propagation Cannot Feasibly Simulate Google's Quantum Echoes Experiment","primary_cat":"quant-ph","submitted_at":"2026-04-16T18:00:01+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Tensor networks with belief propagation fail to simulate Google's quantum echoes OTOC experiment because the circuits produce largely incompressible entanglement.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.05032","ref_index":32,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Real-time Dynamics in 3D for up to 1000 Qubits with Neural Quantum States: Quenches and the Quantum Kibble--Zurek Mechanism","primary_cat":"quant-ph","submitted_at":"2026-04-06T18:00:04+00:00","verdict":"CONDITIONAL","verdict_confidence":"MODERATE","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Neural quantum states with a tailored 3D convolutional architecture simulate quench dynamics up to 1000 qubits and verify the 3D quantum Kibble-Zurek mechanism with RG-derived logarithmic corrections and data collapse.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.03228","ref_index":48,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Belief Propagation and Tensor Network Expansions for Many-Body Quantum Systems: Rigorous Results and Fundamental Limits","primary_cat":"quant-ph","submitted_at":"2026-04-03T17:59:09+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"For PEPS states with loop-decay, BP with cluster corrections approximates local observables exponentially accurately, and loop-decay necessarily implies exponential decay of connected correlations, ruling out BP at critical points.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"Fishman, E. M. Stoudenmire, and D. Sels, Efficient tensor network simulation of ibm's eagle kicked ising experiment, PRX Quantum5, 010308 (2024). [47] T. Beguˇ si' c, J. Gray, and G. K.-L. Chan, Fast and con- verged classical simulations of evidence for the utility of quantum computing before fault tolerance, Science Ad- vances10, eadk4321 (2024). [48] J. Tindall, A. Mello, M. Fishman, M. Stoudenmire, and D. Sels, Dynamics of disordered quantum systems with two- and three-dimensional tensor networks (2025), arXiv:2503.05693 [quant-ph]. [49] M. S. Rudolph and J. Tindall, Simulating and sampling from quantum circuits with 2d tensor networks (2025), arXiv:2507.11424 [quant-ph]. [50] G. Park, J. Gray, and G."},{"citing_arxiv_id":"2604.01050","ref_index":19,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Simulated Bifurcation Quantum Annealing","primary_cat":"quant-ph","submitted_at":"2026-04-01T15:54:12+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"SBQA adds inter-replica interactions to simulated bifurcation to mimic quantum tunneling and improves performance on sparse rugged optimization problems over standard SBM.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"(2025), arXiv:2510.06337 [quant-ph]. [17] H. Munoz-Bauza and D. Lidar, Scaling advantage in ap- proximate optimization with quantum annealing, Phys. Rev. Lett.134, 160601 (2025). [18] J. Pawlowski, P. Tarasiuk, J. Tuziemski, L. Pawela, and B. Gardas, Closing the quantum-classical scaling gap in approximate optimization (2025), arXiv:2505.22514 [quant-ph]. [19] M. J. Schuetz, J. K. Brubaker, and H. G. Katzgraber, Combinatorial optimization with physics-inspired graph neural networks, Nat. Mach. Intell.4, 367 (2022). [20] M. Honari-Latifpour, M. S. Mills, and M.-A. Miri, Com- binatorial optimization with photonics-inspired clock models, Commun. Phys.5, 104 (2022). [21] T. Zhang, Q. Tao, B. Liu, and J. Han, A review of sim-"},{"citing_arxiv_id":"2510.19928","ref_index":203,"ref_count":4,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Mind the gaps: The fraught road to quantum advantage","primary_cat":"quant-ph","submitted_at":"2025-10-22T18:00:19+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":3.0,"formal_verification":"none","one_line_summary":"The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.","context_count":2,"top_context_role":"background","top_context_polarity":"background","context_text":"dence for the utility of quantum computing before fault toler- ance, (2023), arXiv:2306.16372. [201] A. D. Kinget al., Beyond-classical computation in quantum simulation, Science388, 199 (2025). [202] J. Tindall, A. Mello, M. Fishman, M. Stoudenmire, and D. Sels, Dynamics of disordered quantum systems with two- and three- dimensional tensor networks, (2025), arXiv:2503.05693. [203] Many-body physics with individually controlled Rydberg atoms, Nature Phys.16, 132 (2020). [204] G. Semeghini, H. Levine, A. Keesling, S. Ebadi, T. T. Wang, D. Bluvstein, R. Verresen, H. Pichler, M. Kalinowski, R. Sama- jdar, A. Omran, S. Sachdev, A. Vishwanath, M. Greiner, V . Vuletic, and M. D. Lukin, Probing topological spin liquids on a programmable quantum simulator, Science374, 1242 (2021)."},{"citing_arxiv_id":"2509.03952","ref_index":13,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Quantum-inspired dynamical models on quantum and classical annealers","primary_cat":"quant-ph","submitted_at":"2025-09-04T07:27:11+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A parallel-in-time encoding turns quantum dynamical propagators into QUBO instances for direct benchmarking of quantum annealers against classical solvers on models from single-qubit rotations to PT-symmetric systems.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2506.17418","ref_index":26,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Magnetic Hysteresis Experiments Performed on Quantum Annealers","primary_cat":"quant-ph","submitted_at":"2025-06-20T18:28:16+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"The paper introduces the first general protocol for magnetic hysteresis on programmable quantum annealers and reports non-monotonic dependence of loop area on quantum fluctuations along with disorder-induced steps.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}