A coherence law based on the readout-visible aligned coherence rate (a Rayleigh quotient of the noise generator) predicts gradient survival in noisy U(1)-equivariant QNNs, with simulations confirming R²=0.979 and a special channel test showing no loss where predicted.
Bakalov, Frédéric Sauvage, Alexander F
8 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
fields
quant-ph 8roles
background 1polarities
unclear 1representative citing papers
AI coding agents evolve simple ground-state protocols into improved versions for VQE, DMRG, and AFQMC on spin models and molecules by using executable energy scores under fixed compute budgets.
Fragment classification is efficiently learnable by quantum neural networks under suitable conditions but resists known classical dequantization techniques.
A quantum machine learning surrogate based on parameterized circuits with data re-uploading approximates the full BGK collision dynamics in LBM across all admissible relaxation parameters and is validated on Taylor-Green vortex and double shear layer benchmarks.
The work constructs a permutation-equivariant quantum GNN that implements message passing at selectable Weisfeiler-Leman levels, supports pre-training on small graphs, and demonstrates readout scalability with simulations up to 56 qubits on synthetic, molecular, and TSP datasets.
CV-ADAPT-VQE with tailored symmetry-preserving pools achieves significantly shallower circuits than Hamiltonian-based VQE for bosonic lattice models in GPU classical simulations.
QTL unifies expectation-value minimization with CVaR and Gibbs heuristics under one tunable operator, amplifying gradients in structured cases while preserving global minima and shifting the bottleneck to measurement variance.
A necessary condition for variational quantum circuits to reach exact ground states requires matching module projection norms between input and solution, enabling classical O(n^5) exact solvers for problems like MaxCut.
citing papers explorer
-
A Coherence Law for Trainability in Noisy Equivariant Quantum Neural Networks
A coherence law based on the readout-visible aligned coherence rate (a Rayleigh quotient of the noise generator) predicts gradient survival in noisy U(1)-equivariant QNNs, with simulations confirming R²=0.979 and a special channel test showing no loss where predicted.
-
Optimizing ground state preparation protocols with autoresearch
AI coding agents evolve simple ground-state protocols into improved versions for VQE, DMRG, and AFQMC on spin models and molecules by using executable energy scores under fixed compute budgets.
-
A Quantum-Classical Surrogate Model for the Collision Operator of the Lattice Boltzmann Method
A quantum machine learning surrogate based on parameterized circuits with data re-uploading approximates the full BGK collision dynamics in LBM across all admissible relaxation parameters and is validated on Taylor-Green vortex and double shear layer benchmarks.
-
Scalable Message-Passing Quantum Graph Neural Networks in the Weisfeiler-Leman Hierarchy
The work constructs a permutation-equivariant quantum GNN that implements message passing at selectable Weisfeiler-Leman levels, supports pre-training on small graphs, and demonstrates readout scalability with simulations up to 56 qubits on synthetic, molecular, and TSP datasets.
-
Continuous-variable ADAPT-VQE for bosonic lattice models
CV-ADAPT-VQE with tailored symmetry-preserving pools achieves significantly shallower circuits than Hamiltonian-based VQE for bosonic lattice models in GPU classical simulations.
-
Quantum Tilted Loss in Variational Optimization: Theory and Applications
QTL unifies expectation-value minimization with CVaR and Gibbs heuristics under one tunable operator, amplifying gradients in structured cases while preserving global minima and shifting the bottleneck to measurement variance.
-
Reachability Constraints in Variational Quantum Circuits: Optimization within Polynomial Group Module
A necessary condition for variational quantum circuits to reach exact ground states requires matching module projection norms between input and solution, enabling classical O(n^5) exact solvers for problems like MaxCut.