{"arxiv_id":"2310.11505","incoming":{"papers":49,"sentences":115,"groups":[{"kind":"extends","label":"Builds on it","papers":1,"sentences":1,"quotes":[{"arxiv_id":"2507.10851","title":"A unified approach to quantum resource theories and a new class of free operations","url":"/paper/2507.10851","section":"Introduction","sentence":"Our framework encompasses the results in [ref] as special cases, but also the resource theories in Refs. [ref] , for which we explicitly derive $$.","intent_p":0.8,"contests_p":null}]},{"kind":"method_or_tool","label":"Uses its method or tool","papers":2,"sentences":2,"quotes":[{"arxiv_id":"2409.18918","title":"Subspace Preserving Quantum Convolutional Neural Network Architectures","url":"/paper/2409.18918","section":"Introduction","sentence":"To design such an algorithm, we used Hamming weight (HW) preserving quantum circuits [ref] , a particular type of subspace preserving framework that allows one to avoid BP [ref] by considering a Hilbert space of polynomial size at the cost of having only a polynomial advantage, that could be of high degree.","intent_p":0.88,"contests_p":null},{"arxiv_id":"2506.22310","title":"Trainability of Parametrised Linear Combinations of Unitaries","url":"/paper/2506.22310","section":"Linear combinations of fermionic Gaussian unitaries / matchgate circuits","sentence":"We leverage the work of [ref] in <ref> to obtain $E[m_i^2], E[m_i]^2$.","intent_p":0.93,"contests_p":null}]},{"kind":"comparison","label":"Compares with it","papers":3,"sentences":3,"quotes":[{"arxiv_id":"2605.27795","title":"Geometric Analysis of Variational Quantum Eigensolver","url":"/paper/2605.27795","section":"Product-Unitary Formulation","sentence":"Unlike existing BP analyses [ref] , which are primarily based on concentration arguments, our analysis is based on deterministic convergence theory and characterizes the trainability of the product-unitary objective through its optimization dynamics.","intent_p":0.98,"contests_p":null},{"arxiv_id":"2312.08105","title":"Towards determining the presence of barren plateaus in some chemically inspired variational quantum algorithms","url":"/paper/2312.08105","section":"Separation between single and double excitation rotations","sentence":"It is important to note that these results [ref] cannot be directly applied in our setting for different reasons, such as $𝔤$ being real, $ρ,O∉𝔤$, or the considered is a specific one that differs from ours.","intent_p":0.83,"contests_p":null},{"arxiv_id":"2606.09773","title":"From Pauli Strings to Quantum Dynamics: A Unified Characterization","url":"/paper/2606.09773","section":"Key Results in Context","sentence":"Using the Clifford formalism, we provide a basis for the adjoint commutant for Pauli Lie algebras, which is a counterpart to the square commutant described in [ref] via the commutator graph formalism.","intent_p":0.92,"contests_p":null}]},{"kind":"supports_this_paper","label":"Cites it as support","papers":2,"sentences":2,"quotes":[{"arxiv_id":"2604.13735","title":"Reachability Constraints in Variational Quantum Circuits: Optimization within Polynomial Group Module","url":"/paper/2604.13735","section":"Variational optimization and barren plateau","sentence":"In Ref. [ref] , it is shown that each module contributes independently to the variance of the loss gradient,","intent_p":0.98,"contests_p":null},{"arxiv_id":"2405.00781","title":"Barren Plateaus in Variational Quantum Computing","url":"/paper/2405.00781","section":"Link with vanishing gradient problem","sentence":"In addition, it is worth noting that in the quantum setting, the BP phenomenon can be intimately tied to what $ρ$ and $O$ are, as different initial states and measurements can lead to a model having (or not having) exponentially concentrated loss functions [ref] .","intent_p":0.96,"contests_p":null}]},{"kind":"background","label":"Cites it as background","papers":22,"sentences":29,"quotes":[{"arxiv_id":"2608.04252","title":"Dynamical Lie Algebras Cannot Describe Shallow QAOA: Cragged Terrains, Barren Plateaus, and Empirical Hardness Models","url":"/paper/2608.04252","section":"Introduction","sentence":"By assuming that the quantum circuit forms an approximate unitary 2-design over an ambient Lie group, recent work has derived closed-form expressions for the variance of the loss landscape and loss landscape gradients [ref] .","intent_p":0.87,"contests_p":null},{"arxiv_id":"2312.09121","title":"Does provable absence of barren plateaus imply classical simulability?","url":"/paper/2312.09121","section":"What leads to absence of barren plateaus?","sentence":"While the study of barren plateaus was initially limited to case-by-case analyses, recent results have transformed our understanding of this phenomenon [ref] .","intent_p":1.0,"contests_p":null},{"arxiv_id":"2508.10819","title":"Concentration-Free Quantum Kernel Learning in the Rydberg Blockade","url":"/paper/2508.10819","section":"Introduction","sentence":"The promise of near-term applicability has sparked extensive studies of the promises and challenges of QKMs [ref] .","intent_p":0.99,"contests_p":null},{"arxiv_id":"2410.01893","title":"Estimates of loss function concentration in noisy parametrized quantum circuits","url":"/paper/2410.01893","section":"Loss variance calculation","sentence":"Then we have [equation] where $(·,·)$ is the scalar product defined in <ref>. <ref> already gathers many interesting properties discussed in the literature [ref] .","intent_p":0.83,"contests_p":null},{"arxiv_id":"2506.16005","title":"No-go theorems for sublinear-depth group designs","url":"/paper/2506.16005","section":"Matchgate group","sentence":"For our first example, we consider the $n$-qubit matchgate (or free-fermion) group $Spin(2n)$, which we recall to be generated by nearest-neighbor (on a one-dimensional array) $XX$ gates and single-qubit $Z$ gates [ref] .","intent_p":0.99,"contests_p":null}]}],"unlabelled_sentences":78},"outgoing":{"papers":16,"sentences":28,"groups":[{"kind":"method_or_tool","label":"Uses the method or tool of","papers":3,"sentences":3,"quotes":[{"arxiv_id":"2210.07980","title":"Representation Theory for Geometric Quantum Machine Learning","url":"/paper/2210.07980","section":"Introduction","sentence":"This result, along with the previous lemmas, allow us to compute the variance of the loss function via the Weingarten calculus [ref] , and prove the following theorem: The loss function in Eq. [ref] has mean [equation] and variance [equation] Here we defined the $κ$-purity of an operator $M∈$ as $_κ(M)=⟨M_κ,M_κ⟩_𝕀$, and its $κ$-coherence as $_κ(M)=i^κ mod 2⟨M_κ,M_2n-κ⟩_P$.","intent_p":0.95,"contests_p":null},{"arxiv_id":"2305.09957","title":"Quantum neural networks form Gaussian processes","url":"/paper/2305.09957","section":"Introduction","sentence":"This result, along with the previous lemmas, allow us to compute the variance of the loss function via the Weingarten calculus [ref] , and prove the following theorem: The loss function in Eq. [ref] has mean [equation] and variance [equation] Here we defined the $κ$-purity of an operator $M∈$ as $_κ(M)=⟨M_κ,M_κ⟩_𝕀$, and its $κ$-coherence as $_κ(M)=i^κ mod 2⟨M_κ,M_2n-κ⟩_P$.","intent_p":0.95,"contests_p":null},{"arxiv_id":"2307.08956","title":"Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial","url":"/paper/2307.08956","section":"Introduction","sentence":"This result, along with the previous lemmas, allow us to compute the variance of the loss function via the Weingarten calculus [ref] , and prove the following theorem: The loss function in Eq. [ref] has mean [equation] and variance [equation] Here we defined the $κ$-purity of an operator $M∈$ as $_κ(M)=⟨M_κ,M_κ⟩_𝕀$, and its $κ$-coherence as $_κ(M)=i^κ mod 2⟨M_κ,M_2n-κ⟩_P$.","intent_p":0.95,"contests_p":null}]},{"kind":"supports_this_paper","label":"Cites as support","papers":2,"sentences":2,"quotes":[{"arxiv_id":"2307.12654","title":"Gaussian decomposition of magic states for matchgate computations","url":"/paper/2307.12654","section":"Introduction","sentence":"They also have an exponential “extent” [ref] for any fixed $τ∈(0,π]$, meaning that their expansion in Gaussian states requires exponentially many terms leading to nonsimulable loss functions via Wick's theorem.","intent_p":0.96,"contests_p":null},{"arxiv_id":"2307.12912","title":"Classical simulation of non-Gaussian fermionic circuits","url":"/paper/2307.12912","section":"Introduction","sentence":"They also have an exponential “extent” [ref] for any fixed $τ∈(0,π]$, meaning that their expansion in Gaussian states requires exponentially many terms leading to nonsimulable loss functions via Wick's theorem.","intent_p":0.96,"contests_p":null}]},{"kind":"background","label":"Cites as background","papers":7,"sentences":8,"quotes":[{"arxiv_id":"2309.09342","title":"A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits","url":"/paper/2309.09342","section":"Introduction","sentence":"As conceptually explained in [ref] (and as conjectured in [ref] ), a central object to BPs is the Dynamical Lie Algebra (DLA) $$ which quantifies the ultimate expressiveness of a parametrized circuit.","intent_p":0.95,"contests_p":null},{"arxiv_id":"2309.07902","title":"The Adjoint Is All You Need: Characterizing Barren Plateaus in Quantum Ans\\\"atze","url":"/paper/2309.07902","section":"Introduction","sentence":"Recently, two independent works [ref] presented the mathematical foundations for a unified Lie algebraic theory of BPs.","intent_p":0.92,"contests_p":null},{"arxiv_id":"2211.01477","title":"On the practical usefulness of the Hardware Efficient Ansatz","url":"/paper/2211.01477","section":"Introduction","sentence":"Over the past few years, researchers have started to unravel the different sources of BPs through case-specific analyses [ref] .","intent_p":0.93,"contests_p":null},{"arxiv_id":"2305.09957","title":"Quantum neural networks form Gaussian processes","url":"/paper/2305.09957","section":"Introduction","sentence":"Over the past few years, researchers have started to unravel the different sources of BPs through case-specific analyses [ref] .","intent_p":0.93,"contests_p":null},{"arxiv_id":"2309.15547","title":"Trainability and Expressivity of Hamming-Weight Preserving Quantum Circuits for Machine Learning","url":"/paper/2309.15547","section":"Introduction","sentence":"Over the past few years, researchers have started to unravel the different sources of BPs through case-specific analyses [ref] .","intent_p":0.93,"contests_p":null}]}],"unlabelled_sentences":15},"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":null,"_links":{"html":"https://pith.science/paper/2310.11505"}}