Cover Image

Exact Spin Elimination in Ising Hamiltonians and Energy-Based Machine Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Berloff, Natalia G.
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Discrete Mathematics Data Structures and Algorithms Emerging Technologies Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Exact Causal Attention with 10% Fewer Operations
by: Rybin, Dmitry, et al.
Published: (2025)

Quantum Speedup for Spectral Approximation of Kronecker Products
by: Gao, Yeqi, et al.
Published: (2024)

Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
by: Liao, Meihao, et al.
Published: (2025)

Near-Optimal Parameter Tuning of Level-1 QAOA for Ising Models
by: Vijendran, V, et al.
Published: (2025)

Worst-case Error Bounds for Online Learning of Smooth Functions
by: Xie, Weian
Published: (2025)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
by: Veldt, Nate, et al.
Published: (2025)

Analyzing and improving a classical Betti number estimation algorithm
by: Sorci, Julien
Published: (2025)

Efficient Classical Computation of Single-Qubit Marginal Measurement Probabilities to Simulate Certain Classes of Quantum Algorithms
by: Pradata, Santana Y., et al.
Published: (2024)

Image Computation for Quantum Transition Systems
by: Hong, Xin, et al.
Published: (2025)

An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
by: Liu, Wenjie, et al.
Published: (2023)

Quantum Fourier Transform for Image Processing
by: Zhang, Ze Yu, et al.
Published: (2023)

Infeasibility of constructing a special orthogonal matrix for the deterministic remote preparation of arbitrary n-qubit state
by: Liu, Wenjie, et al.
Published: (2023)

Probing Quantum Telecloning on Superconducting Quantum Processors
by: Pelofske, Elijah, et al.
Published: (2023)

Quantum Circuit Simulation with Fast Tensor Decision Diagram
by: Zhang, Qirui, et al.
Published: (2024)

Resource-aware scheduling of multiple quantum circuits on a hardware device
by: Bhoumik, Debasmita, et al.
Published: (2024)

Algebraic Reduction to Improve an Optimally Bounded Quantum State Preparation Algorithm
by: Belli, Giacomo, et al.
Published: (2026)

A near-optimal zero-free disk for the Ising model
by: Patel, Viresh, et al.
Published: (2023)

Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs
by: Pelofske, Elijah, et al.
Published: (2023)

Online Correlation Clustering: Simultaneously Optimizing All $\ell_p$-norms
by: Davies, Sami, et al.
Published: (2025)

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
by: Crane, Alex, et al.
Published: (2025)

Graph Inference with Effective Resistance Queries
by: Bennett, Huck, et al.
Published: (2025)

Foundational theory for optimal decision tree problems. I. Algorithmic and geometric foundations
by: He, Xi
Published: (2025)

Comparative algorithm performance evaluation and prediction for the maximum clique problem using instance space analysis
by: Sharman, Bharat, et al.
Published: (2025)

Optimal hypersurface decision trees
by: He, Xi
Published: (2025)

Partial Optimality in the Preordering Problem
by: Stein, David, et al.
Published: (2026)

Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
by: Tukan, Murad, et al.
Published: (2024)

Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
by: Chen, Yixin, et al.
Published: (2024)

Breaking Hard Isomorphism Benchmarks with DRESS
by: Velilla, Eduar Castrillo
Published: (2026)

An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
by: Xue, Jinghui, et al.
Published: (2024)

A 4-approximation algorithm for min max correlation clustering
by: Heidrich, Holger, et al.
Published: (2023)

An Exact Solver for Submodular Knapsack Problems
by: Münch, Sabine, et al.
Published: (2025)

UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm
by: Arhire, Andrei, et al.
Published: (2025)

Toward Minimum Graphic Parity Networks
by: Cao, Yixin, et al.
Published: (2025)

Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness
by: Zhang, Bohang, et al.
Published: (2024)

Non-adaptive Learning of Random Hypergraphs with Queries
by: Austhof, Bethany, et al.
Published: (2025)

Learning to Prune Instances of Steiner Tree Problem in Graphs
by: Zhang, Jiwei, et al.
Published: (2022)

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
by: Holtgrefe, Niels, et al.
Published: (2024)

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
by: Kaul, Matthias, et al.
Published: (2024)

Parallel Token Swapping for Qubit Routing
by: Bansal, Ishan, et al.
Published: (2024)

Fault-Tolerant Matroid Bases
by: Bentert, Matthias, et al.
Published: (2025)