# The D-Wave Advantage System : An Overview

@inproceedings{2020TheDA, title={The D-Wave Advantage System : An Overview}, author={}, year={2020} }

This report presents a high-level overview of the D-Wave AdvantageTM quantum computer, with a comparison to its predecessor, the D-Wave 2000QTM system. The Advantage quantum processing unit (QPU) can hold application inputs that are almost three times larger, on average, than those that t on the D-Wave 2000Q QPU. Beyond the capability to read bigger problems, the Advantage QPU can deliver better performance on application-relevant inputs. The D-Wave Advantage System: An Overview

## Figures and Tables from this paper

## 31 Citations

Implementation of a Multiple Target Tracking Filter on an Adiabatic Quantum Computer

- Physics2022 IEEE Aerospace Conference (AERO)
- 2022

Recent work at Fraunhofer FKIE shows that More-field's method for multiple target data association can in theory be solved on an adiabatic quantum computer. The present paper validates the theory and…

Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems

- PhysicsQuantum Inf. Process.
- 2022

We benchmark the quantum processing units of the largest quantum annealers to date, the $$5000+$$
5000
+
qubit quantum annealer Advantage and its 2000+ qubit predecessor D-Wave 2000Q, using…

Solving the Traveling Salesman Problem on the D-Wave Quantum Computer

- Physics, Computer ScienceFrontiers in Physics
- 2021

This paper shows how to solve the traveling salesman problem on an Ising Hamiltonian based quantum annealer by casting it as a quadratic unconstrained binary optimization (QUBO) problem.

EQUAL: Improving the Fidelity of Quantum Annealers by Injecting Controlled Perturbations

- Computer ScienceArXiv
- 2021

EQUAL generates an ensemble of QMIs by adding controlled perturbations to the program QMI, which steers the program away from encountering the same bias during all trials and thus, improves the quality of solutions.

Leveraging Quantum Annealer to identify an Event-topology at High Energy Colliders

- Physics, Computer Science
- 2021

It is shown that a computing complexity can be reduced significantly to the order of polynomials which enables us to decode the “Big” data in a very clear and efficient way.

Garden optimization problems for benchmarking quantum annealers

- Computer ScienceQuantum Inf. Process.
- 2021

It is demonstrated that the system and the new hybrid solver can solve larger problems in less time than their predecessors, however, it is also shown that the solvers based on the 2000+ qubit system sometimes produce more favourable results if they can solve the problems.

Unveiling ground state sign structures of frustrated quantum systems via non-glassy Ising models

- Physics
- 2022

Identiﬁcation of phases in many-body quantum states is arguably among the most important and challenging problems of computational quantum physics. The non-trivial phase structure of geometrically…

Hybrid classical-quantum approach to solve the heat equation using quantum annealers

- PhysicsPhysical Review A
- 2021

The numerical solution of partial differential equations by discretization techniques is ubiquitous in computational physics. In this work we benchmark this approach in the quantum realm by solving…

Performance benefits of increased qubit connectivity in quantum annealing 3-dimensional spin glasses.

- Physics
- 2020

An important challenge in superconducting quantum computing is the need to physically couple many devices using quasi-two-dimensional fabrication processes. Recent advances in the design and…

Experimental Analysis of Quantum Annealers and Hybrid Solvers Using Benchmark Optimization Problems

- Computer ScienceMathematics
- 2022

A novel matrix formulation is developed for the HCP and TSP Hamiltonians, which enables the seamless and automatic integration of benchmark instances in quantum platforms and explains quantitatively why, almost always, running incomplete graph instances requires more qubits than complete instances.

## References

SHOWING 1-8 OF 8 REFERENCES

Next-Generation Topology of D-Wave Quantum Processors

- Computer Science
- 2020

This paper presents an overview of the topology of D-Wave's next-generation quantum processors. It provides examples of minor embeddings and discusses performance of embedding algorithms for the new…

Phase transitions in a programmable quantum spin glass simulator

- PhysicsScience
- 2018

The ability to control and read out the state of individual spins provides direct access to several order parameters, which were used to determine the lattice’s magnetic phases as well as critical disorder and one of its universal exponents.

Performance benefits of increased qubit connectivity in quantum annealing 3-dimensional spin glasses.

- Physics
- 2020

An important challenge in superconducting quantum computing is the need to physically couple many devices using quasi-two-dimensional fabrication processes. Recent advances in the design and…

Observation of topological phenomena in a programmable lattice of 1,800 qubits

- PhysicsNature
- 2018

A large-scale programmable quantum simulation is described, using a D-Wave quantum processor to simulate a two-dimensional magnetic lattice in the vicinity of a topological phase transition.

Ising formulations of many NP problems

- PhysicsFront. Physics
- 2014

This work collects and extends mappings to the Ising model from partitioning, covering and satisfiability, and provides Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21NP-complete problems.

Hybrid Solver Service + Advantage: Technology Update, dwavesys.com/resources/publications (2020)

- Copyright © D-Wave Systems Inc
- 2020

D-Wave Ocean Software Documentation, keyword: minor embedding

- 2020

D-Wave Ocean Software Documentation, keyword: find clique embedding

- 2020