Next-Generation Topology of D-Wave Quantum Processors
arXiv:2003.00133
Abstract
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 topology compared to the existing Chimera topology. It also presents some initial performance results for simple, standard Ising model classes of problems.
References in corpus (6)
- Error corrected quantum annealing with hundreds of qubits
- Zero--Temperature Quantum Phase Transition of a Two--Dimensional Ising Spin--Glass
- Glassy Chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines
- Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension
- Efficient subgraph-based sampling of Ising-type models with frustration
- Critical and Griffiths-McCoy singularities in quantum Ising spin-glasses on d-dimensional hypercubic lattices: A series expansion study
Cited by in corpus (19)
- Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
- Adiabatic Quantum Linear Regression
- Unconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization
- 3-Regular 3-XORSAT Planted Solutions Benchmark of Classical and Quantum Heuristic Optimizers
- Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm
- Quantum Computing for Quantum Tunnelling
- Prospects and challenges of quantum finance
- Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm
- High-quality Thermal Gibbs Sampling with Quantum Annealing Hardware
- Improving performance of logical qubits by parameter tuning and topology compensation
- Quantum Isomer Search
- Customized quantum annealing schedules
- Architectural considerations in the design of a third-generation superconducting quantum annealing processor
- Experimental Demonstrations of Native Implementation of Boolean Logic Hamiltonian in a Superconducting Quantum Annealer
- Minimizing polynomial functions on quantum computers
- Mapping NP-Hard Problems to Restricted Adiabatic Quantum Architectures
- Solving Large Break Minimization Problems in a Mirrored Double Round-robin Tournament Using Quantum Annealing
- Leveraging Quantum Annealer to identify an Event-topology at High Energy Colliders
- A Hybrid Framework Using a QUBO Solver For Permutation-Based Combinatorial Optimization