A quantum annealing approach for Boolean Satisfiability problem

No abstract is available for this paper.

• Publication year

  2016

• Venue

  Design Automation Conference

• Publication date

  2016-06-05

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1145/2897937.2897973
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A quantum annealing approach for fault detection and diagnosis of graph-based systems

  2014cited by this paper
• A practical heuristic for finding graph minors

  2014cited by this paper
• Discrete optimization using quantum annealing on sparse Ising models

  2014influential reference
• Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice

  2014cited by this paper
• Evidence for quantum annealing with more than one hundred qubits

  2013cited by this paper
• Proceedings of SAT Competition 2013

  2013cited by this paper
• Finding low-energy conformations of lattice protein models by quantum annealing

  2012cited by this paper
• Pathfinder : A Negotiation-Based Performance-Driven Router for FPGAs

  2012cited by this paper
• Exponential Complexity of the Quantum Adiabatic Algorithm for certain Satisfiability Problems

  2011cited by this paper
• Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor

  2010cited by this paper
• Faster parameterized algorithms for minor containment

  2010cited by this paper
• The Ising model : teaching an old problem new tricks

  2010cited by this paper
• Quantum algorithms for algebraic problems

  2008cited by this paper
• Optimization by quantum annealing: lessons from hard satisfiability problems.

  2005cited by this paper
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem

  2001cited by this paper
• Timing-driven placement for FPGAs

  2000influential reference
• Risa: Accurate And Efficient Placement Routability Modeling

  1994cited by this paper
• Quantum annealing: A new method for minimizing multidimensional functions

  1994cited by this paper
• Performance of a new annealing schedule

  1988cited by this paper

• Hardware-Compatible Single-Shot Feasible-Space Heuristics for Solving the Quadratic Assignment Problem

  2025cites this paper
• OpaQue: Program Output Obfuscation for Quantum Software Circuits in Quantum Clouds

  2025cites this paper
• CUBO-to-QUBO Conversion: Reducing Cubic Formulations to Quadratic Formulations

  2025cites this paper
• Gate-Based and Annealing-Based Quantum Algorithms for the Maximum K-Plex Problem

  2025cites this paper
• RSQC: Recursive Sparse QUBO Construction for Quantum Annealing Machines

  2025influential citation
• QUBO Models for the FIFO Stack-Up Problem and Experimental Evaluation on a Quantum Annealer

  2024influential citation
• A review on machine learning-guided design of energy materials

  2024cites this paper
• Quantum Algorithms for the Maximum K-Plex Problem

  2024cites this paper
• High Quality Circuit-Based 3-SAT Mappings for Oscillator Ising Machines

  2024cites this paper
• Quantum Data Encoding Patterns and their Consequences

  2024cites this paper
• QCEDA: Using Quantum Computers for EDA

  2024cites this paper
• Quantum Computing for Databases: Overview and Challenges

  2024cites this paper
• Designing unit Ising models for logic gate simulation through integer linear programming

  2024cites this paper
• HETRI: Heterogeneous Ising Multiprocessing

  2024cites this paper
• Solving the B-SAT Problem Using Quantum Computing: Smaller Is Sometimes Better

  2024cites this paper
• PARALLAX: A Compiler for Neutral Atom Quantum Computers under Hardware Constraints

  2024cites this paper
• Graphine: Enhanced Neutral Atom Quantum Computing Using Application-Specific Rydberg Atom Arrangement

  2023cites this paper
• Augmented Electronic Ising Machine as an Effective SAT Solver

  2023cites this paper
• FPIM: Field-Programmable Ising Machines for Solving SAT

  2023cites this paper
• Boolean satisfiability verification by quantum annealing

  2023cites this paper
• Toward Privacy in Quantum Program Execution On Untrusted Quantum Cloud Computing Machines for Business-sensitive Quantum Needs

  2023cites this paper
• Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SAT

  2023cites this paper
• Quantum Computing for Databases: A Short Survey and Vision

  2023cites this paper
• Quantum Algorithm for Maximum Biclique Problem

  2023cites this paper
• Skipper: Improving the Reach and Fidelity of Quantum Annealers by Skipping Long Chains

  2023cites this paper
• The Effect of Penalty Factors of Constrained Hamiltonians on the Eigenspectrum in Quantum Annealing

  2022cites this paper
• QASMBench: A Low-Leveluantum Benchmark Suite for NISQ Evaluation and Simulation

  2022cites this paper
• A Novel Approach for Bounded Model Checking Through Full Parallelism

  2022cites this paper
• Cross Entropy Optimization of Constrained Problem Hamiltonians for Quantum Annealing

  2021cites this paper
• EQUAL: Improving the Fidelity of Quantum Annealers by Injecting Controlled Perturbations

  2021cites this paper
• Quantum computation: Algorithms and Applications

  2021cites this paper
• Theories and applications of quantum annealing: A literature survey

  2021cites this paper
• Quantum Advantage for All

  2021cites this paper
• Design of quantum optical experiments with logic artificial intelligence

  2021cites this paper
• QASMBench: A Low-level QASM Benchmark Suite for NISQ Evaluation and Simulation

  2020cites this paper
• Leveraging Artificial Intelligence to Advance Problem-Solving with Quantum Annealers

  2020cites this paper
• QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation

  2020cites this paper
• A Quantum Annealing Approach for Dynamic Multi-Depot Capacitated Vehicle Routing Problem

  2020cites this paper
• Reinforcement Quantum Annealing: A Hybrid Quantum Learning Automata

  2020cites this paper
• Reinforcement Quantum Annealing: A Quantum-Assisted Learning Automata Approach

  2020cites this paper
• Layout-Aware Embedding for Quantum Annealing Processors

  2019cites this paper
• Solving the Hamiltonian Cycle Problem using a Quantum Computer

  2019cites this paper
• A Quantum Annealing Algorithm for Finding Pure Nash Equilibria in Graphical Games

  2019cites this paper
• Solving SAT and MaxSAT with a Quantum Annealer: Foundations, Encodings, and Preliminary Results

  2018cites this paper
• A Novel Quantum N-Queens Solver Algorithm and its Simulation and Application to Satellite Communication Using IBM Quantum Experience

  2018cites this paper
• Is quantum computing for real?: an interview with Catherine McGeoch of D-Wave Systems

  2017cites this paper
• Fast embedding of constrained satisfaction problem to quantum annealer with minimizing chain length

  2017influential citation
• High Performance Computing

  1993cites this paper