REVIEW 16 cited by
Next-Generation Topology of D-Wave Quantum Processors
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 16 Pith papers
-
Towards Datalog on Quantum Annealers: Compiling Recursive Logic Programs with Bottom-up Semantics to 2-local Ising Models
A Lean-4-verified compiler maps recursive Datalog programs to 2-local Ising models whose ground state is the program's minimal Herbrand model, but simulated annealers reach that state only for small instances.
-
Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform
A Walsh-Fourier least-squares projection of constraint penalties onto hardware-supported quadratic terms gives chain-free QUBO encodings that, on tested MDKP benchmarks, often beat full-pairwise projections and unbala...
-
A Reality Check on Quantum Optimisation: Evidence from an Industrial Case Study
On industrial job-shop scheduling instances, IBM and D-Wave quantum hardware solve only toy problems; the Fujitsu Digital Annealer with tailored QUBO formulations handles industry-scale instances and beats the paper's...
-
Where the Quantum Lives in D-Wave Hybrid Portfolio Optimization: An Operational Decomposition Audit
LeapHybridCQM matches Gurobi optima with ~0.68% QPU wall-clock, classical Tabu matches those objectives, and penalty encoding forces a complete logical graph independent of covariance density.
-
Performance enhancing of hybrid quantum-classical Benders approach for MILP optimization
Precomputed embeddings reduce the preprocessing overhead of a quantum-annealer-based Benders decomposition by about an order of magnitude on small transmission-network expansion problems, with no loss in solution quality.
-
Quantum Annealing for Realistic Traffic Flow Optimization: Clustering and Data-Driven QUBO
A data-driven QUBO pipeline with Leiden clustering solves traffic route assignment on 10,000-vehicle subproblems with D-Wave's hybrid annealer within ~1% of Gurobi under matched time budgets.
-
Magnetic Memory and Hysteresis from Quantum Transitions: Theory and Experiments on Quantum Annealers
A hybrid Landau-Zener plus semiclassical domain-wall kinetics model reproduces quantum hysteresis observed in up to 4,906-qubit D-Wave experiments, where classical 1D systems would show no hysteresis.
-
Compensating connectivity restrictions in quantum annealers via splitting and linearization techniques
A splitting-plus-linearization algorithm with random hardware-graph permutations matches large-neighborhood local search on QUBOs while avoiding minor embeddings, but its monotonicity guarantee only holds for damping ...
-
Finite-temperature criticality through quantum annealing
A calibrated quantum annealing protocol recovers the finite-temperature critical point and critical exponents of the 2D Ising ferromagnet on lattices up to 2640 spins.
-
Robust Wavelength Selection for Partial Least Squares Sugar Content Estimation Using Combinatorial Bayesian Optimization
A Bayesian-optimization-based wavelength selector produces more consistent and locally stable sugar-content predictions than genetic algorithms or simulated annealing on a small plum NIR dataset.
-
Erasing Classical Memory with Quantum Fluctuations: Shannon Information Entropy of Reverse Quantum Annealing
Shannon entropy of magnetic domain-wall positions, measured on three D-Wave quantum annealers, reveals a crossover from full memory retention to full memory loss as the transverse field increases, shifting with anneal...
-
Effectiveness of Hybrid Optimization Method for Quantum Annealing Machines
For fully-connected random Ising models of 240 to 640 spins, solving a spin-reduced subproblem on a quantum annealer improves on preprocessing simulated annealing, and the optimal subproblem size grows with quantum an...
-
Quantum Annealing for Machine Learning: Applications in Feature Selection, Instance Selection, and Clustering
Quantum annealing matched simulated annealing on small QUBO-based machine learning tasks, with a hybrid classical clustering plus quantum medoid refinement pipeline giving the best submitted retrieval score in the clu...
-
Hamiltonian formulations of centroid-based clustering
A family of QUBO Hamiltonians for binary clustering that encodes cluster centroids via cluster-size variables, enabling combined intracluster, intercluster, and constrained objectives.
-
A comprehensive benchmark of an Ising machine on the Max-Cut problem
The Digital Annealer finds better Max-Cut solutions than selected classical heuristics on a majority of medium-to-large instances, but its advantage depends on instance size and numeric precision.
-
Observation of Magnetic Devil's Staircase-Like Behavior in Quasiperiodic Qubit Lattices
Stepwise magnetization curves in quasiperiodic antiferromagnetic Ising lattices are observed on a quantum annealer and labeled devil's staircase-like, though no fractal scaling or rational plateaus are demonstrated.
Discussion (0). Continue with ORCID to comment.