On the public citation graph

Solving Set Cover with Pairs Problem using Quantum Annealing

0 signed · 85 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11526216openalex-snapshot

Quantum Annealing and Other Optimization Methods

inferredcites →https://doi.org/10.1007/11590156_13openalex-snapshot

The Set Cover with Pairs Problem

inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot

Reducibility among Combinatorial Problems

inferredcites →https://doi.org/10.1007/978-3-031-02518-1openalex-snapshot

Adiabatic Quantum Computation and Quantum Annealing

inferredcites →https://doi.org/10.1007/s11128-008-0082-9openalex-snapshot

Minor-embedding in adiabatic quantum computation: I. The parameter setting problem

inferredcites →https://doi.org/10.1007/s11128-010-0200-3openalex-snapshot

Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design

inferredcites →https://doi.org/10.1007/s11128-013-0683-9openalex-snapshot

Adiabatic quantum programming: minor embedding with hard faults

inferredcites →https://doi.org/10.1007/s11590-011-0289-zopenalex-snapshot

Exact and heuristic approaches for the set cover with pairs problem

inferredcites →https://doi.org/10.1016/0009-2614(94)00117-0openalex-snapshot

Quantum annealing: A new method for minimizing multidimensional functions

inferredcites →https://doi.org/10.1016/j.amc.2011.04.073openalex-snapshot

Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuristics

inferredcites →https://doi.org/10.1016/j.cpc.2015.02.015openalex-snapshot

Optimised simulated annealing for Ising spin glasses

inferredcites →https://doi.org/10.1016/j.physrep.2012.10.002openalex-snapshot

The quantum adiabatic algorithm applied to random optimization problems: The quantum spin glass perspective

inferredcites →https://doi.org/10.1038/nature10012openalex-snapshot

Quantum annealing with manufactured spins

inferredcites →https://doi.org/10.1038/ncomms2920openalex-snapshot

Thermally assisted quantum annealing of a 16-qubit problem

inferredcites →https://doi.org/10.1038/ncomms3067openalex-snapshot

Experimental signature of programmable quantum annealing

inferredcites →https://doi.org/10.1038/nphys2900openalex-snapshot

Evidence for quantum annealing with more than one hundred qubits

inferredcites →https://doi.org/10.1038/srep00571openalex-snapshot

Finding low-energy conformations of lattice protein models by quantum annealing

inferredcites →https://doi.org/10.1038/srep05703openalex-snapshot

Hearing the Shape of the Ising Model with a Programmable Superconducting-Flux Annealer

inferredcites →https://doi.org/10.1038/srep18628openalex-snapshot

Determination and correction of persistent biases in quantum annealers

inferredcites →https://doi.org/10.1038/srep22318openalex-snapshot

Maximum-Entropy Inference with a Programmable Annealer

inferredcites →https://doi.org/10.1088/0305-4470/15/10/028openalex-snapshot

On the computational complexity of Ising spin glass models

inferredcites →https://doi.org/10.1088/1367-2630/16/4/045006openalex-snapshot

Max 2-SAT with up to 108 qubits

inferredcites →https://doi.org/10.1103/physreva.65.042308openalex-snapshot

Quantum search by local adiabatic evolution

inferredcites →https://doi.org/10.1103/physreva.77.052331openalex-snapshot

Nonperturbative k -body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins

inferredcites →https://doi.org/10.1103/physreva.86.042310openalex-snapshot

Solving the graph-isomorphism problem with a quantum annealer

inferredcites →https://doi.org/10.1103/physreva.89.022342openalex-snapshot

Graph isomorphism and adiabatic quantum computing

inferredcites →https://doi.org/10.1103/physreva.90.042317openalex-snapshot

Quantum and classical dynamics in adiabatic computation

inferredcites →https://doi.org/10.1103/physreva.91.042314openalex-snapshot

Consistency tests of classical and quantum models for a quantum annealer

inferredcites →https://doi.org/10.1103/physreva.92.042310openalex-snapshot

Quantum annealing correction with minor embedding

inferredcites →https://doi.org/10.1103/physreva.92.042325openalex-snapshot

Probing for quantum speedup in spin-glass problems with planted solutions

inferredcites →https://doi.org/10.1103/physreva.92.062328openalex-snapshot

Reexamination of the evidence for entanglement in a quantum annealer

inferredcites →https://doi.org/10.1103/physrevb.82.024511openalex-snapshot

Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor

inferredcites →https://doi.org/10.1103/physreve.58.5355openalex-snapshot

Quantum annealing in the transverse Ising model

inferredcites →https://doi.org/10.1103/physrevlett.101.220405openalex-snapshot

Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation

inferredcites →https://doi.org/10.1103/physrevlett.108.010501openalex-snapshot

Ramsey Numbers and Adiabatic Quantum Computing

inferredcites →https://doi.org/10.1103/physrevlett.108.230506openalex-snapshot

Adiabatic Quantum Algorithm for Search Engine Ranking

inferredcites →https://doi.org/10.1103/physrevlett.109.050501openalex-snapshot

Quantum Speedup by Quantum Annealing

inferredcites →https://doi.org/10.1103/physrevlett.111.130505openalex-snapshot

Experimental Determination of Ramsey Numbers

inferredcites →https://doi.org/10.1103/physrevlett.115.230501openalex-snapshot

Heavy Tails in the Distribution of Time to Solution for Classical and Quantum Annealing

inferredcites →https://doi.org/10.1103/physrevx.4.021041openalex-snapshot

Entanglement in a Quantum Annealing Processor

inferredcites →https://doi.org/10.1103/physrevx.5.031026openalex-snapshot

Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly

inferredcites →https://doi.org/10.1103/physrevx.5.031040openalex-snapshot

Quantum Optimization of Fully Connected Spin Glasses

inferredcites →https://doi.org/10.1103/revmodphys.80.1061openalex-snapshot

Colloquium : Quantum annealing and analog quantum computation

inferredcites →https://doi.org/10.1126/science.1057726openalex-snapshot

A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem

inferredcites →https://doi.org/10.1126/science.1068774openalex-snapshot

Theory of Quantum Annealing of an Ising Spin Glass

inferredcites →https://doi.org/10.1126/science.1252319openalex-snapshot

Defining and detecting quantum speedup

inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot

Optimization by Simulated Annealing

inferredcites →https://doi.org/10.1126/science.aaa4170openalex-snapshot

Quantum versus classical annealing of Ising spin glasses

inferredcites →https://doi.org/10.1137/1.9781611972917.7openalex-snapshot

Disjoint-Path Facility Location: Theory and Practice

inferredcites →https://doi.org/10.1140/epjst/e2015-02346-0openalex-snapshot

Reexamining classical and quantum models for the D-Wave One processor

inferredcites →https://doi.org/10.1145/1806689.1806711openalex-snapshot

BQP and the polynomial hierarchy

inferredcites →https://doi.org/10.1145/2482767.2482797openalex-snapshot

Experimental evaluation of an adiabiatic quantum system for combinatorial optimization

inferredcites →https://doi.org/10.1287/ijoc.1040.0085openalex-snapshot

Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms

inferredcites →https://doi.org/10.26421/qic2.3-1openalex-snapshot

Finding cliques by quantum adiabatic evolution

inferredcites →https://doi.org/10.3389/fphy.2014.00005openalex-snapshot

Ising formulations of many NP problems

inferredcites →https://doi.org/10.3389/fphy.2014.00056openalex-snapshot

Discrete optimization using quantum annealing on sparse Ising models

inferredcites →https://doi.org/10.48550/arxiv.0811.0416openalex-snapshot

Training a Binary Classifier with the Quantum Adiabatic Algorithm

inferredcites →https://doi.org/10.48550/arxiv.1004.2226openalex-snapshot

Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems

inferredcites →https://doi.org/10.48550/arxiv.1306.1202openalex-snapshot

A note on QUBO instances defined on Chimera graphs

inferredcites →https://doi.org/10.48550/arxiv.1401.7087openalex-snapshot

How "Quantum" is the D-Wave Machine?

inferredcites →https://doi.org/10.48550/arxiv.1401.7320openalex-snapshot

Different Strategies for Optimization Using the Quantum Adiabatic Algorithm

inferredcites →https://doi.org/10.48550/arxiv.1410.2628openalex-snapshot

Algorithm engineering for a quantum annealing platform

inferredcites →https://doi.org/10.48550/arxiv.1501.06914openalex-snapshot

Entanglement as a resource in adiabatic quantum optimization

inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0007071openalex-snapshot

A Numerical Study of the Performance of a Quantum Adiabatic Evolution Algorithm for Satisfiability

inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0201031openalex-snapshot

Quantum Adiabatic Evolution Algorithms versus Simulated Annealing

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/qute.202300104openalex-snapshot

Quantum Annealing with Inequality Constraints: The Set Cover Problem

inferred← citeshttps://doi.org/10.1007/978-3-030-50433-5_41openalex-snapshot

A Hybrid Solution Method for the Multi-Service Location Set Covering Problem

inferred← citeshttps://doi.org/10.1007/978-3-030-77980-1_3openalex-snapshot

Multimodal Container Planning: A QUBO Formulation and Implementation on a Quantum Annealer

inferred← citeshttps://doi.org/10.1007/s11128-022-03476-yopenalex-snapshot

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

inferred← citeshttps://doi.org/10.1007/s11265-018-1357-8openalex-snapshot

Finding Maximum Cliques on the D-Wave Quantum Annealer

inferred← citeshttps://doi.org/10.1007/s42484-026-00411-7openalex-snapshot

Network-based prediction of drug combinations with quantum annealing

inferred← citeshttps://doi.org/10.1016/j.cpc.2022.108411openalex-snapshot

GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm

inferred← citeshttps://doi.org/10.1038/s41598-021-00339-xopenalex-snapshot

Prime factorization using quantum variational imaginary time evolution

inferred← citeshttps://doi.org/10.1103/revmodphys.90.015002openalex-snapshot

Adiabatic quantum computation

inferred← citeshttps://doi.org/10.1109/access.2022.3188117openalex-snapshot

Implementation of Quantum Annealing: A Systematic Review

inferred← citeshttps://doi.org/10.1109/access.2025.3531391openalex-snapshot

Performance of Quantum Annealing Machine Learning Classification Models on ADMET Datasets

inferred← citeshttps://doi.org/10.1109/icc51166.2024.10622443openalex-snapshot

Haplotype Inference with Pure Parsimony: A Quantum Computing Approach

inferred← citeshttps://doi.org/10.1109/ojcoms.2024.3424433openalex-snapshot

Lagrangian Relaxation Based Parallelized Quantum Annealing and Its Application in Network Function Virtualization

inferred← citeshttps://doi.org/10.1109/tasc.2018.2836990openalex-snapshot

Andreev Spectroscopy of Molecular States in Resonant and Charge Accumulation Regime

inferred← citeshttps://doi.org/10.1109/tqe.2024.3441229openalex-snapshot

Multidisk Clutch Optimization Using Quantum Annealing

inferred← citeshttps://doi.org/10.1145/3588946openalex-snapshot

Ready to Leap (by Co-Design)? Join Order Optimisation on Quantum Hardware

inferred← citeshttps://doi.org/10.3390/e19090500openalex-snapshot

Recall Performance for Content-Addressable Memory Using Adiabatic Quantum Optimization

inferred← citeshttps://doi.org/10.3390/e25030540openalex-snapshot

Quantum Computing Approaches for Vector Quantization—Current Perspectives and Developments

inferred← citeshttps://doi.org/10.48550/arxiv.1801.08649openalex-snapshot

Finding Maximum Cliques on the D-Wave Quantum Annealer

inferred← citeshttps://doi.org/10.48550/arxiv.1811.10486openalex-snapshot

Selected Methods for non-Gaussian Data Analysis

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.