Image de couverture de livre

Revisiting Majumdar-Ghosh spin chain model and Max-cut problem using variational quantum algorithms

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Britant, Pathak, Anirban
Format:	Preprint
Publié:	2024
Sujets:	Quantum Physics Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A quantum algorithm for solving 0-1 Knapsack problems
par: Wilkening, Sören, et autres
Publié: (2023)

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
par: Apers, Simon, et autres
Publié: (2021)

A 0.8395-approximation algorithm for the EPR problem
par: Apte, Anuj, et autres
Publié: (2025)

Enumeration algorithms for combinatorial problems using Ising machines: When should we stop exploring energy landscapes?
par: Mizuno, Yuta, et autres
Publié: (2024)

Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers
par: Garg, Kushagra, et autres
Publié: (2025)

A Dobrushin condition for quantum Markov chains: Rapid mixing and conditional mutual information at high temperature
par: Bakshi, Ainesh, et autres
Publié: (2025)

High-level quantum algorithm programming using Silq
par: Bezganovic, Viktorija, et autres
Publié: (2024)

No Quantum Advantage in Decoded Quantum Interferometry for MaxCut
par: Parekh, Ojas
Publié: (2025)

A simple analysis of a quantum-inspired algorithm for solving low-rank linear systems
par: Chen, Tyler, et autres
Publié: (2025)

Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
par: Benchasattabuse, Naphan, et autres
Publié: (2023)

Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs
par: Jennings, David, et autres
Publié: (2023)

No quantum advantage implies improved bounds and classical algorithms for the binary paint shop problem
par: Goh, Mark, et autres
Publié: (2026)

Improved quantum algorithms for linear and nonlinear differential equations
par: Krovi, Hari
Publié: (2022)

Analysis of sum-of-squares relaxations for the quantum rotor model
par: Rao, Sujit
Publié: (2023)

Improved approximation algorithms for the EPR Hamiltonian
par: Ju, Nathan, et autres
Publié: (2025)

Fast quantum algorithm for differential equations
par: Bagherimehrab, Mohsen, et autres
Publié: (2023)

Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem
par: Zhong, Dawei, et autres
Publié: (2024)

The state hidden subgroup problem and an efficient algorithm for locating unentanglement
par: Bouland, Adam, et autres
Publié: (2024)

Fast algorithms for classical specifications of stabiliser states and Clifford gates
par: de Silva, Nadish, et autres
Publié: (2023)

A quantum central path algorithm for linear optimization
par: Augustino, Brandon, et autres
Publié: (2023)

An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms
par: Mitosek, Piotr, et autres
Publié: (2024)

Quantum algorithms and lower bounds for eccentricity, radius, and diameter in undirected graphs
par: Wesołowski, Adam, et autres
Publié: (2025)

Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut
par: Bakshi, Ainesh, et autres
Publié: (2026)

Quantum algorithm for approximating the expected value of a random-exist quantified oracle
par: Rotello, Caleb
Publié: (2024)

Improved algorithms for learning quantum Hamiltonians, via flat polynomials
par: Narayanan, Shyam
Publié: (2024)

Elfs, trees and quantum walks
par: Apers, Simon, et autres
Publié: (2022)

Randomized and quantum approximate matrix multiplication
par: Apers, Simon, et autres
Publié: (2025)

On the quantum time complexity of divide and conquer
par: Allcock, Jonathan, et autres
Publié: (2023)

Quartic quantum speedups for community detection
par: Schmidhuber, Alexander, et autres
Publié: (2025)

Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
par: Abbas, Amira, et autres
Publié: (2025)

Variational ground-state quantum adiabatic theorem
par: Žunkovič, Bojan, et autres
Publié: (2024)

Big data applications on small quantum computers
par: Yogendran, Boniface, et autres
Publié: (2024)

Quantum speedups in solving near-symmetric optimization problems by low-depth QAOA
par: Montanaro, Ashley, et autres
Publié: (2024)

Provably faster randomized and quantum algorithms for $k$-means clustering via uniform sampling
par: Chen, Tyler, et autres
Publié: (2025)

Comparison of Hyperplane Rounding for Max-Cut and Quantum Approximate Optimization Algorithm over Certain Regular Graph Families
par: Tate, Reuben, et autres
Publié: (2025)

Assessing fault-tolerant quantum advantage for $k$-SAT with structure
par: Brehm, Martijn, et autres
Publié: (2024)

An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
par: Liu, Wenjie, et autres
Publié: (2023)

Basic quantum subroutines: finding multiple marked elements and summing numbers
par: van Apeldoorn, Joran, et autres
Publié: (2023)

Nonlinear transformation of complex amplitudes via quantum singular value transformation
par: Guo, Naixu, et autres
Publié: (2021)

Non-unitary enhanced transfer efficiency in quantum walk search on complex networks
par: Nzongani, Ugo, et autres
Publié: (2025)