Quantum annealing versus digital computing. An experimental comparison
From MaRDI portal
Recommendations
- Quantum annealing of hard problems
- Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers
- Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems
- Quantum solutions for densest \(k\)-subgraph problems
- Quantum annealing of the graph coloring problem
Cites work
- A case study in programming a quantum annealer for hard operational planning problems
- A fixed-parameter algorithm for the Max-Cut problem on embedded 1-planar graphs
- A polynomial algorithm for the max-cut problem on graphs without long odd cycles
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Derandomizing Approximation Algorithms Based on Semidefinite Programming
- Easy and difficult objective functions for max cut
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- Exact ground states of two-dimensional \(\pm J\) Ising spin glasses
- Experiments in quadratic 0-1 programming
- Fast clique minor generation in Chimera qubit connectivity graphs
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs
- scientific article; zbMATH DE number 1496855 (Why is no real title available?)
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Lifting and separation procedures for the cut polytope
- Maximum cut parameterized by crossing number
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- On the cut polytope
- Optimization, approximation, and complexity classes
- PANDA: a software for polyhedral transformations
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- QUBO formulations for the graph isomorphism problem and related problems
- Reducibility among combinatorial problems
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- The ellipsoid method and its consequences in combinatorial optimization
- The max-cut problem on graphs not contractible to \(K_ 5\)
- Unifying maximum cut and minimum cut of a planar graph
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
Cited in
(27)- Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report
- Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers
- Quantum solutions for densest \(k\)-subgraph problems
- Mapping a logical representation of TSP to quantum annealing
- Statistical quality assessment of Ising-based annealer outputs
- Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems
- On computational capabilities of Ising machines based on nonlinear oscillators
- Modeling the Costas array problem in QUBO for quantum annealing
- Building an iterative heuristic solver for a quantum annealer
- Garden optimization problems for benchmarking quantum annealers
- Embedding of complete graphs in broken Chimera graphs
- D-Wave and predecessors: from simulated to quantum annealing
- The mathematics of quantum-enabled applications on the D-wave quantum computer
- How fast can quantum annealers count?
- Inter-generational comparison of quantum annealers in solving hard scheduling problems
- On connection among quantum-inspired algorithms of the Ising model
- Optimal sufficient requirements on the embedded Ising problem in polynomial time
- Ising Machines for Diophantine Problems in Physics
- Faster exact solution of sparse maxcut and QUBO problems
- Solving larger maximum clique problems using parallel quantum annealing
- Mathematical aspects of the Digital Annealer's simulated annealing algorithm
- Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B
- Minor embedding in broken chimera and derived graphs is NP-complete
- Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling
- Curve fitting on a quantum annealer for an advanced navigation method
- Last fifty years of integer linear programming: a focus on recent practical advances
- Convergence of the sum-of-squares hierarchy for quadratic optimization over roots-of-unity
This page was built for publication: Quantum annealing versus digital computing. An experimental comparison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5102052)
