Efficiently embedding QUBO problems on adiabatic quantum computers
DOI10.1007/S11128-019-2236-3zbMATH Open1417.81081OpenAlexW2919844071WikidataQ128286632 ScholiaQ128286632MaRDI QIDQ670075FDOQ670075
Authors: P. Date, Catherine Schuman, Thomas Potok, Robert M. Patton 
Publication date: 15 March 2019
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://www.osti.gov/biblio/1557505
Recommendations
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- Hard combinatorial problems and minor embeddings on lattice graphs
- Adiabatic quantum programming: minor embedding with hard faults
- Differential geometric treewidth estimation in adiabatic quantum computation
- Embedding of complete graphs in broken Chimera graphs
Learning and adaptive systems in artificial intelligence (68T05) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Turing machines and related notions (03D10)
Cites Work
- The traveling salesman problem. A computational study.
- Learning Bayesian networks: The combination of knowledge and statistical data
- An introduction to support vector machines and other kernel-based learning methods.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- Adiabatic quantum programming: minor embedding with hard faults
- Fast clique minor generation in Chimera qubit connectivity graphs
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
- The complexity of theorem-proving procedures
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- A case study in programming a quantum annealer for hard operational planning problems
- Multiprocessor scheduling for real-time systems
- The Multiple Sequence Alignment Problem in Biology
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework
- Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report
- Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
Cited In (18)
- Quantum solutions for densest \(k\)-subgraph problems
- Hard combinatorial problems and minor embeddings on lattice graphs
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Embedding equality constraints of optimization problems into a quantum annealer
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Template-Based Minor Embedding for Adiabatic Quantum Optimization
- Balanced \(k\)-means clustering on an adiabatic quantum computer
- A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
- High-speed train timetable optimization based on space-time network model and quantum simulator
- A complete restricted Boltzmann machine on an adiabatic quantum computer
- \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance
- Adiabatic quantum programming: minor embedding with hard faults
- Generalized Ramsey numbers through adiabatic quantum optimization
- Automatically Translating Quantum Programs from a Subset of Common Gates to an Adiabatic Representation
- Embedding of complete graphs in broken Chimera graphs
- A review on quantum approximate optimization algorithm and its variants
Uses Software
This page was built for publication: Efficiently embedding QUBO problems on adiabatic quantum computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670075)
