Quantum-Relaxation Based Optimization Algorithms: Theoretical Extensions

On a representation of additive operator set functions

Mark A Naimark · 1943

Earlier work this paper cites.

An upper bound for the chromatic number of a graph and its application to timetabling problems

Dominic JA Welsh and Martin B Powell · 1967

Earlier work this paper cites.

On capacity of a quantum communications channel

Alexander Semenovich Holevo · 1979

Earlier work this paper cites.

Geometrical description of quantal state determination

ID Ivonovic · 1981

Earlier work this paper cites.

Optimal state-determination by mutually unbiased measurements

William K Wootters and Brian D Fields · 1989

Earlier work this paper cites.

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Michel X Goemans and David P Williamson · 1995

Earlier work this paper cites.

Optimal lower bounds for quantum automata and random access codes

Ashwin Nayak · 1999

Earlier work this paper cites.

Dense quantum coding and quantum finite automata

Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, and Umesh Vazirani · 2002

Earlier work this paper cites.

On the power of unique 2-prover 1-round games

Subhash Khot · 2002

Earlier work this paper cites.

Maximizing quadratic programs: extending Grothendieck’s inequality

M. Charikar and A. Wirth · 2004

Cited alongside, same era.

Symmetric informationally complete quantum measurements

Joseph M Renes, Robin Blume-Kohout, Andrew J Scott, and Carlton M Caves · 2004

Cited alongside, same era.

Noise stability of functions with low influences: invariance and optimality

Elchanan Mossel, Ryan O’Donnell, and Krzysztof Oleszkiewicz · 2005

Cited alongside, same era.

(4, 1)-quantum random access coding does not exist—one qubit is not enough to recover one of four bits

Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, and Shigeru Yamashita · 2006

Cited alongside, same era.

The complexity of the local Hamiltonian problem

Julia Kempe, Alexei Kitaev, and Oded Regev · 2006

Cited alongside, same era.

Unbounded-error one-way classical and quantum communication complexity

A quantum approximate optimization algorithm

Original

Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014

Later among the works it cites.

A variational eigenvalue solver on a photonic quantum processor

Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Alán Aspuru-Guzik, and Jeremy L O’brien · 2014

Later among the works it cites.

Constructions of quantum random access codes

Takashi Imamichi and Rudy Raymond · 2018

Later among the works it cites.

Performance of hybrid quantum-classical variational heuristics for combinatorial optimization

Giacomo Nannicini · 2019

Later among the works it cites.

Approximate solutions of combinatorial problems via quantum relaxations

Original

Bryce Fuller, Charles Hadfield, Jennifer R Glick, Takashi Imamichi, Toshinari Itoko, Richard J Thompson, Yang Jiao, Marna M Kagele, Adriana W Blom-Schieber, Rudy Raymond, et al · 2021

Later among the works it cites.