{"arxiv_id":"2002.12508","incoming":{"papers":24,"sentences":57,"groups":[{"kind":"extends","label":"Builds on it","papers":1,"sentences":1,"quotes":[{"arxiv_id":"2004.04164","title":"Fast digital methods for adiabatic state preparation","url":"/paper/2004.04164","section":"Techniques for Algorithm [ref]","sentence":"However, this problem is easily fixed by modifying one of the proofs in [ref] ; see Section [ref] for details.","intent_p":0.82,"contests_p":null}]},{"kind":"method_or_tool","label":"Uses its method or tool","papers":2,"sentences":12,"quotes":[{"arxiv_id":"2004.04164","title":"Fast digital methods for adiabatic state preparation","url":"/paper/2004.04164","section":"Techniques for Algorithm [ref]","sentence":"Instead, we combine the algorithm of Lin and Tong [ref] with time-dependent Hamiltonian simulation [ref] .","intent_p":0.91,"contests_p":null},{"arxiv_id":"2302.11578","title":"Guidable Local Hamiltonian Problems with Implications to Heuristic Ans\\\"atze State Preparation and the Quantum PCP Conjecture","url":"/paper/2302.11578","section":"Overview of techniques","sentence":"Our technique can essentially be viewed as a dequantization of Lin and Tong's ground state energy estimation algorithm [ref] : here one assumes access to a unitary $U_H$ that implements a block-encoding of $H$.","intent_p":0.97,"contests_p":null}]},{"kind":"comparison","label":"Compares with it","papers":3,"sentences":5,"quotes":[{"arxiv_id":"2004.04164","title":"Fast digital methods for adiabatic state preparation","url":"/paper/2004.04164","section":"Faster preparation of ground states","sentence":"Algorithm [ref] essentially combines the approach of [ref] , which assumes access to a oracle that prepares an initial state with bounded overlap with the ground state, with an explicit procedure for this initial state preparation.","intent_p":0.82,"contests_p":null},{"arxiv_id":"2608.22470","title":"Sample-Query Interconversion of Block Encoding of Unknown Quantum States","url":"/paper/2608.22470","section":"Conclusion","sentence":"For ground-state preparation, we showed that, for $α=Θ(1)$, the joint dependence $1/(γΔ)$ on the initial overlap $γ$ and the spectral gap $Δ$ is unavoidable for a simple diagonal marked family, complementing QSVT-based eigenstate-filtering results [ref] .","intent_p":0.87,"contests_p":null},{"arxiv_id":"2305.04908","title":"Tight Bounds for Quantum Phase Estimation and Related Problems","url":"/paper/2305.04908","section":"Phase estimation with advice","sentence":"Their setting is slightly different from ours, they focus on preparing the ground state[Because generalized maximum-finding (Lemma [ref]) actually outputs a state in addition to an estimate, our algorithms can be modified to also output a state that is close to the top eigenspace of $U$.] of a given Hamiltonian without a known bound on its spectrum, but [ref] implies a cost-$O(log(1/γ)log(1/δ)loglog(1/δ)/γδ)$ algorithm for our row 8.","intent_p":0.8,"contests_p":null}]},{"kind":"background","label":"Cites it as background","papers":3,"sentences":3,"quotes":[{"arxiv_id":"2608.24493","title":"Optimal Lower Bound for Ground-State Energy Estimation with a Guiding State","url":"/paper/2608.24493","section":"Our results","sentence":"The block-encoding model has been proven useful for a variety of tasks, including phase estimation [ref] and ground-state preparation [ref] , and combined with quantum singular-value transformation unifies many quantum algorithms [ref] .","intent_p":0.97,"contests_p":null},{"arxiv_id":"2012.09194","title":"Nearly tight Trotterization of interacting electrons","url":"/paper/2012.09194","section":"Introduction","sentence":"Since then, various quantum simulation algorithms have been developed [ref] , with potential applications in studying condensed matter physics [ref] , quantum chemistry [ref] , quantum field theories [ref] , superstring/M-theory [ref] , as well as in designing other classical [ref] and quantum algorithms [ref] .","intent_p":0.99,"contests_p":null},{"arxiv_id":"2401.07912","title":"Lower Bounds for Unitary Property Testing with Proofs and Advice","url":"/paper/2401.07912","section":"Ground state preparation of spectrally-gapped Hamiltonians","sentence":"It is well known that the spectral gap $γ(H)$, that is the difference between the energies of the ground state and the first excited state of $H$, plays an important role in how difficult this problem is [ref] .","intent_p":0.97,"contests_p":null}]}],"unlabelled_sentences":36},"outgoing":{"papers":9,"sentences":10,"groups":[{"kind":"background","label":"Cites as background","papers":5,"sentences":5,"quotes":[{"arxiv_id":"1901.07653","title":"Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution","url":"/paper/1901.07653","section":"Introduction","sentence":"Other such algorithms include quantum imaginary-time evolution, quantum Lanczos [ref] , and quantum filter diagonalization [ref] .","intent_p":0.97,"contests_p":null},{"arxiv_id":"1909.08925","title":"Quantum Filter Diagonalization: Quantum Eigendecomposition without Full Quantum Phase Estimation","url":"/paper/1909.08925","section":"Introduction","sentence":"Other such algorithms include quantum imaginary-time evolution, quantum Lanczos [ref] , and quantum filter diagonalization [ref] .","intent_p":0.97,"contests_p":null},{"arxiv_id":"1911.05163","title":"A Multireference Quantum Krylov Algorithm for Strongly Correlated Electrons","url":"/paper/1911.05163","section":"Introduction","sentence":"Other such algorithms include quantum imaginary-time evolution, quantum Lanczos [ref] , and quantum filter diagonalization [ref] .","intent_p":0.97,"contests_p":null},{"arxiv_id":"1805.00675","title":"Hamiltonian Simulation in the Interaction Picture","url":"/paper/1805.00675","section":"Introduction","sentence":"A key difference between ground state preparation and Hamiltonian simulation, where significant progress has been made in recent years [ref] , is its non-unitary nature.","intent_p":0.94,"contests_p":null},{"arxiv_id":"1912.08854","title":"A Theory of Trotter Error","url":"/paper/1912.08854","section":"Introduction","sentence":"A key difference between ground state preparation and Hamiltonian simulation, where significant progress has been made in recent years [ref] , is its non-unitary nature.","intent_p":0.94,"contests_p":null}]}],"unlabelled_sentences":5},"claims":[],"thresholds":{"intent_p":0.8,"supports_p":0.95,"contests_p":0.7},"method":"Citing sentences come from each paper's LaTeX source; every \\cite marks the sentence and the works it cites. Pith's classifier typed each sentence. A label is shown at intent probability 0.8 or more (0.95 for support), a contest at 0.7 or more. Measured accuracy against two blind model families is at https://pith.science/accuracy. The quoted sentences are the citing authors' own.","held_up":{"arxiv_id":"2002.12508","kind":"model","paper_version":3,"prompt_version":"held-up-v3.5","generated_at":"2026-10-27T17:09:00+00:00","loaded_at":"2026-10-28T01:02:56.144793+00:00","evidence":"substantial","account":[],"groups":[{"kind":"method_or_tool","label":"Uses its method or tool","papers":8,"entries":[{"p":0.91,"quote":null,"citing":[{"self":false,"year":2020,"title":"Fast digital methods for adiabatic state preparation","arxiv_id":"2004.04164"}],"verified":true,"paraphrase":"Combined this paper's algorithm with time-dependent Hamiltonian simulation."},{"p":0.98,"quote":{"text":"We provide estimates for the cost of state preparation based on the $T$-gate count of implementations of Lin and Tong's $𝒰_SP()$ [ref] .","citing":"2210.10872","section":"Introduction"},"citing":[{"self":false,"year":2022,"title":"Quantifying $T$-gate-count improvements for ground-state-energy estimation with near-optimal state preparation","arxiv_id":"2210.10872"}],"verified":true,"paraphrase":"Provided estimates for the cost of state preparation based on the T-gate count of implementations of this paper's U_SP()."},{"p":0.88,"quote":null,"citing":[{"self":false,"year":2025,"title":"Fullqubit alchemist: Quantum algorithm for alchemical free energy calculations","arxiv_id":"2508.16719"}],"verified":true,"paraphrase":"Followed Theorem 6 of this paper for its main algorithm and the correctness of its results."},{"p":1.0,"quote":null,"citing":[{"self":false,"year":2024,"title":"Improved quantum algorithm for calculating eigenvalues of differential operators and its application to estimating the decay rate of the perturbation distribution tail in stochastic inflation","arxiv_id":"2410.02276"}],"verified":true,"paraphrase":"Utilized the quantum algorithm for calculating matrix eigenvalues devised in this paper."},{"p":1.0,"quote":{"text":"Second, we use the method of [ref] to project into the ground state; this has complexity $O(1/δ') = O(1)$.","citing":"2108.03249","section":"Projecting to the Ground State"},"citing":[{"self":false,"year":2021,"title":"Nearly-frustration-free ground state preparation","arxiv_id":"2108.03249"}],"verified":true,"paraphrase":"Used this paper's method to project into the ground state."},{"p":0.99,"quote":null,"citing":[{"self":false,"year":2026,"title":"An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians","arxiv_id":"2605.18241"}],"verified":true,"paraphrase":"Applied this paper's low-energy state preparation algorithm to an extended 2n-qubit Hamiltonian."},{"p":1.0,"quote":null,"citing":[{"self":false,"year":2022,"title":"Simplifying a classical-quantum algorithm interpolation with quantum singular value transformations","arxiv_id":"2207.14810"}],"verified":true,"paraphrase":"Approached EE with the filtering method developed in this paper, relying on the general theory for quantum singular value transformations."},{"p":0.93,"quote":{"text":"We complement our quantum hardness results with classical containment results (of the classically guidable local Hamiltonian problem), obtained through a deterministic dequantized version of Lin and Tong's ground state energy estimation algorithm [ref] .","citing":"2302.11578","section":"Completeness results for the guidable local Hamiltonian problem"},"citing":[{"self":false,"year":2023,"title":"Guidable Local Hamiltonian Problems with Implications to Heuristic Ans\\\"atze State Preparation and the Quantum PCP Conjecture","arxiv_id":"2302.11578"}],"verified":true,"paraphrase":"Obtained classical containment results through a deterministic dequantized version of this paper's ground state energy estimation algorithm."}],"papers_all":11,"self_papers":0,"self_entries":[]},{"kind":"comparison","label":"Compares with it","papers":3,"entries":[{"p":0.83,"quote":null,"citing":[{"self":false,"year":2024,"title":"Enhancing Scalability of Quantum Eigenvalue Transformation of Unitary Matrices for Ground State Preparation through Adaptive Finer Filtering","arxiv_id":"2401.09091"}],"verified":true,"paraphrase":"Noted that its scaling achieves the optimal Delta-scaling but, unlike this paper's algorithm, assumes no lower bound for the spectral gap and employs unitary time evolution through Trotterization instead of block-encoding."},{"p":1.0,"quote":{"text":"We analytically show that while our method exhibits a quadratic query complexity scaling $𝒪(Δ^-2)$—inferior to the linear scaling of Chebyshev-based QSVT [ref] —it offers a practical advantage by eliminating the need for block-encoding and variational optimization.","citing":"2602.19556","section":"Introduction"},"citing":[{"self":false,"year":2026,"title":"Deterministic Ground State Preparation via Power-Cosine Filtering of Time Evolution Operators","arxiv_id":"2602.19556"}],"verified":true,"paraphrase":"Showed analytically that its method's quadratic query complexity scaling is inferior to the linear scaling of this paper's Chebyshev-based QSVT, but offers a practical advantage by eliminating the need for block-encoding and variational optimization."}],"papers_all":14,"self_papers":1,"self_entries":[{"p":1.0,"quote":{"text":"Although our algorithm has a near-optimal dependence on the precision, the dependence on $p_0$ (more precisely, on its lower bound $η$), which scales as $p_0^-2$ in Corollary [ref], is far from optimal compared to the $p_0^-1/2$ scaling in Refs. [ref] .","citing":"2102.11340","section":"Discussions"},"citing":[{"self":true,"year":2021,"title":"Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers","arxiv_id":"2102.11340"}],"verified":true,"paraphrase":"Said that its algorithm's dependence on p_0, scaling as p_0^-2, is far from optimal compared to the p_0^-1/2 scaling in this paper."}]}],"counts":{"by_kind":{"extends":4,"comparison":14,"method_or_tool":11},"dropped":{"relied_on":0,"unknown_ids":0,"account_lines":0,"contest_vetoed":0,"below_threshold":0,"contest_drawback":0,"contest_without_basis":0,"contest_not_one_sentence":0,"contest_on_group_citation":0},"papers_read":17,"self_papers":3,"citing_papers":99,"sentences_read":30,"citing_sentences":235,"unambiguous_read":30,"typed_independent":21,"independent_papers":96,"by_kind_independent":{"extends":4,"comparison":13,"method_or_tool":11}},"input_sha256":"c41c8a16b43547ebb61582cb733b98ee6883d85bebc0d795c974143b8d6c4e3e","method":"For a paper with five or more citing arXiv papers, Pith selected up to 40 citing sentences its citation classifier typed, read those whose citation markers point at this paper alone, and wrote one paraphrase for each later paper in each group, each resting on one sentence. A later paper is listed under a label only when the classifier gives one of its sentences that label at intent probability 0.8 or more (0.95 for support), Pith's reading of the sentence finds that the citing paper itself did it, and a second check of the paraphrase against the sentence passes. The section lists uses only: building on the paper, using its method, tool, data or values, comparing with it and citing it as support. It does not list criticism or disagreement, so their absence says nothing about how the paper has been received. Code counted the papers, wrote the summary from the listed entries, set the evidence level and linked each entry to its citing paper. Quotes are copied from the citing sentence and shown only when the citing paper's licence is CC BY, CC BY-SA or CC0; otherwise the paraphrase is shown. Papers that share an author with this one are listed apart. A paper with fewer citing papers gets a line counted by code, which names uses only: a later paper whose only label is a contest is counted as not described.","line":null,"summary":"10 later papers by other authors are listed below: 8 used its method or tool and 2 compared their own results with it. 1 more paper by the same authors is listed: 1 compared its own results with it."},"_links":{"html":"https://pith.science/paper/2002.12508"}}