Efficiently embedding QUBO problems on adiabatic quantum computers
From MaRDI portal
Publication:670075
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)
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
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- A case study in programming a quantum annealer for hard operational planning problems
- Adiabatic quantum programming: minor embedding with hard faults
- An introduction to support vector machines and other kernel-based learning methods.
- Fast clique minor generation in Chimera qubit connectivity graphs
- Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
- Learning Bayesian networks: The combination of knowledge and statistical data
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
- Multiprocessor scheduling for real-time systems
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report
- The Multiple Sequence Alignment Problem in Biology
- The complexity of theorem-proving procedures
- The traveling salesman problem. A computational study.
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
- Balanced \(k\)-means clustering on an adiabatic quantum computer
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Template-Based Minor Embedding for Adiabatic Quantum Optimization
- 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
- \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance
- Generalized Ramsey numbers through adiabatic quantum optimization
- Adiabatic quantum programming: minor embedding with hard faults
- A complete restricted Boltzmann machine on an adiabatic quantum computer
- 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
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)
