{"total":15,"items":[{"citing_arxiv_id":"2606.20242","ref_index":7,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Mitigating Trotter Errors via Post-Processed Symmetry Restoration","primary_cat":"quant-ph","submitted_at":"2026-06-18T13:55:20+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Symmetry-based classical post-processing projects out Trotter error components that violate symmetries while preserving ideal dynamics in quantum simulations.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.29181","ref_index":8,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"A Variational Quantum Algorithm for Nonlinear Finite Element Analysis of Hyperelastic Materials","primary_cat":"quant-ph","submitted_at":"2026-05-27T23:37:04+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A hybrid quantum-classical variational method using polynomial approximations to the energy functional enables finite element analysis of a 1D Neo-Hookean hyperelastic model on near-term quantum hardware.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.25830","ref_index":31,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Utility-scale quantum experiments using dynamic circuits to address collective dissipation in interacting qubits","primary_cat":"quant-ph","submitted_at":"2026-05-25T13:28:37+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Demonstration of utility-scale quantum simulation of collective dissipation in 1D qubit chains up to 86 emitters using Trotterized dynamic circuits, biased CDR error mitigation, and classical MC-TEBD validation on IBM hardware.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.23358","ref_index":40,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"A Compilation Framework for Quantum Simulation of Non-unitary Dynamics","primary_cat":"quant-ph","submitted_at":"2026-05-22T08:22:31+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A new compilation framework treats quantum channels as first-class objects via ChannelIR and LindFront, achieving up to 99% gate count reduction on Lindbladian benchmarks versus unoptimized and Stinespring baselines.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.16195","ref_index":80,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems","primary_cat":"quant-ph","submitted_at":"2026-05-15T17:11:07+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"Develops a quantum algorithm for linear matrix differential equations with query complexity O~(ν L t / ε) that is nearly optimal and yields polynomial to exponential speedups for open quantum system simulation.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.06792","ref_index":1,"ref_count":2,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations","primary_cat":"quant-ph","submitted_at":"2026-05-07T18:00:24+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Mid-circuit stabilizer verification in six-qubit GSE-encoded Clifford Trotter steps reduces logical error rates by up to 54% on Barium ion hardware, with the gain vanishing if checks are deferred to circuit end.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.16613","ref_index":17,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"GreenPeas: Unlocking Adaptive Quantum Error Correction with Just-in-Time Decoding Hypergraphs","primary_cat":"quant-ph","submitted_at":"2026-04-17T18:11:20+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"GreenPeas delivers a just-in-time GPU compiler for decoding hypergraphs that achieves >10x speedup on surface and bivariate bicycle codes, unlocking circuit-level decoding for adaptive quantum error correction.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.05456","ref_index":8,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Phase-Fidelity-Aware Truncated Quantum Fourier Transform for Scalable Phase Estimation on NISQ Hardware","primary_cat":"quant-ph","submitted_at":"2026-04-07T05:39:21+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"A hardware-calibrated truncated QFT reduces gate count 31-44% at 30 qubits while bounding total variation distance error by O(2^{-d}) and outperforming full QFT under moderate noise.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.03445","ref_index":66,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Hybrid Quantum-HPC Middleware Systems for Adaptive Resource, Workload and Task Management","primary_cat":"quant-ph","submitted_at":"2026-04-03T20:37:06+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"The authors present Pilot-Quantum, a middleware for adaptive resource management in hybrid quantum-HPC systems, along with execution motifs and a performance modeling toolkit called Q-Dreamer.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"eprint: https://www.science.org/doi/pd f/10.1126/science.273.5278.1073. doi:10.1126/science.273.5278.1073. [65] T. Lubinski, C. Granade, A. Anderson, A. Geller, M. Roetteler, A. Petrenko, and B. Heim. 2022. Advancing hybrid quantum-classical computation with real-time execution. (2022). https://arxiv.org/abs/2206.12950 arXiv: 2206.12950 [quant-ph]. [66] A. Luckow, M. Santcroos, A. Merzky, O. Weidner, P. Mantha, and S. Jha. 2012. P*: a model of pilot-abstractions. In 2012 IEEE 8th International Conference on E-Science, 1-10. doi:10.1109/eScience.2012.6404423. [67] W. Luo, C.-C. Lu, T. Zhan, and Q. Guan. 2025. A simulation framework for workload management in hybrid quantum- hpc cloud system. InProceedings of the SC '25 Workshops of the International Conference for High Performance"},{"citing_arxiv_id":"2604.02874","ref_index":12,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"A Unified Poisson Summation Framework for Generalized Quantum Matrix Transformations","primary_cat":"quant-ph","submitted_at":"2026-04-03T08:42:08+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A dual Fourier-PSF and contour-PSF framework resolves the smoothness-sparsity trade-off for efficient quantum simulation of singular and holomorphic matrix functions.","context_count":1,"top_context_role":"method","top_context_polarity":"use_method","context_text":"a distinct advantage in performing large-scale matrix transfor- mations. Consequently, a wide array of quantum applications rang- ing from Hamiltonian simulation and quantum linear solvers to quantum walks, which can be unified under the mathe- matical framework of evaluating matrix functionsf(A)[4, 8-11]. While the quantum singular value transformation (QSVT) [12] has emerged as a powerful unified framework for such tasks, often achieving exponential speedups, its direct applicability to general matrix functionsf(A)is constrained. Standard QSVT typically requires the input matrixAto admit a trivial singular value decomposition (e.g., normal or Hermi- tian matrices) or restrictsfto specific forms such as matrix"},{"citing_arxiv_id":"2603.15608","ref_index":63,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Benchmarking quantum simulation with neutron-scattering experiments","primary_cat":"quant-ph","submitted_at":"2026-03-16T17:56:58+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A 50-qubit quantum processor produces dynamical structure factors for KCuF3 that quantitatively match neutron-scattering measurements of its spinon spectrum.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2512.01605","ref_index":9,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Resource Estimation for VQE on Small Molecules: Impact of Fermion Mappings and Hamiltonian Reductions","primary_cat":"quant-ph","submitted_at":"2025-12-01T12:24:00+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Fermion mappings combined with Z2 tapering and frozen-core approximations reduce qubit counts by up to 50%, gate counts by up to 27.5x, and Pauli strings by up to 2.75x for VQE on small molecules.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2507.06286","ref_index":210,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Krylov Complexity","primary_cat":"hep-th","submitted_at":"2025-07-08T18:00:00+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":2.0,"formal_verification":"none","one_line_summary":"Krylov complexity is a canonical, parameter-independent measure of operator spreading that probes chaotic dynamics to late times and admits a geometric interpretation in holographic duals.","context_count":1,"top_context_role":"background","top_context_polarity":"unclear","context_text":"cise about the sense of our approximation, by imposing that ||U(t) − Uapprox(t)|| < ϵ for some small positive ϵ with respect to a suitable matrix norm,∥ · ∥ . Moreover, one can show that eachUi can be approximated to arbi- trary precision by repeated application of a simple and finite set of unitary operators, sayU = \b Uel a acting only on single qubits and pairs of qubits (Lloyd, 1996). This means that we can define the quantum computational complexity of an operator7 U(t), denoted C[U(t)] as the minimal n, such that ∥U(t) − nY a=1 Uel i ∥ < ϵ , (19) where each Uel i is chosen from the small finite set of allowed elementary unitaries. Intuitively this resonates wellwiththeideaofcomputationalcomplexitybeingrep- resented by the length of the most efficient logical circuit"},{"citing_arxiv_id":"2504.13532","ref_index":6,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Quantum Walks-Based Adaptive Distribution Generation with Efficient CUDA-Q Acceleration","primary_cat":"quant-ph","submitted_at":"2025-04-18T07:53:03+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Quantum walks integrated with variational circuits and CUDA-Q acceleration generate high-fidelity adaptive probability distributions for 1D financial modeling and 2D digit patterns.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2401.15829","ref_index":3,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice","primary_cat":"quant-ph","submitted_at":"2024-01-29T01:28:42+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}