Cover Image

Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhong, Dawei, Francis, Akhil, Rrapaj, Ermal
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Data Structures and Algorithms Emerging Technologies Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Theoretical Approximation Ratios for Warm-Started QAOA on 3-Regular Max-Cut Instances at Depth $p=1$
by: Tate, Reuben, et al.
Published: (2024)

Quantum-inspired Tensor Network for QUBO, QUDO and Tensor QUDO Problems with k-neighbors
by: Subiñas, Sergio Muñiz, et al.
Published: (2026)

Classical and Quantum Heuristics for the Binary Paint Shop Problem
by: Vijendran, V, et al.
Published: (2025)

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

Min-Max Connected Multiway Cut
by: Tiwary, Hans Raj, et al.
Published: (2026)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
by: Shi, Haoyan, et al.
Published: (2024)

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

Universal Coating by 3D Hybrid Programmable Matter
by: Kostitsyna, Irina, et al.
Published: (2023)

Expected Maximin Fairness in Max-Cut and other Combinatorial Optimization Problems
by: Salem, Jad, et al.
Published: (2024)

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

Dynamic Batching of Online Arrivals to Leverage Economies of Scale
by: Bhimaraju, Akhil, et al.
Published: (2023)

Parameterized algorithms for block-structured integer programs with large entries
by: Cslovjecsek, Jana, et al.
Published: (2023)

Comparing Algorithms for Loading Classical Datasets into Quantum Memory
by: Miranskyy, Andriy, et al.
Published: (2024)

A note on the complexity of the picker routing problem in multi-block warehouses and related problems
by: Prunet, Thibault, et al.
Published: (2023)

On computing approximate Lewis weights
by: Apers, Simon, et al.
Published: (2024)

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)

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

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)

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

Exploiting Low-Rank Structure in Max-K-Cut Problems
by: Stevens, Ria, et al.
Published: (2026)

Convex optimization with $p$-norm oracles
by: Adil, Deeksha, et al.
Published: (2024)

Handicap reduction for linear complementarity problems
by: -Nagy, Marianna E., et al.
Published: (2026)

Optimized methods for composite optimization: a reduction perspective
by: Bok, Jinho, et al.
Published: (2025)

Minimum Cost Nowhere-zero Flows and Cut-balanced Orientations
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025)

A nearly optimal randomized algorithm for explorable heap selection
by: Borst, Sander, et al.
Published: (2022)

Assortment optimization given basket shopping behavior using the Ising model
by: Vasilyev, Andrey, et al.
Published: (2025)

On the complexity of the upgrading version of the maximal covering location problem
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)

Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)
by: Zick, Kenneth M.
Published: (2025)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
by: Kasperski, Adam, et al.
Published: (2024)

A rounding and clustering-based exact algorithm for the p-center problem
by: Ales, Zacharie, et al.
Published: (2024)

Expanding the reach of quantum optimization with fermionic embeddings
by: Zhao, Andrew, et al.
Published: (2023)

On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
by: Sergeev, Ivan
Published: (2024)

No Quantum Advantage in Decoded Quantum Interferometry for MaxCut
by: Parekh, Ojas
Published: (2025)

A quantum central path algorithm for linear optimization
by: Augustino, Brandon, et al.
Published: (2023)

TSP integrality gap via 2-edge-connected multisubgraph problem under coincident IP optima
by: Yamanaka, Toshiaki
Published: (2025)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
by: Encz, Koppány István, et al.
Published: (2025)

Tile Reconfiguration by a Finite Automaton
by: Friemel, Jonas, et al.
Published: (2025)

Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures
by: Hinnenthal, Kristian, et al.
Published: (2024)