{"total":11,"items":[{"citing_arxiv_id":"2607.01653","ref_index":23,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Preparing a Thermofield Double State with Feedback Quantum Algorithms","primary_cat":"hep-th","submitted_at":"2026-07-02T03:25:37+00:00","verdict":"UNVERDICTED","verdict_confidence":"UNKNOWN","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A hybrid feedback algorithm combining imaginary-time evolution and time-rescaling prepares the TFD ground state of the Maldacena-Qi model with near-unit fidelity.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.20975","ref_index":91,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Solving Einstein Field Equations on a Digital Quantum Computer","primary_cat":"gr-qc","submitted_at":"2026-06-18T22:44:08+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"A quantum algorithm for evolving Schwarzschild spacetime in the WEBB NR formalism is implemented in Qiskit and tested on simulators and IBM quantum computers.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.07559","ref_index":15,"ref_count":2,"confidence":0.88,"is_internal_anchor":false,"paper_title":"svPITE: A Python package for the state-vector-based probabilistic imaginary-time evolution algorithm","primary_cat":"quant-ph","submitted_at":"2026-05-08T10:34:02+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":3.0,"formal_verification":"none","one_line_summary":"svPITE is a Python package for ground-state preparation via probabilistic imaginary-time evolution, supporting state-vector and shot-based modes with exact-diagonalization benchmarking and interoperability for dynamical observables.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.21123","ref_index":37,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Qubit-efficient and gate-efficient encodings of graph partitioning problems for quantum optimization","primary_cat":"quant-ph","submitted_at":"2026-04-22T22:26:09+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"A new qubit-efficient HUBO encoding for graph partitioning problems like minimum coloring uses logarithmic bits and a lexicographic penalty to cut resources while providing provable optimality conditions.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"HamiltonianH 1 whose ground state encodes the optimum [10], [33]. Practical devices typically support only quadratic Ising models, requiring higher-order problems to be reduced to quadratic order before execution. Minimizing qubit count is especially important here, as the inverse spectral gap- which is proportional to Time-to-Solution-typically grows exponentially with qubit number [37]. C. Graph Partitioning Problems The specifc COPs we treat in this work have the following properties. Given an undirected, simple graphG= (V, E): (i)Vertex labelling.Each vertexv∈Vmust be assigned a labelℓ v ∈ {0,1, . . . , k−1}(i.e.,[k]), wherek≤ |V|. (ii)Pairwise decomposability.There exists a pairwise cost or constraint functionϕ u,v(ℓu, ℓv)for each edge(u, v)∈"},{"citing_arxiv_id":"2604.09483","ref_index":57,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Quantum Randomized Subspace Iteration","primary_cat":"quant-ph","submitted_at":"2026-04-10T16:47:22+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"QRSI spans degenerate quantum eigenspaces almost surely by conjugating the Hamiltonian with random unitaries on g parallel branches and using subspace estimation, while exactly preserving the spectral gap.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"URLhttp://dx.doi.org/10. 26421/QIC12.11-12-1. [56] Dominic W. Berry, Andrew M. Childs, and Robin Kothari. Hamiltonian simulation with nearly optimal de- pendence on all parameters. In2015 IEEE 56th Annual Symposium on Foundations of Computer Science, page 792-809. IEEE, October 2015. doi:10.1109/focs.2015.54. URLhttp://dx.doi.org/10.1109/FOCS.2015.54. [57] Nicholas H. Stair, Renke Huang, and Francesco A. Evan- gelista. A multireference quantum krylov algorithm for strongly correlated electrons, 2019. URLhttps: //arxiv.org/abs/1911.05163. [58] Cristian L. Cortes and Stephen K. Gray. Quantum krylov subspace algorithms for ground- and excited-state energy estimation.Physical Review A, 105(2), February 2022."},{"citing_arxiv_id":"2604.03445","ref_index":76,"ref_count":1,"confidence":0.88,"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":"McArdle, M. Neeley, T. O'Brien, B. O'Gorman, I. Ozfidan, M. D. Radin, J. Romero, N. Rubin, N. P. D. Sawaya, K. Setia, S. Sim, D. S. Steiger, M. Steudtner, Q. Sun, W. Sun, D. Wang, F. Zhang, and R. Babbush. 2019. Openfermion: the electronic structure package for quantum computers. (2019). https://arxiv.org/abs/1710.07629 arXiv: 1710.07629[quant-ph]. [76] Microsoft Azure Quantum. 2025. Interferometric single-shot parity measurement in inas-al hybrid devices.Nature, 638, 651-655. doi:10.1038/s41586-024-08445-2. [77] S. Minami, K. Nakaji, Y. Suzuki, A. Aspuru-Guzik, and T. Kadowaki. 2025. Generative quantum combinatorial optimization by means of a novel conditional generative quantum eigensolver. (2025)."},{"citing_arxiv_id":"2602.22313","ref_index":40,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors","primary_cat":"quant-ph","submitted_at":"2026-02-25T19:00:01+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Quantum simulation methods for Thirring and Gross-Neveu fermionic models with arbitrary flavors, including gate complexity bounds and ground-state preparation up to 20 qubits.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2511.10267","ref_index":38,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"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":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":"2507.21883","ref_index":44,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Sampling (noisy) quantum circuits through randomized rounding","primary_cat":"quant-ph","submitted_at":"2025-07-29T14:56:17+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Gaussian randomized rounding on two-qubit marginals of depth-D circuits with local depolarizing noise p yields samples whose expected Max-Cut cost matches the noisy quantum device up to an approximation ratio of 1-O[(1-p)^D].","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2504.03237","ref_index":74,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Improved Strategies for Fermionic Quantum Simulation with Global Interactions","primary_cat":"quant-ph","submitted_at":"2025-04-04T07:37:25+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Quantum circuits for single and double fermionic excitations on ion traps reduce MS gate counts by factors of 2 and 4 respectively by using global interactions for optimal parallelism.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2406.14411","ref_index":11,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"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}],"limit":50,"offset":0}