QCP 2021 "Reducing quantum annealing biases for solving the graph partitioning problem"

QCP 2021 "Reducing quantum annealing biases for solving the graph partitioning problem"Подробнее

Q2B 2020 | Optimal Protocols in Quantum Annealing and QAOA Problems | Alexey GorshkovПодробнее

The Graph Partitioning ProblemПодробнее

Understanding how quantum annealing solves problemsПодробнее

Applications of Quantum Annealing to Music Theory - Özlem Salehi et al. - [1st ISQCMC, RPS4, 2021]Подробнее

A Quantum Annealing Algorithm For The Qubit Allocation ProblemПодробнее

QIP2021 | Quantum speedups for graph sparsification, graph cut problems... (Simon Apers)Подробнее

QCP 2021 "Improved and fully characterized QUBO reformulations of constrained COPs"Подробнее

14.54c | How to calculate the Kb for (CH3)3N from equilibrium concentrationsПодробнее

Topological and subsystem codes on low-degree graphs with flag qubitsПодробнее

Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian SolvingПодробнее

QIP2021 | Q-algorithms for graph problems... // Q-algorithms for learning graphs (Lee&Shao)Подробнее

UCBerkeley: Solutions to Integer Programming from Quantum AnnealingПодробнее

Why Partitioning is Difficult When Working with a GraphПодробнее

Graph theory, optimization, and quantum algorithmsПодробнее

Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph PartitioningПодробнее