REVIEW 17 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
Next-Generation Topology of D-Wave Quantum Processors
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 17 Pith papers
-
Ember: An Extensible Benchmark Suite for Quantum Annealing Embedding Algorithms
Ember provides the first standardized, reproducible benchmark framework with 24,016 diverse graph instances for quantum annealing embedding algorithms, showing that no single algorithm performs best across all graph families.
-
Ember: An Extensible Benchmark Suite for Quantum Annealing Embedding Algorithms
Ember introduces a reproducible benchmark suite with 24,016 graph instances for evaluating quantum annealing embedding algorithms across Chimera, Pegasus, and Zephyr topologies.
-
Magnetic Hysteresis Experiments Performed on Quantum Annealers
The paper introduces the first general protocol for magnetic hysteresis on programmable quantum annealers and reports non-monotonic dependence of loop area on quantum fluctuations along with disorder-induced steps.
-
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...
-
Applications of quantum annealing to magnetic dipole hyperfine structure constants: First results beyond energies for atoms
Modified QAE on D-Wave hardware yields magnetic dipole HFS constants for four light atomic systems that match GRASP results at limited precision.
-
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.
-
Simulated Bifurcation Quantum Annealing
SBQA adds inter-replica interactions to simulated bifurcation to mimic quantum tunneling and improves performance on sparse rugged optimization problems over standard SBM.
-
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.
-
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.
-
Where the Quantum Lives in D-Wave Hybrid Portfolio Optimization: An Operational Decomposition Audit
D-Wave hybrid portfolio optimization is dominated by classical decomposition, with QPU access at 0.68% of wall-clock time and classical TabuSampler matching objective values.
-
Where the Quantum Lives in D-Wave Hybrid Portfolio Optimization: An Operational Decomposition Audit
D-Wave's constraint-native hybrid service for mean-variance-turnover portfolio optimization with cardinality constraints is 99.3 percent classical, with mean QPU access of 0.034 seconds out of a 5-second budget, and r...
-
Multi-tasking through quantum annealing
MTQA embeds multiple NP-hard problems such as minimum vertex cover and graph partitioning into spatially distinct regions on quantum hardware, delivering comparable solution quality to single-task annealing with reduc...
-
Designing a Machine Learning-Driven, Cross-Hardware Emulator for Noisy Quantum Computers with Gate-Based Protocols
Supervised ML trained on simulated gate set tomography data predicts noise models to build cross-hardware quantum emulators, validated by matching H2 unitary coupled cluster energy results to real hardware within 0.12...
-
VeloxQ: A Fast and Efficient QUBO Solver
VeloxQ is a classical QUBO solver that reports competitive or superior performance and unique scalability to 10^8-variable sparse instances across benchmarks against quantum annealers, physics-inspired methods, and co...
-
Quantum Annealing: Optimisation, Sampling, and Many-Body Dynamics
Quantum annealing is described as a heuristic for discrete optimization and sampling that also serves as a platform for studying non-equilibrium many-body quantum dynamics with programmable spin systems.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.