{"total":14,"items":[{"citing_arxiv_id":"2605.05479","ref_index":6,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Quantum Simulation of the Real-time Dynamics in the multi-flavor Gross-Neveu Model at the utility scale using Superconducting Quantum Computers","primary_cat":"quant-ph","submitted_at":"2026-05-06T21:57:51+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A scalable Trotterization and Localized Diagonal Operator Approximation enable real-time quantum simulation of the multi-flavor Gross-Neveu model on utility-scale superconducting hardware.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"Zoller, Practical quantum advantage in quantum simulation, Nature607, 667 (2022). [4] T. Byrnes and Y. Yamamoto, Simulating lattice gauge theories on a quantum computer, Phys. Rev. A73, 022328 (2006), arXiv:quant-ph/0510027 [quant-ph]. [5] S. P. Jordan, K. S. M. Lee, and J. Preskill, Quantum Algorithms for Quantum Field Theories, Science336, 1130 (2012), arXiv:1111.3633 [quant-ph]. [6] S. P. Jordan, K. S. M. Lee, and J. Preskill, Quantum Computation of Scattering in Scalar Quantum Field Theories, arXiv e-prints , arXiv:1112.4833 (2011), arXiv:1112.4833 [hep-th]. [7] S. P. Jordan, K. S. M. Lee, and J. Preskill, Quantum Algorithms for Fermionic Quantum Field Theories, arXiv e-prints , arXiv:1404.7115 (2014), arXiv:1404.7115 [hep-th]."},{"citing_arxiv_id":"2605.02494","ref_index":6,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"A Critical Assessment of the Sample-Based Quantum Diagonalization for Heisenberg and Hubbard Models","primary_cat":"quant-ph","submitted_at":"2026-05-04T11:44:40+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"SQD needs an exponentially increasing number of computational-basis configurations to approximate ground-state energies of Heisenberg and Hubbard models within fixed accuracy, even when configurations are chosen optimally by probability.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"than sampling inefficiencies. Our results indicate that SQD effectively probes the configuration-space entropy but faces fundamental scalability limitations for these models. 1 Introduction Determining low-energy eigenstates of interacting quantum many-body Hamiltonians is a central prob- lem in condensed matter physics [1, 2], quantum chemistry [3-5], and quantum simulation [6]. Exact diagonalization methods provide numerically exact solutions but scale exponentially with the system size, limiting their applicability to relatively small systems [7-9]. Hybrid quantum-classical algorithms have, therefore, been proposed as a promising ap- proach to extend the range of tractable problems by leveraging quantum devices to represent many-body"},{"citing_arxiv_id":"2604.27171","ref_index":7,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Structure-Aware Transformers for Learning Near-Optimal Trotter Orderings with System-Size Generalization in 1D Heisenberg Hamiltonians","primary_cat":"quant-ph","submitted_at":"2026-04-29T20:19:11+00:00","verdict":"CONDITIONAL","verdict_confidence":"MODERATE","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A structure-aware transformer trained on 3-14 qubit systems predicts Trotter orderings for 16-20 qubit 1D Heisenberg Hamiltonians with a mean fidelity gap of 0.00115 to the best of 24 candidates.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.24578","ref_index":42,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Hybrid Path-Sums for Hybrid Quantum Programs","primary_cat":"cs.PL","submitted_at":"2026-04-27T15:05:17+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"Therefore,robust, expressive, efficient, and tractable formal verification tools are absolute requirements for the industrialization of quantum computing. Formal verification relies on mathematically establishing the correctness of a program for any possible input. It is already preferred over testing in critical applications such as the formalization of mathematics [42], software architectures [57, 60], and industrial development systems [8, 28]. Its application for quantum programs, on the other hand, is still in its infancy. Yet, there are already promising results involving symbolic representations [3, 4, 7, 82], specification language design [21], deductive systems [91, 92] and the development of practical tools [18, 23, 47, 95] - see [19] for a"},{"citing_arxiv_id":"2604.13486","ref_index":3,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Taming Trotter Errors with Quantum Resources","primary_cat":"quant-ph","submitted_at":"2026-04-15T05:19:11+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Higher entanglement entropy reduces variance of Trotter errors and higher magic reduces kurtosis, making error distributions more robust in quantum simulation.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"emulation may, paradoxically, enhance the intrinsic robustness of quantum simulation, highlighting a constructive interplay between complexity and stability in quantum computation. Simulating physical systems [1, 2] stands as a foun- dational task for which quantum computers promise a transformative advantage, from quantum materials and chemical processes to high-energy physics and cosmol- ogy, offering unprecedented precision and insight [3, 4]. The foundational promise of quantum simulation stems from its capacity to efficiently simulate quantum sys- tems that are classically intractable [1, 3]. Such classical intractability originates from the exponential scaling of computational resources required to represent essential quantum features-particularly entanglement [5-8] and non-stabilizerness, or called magic [9-12]"},{"citing_arxiv_id":"2604.09361","ref_index":6,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Stochastic-Dimension Frozen Sampled Neural Network for High-Dimensional Gross-Pitaevskii Equations on Unbounded Domains","primary_cat":"cs.LG","submitted_at":"2026-04-10T14:31:36+00:00","verdict":null,"verdict_confidence":null,"novelty_score":null,"formal_verification":null,"one_line_summary":null,"context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.06087","ref_index":38,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Gauss law codes and vacuum codes from lattice gauge theories","primary_cat":"quant-ph","submitted_at":"2026-04-07T17:02:21+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"Gauss law codes identify the full gauge-invariant sector as the code space while vacuum codes restrict to the matter vacuum, with the two shown to be unitarily equivalent for finite gauge groups.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"These operators move between the two occupation states and therefore change the charge stored at the vertex, and we haveN v =ψ † v ψv, as usual. To obtain the correct fermionic statistics, however, it is important that the vertex Hilbert spaces are not combined with an ordinary tensor product. Instead, the full matter Hilbert space is theZ 2-graded tensor product [103-105], which we review in appendix A, Hmatter =[O v∈V Hv.(3.107) The grading keeps track of fermion parity. On each site the parity operator is defined by Pv = (−1)Nv ,(3.108) so empty states with even occupation have parity +1 and states with odd occupation have parity−1. An operatorA v acting onH v is called even or odd if it transforms under this parity operator with a definite sign, that is PvAvPv = (−1)|Av|Av,(3.109) where|A v|= 0,1 is the fermion parity of the operator. Operators with|A v|= 0 are even and preserve the fermion number mod 2, while operators with|A v|= 1 are odd and change it. The graded tensor product encodes the rule that odd operators anticommute across different sites. Indeed, ifA v andB v′ are operators with definite fermion parities|A v|and|B v′|, then forv̸=v ′, AvBv′ = (−1)|Av||Bv′ |Bv′Av.(3.110) Since the operatorsψ v andψ † v′ are odd with respect to this grading, the graded tensor product immedi- ately implies the canonical anticommutation relations: {ψv, ψ† v′}=δ v,v ′ ,{ψ v, ψv′}={ψ † v, ψ† v′}= 0.(3.111) 38 The action of gauge transformations on these operators is particularly simple. Conjugating with the on-site representationu g v in Eq. (3.103) gives ψv →u g vψvug† v = ¯χF (g)ψv (3.112) ψ† v →u g vψ† vug† v =χ F (g)ψ † v .(3.113) Thus, the creation operator carries chargeχ F and the annihilation operator carries the conjugate charge, exactly as expected for fermionic matter fields. In particular, this means thatψ v andψ † v act as anni- hilation and creation operators, respectively, at even sites, and vice versa at odd sites. A consequence of this feature i"},{"citing_arxiv_id":"2512.04028","ref_index":12,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Thermalization from quenching in coupled oscillators","primary_cat":"quant-ph","submitted_at":"2025-12-03T18:04:41+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Sudden quenches in a pair of coupled oscillators produce exact or approximate thermalization of a quantum harmonic oscillator to arbitrary temperatures via solvable equations on the Gaussian covariance matrix.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2511.10267","ref_index":5,"ref_count":1,"confidence":0.88,"is_internal_anchor":true,"paper_title":"Quantum Simulation of Non-Hermitian Special Functions and Dynamics via Contour-based Matrix Decomposition","primary_cat":"quant-ph","submitted_at":"2025-11-13T12:52:52+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"CBMD decomposes non-Hermitian operators via contour residues to enable optimal-query quantum simulation of first-order dynamics and special functions such as Bessel and Airy evolutions without requiring diagonalizability.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2509.06726","ref_index":5,"ref_count":1,"confidence":0.88,"is_internal_anchor":true,"paper_title":"Entanglement Structure Certification Based on Energy-Restricted State Discrimination","primary_cat":"quant-ph","submitted_at":"2025-09-08T14:22:56+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A state discrimination game on energy-restricted quantum states creates a hierarchy of optimal success probabilities that certifies multipartite entanglement structure.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2508.11765","ref_index":145,"ref_count":1,"confidence":0.88,"is_internal_anchor":true,"paper_title":"The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute","primary_cat":"quant-ph","submitted_at":"2025-08-15T18:31:37+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":2.0,"formal_verification":"none","one_line_summary":"A synthesis of expert insights from the ADAC Quantum Computing Working Group and member survey on the complementary roles of quantum and classical high-performance computing in future hybrid infrastructures.","context_count":1,"top_context_role":"background","top_context_polarity":"support","context_text":"arXiv:2206.07682. [143] R. P. Feynman, Simulating physics with computers, International Journal of Theoretical Physics 21 (6-7) (1982) 467-488.doi:10.1007/BF02650179. [144] I. M. Georgescu, S. Ashhab, F. Nori, Quantum simulation, Rev. Mod. Phys. 86 (2014) 153-185. doi:10.1103/RevModPhys.86.153. URL https://link.aps.org/doi/10.1103/ RevModPhys.86.153 [145] R. Trivedi, A. Franco Rubio, J. I. Cirac, Quantum advantage and stability to errors in analogue quantum simulators, Nat. Commun. 15 (1) (2024) 6507. doi: 10.1038/s41467-024-50750-x. [146] HPCQS - high performance and quantum simulation (Accessed 2024). URL https://www.hpcqs.eu/ [147] A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVin- cenzo, N. Margolus, P."},{"citing_arxiv_id":"2506.11552","ref_index":37,"ref_count":1,"confidence":0.88,"is_internal_anchor":true,"paper_title":"Learning Encodings by Maximizing State Distinguishability: Variational Quantum Error Correction","primary_cat":"quant-ph","submitted_at":"2025-06-13T08:02:37+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"VarQEC uses a distinguishability loss as a machine-learning objective to variationally discover resource-efficient encoding circuits optimized for given noise models.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2406.14411","ref_index":2,"ref_count":1,"confidence":0.88,"is_internal_anchor":true,"paper_title":"Performance and scaling analysis of variational quantum simulation","primary_cat":"quant-ph","submitted_at":"2024-06-20T15:32:41+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Empirical scaling study reports VQS requires shallower circuits than Trotterization for time evolution as system size and simulation time grow.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2107.09809","ref_index":6,"ref_count":1,"confidence":0.88,"is_internal_anchor":true,"paper_title":"Simulating quantum chaos on a quantum computer","primary_cat":"quant-ph","submitted_at":"2021-07-20T23:52:01+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Hybrid simulation of the 2-qubit quantum kicked top on IBMQ shows periodic evolution and chaos signatures in time-averaged entanglement, with gate count independent of kick number.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}